| Publication | Date of Publication | Type |
|---|
A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph
Discrete Applied Mathematics | 2024-06-20 | Paper |
Finding large planar subgraphs and large subgraphs of a given genus
Lecture Notes in Computer Science | 2024-01-29 | Paper |
An improved algorithm for finding maximum outerplanar subgraphs
Discrete Applied Mathematics | 2024-01-24 | Paper |
Faster compression of patterns to rectangle rule lists
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Combination algorithms for Steiner tree variants
Algorithmica | 2023-04-21 | Paper |
Faster compression of patterns to rectangle rule lists
Theoretical Computer Science | 2020-05-26 | Paper |
Improved approximation algorithms for minimum power covering problems
Theoretical Computer Science | 2019-10-18 | Paper |
Client assignment problems for latency minimization
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Improved approximation algorithms for minimum power covering problems
Approximation and Online Algorithms | 2019-01-15 | Paper |
T-joins in strongly connected hypergraphs
Discrete Mathematics, Algorithms and Applications | 2017-12-14 | Paper |
Improved approximation algorithms for single-tiered relay placement
Journal of Combinatorial Optimization | 2016-04-13 | Paper |
1.61-approximation for min-power strong connectivity with two power levels
Journal of Combinatorial Optimization | 2016-02-23 | Paper |
Register loading via linear programming
Algorithmica | 2015-09-02 | Paper |
Relay placement for two-connectivity
Discrete Optimization | 2015-04-09 | Paper |
| Compressing rectilinear pictures and minimizing access control lists | 2014-12-18 | Paper |
Bounding the payment of approximate truthful mechanisms
Theoretical Computer Science | 2014-12-02 | Paper |
An improved approximation algorithm for \textsc{Resource Allocation}
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Sequential dependency computation via geometric data structures
Computational Geometry | 2014-01-22 | Paper |
Approximate min-power strong connectivity
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
Maximum series-parallel subgraph
Algorithmica | 2012-04-26 | Paper |
Maximizing a monotone submodular function subject to a matroid constraint
SIAM Journal on Computing | 2012-03-15 | Paper |
Register loading via linear programming
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Disjoint bases in a polymatroid
Random Structures & Algorithms | 2010-11-09 | Paper |
Min-power strong connectivity
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
| On the \(k\)-restricted structure ratio in planar and outerplanar graphs | 2010-07-27 | Paper |
Network lifetime and power assignment in ad hoc wireless networks
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Maximum series-parallel subgraph
Graph-Theoretic Concepts in Computer Science | 2010-01-21 | Paper |
Reconfigurations in Graphs and Grids
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Fast edge colorings with fixed number of colors to minimize imbalance
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Reconfigurations in Graphs and Grids
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
A note on data structures for maintaining bipartitions
Journal of Discrete Algorithms | 2008-05-16 | Paper |
Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
On ring grooming in optical networks
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
A fast localized algorithm for scheduling sensors
Journal of Parallel and Distributed Computing | 2006-08-04 | Paper |
Bounded-hops power assignment in ad hoc wireless networks
Discrete Applied Mathematics | 2006-06-09 | Paper |
| The carpenter's ruler folding problem | 2006-04-28 | Paper |
SEPARATING POINTS BY AXIS-PARALLEL LINES
International Journal of Computational Geometry & Applications | 2006-03-13 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
The polymatroid Steiner problems
Journal of Combinatorial Optimization | 2005-10-18 | Paper |
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2086936 (Why is no real title available?) | 2004-08-11 | Paper |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms | 2004-03-14 | Paper |
A new approximation algorithm for finding heavy planar subgraphs
Algorithmica | 2003-08-17 | Paper |
Traffic partition in WDM/SONET rings to minimize SONET ADMs
Journal of Combinatorial Optimization | 2003-06-09 | Paper |
Minimum-energy broadcasting in static ad hoc wireless networks
Wireless Networks | 2003-02-19 | Paper |
| scientific article; zbMATH DE number 1775387 (Why is no real title available?) | 2002-08-01 | Paper |
Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs
Theoretical Computer Science | 2002-07-15 | Paper |
| Approximation algorithms for the 0-extension problem | 2002-06-30 | Paper |
| Multicuts in unweighted digraphs with bounded degree and bounded tree-width | 2001-10-24 | Paper |
Alphabet-Independent and Scaled Dictionary Matching
Journal of Algorithms | 2001-03-12 | Paper |
An improved approximation algorithm of MULTIWAY CUT.
Journal of Computer and System Sciences | 2000-11-21 | Paper |
| scientific article; zbMATH DE number 1187148 (Why is no real title available?) | 1999-04-08 | Paper |
A Better Approximation Algorithm for Finding Planar Subgraphs
Journal of Algorithms | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 871895 (Why is no real title available?) | 1996-06-16 | Paper |
