| Publication | Date of Publication | Type |
|---|
Efficient deterministic algorithms for embedding graphs on books
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Improved bounds for the crossing numbers on surfaces of genus g
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Concurrent flows and packet routing in Cayley graphs (Preliminary version)
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 |
Bounding the trace function of a hypergraph with applications
(available as arXiv preprint) | 2022-10-22 | Paper |
On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem
Lecture Notes in Computer Science | 2022-08-19 | Paper |
| Bounding the edge cover of a hypergraph | 2021-08-18 | Paper |
Strong pseudo transitivity and intersection graphs
(available as arXiv preprint) | 2019-07-24 | Paper |
Largest reduced neighborhood clique cover number revisited
(available as arXiv preprint) | 2018-04-23 | Paper |
On the largest reduced neighborhood clique cover number of a graph
(available as arXiv preprint) | 2017-04-04 | Paper |
Bounds for the clique cover width of factors of the apex graph of the planar grid
Congressus Numerantium | 2016-04-13 | Paper |
Algorithms for longest chains in pseudo-transitive graphs
(available as arXiv preprint) | 2015-05-21 | Paper |
| New representation results for planar graphs | 2015-02-21 | Paper |
Clique cover width and clique sum
(available as arXiv preprint) | 2014-04-02 | Paper |
Unit incomparability dimension and clique cover width in graphs
Congressus Numerantium | 2014-01-03 | Paper |
| On the clique cover width problem | 2011-07-13 | Paper |
A new upper bound for the clique cover number with applications
(available as arXiv preprint) | 2011-07-13 | Paper |
Bounds for Convex Crossing Numbers
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
On \(k\)-planar crossing numbers
Discrete Applied Mathematics | 2007-06-08 | Paper |
| scientific article; zbMATH DE number 2145245 (Why is no real title available?) | 2005-03-14 | Paper |
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem
Discrete Applied Mathematics | 2001-07-03 | Paper |
On bipartite drawings and the linear arrangement problem
SIAM Journal on Computing | 2001-03-19 | 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 637304 (Why is no real title available?) | 2000-08-14 | Paper |
On Crossing Sets, Disjoint Sets, and Pagenumber
Journal of Algorithms | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1262804 (Why is no real title available?) | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1151794 (Why is no real title available?) | 1998-08-10 | Paper |
Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces
Discrete & Computational Geometry | 1998-04-19 | 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 |
Applications of the crossing number
Algorithmica | 1996-08-12 | Paper |
| scientific article; zbMATH DE number 861340 (Why is no real title available?) | 1996-05-21 | Paper |
| scientific article; zbMATH DE number 867664 (Why is no real title available?) | 1996-04-22 | Paper |
On Canonical Concurrent Flows, Crossing Number and Graph Expansion
Combinatorics, Probability and Computing | 1995-03-30 | Paper |
| scientific article; zbMATH DE number 637522 (Why is no real title available?) | 1994-10-13 | Paper |
A linear time algorithm for graph partition problems
Information Processing Letters | 1993-01-16 | Paper |
Approximation Algorithms for the Maximum Concurrent Flow Problem
ORSA Journal on Computing | 1993-01-16 | Paper |
The maximum concurrent flow problem
Journal of the ACM | 1990-01-01 | Paper |
Sparsest cuts and bottlenecks in graphs
Discrete Applied Mathematics | 1990-01-01 | Paper |
On renaming a set of clauses as a Horn set
Information Processing Letters | 1989-01-01 | Paper |
