| Publication | Date of Publication | Type |
|---|
Which is the worst-case Nash equilibrium?
SIAM Journal on Discrete Mathematics | 2024-06-08 | Paper |
Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
Improved bounds for the crossing numbers on surfaces of genus g
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Book embeddings and crossing numbers
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
Lecture Notes in Computer Science | 2022-08-19 | Paper |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Journal of Graph Theory | 2016-10-13 | Paper |
Evolutionary graph colouring
Information Processing Letters | 2016-06-16 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Discrete Applied Mathematics | 2014-04-16 | Paper |
The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Antibandwidth and cyclic antibandwidth of Hamming graphs
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Planar crossing numbers of graphs of bounded genus
Discrete & Computational Geometry | 2012-09-19 | Paper |
A special antidilation problem for meshes and Hamming graphs
Discrete Mathematics | 2012-07-04 | Paper |
Bounds for Convex Crossing Numbers
Lecture Notes in Computer Science | 2011-03-18 | Paper |
General lower bounds for the minor crossing number of graphs
Discrete & Computational Geometry | 2010-09-22 | Paper |
A note on isoperimetric peaks of complete trees
Discrete Mathematics | 2010-04-27 | Paper |
Antibandwidth of three-dimensional meshes
Discrete Mathematics | 2010-03-29 | Paper |
Antibandwidth of complete \(k\)-ary trees
Discrete Mathematics | 2009-12-15 | Paper |
Antibandwidth of \(d\)-dimensional meshes
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Antibandwidth and cyclic antibandwidth of meshes and hypercubes
Discrete Mathematics | 2009-06-19 | Paper |
Two trees which are self-intersecting when drawn simultaneously
Discrete Mathematics | 2009-04-09 | Paper |
Planar Crossing Numbers of Genus g Graphs
Automata, Languages and Programming | 2009-03-12 | Paper |
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
Random Structures & Algorithms | 2009-03-04 | Paper |
An improved upper bound on the crossing number of the hypercube
Journal of Graph Theory | 2009-02-20 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
On \(k\)-planar crossing numbers
Discrete Applied Mathematics | 2007-06-08 | Paper |
The Cyclic Antibandwidth Problem
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Antibandwidth of Complete k-Ary Trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Antibandwidth of Three-Dimensional Meshes
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph minors and the crossing number of graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Crossing Minimisation Heuristics for 2-page Drawings
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
| Biplanar crossing numbers. I: A survey of results and problems | 2006-06-29 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Crossing Numbers and Cutwidths
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions
The Electronic Journal of Combinatorics | 2005-04-25 | Paper |
| scientific article; zbMATH DE number 2145245 (Why is no real title available?) | 2005-03-14 | Paper |
A note on Halton's conjecture
Information Sciences | 2005-02-09 | Paper |
Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
Discrete Applied Mathematics | 2004-11-23 | Paper |
New results on edge-bandwidth
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2084271 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084269 (Why is no real title available?) | 2004-08-06 | Paper |
Dynamic faults have small effect on broadcasting in hypercubes.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2043451 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1974130 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1974119 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1953110 (Why is no real title available?) | 2003-07-25 | Paper |
Optimal broadcasting in hypercubes with dynamic faults
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1696530 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1760009 (Why is no real title available?) | 2002-06-25 | Paper |
Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees
RAIRO. Theoretical Informatics and Applications | 2002-01-08 | Paper |
On bipartite drawings and the linear arrangement problem
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1420908 (Why is no real title available?) | 2000-10-17 | Paper |
| scientific article; zbMATH DE number 1500685 (Why is no real title available?) | 2000-09-04 | Paper |
A new lower bound for the bipartite crossing number with applications
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1490011 (Why is no real title available?) | 2000-08-13 | Paper |
Virtual Path Layouts in ATM Networks
SIAM Journal on Computing | 2000-03-19 | Paper |
Bisection width of transposition graphs
Discrete Applied Mathematics | 1998-12-10 | Paper |
Bisecting de Bruijn and Kautz graphs
Discrete Applied Mathematics | 1998-07-28 | Paper |
Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces
Discrete & Computational Geometry | 1998-04-19 | Paper |
Cutwidth of the de Bruijn graph
RAIRO - Theoretical Informatics and Applications | 1997-10-08 | Paper |
| scientific article; zbMATH DE number 1054768 (Why is no real title available?) | 1997-10-07 | Paper |
The crossing number of a graph on a compact 2-manifold
Advances in Mathematics | 1997-07-07 | Paper |
| The book crossing number of a graph | 1996-10-29 | Paper |
Drawings of graphs on surfaces with few crossings
Algorithmica | 1996-10-20 | Paper |
On embeddings in cycles
Information and Computation | 1995-07-10 | Paper |
Two remarks on ``Expanding and forwarding by P. Solé
Discrete Applied Mathematics | 1995-07-09 | Paper |
On VLSI layouts of the star graph and related networks
Integration | 1995-05-30 | Paper |
On crossing numbers of hypercubes and cube connected cycles
BIT | 1993-11-28 | Paper |
| scientific article; zbMATH DE number 219248 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 219242 (Why is no real title available?) | 1993-06-29 | Paper |
Edge separators for graphs of bounded genus with applications
Theoretical Computer Science | 1993-05-24 | Paper |
Edge Separators of Planar and Outerplanar Graphs With Applications
Journal of Algorithms | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 17819 (Why is no real title available?) | 1992-06-26 | Paper |
Semelectivity is not sufficient
Information Processing Letters | 1991-01-01 | Paper |
Area complexity of merging
Theoretical Computer Science | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4064516 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4057005 (Why is no real title available?) | 1988-01-01 | Paper |
Tight chip area lower bounds for string matching
Information Processing Letters | 1987-01-01 | Paper |
A minimum-area circuit for \(\ell\)-selection
Algorithmica | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4026821 (Why is no real title available?) | 1987-01-01 | Paper |
The area-time complexity of the VLSI counter
Information Processing Letters | 1987-01-01 | Paper |
Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations
Information Processing Letters | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3940717 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3936524 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3861076 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3806932 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3882468 (Why is no real title available?) | 1982-01-01 | Paper |
