| Publication | Date of Publication | Type |
|---|
| Shortest disjoint paths on a grid | 2024-11-28 | Paper |
| Fully dynamic shortest paths and reachability in sparse digraphs | 2024-11-14 | Paper |
scientific article; zbMATH DE number 7788355 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Subquadratic dynamic path reporting in directed graphs against an adaptive adversary
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Min-Cost Flow in Unit-Capacity Planar Graphs
(available as arXiv preprint) | 2022-05-11 | Paper |
A tight bound for shortest augmenting paths on trees
Theoretical Computer Science | 2022-01-18 | Paper |
Online facility location with deletions
(available as arXiv preprint) | 2021-08-04 | Paper |
NC algorithms for weighted planar perfect matching and related problems
(available as arXiv preprint) | 2021-07-28 | Paper |
Budget feasible mechanisms on matroids
Algorithmica | 2021-04-19 | Paper |
Algorithms for weighted matching generalizations. I: Bipartite graphs, \(b\)-matching, and unweighted \(f\)-factors
SIAM Journal on Computing | 2021-04-14 | Paper |
Algorithms for weighted matching generalizations. II: \(f\)-factors and the special case of shortest paths
SIAM Journal on Computing | 2021-04-14 | Paper |
Walking randomly, massively, and efficiently
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Approximate nearest neighbors search without false negatives for \(l_2\) for \(c>\sqrt{\log\log n}\)
(available as arXiv preprint) | 2020-11-25 | Paper |
Round compression for parallel matching algorithms
SIAM Journal on Computing | 2020-10-29 | Paper |
Contracting a planar graph efficiently
(available as arXiv preprint) | 2020-05-27 | Paper |
A tight bound for shortest augmenting paths on trees
LATIN 2018: Theoretical Informatics | 2020-02-12 | Paper |
\((1 + \varepsilon)\)-approximate incremental matching in constant deterministic amortized time
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Improved distance queries and cycle counting by Frobenius normal form
Theory of Computing Systems | 2019-08-27 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Round compression for parallel matching algorithms
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Network sparsification for Steiner problems on planar and bounded-genus graphs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Network sparsification for Steiner problems on planar and bounded-genus graphs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Min \(st\)-cut oracle for planar graphs with near-linear preprocessing time
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
Journal of the ACM | 2018-08-02 | Paper |
Negative-weight shortest paths and unit capacity minimum cost flow in \(\tilde{O}(m^{10/7}\log W)\) time (extended abstract)
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Algorithmic complexity of power law networks
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Online pricing with impatient bidders
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
(available as arXiv preprint) | 2018-04-19 | Paper |
Shortest augmenting paths for online matchings on trees
Theory of Computing Systems | 2018-04-12 | Paper |
| scientific article; zbMATH DE number 6850408 (Why is no real title available?) | 2018-03-15 | Paper |
scientific article; zbMATH DE number 6850408 (Why is no real title available?)
(available as arXiv preprint) | 2018-03-15 | Paper |
Optimal decremental connectivity in planar graphs
Theory of Computing Systems | 2018-02-01 | Paper |
Budget feasible mechanisms on matroids
Integer Programming and Combinatorial Optimization | 2017-08-31 | Paper |
Decremental single-source reachability in planar digraphs
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Catch them if you can
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Reachability in graph timelines
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
| Subexponential-time parameterized algorithm for Steiner tree on planar graphs | 2017-01-30 | Paper |
Optimal decremental connectivity in planar graphs
(available as arXiv preprint) | 2017-01-24 | Paper |
Network Elicitation in Adversarial Environment
Lecture Notes in Computer Science | 2016-12-21 | Paper |
Online network design with outliers
Algorithmica | 2016-11-01 | Paper |
Locality-Sensitive Hashing Without False Negatives for $$l_p$$
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Shortest augmenting paths for online matchings on trees
Lecture Notes in Computer Science | 2016-02-26 | Paper |
The Power of Dynamic Distance Oracles
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Efficiency of truthful and symmetric mechanisms in one-sided matching
Algorithmic Game Theory | 2015-01-14 | Paper |
Revenue maximizing envy-free fixed-price auctions with budgets
Web and Internet Economics | 2015-01-07 | Paper |
| Faster dynamic matchings and vertex connectivity | 2014-12-18 | Paper |
The ring design game with fair cost allocation
Theoretical Computer Science | 2014-12-02 | Paper |
Improved algorithms for min cut and max flow in undirected planar graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Network formation games with local coalitions
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Set covering with our eyes closed
SIAM Journal on Computing | 2013-09-25 | Paper |
| Single Source - All Sinks Max Flows in Planar Digraphs | 2012-10-17 | Paper |
A path-decomposition theorem with applications to pricing and covering on trees
Algorithms – ESA 2012 | 2012-09-25 | Paper |
| Approximation algorithms for union and intersection covering problems | 2012-08-31 | Paper |
Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Dynamic normal forms and dynamic characteristic polynomial
Theoretical Computer Science | 2011-03-29 | Paper |
Online network design with outliers
Automata, Languages and Programming | 2010-09-07 | Paper |
Fast approximation in subspaces by doubling metric decomposition
Algorithms – ESA 2010 | 2010-09-06 | Paper |
| scientific article; zbMATH DE number 5764797 (Why is no real title available?) | 2010-08-06 | Paper |
Multisampling: a new approach to uniform sampling and approximate counting
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fast dynamic transitive closure with lookahead
Algorithmica | 2010-02-23 | Paper |
Maximum weight bipartite matching in matrix multiplication time
Theoretical Computer Science | 2009-11-04 | Paper |
Weighted Bipartite Matching in Matrix Multiplication Time
Automata, Languages and Programming | 2009-03-12 | Paper |
Algebraic Graph Algorithms
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Dynamic Plane Transitive Closure
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Dynamic Normal Forms and Dynamic Characteristic Polynomial
Automata, Languages and Programming | 2008-08-28 | Paper |
Processor efficient parallel matching
Theory of Computing Systems | 2008-02-18 | Paper |
Maximum matchings in planar graphs via Gaussian elimination
Algorithmica | 2007-06-21 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 1962833 (Why is no real title available?) | 2003-08-11 | Paper |
