| Publication | Date of Publication | Type |
|---|
| Single source -- all sinks max flows in planar digraphs | 2025-05-05 | Paper |
| Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications | 2019-05-10 | Paper |
Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| scientific article; zbMATH DE number 6850341 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850341 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Faster shortest paths in dense distance graphs, with applications
Theoretical Computer Science | 2018-02-16 | Paper |
Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
SIAM Journal on Computing | 2017-08-16 | Paper |
Linear-time recognition of probe interval graphs
SIAM Journal on Discrete Mathematics | 2015-10-30 | Paper |
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Improved algorithms for \textsc{Min-cut} and \textsc{Max-flow} in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Recognition of probe proper interval graphs
Discrete Applied Mathematics | 2014-03-27 | Paper |
Isomorphism of graph classes related to the circular-ones property
(available as arXiv preprint) | 2014-02-14 | Paper |
| Isomorphism of graph classes related to the circular-ones property | 2014-02-14 | Paper |
| Single Source - All Sinks Max Flows in Planar Digraphs | 2012-10-17 | Paper |
| Minimum \(s-t\) cut in undirected planar graphs when the source and the sink are close | 2012-01-23 | Paper |
A simpler linear-time recognition of circular-arc graphs
Algorithmica | 2011-11-07 | Paper |
Maximum flow in directed planar graphs with vertex capacities
Algorithmica | 2011-08-16 | Paper |
Improved distance queries in planar graphs
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Discrete Applied Mathematics | 2010-04-28 | Paper |
Maximum Flow in Directed Planar Graphs with Vertex Capacities
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Linear-time recognition of probe interval graphs
Lecture Notes in Computer Science | 2009-10-29 | Paper |
From a Circular-Arc Model to a Proper Circular-Arc Model
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs
Graph-Theoretic Concepts in Computer Science | 2008-09-04 | Paper |
A Simpler Linear-Time Recognition of Circular-Arc Graphs
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
