The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for pathwidth with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1989-1994 (15) 1995-2001 (17) 2002-2005 (20) 2006-2007 (18) 2008 (17) 2009-2010 (15) 2011-2012 (18) 2013-2014 (21) 2015-2016 (20) 2017-2018 (15) 2019-2020 (19) 2021-2022 (17) 2023-2024 (18)
Publication types (Num. hits)
article(133) incollection(2) inproceedings(95)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 51 occurrences of 28 keywords

Results
Found 230 publication records. Showing 230 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
110Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse Nondeterministic Graph Searching: From Pathwidth to Treewidth. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF treewidth, graph searching, pathwidth
101Fedor V. Fomin Pathwidth of Planar and Line Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
101Hans L. Bodlaender, Ton Kloks, Dieter Kratsch Treewidth and Pathwidth of Permutation Graphs. Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
101Ton Kloks, Hans L. Bodlaender Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
94Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse Nondeterministic Graph Searching: From Pathwidth to Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Treewidth, Graph searching, Pathwidth
85Fedor V. Fomin, Hans L. Bodlaender Approximation of Pathwidth of Outerplanar Graphs. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
69Karol Suchan, Ioan Todinca Pathwidth of Circular-Arc Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
69Hans L. Bodlaender, Ton Kloks Better Algorithms for the Pathwidth and Treewidth of Graphs. Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
64David Coudert, Florian Huc, Dorian Mazauric A Distributed Algorithm for Computing and Updating the Process Number of a Forest. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
57Pierre Fraigniaud, Nicolas Nisse Monotony Properties of Connected Visible Graph Searching. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Treewidth, Graph Searching, Pathwidth
57Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos Isomorphism for Graphs of Bounded Distance Width. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability
53Rodica Mihai, Ioan Todinca Pathwidth is NP-Hard for Weighted Trees. Search on Bibsonomy FAW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
53Karol Suchan, Yngve Villanger Computing Pathwidth Faster Than 2n. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
53Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde Embeddings of k-Connected Graphs of Pathwidth k. Search on Bibsonomy SWAT The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
53Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. Search on Bibsonomy WG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
53Hans L. Bodlaender, Rolf H. Möhring The Pathwidth and Treewidth of Cographs. Search on Bibsonomy SWAT The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
48Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg Nash equilibria in graphical games on trees revisited. Search on Bibsonomy EC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF PPAD-completeness, nash equilibrium, graphical games
41David Coudert, Dorian Mazauric, Nicolas Nisse Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
41Dariusz Dereniowski From Pathwidth to Connected Pathwidth. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
41Dariusz Dereniowski From Pathwidth to Connected Pathwidth. Search on Bibsonomy STACS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
41Dariusz Dereniowski From Pathwidth to Connected Pathwidth Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
41Mitsunori Togasaki, Koichi Yamazaki Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. Search on Bibsonomy Discret. Math. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
41Richard B. Borie, R. Gary Parker, Craig A. Tovey Solving problems on recursively constructed graphs. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
41Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood Improved upper bounds on the crossing number. Search on Bibsonomy SCG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree
41David Coudert, Florian Huc, Dorian Mazauric Computing and Updating the Process Number in Trees. Search on Bibsonomy OPODIS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF process number, distributed algorithm, Pathwidth
41Hans L. Bodlaender Necessary Edges in k-Chordalisations of Graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth
37Boting Yang Strong-mixed searching and pathwidth. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Node search, Edge search, Mixed search, Cops-and-robber game, Pursuit-evasion problem
37Sheng-Lung Peng, Yi-Chuan Yang On the Treewidth and Pathwidth of Biconvex Bipartite Graphs. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Rodney G. Downey, Catherine McCartin Online Problems, Pathwidth, and Persistence. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian 0001 Isoperimetric Inequalities and the Width Parameters of Graphs. Search on Bibsonomy COCOON The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle Memory Requirements for Table Computations in Partial k-tree Algorithms. Search on Bibsonomy SWAT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
32Siddharthan Ramachandramurthi A Lower Bound for Treewidth and Its Consequences. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
32Michael R. Fellows, Michael T. Hallett, Harold T. Wareham DNA Physical Mapping: Three Ways Difficult. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider Clique-width minimization is NP-hard. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF absolute approximation, NP-completeness, clique-width, pathwidth
25Hans L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth. Search on Bibsonomy STOC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF graph algorithms, treewidth, graph minors, pathwidth, partial k-trees
21Marcin Brianski, Gwenaël Joret, Michal T. Seweryn Pathwidth Versus Cocircumference. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich 0001, Igor Razgon, Viktor Zamaraev The Treewidth and Pathwidth of Graph Unions. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak Tight Bound on Treedepth in Terms of Pathwidth and Longest Path. Search on Bibsonomy Comb. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Tala Eagling-Vose, Barnaby Martin, Daniël Paulusma, Mark Siggers, Siani Smith Graph Homomorphism, Monotone Classes and Bounded Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Michael Lampis The Primal Pathwidth SETH. Search on Bibsonomy CoRR The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck 2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth. Search on Bibsonomy Comput. J. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Alessandro Aloisio, Alfredo Navarra On Coverage in Multi-Interface Networks with Bounded Pathwidth. Search on Bibsonomy AINA (6) The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
21Giovanna Kobus Conrado, Amir Kafshdar Goharshady, Chun Kit Lam The Bounded Pathwidth of Control-Flow Graphs. Search on Bibsonomy Proc. ACM Program. Lang. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Sergey Norin, Alex Scott 0001, David R. Wood Clustered colouring of graph classes with bounded treedepth or pathwidth. Search on Bibsonomy Comb. Probab. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak Approximating Pathwidth for Graphs of Small Treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21David R. Wood 2-Layer Graph Drawings with Bounded Pathwidth. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Nikhil Bansal 0001, Dor Katzelnick, Roy Schwartz 0002 Almost Logarithmic Approximation for Cutwidth and Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, Bartosz Walczak Tight bound on treedepth in terms of pathwidth and longest path. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter Parameterized Complexity of Vertex Splitting to Pathwidth at most 1. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Marcin Brianski, Gwenaël Joret, Michal T. Seweryn Pathwidth vs cocircumference. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Shoji Kasahara, Jun Kawahara, Shin-ichi Minato, Jumpei Mori DAG-Pathwidth: Graph Algorithmic Analyses of DAG-Type Blockchain Networks. Search on Bibsonomy IEICE Trans. Inf. Syst. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Michael Lampis First Order Logic on Pathwidth Revisited Again. Search on Bibsonomy ICALP The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Jakob Baumann, Matthias Pfretzschner, Ignaz Rutter Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1. Search on Bibsonomy WG The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
21Therese Biedl Horton-Strahler number, rooted pathwidth and upward drawings of trees. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi Grundy Distinguishes Treewidth from Pathwidth. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Dekel Tsur Faster algorithm for pathwidth one vertex deletion. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Louis Dublois, Michael Lampis, Vangelis Th. Paschos Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Michael Lampis First Order Logic on Pathwidth Revisited Again. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21David R. Wood 2-Layer Graph Drawings with Bounded Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich 0001, Igor Razgon, Viktor Zamaraev The treewidth and pathwidth of graph unions. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
21Lars Jaffke, Paloma T. Lima, Roohani Sharma b-Coloring Parameterized by Pathwidth is XNLP-complete. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
21Kristóf Huszár On the Pathwidth of Hyperbolic 3-Manifolds. Search on Bibsonomy Comput. Geom. Topol. The full citation details ... 2022 DBLP  BibTeX  RDF
21Vida Dujmovic, Pat Morin, Céline Yelle Two Results on Layered Pathwidth and Linear Layouts. Search on Bibsonomy J. Graph Algorithms Appl. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Yunlong Liu 0001, Jie Chen 0072, Jingui Huang, Jianxin Wang 0001 On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Louis Dublois, Michael Lampis, Vangelis Th. Paschos Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Kristóf Huszár On the pathwidth of hyperbolic 3-manifolds. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
21Martin E. Dyer, Catherine S. Greenhill, Haiko Müller Counting independent sets in graphs with bounded bipartite pathwidth. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak Approximating Pathwidth for Graphs of Small Treewidth. Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Louis Dublois, Michael Lampis, Vangelis Th. Paschos Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-exponential Approximation. Search on Bibsonomy CIAC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
21Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood Minor-Closed Graph Classes with Bounded Layered Pathwidth. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth. Search on Bibsonomy Comb. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Therese Biedl, Markus Chimani, Martin Derka, Petra Mutzel Crossing Number for Graphs with Bounded Pathwidth. Search on Bibsonomy Algorithmica The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi Grundy Distinguishes Treewidth from Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos A linear fixed parameter tractable algorithm for connected pathwidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Vida Dujmovic, Pat Morin, Céline Yelle Two Results on Layered Pathwidth and Linear Layouts. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Carla Groenland, Gwenaël Joret, Wojciech Nadara, Bartosz Walczak Approximating pathwidth for graphs of small treewidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Christine T. Cheng, Will Rosenbaum Simple Counting and Sampling Algorithms for Graphs with Bounded Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
21Elke Fuchs, Laura Gellert, Irene Heinrich Cycle decompositions of pathwidth-6 graphs. Search on Bibsonomy J. Graph Theory The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Mamadou Moustapha Kanté, Christophe Paul, Dimitrios M. Thilikos A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth. Search on Bibsonomy ESA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi Grundy Distinguishes Treewidth from Pathwidth. Search on Bibsonomy ESA The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Patrizio Angelini, Giordano Da Lozzo, Henry Förster, Thomas Schneck 2-Layer k-Planar Graphs - Density, Crossing Lemma, Relationships, and Pathwidth. Search on Bibsonomy GD The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Yunlong Liu 0001, Jie Chen 0072, Jingui Huang, Jianxin Wang 0001 On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering. Search on Bibsonomy AAIM The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
21Hans L. Bodlaender, Tom C. van der Zanden On exploring always-connected temporal graphs of small pathwidth. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
21Katrin Casel, Joel D. Day, Pamela Fleischmann, Tomasz Kociumaka, Florin Manea, Markus L. Schmid Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Martin E. Dyer, Catherine S. Greenhill, Haiko Müller Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth. Search on Bibsonomy WG The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
21Sven Mallach Linear ordering based MIP formulations for the vertex separation or pathwidth problem. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Tony Huynh, Gwenaël Joret, Piotr Micek, David R. Wood Seymour's conjecture on 2-connected graphs of large pathwidth. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Vida Dujmovic, David Eppstein, Gwenaël Joret, Pat Morin, David R. Wood Minor-closed graph classes with bounded layered pathwidth. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Martin E. Dyer, Catherine S. Greenhill, Haiko Müller Counting independent sets in graphs with bounded bipartite pathwidth. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Hans L. Bodlaender, Tom C. van der Zanden On Exploring Temporal Graphs of Small Pathwidth. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
21Paz Carmi, Vida Dujmovic, Pat Morin Anagram-Free Chromatic Number Is Not Pathwidth-Bounded. Search on Bibsonomy WG The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Shai Vardi Randomly Coloring Graphs of Logarithmically Bounded Pathwidth. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
21Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
21Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger Treewidth and Pathwidth parameterized by the vertex cover number. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Euripides Markou, Nicolas Nisse, Stéphane Pérennes Exclusive graph searching vs. pathwidth. Search on Bibsonomy Inf. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
21Héctor Joaquín Fraire Huacuja, Norberto Castillo-García, Mario César López Locés, José Antonio Martínez Flores, Rodolfo A. Pazos Rangel, Juan Javier González Barbosa, Juan Martín Carpio Valadez Integer Linear Programming Formulation and Exact Algorithm for Computing Pathwidth. Search on Bibsonomy Nature-Inspired Design of Hybrid Intelligent Systems The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 230 (100 per page; Change: )
Pages: [1][2][3][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license