| Publication | Date of Publication | Type |
|---|
Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
International Journal of Game Theory | 2024-08-01 | Paper |
How vulnerable is an undirected planar graph with respect to max flow
Networks | 2024-03-15 | Paper |
Non-crossing shortest paths lengths in planar graphs in linear time
Discrete Applied Mathematics | 2024-02-14 | Paper |
Non-crossing shortest paths lengths in planar graphs in linear time
Lecture Notes in Computer Science | 2023-10-04 | Paper |
How vulnerable is an undirected planar graph with respect to max flow
Lecture Notes in Computer Science | 2023-10-04 | Paper |
Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
Non-crossing shortest paths in undirected unweighted planar graphs in linear time
(available as arXiv preprint) | 2022-11-11 | Paper |
Semi-dynamic shortest paths and breadth-first search in digraphs
Lecture Notes in Computer Science | 2022-11-09 | Paper |
A tight relation between series-parallel graphs and bipartite distance hereditary graphs
The Art of Discrete and Applied Mathematics | 2022-11-04 | Paper |
Enclosing many boxes by an optimal pair of boxes
STACS 92 | 2022-08-18 | Paper |
| Network homophily via tail inequalities | 2022-08-03 | Paper |
| Evaluating homophily of human PPI with respect to chromosomes | 2022-07-29 | Dataset |
Max flow vitality in general and \(st\)-planar graphs
Networks | 2019-08-01 | Paper |
A low arithmetic-degree algorithm for computing proximity graphs
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
On computing the Galois lattice of bipartite distance hereditary graphs
Discrete Applied Mathematics | 2017-06-14 | Paper |
On resilient graph spanners
Algorithmica | 2016-05-31 | Paper |
The incremental maintenance of a depth-first-search tree in directed acyclic graphs
Information Processing Letters | 2016-05-26 | Paper |
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Lecture Notes in Computer Science | 2015-09-15 | Paper |
On the Galois lattice of bipartite distance hereditary graphs
Discrete Applied Mathematics | 2015-07-06 | Paper |
On resilient graph spanners
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Computing graph spanners in small memory: fault-tolerance and streaming
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Computing graph spanners in small memory: fault-tolerance and streaming
Lecture Notes in Computer Science | 2010-07-20 | Paper |
On the complexity of recognizing directed path families
Discrete Applied Mathematics | 2010-04-28 | Paper |
Graph spanners in the streaming model: An experimental study
Algorithmica | 2009-08-27 | Paper |
Small stretch \((\alpha ,\beta )\)-spanners in the streaming model
Theoretical Computer Science | 2009-08-21 | Paper |
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Small Stretch Spanners on Dynamic Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments
Algorithms – ESA 2007 | 2008-09-25 | Paper |
A characterization of partial directed line graphs
Discrete Mathematics | 2007-10-25 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Partially dynamic maintenance of minimum weight hyperpaths
Journal of Discrete Algorithms | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2044509 (Why is no real title available?) | 2004-02-18 | Paper |
| scientific article; zbMATH DE number 1554935 (Why is no real title available?) | 2001-01-21 | Paper |
Semi-dynamic breadth-first search in digraphs
Theoretical Computer Science | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1104331 (Why is no real title available?) | 1998-02-05 | Paper |
On the Boolean dimension of spherical orders
Order | 1997-07-13 | Paper |
Enclosing a Set of Objects by Two Minimum Area Rectangles
Journal of Algorithms | 1997-06-22 | Paper |
A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS
International Journal of Computational Geometry & Applications | 1994-11-06 | Paper |
SEPARATING SETS OF HYPERRECTANGLES
International Journal of Computational Geometry & Applications | 1993-10-24 | Paper |
| scientific article; zbMATH DE number 176570 (Why is no real title available?) | 1993-05-18 | Paper |
On the optimal binary plane partition for sets of isothetic rectangles
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 4213450 (Why is no real title available?) | 1990-01-01 | Paper |
