Search results for "treewidth"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Masanobu Furuse, Koichi Yamazaki	A revisit of the scheme for computing treewidth and minimum fill-in.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
15	Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu 0003	Inapproximability of Treewidth and Related Problems.	J. Artif. Intell. Res.	2014	DBLP DOI BibTeX RDF
15	Maurice J. Jansen, Jayalal Sarma	Balancing Bounded Treewidth Circuits.	Theory Comput. Syst.	2014	DBLP DOI BibTeX RDF
15	Nikhil Balaji, Samir Datta	Bounded Treewidth and Space-Efficient Linear Algebra.	CoRR	2014	DBLP BibTeX RDF
15	Siqi Nie, Denis Deratani Mauá, Cassio Polpo de Campos, Qiang Ji	Advances in Learning Bayesian Networks of Bounded Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Igor Razgon	On the read-once property of branching programs and CNFs of bounded treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Alexander Grigoriev, Steven Kelk, Nela Lekic	On low treewidth graphs and supertrees.	CoRR	2014	DBLP BibTeX RDF
15	Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal	Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Chandra Chekuri, Julia Chuzhoy	Degree-3 Treewidth Sparsifiers.	CoRR	2014	DBLP BibTeX RDF
15	Sigve Hortemo Sæther, Jan Arne Telle	Between Treewidth and Clique-width.	CoRR	2014	DBLP BibTeX RDF
15	Zdenek Dvorák 0001, Sergey Norin	Treewidth of graphs with balanced separations.	CoRR	2014	DBLP BibTeX RDF
15	Léon Planken, Mathijs Michiel de Weerdt, Roman van der Krogt	Computing All-Pairs Shortest Paths by Leveraging Low Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Uriel Feige, Jonathan Hermon, Daniel Reichman 0001	On giant components and treewidth in the layers model.	CoRR	2014	DBLP BibTeX RDF
15	Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001	Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Mateus de Oliveira Oliveira	An Algorithmic Metatheorem for Directed Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Mateus de Oliveira Oliveira	On the Satisfiability of Quantum Circuits of Small Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk	Hitting forbidden subgraphs in graphs of bounded treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Michael J. Bannister, David Eppstein	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.	CoRR	2014	DBLP BibTeX RDF
15	Kitty Meeks	The challenges of unbounded treewidth in parameterised subgraph counting problems.	CoRR	2014	DBLP BibTeX RDF
15	Igor Razgon	No small nondeterministic read-once branching programs for CNFs of bounded treewidth.	CoRR	2014	DBLP BibTeX RDF
15	Kyohei Kozawa, Yota Otachi, Koichi Yamazaki	Lower bounds for treewidth of product graphs.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
15	Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran	Tractable answer-set programming with weight constraints: bounded treewidth is not enough.	Theory Pract. Log. Program.	2014	DBLP DOI BibTeX RDF
15	Daniel Reidenbach, Markus L. Schmid	Patterns with bounded treewidth.	Inf. Comput.	2014	DBLP DOI BibTeX RDF
15	Jonathan L. Gross	Embeddings of graphs of fixed treewidth and bounded degree.	Ars Math. Contemp.	2014	DBLP DOI BibTeX RDF
15	Georg Gottlob, Gianluigi Greco, Francesco Scarcello	Treewidth and Hypertree Width.	Tractability	2014	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.	FOCS	2014	DBLP DOI BibTeX RDF
15	Daniel J. Rosenkrantz, Madhav V. Marathe, Ravi Sundaram, Anil Vullikanti	Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints.	UAI	2014	DBLP BibTeX RDF
15	Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk	Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth.	MFCS (2)	2014	DBLP DOI BibTeX RDF
15	Johan Kwisthout	Treewidth and the Computational Complexity of MAP Approximations.	Probabilistic Graphical Models	2014	DBLP DOI BibTeX RDF
15	Sigve Hortemo Sæther, Jan Arne Telle	Between Treewidth and Clique-Width.	WG	2014	DBLP DOI BibTeX RDF
15	Alexander Grigoriev, Steven Kelk, Nela Lekic	On Low Treewidth Graphs and Supertrees.	AlCoB	2014	DBLP DOI BibTeX RDF
15	Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu 0001, Ke Xu 0001	Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth.	FAW	2014	DBLP DOI BibTeX RDF
15	Michael J. Bannister, David Eppstein	Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth.	GD	2014	DBLP DOI BibTeX RDF
15	Jeremias Berg, Matti Järvisalo	SAT-Based Approaches to Treewidth Computation: An Evaluation.	ICTAI	2014	DBLP DOI BibTeX RDF
15	Siqi Nie, Denis Deratani Mauá, Cassio P. de Campos, Qiang Ji	Advances in Learning Bayesian Networks of Bounded Treewidth.	NIPS	2014	DBLP BibTeX RDF
15	Igor Razgon	On OBDDs for CNFs of Bounded Treewidth.	KR	2014	DBLP BibTeX RDF
15	Riko Jacob, Tobias Lieber, Matthias Mnich	Treewidth Computation and Kernelization in the Parallel External Memory Model.	IFIP TCS	2014	DBLP DOI BibTeX RDF
15	Hasna Mohsen Alqahtani, Thomas Erlebach	Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth.	SOFSEM	2014	DBLP DOI BibTeX RDF
15	Jeremias Berg, Matti Järvisalo, Brandon M. Malone	Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability.	AISTATS	2014	DBLP BibTeX RDF
15	Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar	Finite Integer Index of Pathwidth and Treewidth.	IPEC	2014	DBLP DOI BibTeX RDF
15	Julien Baste, Ignasi Sau	The Role of Planarity in Connectivity Problems Parameterized by Treewidth.	IPEC	2014	DBLP DOI BibTeX RDF
15	Igor Razgon	No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth.	IPEC	2014	DBLP DOI BibTeX RDF
15	Tobias Lieber	On Optimal Algorithms for List Ranking in the Parallel External Memory Model with Applications to Treewidth and other Elementary Graph Problems.		2014	RDF
15	Marthe Bonamy, Nicolas Bousquet	Recoloring bounded treewidth graphs.	Electron. Notes Discret. Math.	2013	DBLP DOI BibTeX RDF
15	Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs.	Chic. J. Theor. Comput. Sci.	2013	DBLP BibTeX RDF
15	Glenn G. Chappell, Michael J. Pelsmajer	Maximum Induced Forests in Graphs of Bounded Treewidth.	Electron. J. Comb.	2013	DBLP DOI BibTeX RDF
15	L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma	Product Dimension of Forests and Bounded Treewidth Graphs.	Electron. J. Comb.	2013	DBLP DOI BibTeX RDF
15	M. Praveen	Does Treewidth Help in Modal Satisfiability?	ACM Trans. Comput. Log.	2013	DBLP DOI BibTeX RDF
15	Dániel Marx, Barry O'Sullivan, Igor Razgon	Finding small separators in linear time via treewidth reduction.	ACM Trans. Algorithms	2013	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch	Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization.	SIAM J. Discret. Math.	2013	DBLP DOI BibTeX RDF
15	Moritz Müller, Stefan Szeider	Revisiting Space in Proof Complexity: Treewidth and Pathwidth.	Electron. Colloquium Comput. Complex.	2013	DBLP BibTeX RDF
15	Julien Baste, Ignasi Sau	The role of planarity in connectivity problems parameterized by treewidth.	CoRR	2013	DBLP BibTeX RDF
15	Chandra Chekuri, Julia Chuzhoy	Large-Treewidth Graph Decompositions and Applications	CoRR	2013	DBLP BibTeX RDF
15	Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger	TREEWIDTH and PATHWIDTH parameterized by vertex cover	CoRR	2013	DBLP BibTeX RDF
15	Bart M. P. Jansen	On Sparsification for Computing Treewidth.	CoRR	2013	DBLP BibTeX RDF
15	John Fearnley, Sven Schewe	Time and Space Results for Parity Games with Bounded Treewidth	Log. Methods Comput. Sci.	2013	DBLP DOI BibTeX RDF
15	Marthe Bonamy, Nicolas Bousquet	Recoloring bounded treewidth graphs	CoRR	2013	DBLP BibTeX RDF
15	Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk	A O(c^k n) 5-Approximation Algorithm for Treewidth	CoRR	2013	DBLP BibTeX RDF
15	Anupam Gupta 0001, Kunal Talwar, David Witmer	Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results	CoRR	2013	DBLP BibTeX RDF
15	Eyal Amir	Efficient Approximation for Triangulation of Minimum Treewidth	CoRR	2013	DBLP BibTeX RDF
15	Prasad Chebolu, Mary Cryan, Russell Martin	Exact counting of Euler Tours for Graphs of Bounded Treewidth.	CoRR	2013	DBLP BibTeX RDF
15	Igor Razgon	On OBDDs for CNFs of bounded treewidth.	CoRR	2013	DBLP BibTeX RDF
15	Krishnendu Chatterjee, Jakub Lacki	Faster Algorithms for Markov Decision Processes with Low Treewidth	CoRR	2013	DBLP BibTeX RDF
15	Bernardetta Addis, Marco Di Summa, Andrea Grosso	Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.	Discret. Appl. Math.	2013	DBLP DOI BibTeX RDF
15	Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König 0001	Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.	J. Vis. Lang. Comput.	2013	DBLP DOI BibTeX RDF
15	Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann	The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs.	J. Comb. Optim.	2013	DBLP DOI BibTeX RDF
15	David R. Wood	Treewidth of Cartesian Products of Highly Connected Graphs.	J. Graph Theory	2013	DBLP DOI BibTeX RDF
15	Krishnendu Chatterjee, Jakub Lacki	Faster Algorithms for Markov Decision Processes with Low Treewidth.	CAV	2013	DBLP DOI BibTeX RDF
15	Serge Gaspers, Stefan Szeider	Strong Backdoors to Bounded Treewidth SAT.	FOCS	2013	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk	An O(c^k n) 5-Approximation Algorithm for Treewidth.	FOCS	2013	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof	Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth.	ICALP (1)	2013	DBLP DOI BibTeX RDF
15	Moritz Müller, Stefan Szeider	Revisiting Space in Proof Complexity: Treewidth and Pathwidth.	MFCS	2013	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen	Fixed-Parameter Tractability and Characterizations of Small Special Treewidth.	WG	2013	DBLP DOI BibTeX RDF
15	Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001	Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree.	FCT	2013	DBLP DOI BibTeX RDF
15	Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger	Treewidth and Pathwidth Parameterized by the Vertex Cover Number.	WADS	2013	DBLP DOI BibTeX RDF
15	Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider	Model Counting for CNF Formulas of Bounded Modular Treewidth.	STACS	2013	DBLP DOI BibTeX RDF
15	Anupam Gupta 0001, Kunal Talwar, David Witmer	Sparsest cut on bounded treewidth graphs: algorithms and hardness results.	STOC	2013	DBLP DOI BibTeX RDF
15	Chandra Chekuri, Julia Chuzhoy	Large-treewidth graph decompositions and applications.	STOC	2013	DBLP DOI BibTeX RDF
15	Bernard Mans, Luke Mathieson	On the Treewidth of Dynamic Graphs.	COCOON	2013	DBLP DOI BibTeX RDF
15	K. S. Sesh Kumar, Francis R. Bach	Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs.	ICML (1)	2013	DBLP BibTeX RDF
15	Anisse Ismaili, Evripidis Bampis, Nicolas Maudet, Patrice Perny	A study on the stability and efficiency of graphical games with unbounded treewidth.	AAMAS	2013	DBLP BibTeX RDF
15	Bart M. P. Jansen	On Sparsification for Computing Treewidth.	IPEC	2013	DBLP DOI BibTeX RDF
15	Antonis Thomas, Jan van Leeuwen	Treewidth and Pure Nash Equilibria.	IPEC	2013	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos	On exact algorithms for treewidth.	ACM Trans. Algorithms	2012	DBLP DOI BibTeX RDF
15	Fedor V. Fomin, Yngve Villanger	Treewidth computation and extremal combinatorics.	Comb.	2012	DBLP DOI BibTeX RDF
15	Michael R. Fellows, Danny Hermelin, Frances A. Rosamond	Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications.	Algorithmica	2012	DBLP DOI BibTeX RDF
15	Michael Lampis	Algorithmic Meta-theorems for Restrictions of Treewidth.	Algorithmica	2012	DBLP DOI BibTeX RDF
15	Bruce A. Reed, David R. Wood	Polynomial treewidth forces a large grid-like-minor.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
15	Gwenaël Joret, David R. Wood	Nordhaus-Gaddum for treewidth.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender, Jurriaan Hage	On switching classes, NLC-width, cliquewidth and treewidth.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
15	Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, Paul Valiant	Size and Treewidth Bounds for Conjunctive Queries.	J. ACM	2012	DBLP DOI BibTeX RDF
15	Léon Planken, Mathijs de Weerdt, Roman van der Krogt	Computing All-Pairs Shortest Paths by Leveraging Low Treewidth.	J. Artif. Intell. Res.	2012	DBLP DOI BibTeX RDF
15	Markus Chimani, Petra Mutzel, Bernd Zey	Improved Steiner tree algorithms for bounded treewidth.	J. Discrete Algorithms	2012	DBLP DOI BibTeX RDF
15	Navin Kashyap, Andrew Thangaraj	The Treewidth of MDS and Reed-Muller Codes.	IEEE Trans. Inf. Theory	2012	DBLP DOI BibTeX RDF
15	Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran	Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough	CoRR	2012	DBLP BibTeX RDF
15	Serge Gaspers, Stefan Szeider	Strong Backdoors to Bounded Treewidth SAT	CoRR	2012	DBLP BibTeX RDF
15	Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai	Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs	CoRR	2012	DBLP BibTeX RDF
15	Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof	Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time	CoRR	2012	DBLP BibTeX RDF
15	Vibhav Gogate, Rina Dechter	A Complete Anytime Algorithm for Treewidth	CoRR	2012	DBLP BibTeX RDF