Search results for "Treewidth"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001	Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
15	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna	Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth.	ACM Trans. Algorithms	2018	DBLP DOI BibTeX RDF
15	Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li	Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth.	Appl. Math. Comput.	2018	DBLP DOI BibTeX RDF
15	Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang	Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets.	Int. J. Approx. Reason.	2018	DBLP DOI BibTeX RDF
15	Michael J. Bannister, David Eppstein	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.	J. Graph Algorithms Appl.	2018	DBLP DOI BibTeX RDF
15	Petr Kolman	On Algorithms Employing Treewidth for L-bounded Cut Problems.	J. Graph Algorithms Appl.	2018	DBLP DOI BibTeX RDF
15	Eli Berger, Zdenek Dvorák 0001, Sergey Norin	Treewidth of Grid Subsets.	Comb.	2018	DBLP DOI BibTeX RDF
15	Jessica A. Enright, Kitty Meeks	Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth.	Algorithmica	2018	DBLP DOI BibTeX RDF
15	Julien Baste, Marc Noy, Ignasi Sau	On the number of labeled graphs of bounded treewidth.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Steven Kelk, Georgios Stamoulis, Taoyang Wu	Treewidth distance on phylogenetic trees.	Theor. Comput. Sci.	2018	DBLP DOI BibTeX RDF
15	Xinmin Hou, Lei Yu, Jiaao Li, Boyuan Liu	Odd Induced Subgraphs in Graphs with Treewidth at Most Two.	Graphs Comb.	2018	DBLP DOI BibTeX RDF
15	Mateus de Oliveira Oliveira	Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function.	Theory Comput. Syst.	2018	DBLP DOI BibTeX RDF
15	Júlio Araújo 0001, Cláudia Linhares Sales, Ignasi Sau, Ana Silva 0001	Weighted proper orientations of trees and graphs of bounded treewidth.	CoRR	2018	DBLP BibTeX RDF
15	Kristóf Huszár, Jonathan Spreer	3-Manifold triangulations with small treewidth.	CoRR	2018	DBLP BibTeX RDF
15	Karl Bringmann, Thore Husfeldt, Måns Magnusson	Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth.	CoRR	2018	DBLP BibTeX RDF
15	Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta	Limits of Treewidth-based tractability in Optimization.	CoRR	2018	DBLP BibTeX RDF
15	Michal Ziobro, Marcin Pilipczuk	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation.	CoRR	2018	DBLP BibTeX RDF
15	Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz 0001	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.	CoRR	2018	DBLP BibTeX RDF
15	Remie Janssen, Mark Jones 0001, Steven Kelk, Georgios Stamoulis, Taoyang Wu	Treewidth of display graphs: bounds, brambles and applications.	CoRR	2018	DBLP BibTeX RDF
15	Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang	Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets.	CoRR	2018	DBLP BibTeX RDF
15	Jason Li 0006	Distributed Treewidth Computation.	CoRR	2018	DBLP BibTeX RDF
15	Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran	Exploiting Treewidth for Projected Model Counting and its Limits.	CoRR	2018	DBLP BibTeX RDF
15	Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright	Benchmarking treewidth as a practical component of tensor-network-based quantum simulation.	CoRR	2018	DBLP BibTeX RDF
15	Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Pasin Manurangsi, Michal Wlodarczyk 0001	Losing Treewidth by Separating Subsets.	CoRR	2018	DBLP BibTeX RDF
15	Bernhard Bliem, Stefan Woltran	Defensive alliances in graphs of bounded treewidth.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
15	Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis	Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.	ACM Trans. Program. Lang. Syst.	2018	DBLP DOI BibTeX RDF
15	Miaomiao Han, You Lu 0002, Rong Luo, Zhengke Miao	Neighbor sum distinguishing total coloring of graphs with bounded treewidth.	J. Comb. Optim.	2018	DBLP DOI BibTeX RDF
15	Daniel J. Harvey, David R. Wood	The treewidth of line graphs.	J. Comb. Theory, Ser. B	2018	DBLP DOI BibTeX RDF
15	Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post	A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs.	SIAM J. Comput.	2018	DBLP DOI BibTeX RDF
15	Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák	Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.	SODA	2018	DBLP DOI BibTeX RDF
15	Mateus de Oliveira Oliveira	A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth.	SODA	2018	DBLP DOI BibTeX RDF
15	Michal Ziobro, Marcin Pilipczuk	Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation.	SEA	2018	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser	Weighted Model Counting on the GPU by Exploiting Small Treewidth.	ESA	2018	DBLP DOI BibTeX RDF
15	Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi	Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS.	ICALP	2018	DBLP DOI BibTeX RDF
15	Kristóf Huszár, Jonathan Spreer, Uli Wagner 0001	On the Treewidth of Triangulated 3-Manifolds.	SoCG	2018	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Irina Schindler	Default Logic and Bounded Treewidth.	LATA	2018	DBLP DOI BibTeX RDF
15	Christian Doczkal, Damien Pous	Treewidth-Two Graphs as a Free Algebra.	MFCS	2018	DBLP DOI BibTeX RDF
15	Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna	On Directed Feedback Vertex Set Parameterized by Treewidth.	WG	2018	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	Exploiting Treewidth for Projected Model Counting and Its Limits.	SAT	2018	DBLP DOI BibTeX RDF
15	Eduard Eiben, Robert Ganian, Sebastian Ordyniak	Small Resolution Proofs for QBF using Dependency Treewidth.	STACS	2018	DBLP DOI BibTeX RDF
15	László Egri, Dániel Marx, Pawel Rzazewski	Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization.	STACS	2018	DBLP DOI BibTeX RDF
15	Christian Doczkal, Guillaume Combette, Damien Pous	A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs.	ITP	2018	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher	Exploiting Treewidth for Counting Projected Answer Sets.	KR	2018	DBLP BibTeX RDF
15	Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz 0001	Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.	APPROX-RANDOM	2018	DBLP DOI BibTeX RDF
15	Bernhard Bliem	ASP Programs with Groundings of Small Treewidth.	FoIKS	2018	DBLP DOI BibTeX RDF
15	Julien Baste, Ignasi Sau, Dimitrios M. Thilikos	A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth.	IPEC	2018	DBLP DOI BibTeX RDF
15	Fábio Botler, Maycon Sambinelli	Gallai's conjecture for graphs with treewidth 3.	Electron. Notes Discret. Math.	2017	DBLP DOI BibTeX RDF
15	Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert	On the Dimension of Posets with Cover Graphs of Treewidth 2.	Order	2017	DBLP DOI BibTeX RDF
15	Krishnendu Chatterjee, Georg Osang	Pushdown reachability with constant treewidth.	Inf. Process. Lett.	2017	DBLP DOI BibTeX RDF
15	Takayoshi Shoudai, Takashi Yamada	A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2017	DBLP DOI BibTeX RDF
15	Dieter Mitsche, Guillem Perarnau	On Treewidth and Related Parameters of Random Geometric Graphs.	SIAM J. Discret. Math.	2017	DBLP DOI BibTeX RDF
15	Mateus de Oliveira Oliveira	On the Satisfiability of Quantum Circuits of Small Treewidth.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
15	Igor Razgon	On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth.	Theory Comput. Syst.	2017	DBLP DOI BibTeX RDF
15	Glencora Borradaile, Jeff Erickson 0001, Hung Le 0001, Robbie Weber	Embedded-width: A variant of treewidth for plane graphs.	CoRR	2017	DBLP BibTeX RDF
15	Bernhard Bliem, Stefan Woltran	Defensive Alliances in Graphs of Bounded Treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.	CoRR	2017	DBLP BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Irina Schindler	Default Logic and Bounded Treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev	The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.	CoRR	2017	DBLP BibTeX RDF
15	Therese Biedl, Saeed Mehrabi 0001	On Guarding Orthogonal Polygons with Bounded Treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Simone Bova, Stefan Szeider	Circuit Treewidth, Sentential Decision, and Query Compilation.	CoRR	2017	DBLP BibTeX RDF
15	Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee	On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3.	CoRR	2017	DBLP BibTeX RDF
15	Hisao Tamaki	Positive-instance driven dynamic programming for treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Sushmita Gupta, Saket Saurabh 0001, Meirav Zehavi	On Treewidth and Stable Marriage.	CoRR	2017	DBLP BibTeX RDF
15	Glencora Borradaile, Morgan Shirley	Time-dependent shortest paths in bounded treewidth graphs.	CoRR	2017	DBLP BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	Answer Set Solving with Bounded Treewidth Revisited.	CoRR	2017	DBLP BibTeX RDF
15	Julien Baste, Ignasi Sau, Dimitrios M. Thilikos	Hitting minors on bounded treewidth graphs. I. General upper bounds.	CoRR	2017	DBLP BibTeX RDF
15	Amir Kafshdar Goharshady, Fatemeh Mohammadi	A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Kristóf Huszár, Jonathan Spreer, Uli Wagner 0001	On the treewidth of triangulated 3-manifolds.	CoRR	2017	DBLP BibTeX RDF
15	Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx	Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms.	CoRR	2017	DBLP BibTeX RDF
15	Eduard Eiben, Robert Ganian, Sebastian Ordyniak	Small Resolution Proofs for QBF using Dependency Treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Tom C. van der Zanden, Hans L. Bodlaender	Computing Treewidth on the GPU.	CoRR	2017	DBLP BibTeX RDF
15	Glencora Borradaile, Hung Le 0001	Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs.	CoRR	2017	DBLP BibTeX RDF
15	Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna	On Directed Feedback Vertex Set parameterized by treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Steven Kelk, Georgios Stamoulis, Taoyang Wu	Treewidth distance on phylogenetic trees.	CoRR	2017	DBLP BibTeX RDF
15	Shai Vardi	Randomly coloring graphs of bounded treewidth.	CoRR	2017	DBLP BibTeX RDF
15	Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral	Replica Placement on Bounded Treewidth Graphs.	CoRR	2017	DBLP BibTeX RDF
15	Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok	Characterizing width two for variants of treewidth.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Marcin Pilipczuk	A tight lower bound for Vertex Planarization on graphs of bounded treewidth.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger	Treewidth and Pathwidth parameterized by the vertex cover number.	Discret. Appl. Math.	2017	DBLP DOI BibTeX RDF
15	Moritz Müller, Stefan Szeider	The treewidth of proofs.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
15	Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk	Hitting forbidden subgraphs in graphs of bounded treewidth.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
15	Jianhua Tu, Lidong Wu, Jing Yuan 0002, Lei Cui 0010	On the vertex cover P3 problem parameterized by treewidth.	J. Comb. Optim.	2017	DBLP DOI BibTeX RDF
15	Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001	Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth.	SIAM J. Comput.	2017	DBLP DOI BibTeX RDF
15	Daniel J. Harvey, David R. Wood	Parameters Tied to Treewidth.	J. Graph Theory	2017	DBLP DOI BibTeX RDF
15	Amir Nayyeri, Benjamin Raichel	A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs.	SODA	2017	DBLP DOI BibTeX RDF
15	Nikhil Bansal 0001, Daniel Reichman 0001, Seeun William Umboh	LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs.	SODA	2017	DBLP DOI BibTeX RDF
15	Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz 0001	Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs.	SODA	2017	DBLP DOI BibTeX RDF
15	Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001, Marcin Wrochna	Fully polynomial-time parameterized computations for graphs and matrices of low treewidth.	SODA	2017	DBLP DOI BibTeX RDF
15	Hisao Tamaki	Positive-Instance Driven Dynamic Programming for Treewidth.	ESA	2017	DBLP DOI BibTeX RDF
15	Bernhard Bliem	Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs.	ICLP (Technical Communications)	2017	DBLP DOI BibTeX RDF
15	Michal Pilipczuk	On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk).	MFCS	2017	DBLP DOI BibTeX RDF
15	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	Answer Set Solving with Bounded Treewidth Revisited.	LPNMR	2017	DBLP DOI BibTeX RDF
15	Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev	The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries.	PODS	2017	DBLP DOI BibTeX RDF
15	Simone Bova, Stefan Szeider	Circuit Treewidth, Sentential Decision, and Query Compilation.	PODS	2017	DBLP DOI BibTeX RDF
15	Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar	Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity.	WG	2017	DBLP DOI BibTeX RDF
15	Julien Baste, Marc Noy, Ignasi Sau	On the Number of Labeled Graphs of Bounded Treewidth.	WG	2017	DBLP DOI BibTeX RDF
15	Akanksha Agrawal 0001, Daniel Lokshtanov, Amer E. Mouawad	Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard.	WG	2017	DBLP DOI BibTeX RDF
15	Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001	Going Beyond Primal Treewidth for (M)ILP.	AAAI	2017	DBLP DOI BibTeX RDF
15	Neha Lodha, Sebastian Ordyniak, Stefan Szeider	SAT-Encodings for Special Treewidth and Pathwidth.	SAT	2017	DBLP DOI BibTeX RDF
15	Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider	Backdoor Treewidth for SAT.	SAT	2017	DBLP DOI BibTeX RDF