Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
159 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
140 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
82 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
82 | Heiko Schröder 0001, Ondrej Sýkora, Imrich Vrto |
Cyclic Cutwidth of the Mesh. |
SOFSEM |
1999 |
DBLP DOI BibTeX RDF |
|
82 | Maw-Hwa Chen, Sing-Ling Lee |
Linear Time Algorithms for k-cutwidth Problem. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
77 | Fillia Makedon, Ivan Hal Sudborough |
Minimizing Width in Linear Layouts. |
ICALP |
1983 |
DBLP DOI BibTeX RDF |
|
74 | Imrich Vrto |
Cutwidth of the Mesh of dary Trees. |
Euro-Par |
1997 |
DBLP DOI BibTeX RDF |
cutwidth, embedding, congestion, mesh of trees, bisection |
58 | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
50 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. |
ACM Comput. Surv. |
2008 |
DBLP DOI BibTeX RDF |
Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth |
43 | Dominique Barth |
Bandwidth and Cutwidth of the Mesh of d-Ary Trees. |
Euro-Par, Vol. I |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Patricia A. Evans |
Finding Common Subsequences with Arcs and Pseudoknots. |
CPM |
1999 |
DBLP DOI BibTeX RDF |
|
38 | Hans L. Bodlaender |
Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. |
WG |
1989 |
DBLP DOI BibTeX RDF |
|
38 | Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough |
Topological Bandwidth. |
CAAP |
1983 |
DBLP DOI BibTeX RDF |
|
31 | Akira Matsubayashi |
VLSI layout of trees into grids of minimum width. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
cutwidth, grid, tree, graph embedding, VLSI layout, graph layout, aspect ratio |
24 | Elisabeth Gaar, Diane Puges, Angelika Wiegele |
Strong SDP based bounds on the cutwidth of a graph. |
Comput. Oper. Res. |
2024 |
DBLP DOI BibTeX RDF |
|
24 | Zhen-Kun Zhang |
Edge-maximal graphs with cutwidth at most three. |
Discuss. Math. Graph Theory |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Nikhil Bansal 0001, Dor Katzelnick, Roy Schwartz 0002 |
Almost Logarithmic Approximation for Cutwidth and Pathwidth. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Isja Mannens, Jesper Nederlof |
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Elisabeth Gaar, Diane Puges, Angelika Wiegele |
Strong SDP based bounds on the cutwidth of a graph. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk, Pawel Rzazewski |
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Rank Parameters. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Isja Mannens, Jesper Nederlof |
A Fine-Grained Classification of the Complexity of Evaluating the Tutte Polynomial on Integer Points Parameterized by Treewidth and Cutwidth. |
ESA |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
Tight Bounds for Connectivity Problems Parameterized by Cutwidth. |
STACS |
2023 |
DBLP DOI BibTeX RDF |
|
24 | Narek Bojikian, Vera Chekan, Falko Hegerfeld, Stefan Kratsch |
Tight Bounds for Connectivity Problems Parameterized by Cutwidth. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Mu He, Qinghua Wu 0002, Yongliang Lu |
Breakout local search for the cyclic cutwidth minimization problem. |
J. Heuristics |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Zhen-Kun Zhang, Zhong Zhao, Liuyong Pang |
Decomposability of a class of k-cutwidth critical graphs. |
J. Comb. Optim. |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Carla Groenland, Isja Mannens, Jesper Nederlof, Krisztina Szilágyi |
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth. |
STACS |
2022 |
DBLP DOI BibTeX RDF |
|
24 | Sergio Cavero, Eduardo G. Pardo, Manuel Laguna, Abraham Duarte |
Multistart search for the Cyclic Cutwidth Minimization Problem. |
Comput. Oper. Res. |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Dániel Marx, Govind S. Sankar, Philipp Schepper |
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
24 | Carla Groenland, Jesper Nederlof, Isja Mannens, Krisztina Szilágyi |
Tight bounds for counting colorings and connected edge sets parameterized by cutwidth. |
CoRR |
2021 |
DBLP BibTeX RDF |
|
24 | Vinícius Gandra Martins Santos, Marco Antonio Moreira de Carvalho |
Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem. |
Eur. J. Oper. Res. |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Sergio Cavero, Eduardo G. Pardo, Abraham Duarte |
Influence of the Alternative Objective Functions in the Optimization of the Cyclic Cutwidth Minimization Problem. |
CAEPIA |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Dániel Marx, Govind S. Sankar, Philipp Schepper |
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth. |
ICALP |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Marta Piecyk, Pawel Rzazewski |
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth. |
STACS |
2021 |
DBLP DOI BibTeX RDF |
|
24 | Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel |
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. |
J. Graph Algorithms Appl. |
2020 |
DBLP DOI BibTeX RDF |
|
24 | Marta Piecyk, Pawel Rzazewski |
Fine-grained complexity of the list homomorphism problem: feedback vertex set and cutwidth. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
24 | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
Cutwidth: Obstructions and Algorithmic Aspects. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Katrin 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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
24 | Zhen-Kun Zhang |
Decompositions of critical trees with cutwidth k. |
Comput. Appl. Math. |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Katrin 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. |
ICALP |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Jan Gorzny, Jonathan F. Buss |
Imbalance, Cutwidth, and the Structure of Optimal Orderings. |
COCOON |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Thekla Hamm |
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time. |
IPEC |
2019 |
DBLP DOI BibTeX RDF |
|
24 | Aayush Ojha, Raghunath Tewari |
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. |
Electron. Colloquium Comput. Complex. |
2018 |
DBLP BibTeX RDF |
|
24 | Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel |
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
24 | Aayush Ojha, Raghunath Tewari |
Circuit Complexity of Bounded Planar Cutwidth Graph Matching. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
24 | Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, Rolf Morel |
Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. |
IPEC |
2018 |
DBLP DOI BibTeX RDF |
|
24 | Zhen-Kun Zhang, Hong-Jian Lai |
Characterizations of k-cutwidth critical trees. |
J. Comb. Optim. |
2017 |
DBLP DOI BibTeX RDF |
|
24 | Michal Pilipczuk |
Computing Cutwidth and Pathwidth of Semi-complete Digraphs. |
Encyclopedia of Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
Cutwidth: obstructions and algorithmic aspects. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
24 | Pallavi Jain 0001, Kamal Srivastava, Gur Saran |
Minimizing cyclic cutwidth of graphs using a memetic algorithm. |
J. Heuristics |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
Cutwidth: Obstructions and Algorithmic Aspects. |
IPEC |
2016 |
DBLP DOI BibTeX RDF |
|
24 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
On Cutwidth Parameterized by Vertex Cover. |
Algorithmica |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Lan Lin, Yixun Lin, Douglas B. West |
Cutwidth of triangular grids. |
Discret. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Mario César López Locés, Norberto Castillo-García, Héctor J. Fraire H., Pascal Bouvry, Johnatan E. Pecero, Rodolfo A. Pazos Rangel, Juan Javier González Barbosa, Fevrier Valdez |
A New Integer Linear Programming Model for the Cutwidth Minimization Problem of a Connected Undirected Graph. |
Recent Advances on Hybrid Approaches for Designing Intelligent Systems |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard |
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. |
MFCS (2) |
2014 |
DBLP DOI BibTeX RDF |
|
24 | Rafael Martí, Juan José Pantrigo, Abraham Duarte, Eduardo G. Pardo |
Branch and bound for the cutwidth minimization problem. |
Comput. Oper. Res. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Fedor V. Fomin, Michal Pilipczuk |
Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph |
CoRR |
2013 |
DBLP BibTeX RDF |
|
24 | Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte |
Variable Formulation Search for the Cutwidth Minimization Problem. |
Appl. Soft Comput. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Lan Lin, Yixun Lin |
Cutwidth of iterated caterpillars. |
RAIRO Theor. Informatics Appl. |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Fedor V. Fomin, Michal Pilipczuk |
Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph. |
ESA |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Michal Pilipczuk |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. |
STACS |
2013 |
DBLP DOI BibTeX RDF |
|
24 | Eduardo G. Pardo, Nenad Mladenovic, Juan José Pantrigo, Abraham Duarte |
A Variable Neighbourhood Search approach to the Cutwidth Minimization Problem. |
Electron. Notes Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Juan José Pantrigo, Rafael Martí, Abraham Duarte, Eduardo G. Pardo |
Scatter search for the cutwidth minimization problem. |
Ann. Oper. Res. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
SIAM J. Discret. Math. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Michal Pilipczuk |
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings |
CoRR |
2012 |
DBLP BibTeX RDF |
|
24 | Zhenkun Zhang, Yixun Lin |
On 4-cutwidth critical trees. |
Ars Comb. |
2012 |
DBLP BibTeX RDF |
|
24 | Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour |
Tournament immersion and cutwidth. |
J. Comb. Theory, Ser. B |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Richa Bansal, Kamal Srivastava, Sanjay Srivastava |
A hybrid evolutionary algorithm for the cutwidth minimization problem. |
IEEE Congress on Evolutionary Computation |
2012 |
DBLP DOI BibTeX RDF |
|
24 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs and Threshold Graphs. |
SIAM J. Discret. Math. |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
On Cutwidth Parameterized by Vertex Cover. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
24 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
24 | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
Derivation of algorithms for cutwidth and related graph layout parameters. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Benoît Kloeckner |
Cutwidth and degeneracy of graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
24 | Daniel Berend, Ephraim Korach, Vladimir Lipets |
Minimal cutwidth linear arrangements of abelian Cayley graphs. |
Discret. Math. |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth I: A linear time fixed parameter algorithm. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth II: Algorithms for partial w-trees of bounded degree. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Yixun Lin, Aifeng Yang |
On 3-cutwidth critical graphs. |
Discret. Math. |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Dong Wang, Edmund M. Clarke, Yunshan Zhu, James H. Kukula |
Using cutwidth to improve symbolic simulation and Boolean satisfiability. |
HLDVT |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Imrich Vrto |
Cutwidth of the r-dimensional mesh of d-ary trees. |
RAIRO Theor. Informatics Appl. |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Joe D. Chavez, Rolland Trapp |
The Cyclic Cutwidth of Trees. |
Discret. Appl. Math. |
1998 |
DBLP DOI BibTeX RDF |
|
24 | André Raspaud, Ondrej Sýkora, Imrich Vrto |
Cutwidth of the Bruijn Graph. |
RAIRO Theor. Informatics Appl. |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Dominique Barth, François Pellegrini, André Raspaud, Jean Roman |
On Bandwidth, Cutwidth, and Quotient Graphs. |
RAIRO Theor. Informatics Appl. |
1995 |
DBLP DOI BibTeX RDF |
|
24 | Ephraim Korach, Nir Solel |
Tree-Width, Path-Widt, and Cutwidth. |
Discret. Appl. Math. |
1993 |
DBLP DOI BibTeX RDF |
|
24 | Heather Booth, Rajeev Govindan, Michael A. Langston, Siddharthan Ramachandramurthi |
Cutwidth approximation in linear time. |
Great Lakes Symposium on VLSI |
1992 |
DBLP DOI BibTeX RDF |
|
24 | Zevi Miller, Ivan Hal Sudborough |
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. |
Math. Syst. Theory |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Fan R. K. Chung, Paul D. Seymour |
Graphs with small bandwidth and cutwidth. |
Discret. Math. |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Zevi Miller, Ivan Hal Sudborough |
A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. |
Aegean Workshop on Computing |
1986 |
DBLP DOI BibTeX RDF |
|
19 | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh 0001 |
Graph Layout Problems Parameterized by Vertex Cover. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
On Problems without Polynomial Kernels (Extended Abstract). |
ICALP (1) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Jinbo Huang, Adnan Darwiche |
Using DPLL for Efficient OBDD Construction. |
SAT (Selected Papers |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Lubomir Torok, Imrich Vrto |
Layout Volumes of the Hypercube. |
GD |
2004 |
DBLP DOI BibTeX RDF |
|
19 | William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman |
Augmented Ring Networks. |
IEEE Trans. Parallel Distributed Syst. |
2001 |
DBLP DOI BibTeX RDF |
express rings, hierarchical ring networks, diameter trade-offs, graph embedding, Ring networks, multirings, chordal rings, grid graphs |
19 | Fedor V. Fomin, Dimitrios M. Thilikos |
On the Monotonicity of Games Generated by Symmetric Submodular Functions. |
WG |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Hristo N. Djidjev, Imrich Vrto |
An Improved Lower Bound for Crossing Numbers. |
GD |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Sergei L. Bezrukov, Sajal K. Das 0001, Robert Elsässer |
Optimal Cuts for Powers of the Petersen Graph. |
WG |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Yefim Dinitz, Marcelo Feighelstein, Shmuel Zaks |
On Optimal Graphs Embedded into Path and Rings, with Analysis Using l1-Spheres. |
WG |
1997 |
DBLP DOI BibTeX RDF |
|
19 | José D. P. Rolim, Ondrej Sýkora, Imrich Vrto |
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. |
WG |
1995 |
DBLP DOI BibTeX RDF |
|