Search results for "cutwidth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Imrich Vrto	Cutwidth of the Mesh of dary Trees.	Euro-Par	1997	DBLP DOI BibTeX RDF	cutwidth, embedding, congestion, mesh of trees, bisection
2	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	CiE	2009	DBLP DOI BibTeX RDF
2	Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.	WG	2008	DBLP DOI BibTeX RDF
2	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
2	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
2	Heiko Schröder, Ondrej Sýkora, Imrich Vrto	Cyclic Cutwidth of the Mesh.	SOFSEM	1999	DBLP DOI BibTeX RDF
2	Dominique Barth	Bandwidth and Cutwidth of the Mesh of d-Ary Trees.	Euro-Par, Vol. I	1996	DBLP DOI BibTeX RDF
2	Maw-Hwa Chen, Sing-Ling Lee	Linear Time Algorithms for k-cutwidth Problem.	ISAAC	1992	DBLP DOI BibTeX RDF
1	Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour	Tournament immersion and cutwidth.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
1	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos	Cutwidth of Split Graphs and Threshold Graphs.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Marek Cygan, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh	On Cutwidth Parameterized by Vertex Cover.	IPEC	2011	DBLP DOI BibTeX RDF
1	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
1	Benoit Kloeckner	Cutwidth and degeneracy of graphs	CoRR	2009	DBLP BibTeX RDF
1	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
1	Daniel Berend, Ephraim Korach, Vladimir Lipets	Minimal cutwidth linear arrangements of abelian Cayley graphs.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin	On Problems without Polynomial Kernels (Extended Abstract).	ICALP	2008	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh	Graph Layout Problems Parameterized by Vertex Cover.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender	Cutwidth I: A linear time fixed parameter algorithm.	J. Algorithms	2005	DBLP DOI BibTeX RDF
1	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
1	Yixun Lin, Aifeng Yang	On 3-cutwidth critical graphs.	Discrete Mathematics	2004	DBLP DOI BibTeX RDF
1	Lubomir Torok, Imrich Vrto	Layout Volumes of the Hypercube.	Graph Drawing	2004	DBLP DOI BibTeX RDF
1	Jinbo Huang, Adnan Darwiche	Using DPLL for Efficient OBDD Construction.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
1	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
1	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
1	William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman	Augmented Ring Networks.	IEEE Trans. Parallel Distrib. Syst.	2001	DBLP DOI BibTeX RDF	express rings, hierarchical ring networks, diameter trade-offs, graph embedding, Ring networks, multirings, chordal rings, grid graphs
1	Hristo Djidjev, Imrich Vrto	An Improved Lower Bound for Crossing Numbers.	Graph Drawing	2001	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Dimitrios M. Thilikos	On the Monotonicity of Games Generated by Symmetric Submodular Functions.	WG	2001	DBLP DOI BibTeX RDF
1	Imrich Vrto	Cutwidth of the r-dimensional mesh of d-ary trees.	ITA	2000	DBLP DOI BibTeX RDF
1	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
1	Patricia A. Evans	Finding Common Subsequences with Arcs and Pseudoknots.	CPM	1999	DBLP DOI BibTeX RDF
1	Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer	Optimal Cuts for Powers of the Petersen Graph.	WG	1999	DBLP DOI BibTeX RDF
1	Joe D. Chavez, Rolland Trapp	The Cyclic Cutwidth of Trees.	Discrete Applied Mathematics	1998	DBLP DOI BibTeX RDF
1	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
1	André Raspaud, Ondrej Sýkora, Imrich Vrto	Cutwidth of the Bruijn Graph.	ITA	1995	DBLP BibTeX RDF
1	Dominique Barth, François Pellegrini, André Raspaud, Jean Roman	On Bandwidth, Cutwidth, and Quotient Graphs.	ITA	1995	DBLP BibTeX RDF
1	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
1	Ephraim Korach, Nir Solel	Tree-Width, Path-Widt, and Cutwidth.	Discrete Applied Mathematics	1993	DBLP DOI BibTeX RDF
1	Zevi Miller, Ivan Hal Sudborough	A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs.	Mathematical Systems Theory	1991	DBLP DOI BibTeX RDF
1	Fan R. K. Chung, Paul D. Seymour	Graphs with small bandwidth and cutwidth.	Discrete Mathematics	1989	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender	Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth.	WG	1989	DBLP DOI BibTeX RDF
1	Zevi Miller, Ivan Hal Sudborough	A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs.	Aegean Workshop on Computing	1986	DBLP DOI BibTeX RDF
1	Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough	Topological Bandwidth.	CAAP	1983	DBLP DOI BibTeX RDF
1	Fillia Makedon, Ivan Hal Sudborough	Minimizing Width in Linear Layouts.	ICALP	1983	DBLP DOI BibTeX RDF