Walter Unger

发表

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

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, STACS.

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

Juraj Hromkovic, Przemyslawa Kanarek, Krzysztof Lorys, 1995, STACS.

The Friendship Problem on Graphs

George B. Mertzios, Walter Unger, Walter Unger, 2016, J. Multiple Valued Log. Soft Comput..

Elastic image matching is NP-complete

Daniel Keysers, Walter Unger, Daniel Keysers, 2003, Pattern Recognit. Lett..

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2003, CIAC.

Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, CIAC.

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

Juraj Hromkovic, Przemyslawa Kanarek, Krzysztof Lorys, 2009, SIAM J. Discret. Math..

Adventures Between Lower Bounds and Higher Altitudes

Dennis Komm, Hans-Joachim Böckenhauer, Walter Unger, 2018, Lecture Notes in Computer Science.

Fully Online Matching with Advice on General Bipartite Graphs and Paths

Hans-Joachim Böckenhauer, Walter Unger, Lucia Di Caro, 2018, Adventures Between Lower Bounds and Higher Altitudes.

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

Elisabet Burjons, Juraj Hromkovic, Walter Unger, 2016, SOFSEM.

Advice Complexity of the Online Coloring Problem

Sebastian Seibert, Walter Unger, Andreas Sprock, 2013, CIAC.

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

Guido Proietti, Juraj Hromkovic, Hans-Joachim Böckenhauer, 2002, Theor. Comput. Sci..

The hardness of placing street names in a Manhattan type map

Sebastian Seibert, Walter Unger, S. Seibert, 2000, Theor. Comput. Sci..

Learning-based control strategies for hybrid electric vehicles

Erika Ábrahám, Martina Josevski, Dirk Abel, 2015, 2015 IEEE Conference on Control Applications (CCA).

Exploring sparse graphs with advice

Hans-Joachim Böckenhauer, Walter Unger, Janosch Fuchs, 2022, Inf. Comput..

An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs

George B. Mertzios, Walter Unger, Walter Unger, 2010, Math. Comput. Sci..

On-line load balancing made simple: Greedy strikes back

Giorgio Gambosi, Paolo Penna, Pierluigi Crescenzi, 2003, J. Discrete Algorithms.

Online Graph Coloring Against a Randomized Adversary

Elisabet Burjons, Juraj Hromkovic, Richard Královic, 2018, Int. J. Found. Comput. Sci..

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

Andrzej Pelc, Juraj Hromkovic, Ralf Klasing, 2005, Texts in Theoretical Computer Science. An EATCS Series.

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs

Imrich Vrto, Walter Unger, Xavier Muñoz, 2001, GD.

The Complexity of Colouring Circle Graphs (Extended Abstract)

Walter Unger, Walter Unger, 1992, STACS.

On the k-Colouring of Circle-Graphs

Walter Unger, Walter Unger, 1988, STACS.

The complexity of the approximation of the bandwidth problem

Walter Unger, Walter Unger, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

Xavier Hesselbach, Walter Unger, Christian Tipantuña, 2021, IEEE Access.

Approximation algorithms for the TSP with sharpened triangle inequality

Juraj Hromkovic, Hans-Joachim Böckenhauer, Ralf Klasing, 2000, Inf. Process. Lett..

The k-Observer Problem on d-regular Graphs

Walter Unger, Benjamin Ries, Bernhard Schamberg, 2015, SSS.

Scheduling Time-Constrained Communication in Linear Networks

Arnold L. Rosenberg, Micah Adler, Ramesh K. Sitaraman, 2002, SPAA '98.

Scheduling Time-Constrained Communication in Linear Networks

Arnold L. Rosenberg, Micah Adler, Ramesh K. Sitaraman, 1998, SPAA.

Algorithms for communication optimization

Peter Rossmanith, Walter Unger, Benjamin Ries, 2016 .

Extensions of secretary problems towards submodular objectives and temporal arrival

Andreas Tönnis, Peter Rossmanith, Britta Peis, 2017 .

Optimal Embedding of Complete Binary Trees into Lines and Grids

Ralf Klasing, Burkhard Monien, Walter Unger, 1991, J. Parallel Distributed Comput..

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

Juraj Hromkovic, Ralf Klasing, Walter Unger, 1997, Inf. Comput..