| Publication | Date of Publication | Type |
|---|
Package delivery using drones with restricted movement areas
| 2024-09-11 | Paper |
List 3-coloring on comb-convex and caterpillar-convex bipartite graphs
| 2024-08-22 | Paper |
A cop and robber game on edge-periodic temporal graphs
Journal of Computer and System Sciences | 2024-07-01 | Paper |
scientific article; zbMATH DE number 7740865 (Why is no real title available?)
| 2023-09-20 | Paper |
List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs
| 2023-05-17 | Paper |
Parameterised temporal exploration problems
Journal of Computer and System Sciences | 2023-04-21 | Paper |
Non-strict Temporal Exploration
Structural Information and Communication Complexity | 2022-09-01 | Paper |
Exploration of \(k\)-edge-deficient temporal graphs
Acta Informatica | 2022-08-30 | Paper |
Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
| 2022-07-21 | Paper |
Two moves per time step make a difference
| 2022-07-21 | Paper |
Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm
| 2022-07-21 | Paper |
Car-sharing on a star network: on-line scheduling with k servers
| 2022-07-18 | Paper |
Car-sharing between two locations: online scheduling with flexible advance bookings
Discrete Applied Mathematics | 2022-03-28 | Paper |
Exploration of \(k\)-edge-deficient temporal graphs
Lecture Notes in Computer Science | 2022-03-25 | Paper |
Algorithms that access the input via queries
| 2022-03-24 | Paper |
Faster exploration of degree-bounded temporal graphs
| 2021-08-04 | Paper |
Car-sharing between two locations: online scheduling with two servers
| 2021-08-04 | Paper |
Scheduling with explorable uncertainty
| 2021-06-15 | Paper |
On temporal graph exploration
Journal of Computer and System Sciences | 2021-04-14 | Paper |
``Green barrier coverage with mobile sensors
Theoretical Computer Science | 2021-03-09 | Paper |
An adversarial model for scheduling with testing
Algorithmica | 2020-11-11 | Paper |
On the fast delivery problem with one or two packages
Journal of Computer and System Sciences | 2020-10-23 | Paper |
A game of cops and robbers on graphs with periodic edge-connectivity
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
An efficient algorithm for the fast delivery problem
| 2020-01-30 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Theoretical Computer Science | 2019-08-09 | Paper |
Algorithms for Queryable Uncertainty
Frontiers in Algorithmics | 2019-04-26 | Paper |
Car-sharing between two locations: online scheduling with flexible advance bookings
Lecture Notes in Computer Science | 2018-10-04 | Paper |
Computing and scheduling with explorable uncertainty
| 2018-09-06 | Paper |
Constrained bipartite edge coloring with applications to wavelength routing
Automata, Languages and Programming | 2018-07-04 | Paper |
Complexity and online algorithms for minimum skyline coloring of intervals
Combinatorial Optimization and Applications | 2018-03-26 | Paper |
Online algorithms for non-preemptive speed scaling on power-heterogeneous processors
| 2018-03-26 | Paper |
Minimum activation cost edge-disjoint paths in graphs with bounded tree-width
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Further results on capacitated network design games
Algorithmic Game Theory | 2015-11-04 | Paper |
On temporal graph exploration
Lecture Notes in Computer Science | 2015-10-27 | Paper |
Computational complexity of traffic hijacking under BGP and S-BGP
Theoretical Computer Science | 2015-09-16 | Paper |
Minimum activation cost node-disjoint paths in graphs with bounded treewidth
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Query-competitive algorithms for cheapest set problems under uncertainty
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
Length-bounded cuts and flows
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Broadcast scheduling, algorithms and complexity
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Approximation algorithms for disjoint \(st\)-paths with minimum activation cost
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Trimming of graphs, with application to point labeling
| 2013-03-19 | Paper |
Computational complexity of traffic hijacking under BGP and S-BGP
Automata, Languages, and Programming | 2012-11-01 | Paper |
Approximating multiobjective knapsack problems
Management Science | 2012-02-19 | Paper |
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems
Operations Research | 2011-11-24 | Paper |
Trimming of graphs, with application to point labeling
Theory of Computing Systems | 2010-10-06 | Paper |
PTAS for weighted set cover on unit squares
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
scientific article; zbMATH DE number 5764844 (Why is no real title available?)
| 2010-08-06 | Paper |
scientific article; zbMATH DE number 5764814 (Why is no real title available?)
| 2010-08-06 | Paper |
Online capacitated interval coloring
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
Approximation and Online Algorithms | 2010-05-11 | Paper |
Routing and call control algorithms for ring networks.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Discovery of network properties with all-shortest-paths queries
Theoretical Computer Science | 2010-04-06 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Resource allocation problems in multifiber WDM tree networks.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
Variable sized online interval coloring with bandwidth
Algorithmica | 2009-06-17 | Paper |
Length-Bounded Cuts and Flows
Automata, Languages and Programming | 2009-03-12 | Paper |
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics | 2009-03-09 | Paper |
Approximate Discovery of Random Graphs
Stochastic Algorithms: Foundations and Applications | 2009-03-05 | Paper |
Online Capacitated Interval Coloring
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Discovery of Network Properties with All-Shortest-Paths Queries
Structural Information and Communication Complexity | 2008-07-10 | Paper |
Cuts and Disjoint Paths in the Valley-Free Path Model
Internet Mathematics | 2008-04-29 | Paper |
Domination in Geometric Intersection Graphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Independence and Coloring Problems on Intersection Graphs of Disks
Lecture Notes in Computer Science | 2008-03-14 | Paper |
An improved randomized on-line algorithm for a weighted interval selection problem
Journal of Scheduling | 2007-12-20 | Paper |
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
Journal of Scheduling | 2007-12-20 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Variable Sized Online Interval Coloring with Bandwidth
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
An algorithmic view on OVSF code assignment
Algorithmica | 2007-04-26 | Paper |
Call control in rings
Algorithmica | 2007-04-26 | Paper |
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics | 2006-04-28 | Paper |
Wavelength conversion in all-optical networks with shortest-path routing
Algorithmica | 2006-03-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Network Analysis
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Network Analysis
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
SIAM Journal on Computing | 2005-09-16 | Paper |
A memetic algorithm to schedule planned maintenance for the national grid
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics | 2005-05-04 | Paper |
scientific article; zbMATH DE number 2163021 (Why is no real title available?)
| 2005-04-29 | Paper |
Call control with \(k\) rejections
Journal of Computer and System Sciences | 2004-08-19 | Paper |
scientific article; zbMATH DE number 2088903 (Why is no real title available?)
| 2004-08-12 | Paper |
Call Control with k Rejections
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2086671 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086258 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2080249 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2081007 (Why is no real title available?)
| 2004-08-04 | Paper |
Algorithmic complexity of protein identification: Combinatorics of weighted strings
Discrete Applied Mathematics | 2004-02-14 | Paper |
Interval selection: Applications, algorithms, and lower bounds
Journal of Algorithms | 2003-08-13 | Paper |
scientific article; zbMATH DE number 1962808 (Why is no real title available?)
| 2003-08-11 | Paper |
On-line coloring of geometric intersection graphs
Computational Geometry | 2003-03-10 | Paper |
scientific article; zbMATH DE number 1839474 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1834661 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1830720 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1830735 (Why is no real title available?)
| 2002-11-18 | Paper |
Polynomial-time approximation schemes for geometric graphs
| 2002-07-22 | Paper |
Routing flow through a strongly connected graph
Algorithmica | 2002-05-21 | Paper |
The maximum edge-disjoint paths problem in bidirected trees
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Parallel load balancing for problems with good bisectors
Journal of Parallel and Distributed Computing | 2001-09-03 | Paper |
The complexity of path coloring and call scheduling
Theoretical Computer Science | 2001-08-20 | Paper |
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
Theoretical Computer Science | 2001-08-20 | Paper |
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science | 2000-01-12 | Paper |
scientific article; zbMATH DE number 1377367 (Why is no real title available?)
| 1999-12-13 | Paper |
scientific article; zbMATH DE number 1372649 (Why is no real title available?)
| 1999-12-01 | Paper |
scientific article; zbMATH DE number 1163711 (Why is no real title available?)
| 1998-08-04 | Paper |
scientific article; zbMATH DE number 1107733 (Why is no real title available?)
| 1998-06-23 | Paper |
