| Publication | Date of Publication | Type |
|---|
Approximate realizations for outerplanaric degree sequences
Journal of Computer and System Sciences | 2024-12-27 | Paper |
Graph realization of distance sets
Theoretical Computer Science | 2024-11-06 | Paper |
Graph realization of distance sets
| 2024-08-06 | Paper |
On the role of the high-low partition in realizing a degree sequence by a bipartite graph
| 2024-08-06 | Paper |
Online multiset submodular cover
Algorithmica | 2024-08-02 | Paper |
On realizing a single degree sequence by a bipartite graph
| 2024-05-27 | Paper |
scientific article; zbMATH DE number 7788600 (Why is no real title available?)
| 2024-01-15 | Paper |
Degree realization by bipartite multigraphs
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Weighted microscopic image reconstruction
Discrete Applied Mathematics | 2024-01-09 | Paper |
scientific article; zbMATH DE number 7759278 (Why is no real title available?)
| 2023-11-02 | Paper |
Graph realizations: maximum degree in vertex neighborhoods
Discrete Mathematics | 2023-06-12 | Paper |
Forcibly bipartite and acyclic (uni-)graphic sequences
Discrete Mathematics | 2023-05-15 | Paper |
On vertex-weighted graph realizations
| 2023-03-22 | Paper |
Composed degree-distance realizations of graphs
Algorithmica | 2023-03-09 | Paper |
Overflow management with self-eliminations
Theoretical Computer Science | 2023-02-13 | Paper |
scientific article; zbMATH DE number 7651149 (Why is no real title available?)
| 2023-02-07 | Paper |
The Generalized Microscopic Image Reconstruction Problem
| 2023-02-03 | Paper |
Efficiently Realizing Interval Sequences
| 2023-02-03 | Paper |
Maximizing Barrier Coverage Lifetime with Static Sensors
Algorithms for Sensor Systems | 2022-12-09 | Paper |
Randomized strategies for non-additive 3-slope ski rental
| 2022-11-11 | Paper |
Maximizing barrier coverage lifetime with static sensors
Journal of Scheduling | 2022-11-04 | Paper |
The generalized microscopic image reconstruction problem
Discrete Applied Mathematics | 2022-09-15 | Paper |
Vertex-weighted graphs: realizable and unrealizable domains
| 2022-07-13 | Paper |
Overflow management with self-eliminations
Algorithms for Sensor Systems | 2022-06-24 | Paper |
On vertex-weighted realizations of acyclic and general graphs
Theoretical Computer Science | 2022-06-13 | Paper |
Weighted microscopic image reconstruction
| 2022-03-24 | Paper |
Relaxed and approximate graph realizations
| 2022-03-22 | Paper |
Composed degree-distance realizations of graphs
Lecture Notes in Computer Science | 2022-03-22 | Paper |
Online budgeted maximum coverage
Algorithmica | 2021-09-02 | Paper |
``Green barrier coverage with mobile sensors
Theoretical Computer Science | 2021-03-09 | Paper |
Efficiently realizing interval sequences
SIAM Journal on Discrete Mathematics | 2020-12-04 | Paper |
Simple and local independent set approximation
Theoretical Computer Science | 2020-11-06 | Paper |
Local search algorithms for the maximum carpool matching problem
Algorithmica | 2020-10-21 | Paper |
Local search algorithms for the maximum carpool matching problem
| 2020-05-27 | Paper |
Vertex-weighted realizations of graphs
Theoretical Computer Science | 2020-01-22 | Paper |
Service chain placement in SDNs
Discrete Applied Mathematics | 2019-11-06 | Paper |
Graph profile realizations and applications to social networks
| 2019-10-15 | Paper |
Brief announcement: Simple and local independent set approximation
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Distributed approximation of \(k\)-service assignment
Distributed Computing | 2019-03-21 | Paper |
Realizability of graph specifications: characterizations and algorithms
| 2019-01-30 | Paper |
Simple and local independent set approximation
Structural Information and Communication Complexity | 2019-01-30 | Paper |
Flexible cell selection in cellular networks
| 2018-12-07 | Paper |
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Flexible allocation on related machines with assignment restrictions
Discrete Applied Mathematics | 2018-10-26 | Paper |
Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
SIAM Journal on Discrete Mathematics | 2018-08-07 | Paper |
1.5-approximation algorithm for the 2-convex recoloring problem
Discrete Applied Mathematics | 2018-06-27 | Paper |
Distributed backup placement in networks
Distributed Computing | 2018-04-11 | Paper |
Online budgeted maximum coverage
| 2018-03-02 | Paper |
Set it and forget it: approximating the set once strip cover problem
Algorithmica | 2017-10-10 | Paper |
Distributed approximation of \(k\)-service assignment
| 2017-09-29 | Paper |
Maximizing Barrier Coverage Lifetime with Mobile Sensors
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
A constant factor approximation algorithm for the storage allocation problem
Algorithmica | 2017-05-02 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Algorithmica | 2016-05-31 | Paper |
1.5-approximation algorithm for the 2-convex recoloring problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Changing of the guards: strip cover with duty cycling
Theoretical Computer Science | 2015-12-10 | Paper |
``Green barrier coverage with mobile sensors
Lecture Notes in Computer Science | 2015-09-21 | Paper |
Bandwidth allocation in cellular networks with multiple interferences
Discrete Applied Mathematics | 2015-09-01 | Paper |
The hardness of cache conscious data placement
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Online set packing and competitive scheduling of multi-part tasks
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Optimization problems in multiple-interval graphs
| 2014-12-18 | Paper |
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Time-dependent multi-scheduling of multicast
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Optimization problems in dotted interval graphs
Discrete Applied Mathematics | 2014-08-22 | Paper |
Competitive router scheduling with structured data
Theoretical Computer Science | 2014-03-27 | Paper |
Online scheduling with interval conflicts
Theory of Computing Systems | 2013-10-21 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Maximizing barrier coverage lifetime with mobile sensors
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Capacitated Arc Stabbing
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Rent, lease or buy: randomized algorithms for multislope ski rental
| 2013-03-19 | Paper |
A note on multicovering with disks
Computational Geometry | 2013-01-25 | Paper |
Online set packing
SIAM Journal on Computing | 2012-11-29 | Paper |
Optimization problems in dotted interval graphs
Graph-Theoretic Concepts in Computer Science | 2012-11-06 | Paper |
Growing half-balls: minimizing storage and communication costs in CDNs
Automata, Languages, and Programming | 2012-11-01 | Paper |
Changing of the guards: strip cover with duty cycling
Structural Information and Communication Complexity | 2012-09-26 | Paper |
Rent, lease, or buy: randomized algorithms for multislope ski rental
SIAM Journal on Discrete Mathematics | 2012-09-12 | Paper |
Competitive router scheduling with structured data
Approximation and Online Algorithms | 2012-07-16 | Paper |
Distributed approximation of cellular coverage
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
Vector bin packing with multiple-choice
Discrete Applied Mathematics | 2012-06-18 | Paper |
Partial multicovering and the \(d\)-consecutive ones property
Discrete Optimization | 2012-04-05 | Paper |
Online scheduling with interval conflicts
| 2012-01-23 | Paper |
Minimum vertex cover in rectangle graphs
Computational Geometry | 2011-07-20 | Paper |
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Video distribution under multiple constraints
Theoretical Computer Science | 2011-07-14 | Paper |
Optimization problems in multiple subtree graphs
Discrete Applied Mathematics | 2011-04-19 | Paper |
An extension of the Nemhauser-Trotter theorem to generalized vertex cover with applications
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Minimum vertex cover in rectangle graphs
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Vector bin packing with multiple-choice (extended abstract)
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Ski rental with two general options
Information Processing Letters | 2010-06-09 | Paper |
Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications
Approximation and Online Algorithms | 2010-05-11 | Paper |
Optimization problems in multiple subtree graphs
Approximation and Online Algorithms | 2010-05-11 | Paper |
Hitting sets when the VC-dimension is small
Information Processing Letters | 2009-12-04 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Resource allocation in bounded degree trees
Algorithmica | 2009-06-16 | Paper |
The minimum substring cover problem
Information and Computation | 2008-12-03 | Paper |
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
Information and Computation | 2008-12-03 | Paper |
Approximation of Partial Capacitated Vertex Cover
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On the Complexity of Sequential Rectangle Placement in IEEE 802.16/WiMAX Systems
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Approximating the 2-interval pattern problem
Theoretical Computer Science | 2008-07-10 | Paper |
Improved approximation algorithm for convex recoloring of trees
Theory of Computing Systems | 2008-06-06 | Paper |
Resource Allocation in Bounded Degree Trees
Lecture Notes in Computer Science | 2008-03-11 | Paper |
The Minimum Substring Cover Problem
Approximation and Online Algorithms | 2008-02-20 | Paper |
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms | 2008-01-11 | Paper |
Approximation Algorithms for Capacitated Rectangle Stabbing
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization | 2007-02-20 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
scientific article; zbMATH DE number 5010629 (Why is no real title available?)
| 2006-03-09 | Paper |
The hardness of cache conscious data placement
| 2006-02-06 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Local ratio with negative weights.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 1833399 (Why is no real title available?)
| 2002-11-21 | Paper |
Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property
Journal of Algorithms | 2002-08-14 | Paper |
Efficient algorithms for integer programs with two variables per constraint.
Algorithmica | 2001-09-27 | Paper |
scientific article; zbMATH DE number 1405787 (Why is no real title available?)
| 2000-06-05 | Paper |
