The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Walter Unger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:235-249 [Conf]
  2. Markus Röttger, Ulf-Peter Schroeder, Walter Unger
    Embedding 3-dimensional Grids into Optimal Hypercubes. [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:81-94 [Conf]
  3. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On k-Edge-Connectivity Problems with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    CIAC, 2003, pp:189-200 [Conf]
  4. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  5. Sebastian Seibert, Walter Unger
    The Hardness of Placing Street Names in a Manhattan Type Map. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:102-112 [Conf]
  6. Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener
    Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:273-282 [Conf]
  7. Walter Unger
    The Complexity of the Approximation of the Bandwidth Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:82-91 [Conf]
  8. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:59-70 [Conf]
  9. Xavier Muñoz, Walter Unger, Imrich Vrto
    One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2001, pp:115-123 [Conf]
  10. Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
    Online Load Balancing Made Simple: Greedy Strikes Back. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1108-1122 [Conf]
  11. Sebastian Seibert, Walter Unger
    A 1.5-Approximation of the Minimal Manhattan Network Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:246-255 [Conf]
  12. Alessandro Roncato, Walter Unger
    Systolic Gossip in Complete Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1996, pp:279-291 [Conf]
  13. Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger
    Scheduling Time-Constrained Communication in Linear Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:269-278 [Conf]
  14. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:382-394 [Conf]
  15. Juraj Hromkovic, Krzysztof Lorys, Przemyslawa Kanarek, Ralf Klasing, Walter Unger, Hubert Wagener
    On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:255-266 [Conf]
  16. Walter Unger
    On the k-Colouring of Circle-Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:61-72 [Conf]
  17. Walter Unger
    The Complexity of Colouring Circle Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:389-400 [Conf]
  18. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:219-230 [Conf]
  19. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:25-35 [Conf]
  20. Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
    Embedding ladders and caterpillars into the hypercube. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:21-29 [Journal]
  21. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:31, pp:- [Journal]
  22. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener
    Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:133, n:1, pp:1-33 [Journal]
  23. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Approximation algorithms for the TSP with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:75, n:3, pp:133-138 [Journal]
  24. Yoshihide Igarashi, Shingo Osawa, Walter Unger
    Automorphisms of Broadcasting Schemes with Respect to Start Rounds. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:51, n:1, pp:35-41 [Journal]
  25. Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská
    The Complexity of Systolic Dissemination of Information in Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:3-4, pp:303-342 [Journal]
  26. Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger
    On-line load balancing made simple: Greedy strikes back. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:1, pp:162-175 [Journal]
  27. Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger
    Optimal Embedding of Complete Binary Trees into Lines and Grids. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:40-56 [Journal]
  28. Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger
    Scheduling Time-Constrained Communication in Linear Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:6, pp:599-623 [Journal]
  29. Rainer Feldmann, Walter Unger
    The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:13-19 [Journal]
  30. Daniel Keysers, Walter Unger
    Elastic image matching is NP-complete. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 2003, v:24, n:1-3, pp:445-453 [Journal]
  31. Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
    On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:137-153 [Journal]
  32. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:3-24 [Journal]
  33. Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger
    Foreword. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:264, n:1, pp:1-2 [Journal]
  34. Sebastian Seibert, Walter Unger
    The hardness of placing street names in a Manhattan type map. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:285, n:1, pp:89-99 [Journal]
  35. Axel Sikora, Frank-Peter Pesl, Walter Unger, Uwe Paschen
    Technologies and reliability of modern embedded flash cells. [Citation Graph (0, 0)][DBLP]
    Microelectronics Reliability, 2006, v:46, n:12, pp:1980-2005 [Journal]
  36. Mordechai Shalom, Walter Unger, Shmuel Zaks
    On the Complexity of the Traffic Grooming Problem in Optical Networks. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:262-271 [Conf]

  37. The Minimal Manhattan Network Problem in Three Dimensions. [Citation Graph (, )][DBLP]


Search in 0.183secs, Finished in 0.186secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002