| Publication | Date of Publication | Type |
|---|
| Which is the worst-case Nash equilibrium? | 2024-06-08 | Paper |
| Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes | 2024-02-28 | Paper |
| Improved bounds for the crossing numbers on surfaces of genus g | 2024-01-05 | Paper |
| Book embeddings and crossing numbers | 2024-01-05 | Paper |
| On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem | 2022-08-19 | Paper |
| The same upper bound for both: the 2-page and the rectilinear crossing numbers of the \(n\)-cube | 2016-10-13 | Paper |
| Evolutionary graph colouring | 2016-06-16 | Paper |
| Antibandwidth and cyclic antibandwidth of Hamming graphs | 2014-04-16 | Paper |
| The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube | 2013-12-06 | Paper |
| Antibandwidth and cyclic antibandwidth of Hamming graphs | 2013-10-10 | Paper |
| Planar crossing numbers of graphs of bounded genus | 2012-09-19 | Paper |
| A special antidilation problem for meshes and Hamming graphs | 2012-07-04 | Paper |
| Bounds for Convex Crossing Numbers | 2011-03-18 | Paper |
| General lower bounds for the minor crossing number of graphs | 2010-09-22 | Paper |
| A note on isoperimetric peaks of complete trees | 2010-04-27 | Paper |
| Antibandwidth of three-dimensional meshes | 2010-03-29 | Paper |
| Antibandwidth of complete \(k\)-ary trees | 2009-12-15 | Paper |
| Antibandwidth of d-Dimensional Meshes | 2009-12-11 | Paper |
| Graph Drawing | 2009-08-11 | Paper |
| Antibandwidth and cyclic antibandwidth of meshes and hypercubes | 2009-06-19 | Paper |
| Two trees which are self-intersecting when drawn simultaneously | 2009-04-09 | Paper |
| Planar Crossing Numbers of Genus g Graphs | 2009-03-12 | Paper |
| Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method | 2009-03-04 | Paper |
| An improved upper bound on the crossing number of the hypercube | 2009-02-20 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On \(k\)-planar crossing numbers | 2007-06-08 | Paper |
| The Cyclic Antibandwidth Problem | 2007-05-29 | Paper |
| Antibandwidth of Complete k-Ary Trees | 2007-05-29 | Paper |
| Antibandwidth of Three-Dimensional Meshes | 2007-05-29 | Paper |
| Graph minors and the crossing number of graphs | 2007-05-29 | Paper |
| Crossing Minimisation Heuristics for 2-page Drawings | 2007-05-29 | Paper |
| Graph Drawing | 2006-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5477811 | 2006-06-29 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| Graph Drawing | 2005-12-07 | Paper |
| SOFSEM 2005: Theory and Practice of Computer Science | 2005-12-07 | Paper |
| Crossing Numbers and Cutwidths | 2005-05-25 | Paper |
| Outerplanar crossing numbers, the circular arrangement problem and isoperimetric functions | 2005-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4657594 | 2005-03-14 | Paper |
| A note on Halton's conjecture | 2005-02-09 | Paper |
| Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes | 2004-11-23 | Paper |
| New results on edge-bandwidth | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043710 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043708 | 2004-08-06 | Paper |
| Dynamic faults have small effect on broadcasting in hypercubes. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450946 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422291 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4422275 | 2003-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414514 | 2003-07-25 | Paper |
| Optimal broadcasting in hypercubes with dynamic faults | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766678 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536933 | 2002-06-25 | Paper |
| Cutwidth of the \(r\)-dimensional mesh of \(d\)-ary trees | 2002-01-08 | Paper |
| On bipartite drawings and the linear arrangement problem | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944977 | 2000-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501706 | 2000-09-04 | Paper |
| A new lower bound for the bipartite crossing number with applications | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496254 | 2000-08-13 | Paper |
| Virtual Path Layouts in ATM Networks | 2000-03-19 | Paper |
| Bisection width of transposition graphs | 1998-12-10 | Paper |
| Bisecting de Bruijn and Kautz graphs | 1998-07-28 | Paper |
| Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces | 1998-04-19 | Paper |
| Cutwidth of the de Bruijn graph | 1997-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4352316 | 1997-10-07 | Paper |
| The crossing number of a graph on a compact 2-manifold | 1997-07-07 | Paper |
| The book crossing number of a graph | 1996-10-29 | Paper |
| Drawings of graphs on surfaces with few crossings | 1996-10-20 | Paper |
| On embeddings in cycles | 1995-07-10 | Paper |
| Two remarks on ``Expanding and forwarding by P. Solé | 1995-07-09 | Paper |
| On VLSI layouts of the star graph and related networks | 1995-05-30 | Paper |
| On crossing numbers of hypercubes and cube connected cycles | 1993-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694734 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694728 | 1993-06-29 | Paper |
| Edge separators for graphs of bounded genus with applications | 1993-05-24 | Paper |
| Edge Separators of Planar and Outerplanar Graphs With Applications | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975163 | 1992-06-26 | Paper |
| Semelectivity is not sufficient | 1991-01-01 | Paper |
| Area complexity of merging | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798265 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3792241 | 1988-01-01 | Paper |
| Tight chip area lower bounds for string matching | 1987-01-01 | Paper |
| A minimum-area circuit for \(\ell\)-selection | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768394 | 1987-01-01 | Paper |
| The area-time complexity of the VLSI counter | 1987-01-01 | Paper |
| Tight chip area lower bounds for discrete Fourier and Walsh-Hadamard transformations | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711746 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3707412 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3329402 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4749202 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216684 | 1982-01-01 | Paper |
