| Publication | Date of Publication | Type |
|---|
Zero-memory graph exploration with unknown inports
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Fully Online Matching with Advice on General Bipartite Graphs and Paths
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Effective systolic algorithms for gossiping in cycles and two-dimensional grids
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Exploring sparse graphs with advice
Information and Computation | 2022-12-08 | Paper |
The complexity of colouring circle graphs (extended abstract)
STACS 92 | 2022-08-18 | Paper |
Online matching in regular bipartite graphs
Parallel Processing Letters | 2022-07-04 | Paper |
On the advice complexity of the online dominating set problem
Theoretical Computer Science | 2021-03-09 | Paper |
The \(k\)-observer problem on \(d\)-regular graphs
Lecture Notes in Computer Science | 2020-01-14 | Paper |
| Exploring sparse graphs with advice (extended abstract) | 2019-01-15 | Paper |
| scientific article; zbMATH DE number 6930592 (Why is no real title available?) | 2018-09-03 | Paper |
Online graph coloring against a randomized adversary
International Journal of Foundations of Computer Science | 2018-07-24 | Paper |
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters | 2016-06-16 | Paper |
Online graph coloring with advice and randomized adversary (extended abstract)
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Advice complexity of the online coloring problem
Lecture Notes in Computer Science | 2013-06-07 | Paper |
| An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs | 2011-12-19 | Paper |
Preemptive scheduling of equal-length jobs in polynomial time
Mathematics in Computer Science | 2011-02-19 | Paper |
An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs
Mathematics in Computer Science | 2011-02-19 | Paper |
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences | 2011-01-18 | Paper |
On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
Topology control and routing in ad hoc networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
The Minimal Manhattan Network Problem in Three Dimensions
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
On \(k\)-connectivity problems with sharpened triangle inequality
Journal of Discrete Algorithms | 2009-02-23 | Paper |
On-line load balancing made simple: greedy strikes back
Journal of Discrete Algorithms | 2008-05-16 | Paper |
On the Complexity of the Traffic Grooming Problem in Optical Networks
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
Texts in Theoretical Computer Science. An EATCS Series | 2005-04-27 | Paper |
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2084271 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2038778 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1500530 (Why is no real title available?) | 2004-01-27 | Paper |
| scientific article; zbMATH DE number 2011856 (Why is no real title available?) | 2003-12-02 | Paper |
Elastic image matching is NP-complete
Pattern Recognition Letters | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1954373 (Why is no real title available?) | 2003-07-28 | Paper |
Scheduling time-constrained communication in linear networks
Theory of Computing Systems | 2003-05-04 | Paper |
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theoretical Computer Science | 2002-08-05 | Paper |
The hardness of placing street names in a Manhattan type map
Theoretical Computer Science | 2002-08-05 | Paper |
| scientific article; zbMATH DE number 1629849 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1507218 (Why is no real title available?) | 2001-05-28 | Paper |
Embedding ladders and caterpillars into the hypercube
Discrete Applied Mathematics | 1999-02-14 | Paper |
Optimal embedding of complete binary trees into lines and grids
Journal of Parallel and Distributed Computing | 1998-08-20 | Paper |
Optimal algorithms for broadcast and gossip in the edge-disjoint modes
Information and Computation | 1998-01-04 | Paper |
The complexity of systolic dissemination of information in interconnection networks
RAIRO - Theoretical Informatics and Applications | 1997-12-17 | Paper |
Automorphisms of broadcasting schemes with respect to start rounds
Information Processing Letters | 1994-08-03 | Paper |
| scientific article; zbMATH DE number 219230 (Why is no real title available?) | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 52166 (Why is no real title available?) | 1992-09-18 | Paper |
| scientific article; zbMATH DE number 4051024 (Why is no real title available?) | 1988-01-01 | Paper |
