Walter Unger

According to our database1, Walter Unger authored at least 53 papers between 1988 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 





Online Matching in Regular Bipartite Graphs.
Parallel Processing Letters, 2018

Online Graph Coloring Against a Randomized Adversary.
Int. J. Found. Comput. Sci., 2018

The Graph Exploration Problem with Advice.
CoRR, 2018

Exploring Sparse Graphs with Advice (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Fully Online Matching with Advice on General Bipartite Graphs and Paths.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

The Friendship Problem on Graphs.
Multiple-Valued Logic and Soft Computing, 2016

Online Exploration of Rectangular Grids.
CoRR, 2016

Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract).
Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

The k-Observer Problem on d-regular Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2015

Learning-based control strategies for hybrid electric vehicles.
Proceedings of the 2015 IEEE Conference on Control Applications, 2015

A heuristic for logical data buffer allocation in multicore platforms.
Proceedings of the IEEE 33rd International Performance Computing and Communications Conference, 2014

Advice Complexity of the Online Coloring Problem.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

Hardness results for approximating the bandwidth.
J. Comput. Syst. Sci., 2011

Public-Key Cryptography.
Proceedings of the Algorithms Unplugged, 2011

An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs.
Mathematics in Computer Science, 2010

Preemptive Scheduling of Equal-Length Jobs in Polynomial Time.
Mathematics in Computer Science, 2010

Topology Control and Routing in Ad Hoc Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
SIAM J. Discrete Math., 2009

The Minimal Manhattan Network Problem in Three Dimensions.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Proceedings of the Taschenbuch der Algorithmen, 2008

On k-connectivity problems with sharpened triangle inequality.
J. Discrete Algorithms, 2008

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

On-line load balancing made simple: Greedy strikes back.
J. Discrete Algorithms, 2007

On the Complexity of the Traffic Grooming Problem in Optical Networks.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Technologies and reliability of modern embedded flash cells.
Microelectronics Reliability, 2006

A 1.5-Approximation of the Minimal Manhattan Network Problem.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-26663-1, 2005

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
Theor. Comput. Sci., 2004

Elastic image matching is NP-complete.
Pattern Recognition Letters, 2003

Online Load Balancing Made Simple: Greedy Strikes Back.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

On k-Edge-Connectivity Problems with Sharpened Triangle Inequality.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

The hardness of placing street names in a Manhattan type map.
Theor. Comput. Sci., 2002

Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
Theor. Comput. Sci., 2002

Scheduling Time-Constrained Communication in Linear Networks.
Theory Comput. Syst., 2002

Theor. Comput. Sci., 2001

One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

Approximation algorithms for the TSP with sharpened triangle inequality.
Inf. Process. Lett., 2000

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

Optimal Embedding of Complete Binary Trees into Lines and Grids.
J. Parallel Distrib. Comput., 1998

Embedding ladders and caterpillars into the hypercube.
Discrete Applied Mathematics, 1998

The Complexity of the Approximation of the Bandwidth Problem.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes.
Inf. Comput., 1997

Systolic Gossip in Complete Trees.
Proceedings of the SIROCCO'96, 1996

On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks.
Proceedings of the STACS 95, 1995

Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 10th International Symposium, 1995

The Complexity of Systolic Dissemination of Information in Interconnection Networks.
ITA, 1994

Automorphisms of Broadcasting Schemes with Respect to Start Rounds.
Inf. Process. Lett., 1994

Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract).
Proceedings of the Algorithm Theory, 1994

Embedding 3-dimensional Grids into Optimal Hypercubes.
Proceedings of the Parallel and Distributed Computing, 1994

The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network.
Parallel Processing Letters, 1992

The Complexity of Colouring Circle Graphs (Extended Abstract).
Proceedings of the STACS 92, 1992

Färbung von Kreissehnengraphen.
PhD thesis, 1990

On the k-Colouring of Circle-Graphs.
Proceedings of the STACS 88, 1988