Walter Unger

Fabian Frei

David Wehner

Proceedings of the Structural Information and Communication Complexity, 2023

2022

Exploring sparse graphs with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2022

2021

On the advice complexity of the online dominating set problem.

[BibT_eX]

[DOI]

Juraj Hromkovic

Sacha Krug

Theor. Comput. Sci., 2021

Heuristic Strategies for NFV-Enabled Renewable and Non-Renewable Energy Management in the Future IoT World.

[BibT_eX]

[DOI]

Christian Tipantuña

Xavier Hesselbach

IEEE Access, 2021

2018

Online Matching in Regular Bipartite Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2018

Online Graph Coloring Against a Randomized Adversary.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

The Graph Exploration Problem with Advice.

[BibT_eX]

[DOI]

CoRR, 2018

Exploring Sparse Graphs with Advice (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Fully Online Matching with Advice on General Bipartite Graphs and Paths.

[BibT_eX]

[DOI]

Lucia Di Caro

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2016

The Friendship Problem on Graphs.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2016

Online Exploration of Rectangular Grids.

[BibT_eX]

[DOI]

Ulla Karhumäki

CoRR, 2016

Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

2015

The k-Observer Problem on d-regular Graphs.

[BibT_eX]

[DOI]

Benjamin Ries

Bernhard Schamberg

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Learning-based control strategies for hybrid electric vehicles.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Conference on Control Applications, 2015

2014

A heuristic for logical data buffer allocation in multicore platforms.

[BibT_eX]

[DOI]

Proceedings of the IEEE 33rd International Performance Computing and Communications Conference, 2014

2013

Advice Complexity of the Online Coloring Problem.

[BibT_eX]

[DOI]

Andreas Sprock

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2011

Hardness results for approximating the bandwidth.

[BibT_eX]

[DOI]

Chandan K. Dubey

Uriel Feige

J. Comput. Syst. Sci., 2011

Public-Key Cryptography.

[BibT_eX]

[DOI]

Dirk Bongartz

Proceedings of the Algorithms Unplugged, 2011

2010

An Optimal Algorithm for the <i>k</i>-Fixed-Endpoint Path Cover on Proper Interval Graphs.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time.

[BibT_eX]

[DOI]

Math. Comput. Sci., 2010

Topology Control and Routing in Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

The Minimal Manhattan Network Problem in Three Dimensions.

[BibT_eX]

[DOI]

Xavier Muñoz

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

2008

Public-Key-Kryptographie.

[BibT_eX]

[DOI]

Dirk Bongartz

Proceedings of the Taschenbuch der Algorithmen, 2008

On k-connectivity problems with sharpened triangle inequality.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2008

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.

[BibT_eX]

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

On-line load balancing made simple: Greedy strikes back.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

On the Complexity of the Traffic Grooming Problem in Optical Networks.

[BibT_eX]

[DOI]

Mordechai Shalom

Shmuel Zaks

Proceedings of the Fun with Algorithms, 4th International Conference, 2007

2006

Technologies and reliability of modern embedded flash cells.

[BibT_eX]

[DOI]

Microelectron. Reliab., 2006

2005

A 1.5-Approximation of the Minimal Manhattan Network Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005

2004

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

2003

Elastic image matching is NP-complete.

[BibT_eX]

[DOI]

Daniel Keysers

Pattern Recognit. Lett., 2003

Online Load Balancing Made Simple: Greedy Strikes Back.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2002

The hardness of placing street names in a Manhattan type map.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Scheduling Time-Constrained Communication in Linear Networks.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2002

2001

Foreword.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.

[BibT_eX]

[DOI]

Xavier Muñoz

Imrich Vrto

Proceedings of the Graph Drawing, 9th International Symposium, 2001

2000

Approximation algorithms for the TSP with sharpened triangle inequality.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

1998

Optimal Embedding of Complete Binary Trees into Lines and Grids.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

Embedding ladders and caterpillars into the hypercube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

The Complexity of the Approximation of the Bandwidth Problem.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.

[BibT_eX]

[DOI]

Inf. Comput., 1997

1996

Systolic Gossip in Complete Trees.

[BibT_eX]

Alessandro Roncato

Proceedings of the SIROCCO'96, 1996

1995

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.

[BibT_eX]

[DOI]

Proceedings of the STACS 95, 1995

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

1994

The Complexity of Systolic Dissemination of Information in Interconnection Networks.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Automorphisms of Broadcasting Schemes with Respect to Start Rounds.

[BibT_eX]

[DOI]

Yoshihide Igarashi

Shingo Osawa

Inf. Process. Lett., 1994

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

Embedding 3-dimensional Grids into Optimal Hypercubes.

[BibT_eX]

[DOI]

Markus Röttger

Ulf-Peter Schroeder

Proceedings of the Parallel and Distributed Computing, 1994

1992

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network.

[BibT_eX]

[DOI]

Rainer Feldmann

Parallel Process. Lett., 1992

The Complexity of Colouring Circle Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1990

Färbung von Kreissehnengraphen.

[BibT_eX]

[DOI]

PhD thesis, 1990

1988

On the k-Colouring of Circle-Graphs.

[BibT_eX]

[DOI]