Search results for "Treewidth"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis	Snakes and Ladders: A Treewidth Story.	WG	2023	DBLP DOI BibTeX RDF
15	Falko Hegerfeld, Stefan Kratsch	Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth.	WG	2023	DBLP DOI BibTeX RDF
15	Juhi Chaudhary, Meirav Zehavi	P-Matchings Parameterized by Treewidth.	WG	2023	DBLP DOI BibTeX RDF
15	Nicolas Bousquet, Quentin Deschamps, Aline Parreau	Metric Dimension Parameterized by Treewidth in Chordal Graphs.	WG	2023	DBLP DOI BibTeX RDF
15	Markus Hecher	Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?	AAAI	2023	DBLP DOI BibTeX RDF
15	Viktor Besin, Markus Hecher, Stefan Woltran	On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth.	ECAI	2023	DBLP DOI BibTeX RDF
15	Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov	Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.	GD (2)	2023	DBLP DOI BibTeX RDF
15	Sven Mallach	On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings.	IWOCA	2023	DBLP DOI BibTeX RDF
15	Maurício Pires, Uéverton S. Souza, Bruno Lopes 0001	Twin-Treewidth: A Single-Exponential Logic-Based Approach.	COCOA (2)	2023	DBLP DOI BibTeX RDF
15	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.	STOC	2023	DBLP DOI BibTeX RDF
15	Tuukka Korhonen, Daniel Lokshtanov	An Improved Parameterized Algorithm for Treewidth.	STOC	2023	DBLP DOI BibTeX RDF
15	Amir Kafshdar Goharshady, Ahmed Khaled Zaher	Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth.	VMCAI	2023	DBLP DOI BibTeX RDF
15	Hauke Brinkop, Klaus Jansen	Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth.	SOFSEM	2023	DBLP DOI BibTeX RDF
15	Jorge Fandinno, Markus Hecher	Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs.	IJCAI	2023	DBLP DOI BibTeX RDF
15	Hisao Tamaki	A Contraction-Recursive Algorithm for Treewidth.	IPEC	2023	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý	Treewidth Is NP-Complete on Cubic Graphs.	IPEC	2023	DBLP DOI BibTeX RDF
15	Cristina Feier, Tomasz Gogacz, Filip Murlak	Exploiting Semantic Treewidth for Graph Queries Evaluation (short paper).	AMW	2023	DBLP BibTeX RDF
15	C. Aiswarya	How treewidth helps in verification.	ACM SIGLOG News	2022	DBLP DOI BibTeX RDF
15	Ke Liu, Mengyu Cao, Mei Lu	Treewidth of the Generalized Kneser Graphs.	Electron. J. Comb.	2022	DBLP DOI BibTeX RDF
15	Kolja Knauer, Hoang La, Petru Valicov	Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth.	Electron. J. Comb.	2022	DBLP DOI BibTeX RDF
15	Simon Schierreich, Ondrej Suchý	Waypoint routing on bounded treewidth graphs.	Inf. Process. Lett.	2022	DBLP DOI BibTeX RDF
15	Bertrand Marchand, Yann Ponty, Laurent Bulteau	Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics.	Algorithms Mol. Biol.	2022	DBLP DOI BibTeX RDF
15	Céline Scornavacca, Mathias Weller	Treewidth-based algorithms for the small parsimony problem on networks.	Algorithms Mol. Biol.	2022	DBLP DOI BibTeX RDF
15	Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk	Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time.	ACM Trans. Algorithms	2022	DBLP DOI BibTeX RDF
15	Sergio Cabello	Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth.	ACM Trans. Algorithms	2022	DBLP DOI BibTeX RDF
15	Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi	Grundy Distinguishes Treewidth from Pathwidth.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
15	Sushmita Gupta, Saket Saurabh 0001, Meirav Zehavi	On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization).	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
15	Mahdi Belbasi, Martin Fürer	An Improvement of Reed's Treewidth Approximation.	J. Graph Algorithms Appl.	2022	DBLP DOI BibTeX RDF
15	Markus Hecher	Treewidth-aware reductions of normal ASP to SAT - Is normal ASP harder than SAT after all?	Artif. Intell.	2022	DBLP DOI BibTeX RDF
15	Shaohua Li 0005, Marcin Pilipczuk	Hardness of Metric Dimension in Graphs of Constant Treewidth.	Algorithmica	2022	DBLP DOI BibTeX RDF
15	Frank Kammer, Johannes Meintrup, Andrej Sajenko	Space-Efficient Vertex Separators for Treewidth.	Algorithmica	2022	DBLP DOI BibTeX RDF
15	David Eppstein, Daniel Frishberg, William Maxwell	On the treewidth of Hanoi graphs.	Theor. Comput. Sci.	2022	DBLP DOI BibTeX RDF
15	Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani	Orthogonal planarity testing of bounded treewidth graphs.	J. Comput. Syst. Sci.	2022	DBLP DOI BibTeX RDF
15	Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider	Threshold Treewidth and Hypertree Width.	J. Artif. Intell. Res.	2022	DBLP DOI BibTeX RDF
15	Akanksha Agrawal 0001, Dániel Marx, Daniel Neuen, Jasper Slusallek	Computing Square Colorings on Bounded-Treewidth and Planar Graphs.	CoRR	2022	DBLP DOI BibTeX RDF
15	Clément Dallard, Martin Milanic, Kenny Storgel	Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure.	CoRR	2022	DBLP DOI BibTeX RDF
15	Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood	Product structure of graph classes with bounded treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Arnold Filtser, Hung Le 0001	Low Treewidth Embeddings of Planar and Minor-Free Metrics.	CoRR	2022	DBLP DOI BibTeX RDF
15	Hermish Mehta, Daniel Reichman 0001	Local treewidth of random and noisy graphs with applications to stopping contagion in networks.	CoRR	2022	DBLP DOI BibTeX RDF
15	Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset	ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Jeroen L. G. Schols	Kernelization for Treewidth-2 Vertex Deletion.	CoRR	2022	DBLP DOI BibTeX RDF
15	Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers	Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs.	CoRR	2022	DBLP DOI BibTeX RDF
15	Tuukka Korhonen, Daniel Lokshtanov	An Improved Parameterized Algorithm for Treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski	List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs.	CoRR	2022	DBLP DOI BibTeX RDF
15	André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider	Threshold Treewidth and Hypertree Width.	CoRR	2022	DBLP DOI BibTeX RDF
15	Leo van Iersel, Mark Jones 0001, Mathias Weller	Embedding phylogenetic trees in networks of low treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek	Sparse graphs with bounded induced cycle packing number have logarithmic treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Antoine Amarilli, Mikaël Monet	Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.	CoRR	2022	DBLP DOI BibTeX RDF
15	Markus Hecher	Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract.	CoRR	2022	DBLP DOI BibTeX RDF
15	Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini	Recognizing Map Graphs of Bounded Treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Markus Hecher	Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?	CoRR	2022	DBLP DOI BibTeX RDF
15	Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs	Quantum speedups for treewidth.	CoRR	2022	DBLP BibTeX RDF
15	Tesshu Hanaka, Michael Lampis	Hedonic Games and Treewidth Revisited.	CoRR	2022	DBLP BibTeX RDF
15	Yuzhou Gu, Zhao Song 0002	A Faster Small Treewidth SDP Solver.	CoRR	2022	DBLP DOI BibTeX RDF
15	Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.	CoRR	2022	DBLP DOI BibTeX RDF
15	Hugo Jacob 0001, Marcin Pilipczuk	Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs.	CoRR	2022	DBLP BibTeX RDF
15	Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	CoRR	2022	DBLP BibTeX RDF
15	Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz	Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results.	CoRR	2022	DBLP DOI BibTeX RDF
15	Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich 0001, Igor Razgon, Viktor Zamaraev	The treewidth and pathwidth of graph unions.	CoRR	2022	DBLP BibTeX RDF
15	Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen	Problems hard for treewidth but easy for stable gonality.	CoRR	2022	DBLP BibTeX RDF
15	Édouard Bonnet, Hugues Déprés	Twin-width can be exponential in treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Hisao Tamaki	Heuristic computation of exact treewidth.	CoRR	2022	DBLP BibTeX RDF
15	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.	CoRR	2022	DBLP DOI BibTeX RDF
15	Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos	A polynomial time algorithm to compute the connected treewidth of a series-parallel graph.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
15	Soumen Maity, Charles J. Colbourn	Mixed covering arrays on graphs of small treewidth.	Discret. Math. Algorithms Appl.	2022	DBLP DOI BibTeX RDF
15	Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta	New limits of treewidth-based tractability in optimization.	Math. Program.	2022	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran	Exploiting Database Management Systems and Treewidth for Counting.	Theory Pract. Log. Program.	2022	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Irina Schindler	Default logic and bounded treewidth.	Inf. Comput.	2022	DBLP DOI BibTeX RDF
15	Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001	Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering.	SIAM J. Comput.	2022	DBLP DOI BibTeX RDF
15	Peter Bradshaw	Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings.	J. Graph Theory	2022	DBLP DOI BibTeX RDF
15	Markus Hecher	Advanced Tools and Methods for Treewidth-Based Problem Solving		2022	DOI RDF
15	Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo	A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.	IPCO	2022	DBLP DOI BibTeX RDF
15	Jacob Focke, Dániel Marx, Pawel Rzazewski	Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds.	SODA	2022	DBLP DOI BibTeX RDF
15	Aditya Jayaprakash, Mohammad R. Salavatipour	Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.	SODA	2022	DBLP DOI BibTeX RDF
15	Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs	Quantum Speedups for Treewidth.	TQC	2022	DBLP DOI BibTeX RDF
15	Ajinkya Gaikwad, Soumen Maity	On the Harmless Set Problem Parameterized by Treewidth.	WALCOM	2022	DBLP DOI BibTeX RDF
15	Hisao Tamaki	Heuristic Computation of Exact Treewidth.	SEA	2022	DBLP DOI BibTeX RDF
15	Arnold Filtser, Hung Le 0001	Low Treewidth Embeddings of Planar and Minor-Free Metrics.	FOCS	2022	DBLP DOI BibTeX RDF
15	Yizuo Chen, Adnan Darwiche	On the definition and computation of causal treewidth.	UAI	2022	DBLP BibTeX RDF
15	Tesshu Hanaka, Michael Lampis	Hedonic Games and Treewidth Revisited.	ESA	2022	DBLP DOI BibTeX RDF
15	Leo van Iersel, Mark Jones 0001, Mathias Weller	Embedding Phylogenetic Trees in Networks of Low Treewidth.	ESA	2022	DBLP DOI BibTeX RDF
15	Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset	ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth.	SoCG	2022	DBLP DOI BibTeX RDF
15	Antoine Amarilli, Mikaël Monet	Weighted Counting of Matchings in Unbounded-Treewidth Graph Families.	MFCS	2022	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen	Problems Hard for Treewidth but Easy for Stable Gonality.	WG	2022	DBLP DOI BibTeX RDF
15	Hugo Jacob 0001, Marcin Pilipczuk	Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs.	WG	2022	DBLP DOI BibTeX RDF
15	Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna	Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts.	WG	2022	DBLP DOI BibTeX RDF
15	Wolfgang Dvorák, Markus Hecher, Matthias König 0002, André Schidler, Stefan Szeider, Stefan Woltran	Tractable Abstract Argumentation via Backdoor-Treewidth.	AAAI	2022	DBLP DOI BibTeX RDF
15	Florentina Voboril	Computing Treewidth with Constraint Programming.	SKILL	2022	DBLP BibTeX RDF
15	Wolfgang Dvorák, Matthias König 0002, Stefan Woltran	Treewidth for Argumentation Frameworks with Collective Attacks.	COMMA	2022	DBLP DOI BibTeX RDF
15	Matej Lieskovský, Jirí Sgall	Graph Burning and Non-uniform k-centers for Small Treewidth.	WAOA	2022	DBLP DOI BibTeX RDF
15	Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini	Recognizing Map Graphs of Bounded Treewidth.	SWAT	2022	DBLP DOI BibTeX RDF
15	Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif	A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.	APPROX/RANDOM	2022	DBLP DOI BibTeX RDF
15	Hermish Mehta, Daniel Reichman 0001	Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks.	APPROX/RANDOM	2022	DBLP DOI BibTeX RDF
15	Viktor Besin, Markus Hecher, Stefan Woltran	Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract).	IJCAI	2022	DBLP DOI BibTeX RDF
15	Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman	Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs.	SPAA	2022	DBLP DOI BibTeX RDF
15	Dániel Marx, Govind S. Sankar, Philipp Schepper	Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard).	IPEC	2022	DBLP DOI BibTeX RDF
15	Ke Liu, Mei Lu	The treewidth of 2-section of hypergraphs.	Discret. Math. Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
15	Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan	The Size Ramsey Number of Graphs with Bounded Treewidth.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
15	Clément Dallard, Martin Milanic, Kenny Storgel	Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure.	SIAM J. Discret. Math.	2021	DBLP DOI BibTeX RDF
15	Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis	Faster algorithms for quantitative verification in bounded treewidth graphs.	Formal Methods Syst. Des.	2021	DBLP DOI BibTeX RDF