| Publication | Date of Publication | Type |
|---|
Constructing red-black spanners for mixed-charging vehicular networks
Theoretical Computer Science | 2024-12-12 | Paper |
Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges
Journal of Combinatorial Optimization | 2024-12-03 | Paper |
Sink location problems in dynamic flow grid networks
Theoretical Computer Science | 2024-11-06 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
| Faster algorithms for evacuation problems in networks with a single sink of small degree and bounded capacitated edges | 2024-09-16 | Paper |
| Sink location problems in dynamic flow grid networks | 2024-08-22 | Paper |
| Red-black spanners for mixed-charging vehicular networks | 2024-08-22 | Paper |
| Locating evacuation centers optimally in path and cycle networks | 2024-08-13 | Paper |
| On computing a center persistence diagram | 2024-05-29 | Paper |
ZDD-based algorithmic framework for solving shortest reconfiguration problems
Integration of Constraint Programming, Artificial Intelligence, and Operations Research | 2023-10-04 | Paper |
Small Complexity Gaps for Comparison-Based Sorting
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Combinatorial Optimization and Applications | 2023-03-21 | Paper |
Minmax regret 1-sink location problems on dynamic flow path networks with parametric weights
(available as arXiv preprint) | 2021-10-04 | Paper |
Almost linear time algorithms for minsum \(k\)-sink problems on dynamic flow path networks
Theoretical Computer Science | 2021-06-22 | Paper |
Satisfiability algorithm for syntactic read-\(k\)-times branching programs
Theory of Computing Systems | 2021-06-11 | Paper |
| Satisfiability algorithm for syntactic read-\(k\)-times branching programs | 2020-11-25 | Paper |
Improved average complexity for comparison-based sorting
Theoretical Computer Science | 2020-01-22 | Paper |
Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression
Journal of Computer and System Sciences | 2019-08-07 | Paper |
A moderately exponential time algorithm for \(k\)-IBDD satisfiability
Algorithmica | 2018-07-26 | Paper |
| Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression | 2018-03-21 | Paper |
| Improved exact algorithms for mildly sparse instances of MAX SAT | 2017-09-29 | Paper |
Improved exact algorithms for mildly sparse instances of MAX SAT
Theoretical Computer Science | 2017-09-28 | Paper |
Improved average complexity for comparison-based sorting
Lecture Notes in Computer Science | 2017-09-22 | Paper |
A moderately exponential time algorithm for \(k\)-IBDD satisfiability
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Efficient algorithms for sorting \(k\)-sets in bins
Algorithms and Computation | 2014-02-18 | Paper |
Quantum counterfeit coin problems
Theoretical Computer Science | 2012-10-11 | Paper |
Reconstructing strings from substrings with quantum queries
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
Quantum counterfeit coin problems
Algorithms and Computation | 2010-12-09 | Paper |
