default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWalter Unger
Person information
- affiliation: RWTH Aachen University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c30]Hans-Joachim Böckenhauer
, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. SIROCCO 2023: 246-261- [i4]Hans-Joachim Böckenhauer, Fabian Frei, Walter Unger, David Wehner:
Zero-Memory Graph Exploration with Unknown Inports. CoRR abs/2301.13860 (2023) - 2022
- [j26]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring sparse graphs with advice. Inf. Comput. 289(Part): 104950 (2022) - 2021
- [j25]Christian Tipantuña, Xavier Hesselbach, Walter Unger:
Heuristic Strategies for NFV-Enabled Renewable and Non-Renewable Energy Management in the Future IoT World. IEEE Access 9: 125000-125031 (2021) - [j24]Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Walter Unger:
On the advice complexity of the online dominating set problem. Theor. Comput. Sci. 862: 81-96 (2021)
2010 – 2019
- 2018
- [j23]Elisabet Burjons, Juraj Hromkovic, Rastislav Královic, Richard Královic, Xavier Muñoz, Walter Unger:
Online Graph Coloring Against a Randomized Adversary. Int. J. Found. Comput. Sci. 29(4): 551-569 (2018) - [j22]Lali Barrière, Xavier Muñoz, Janosch Fuchs, Walter Unger:
Online Matching in Regular Bipartite Graphs. Parallel Process. Lett. 28(2): 1850008:1-1850008:13 (2018) - [c29]Hans-Joachim Böckenhauer, Lucia Di Caro, Walter Unger:
Fully Online Matching with Advice on General Bipartite Graphs and Paths. Adventures Between Lower Bounds and Higher Altitudes 2018: 172-190 - [c28]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring Sparse Graphs with Advice (Extended Abstract). WAOA 2018: 102-117 - [e1]Hans-Joachim Böckenhauer, Dennis Komm, Walter Unger:
Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 11011, Springer 2018, ISBN 978-3-319-98354-7 [contents] - [i3]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
The Graph Exploration Problem with Advice. CoRR abs/1804.06675 (2018) - 2016
- [j21]George B. Mertzios, Walter Unger:
The Friendship Problem on Graphs. J. Multiple Valued Log. Soft Comput. 27(2-3): 275-285 (2016) - [c27]Elisabet Burjons, Juraj Hromkovic, Xavier Muñoz, Walter Unger:
Online Graph Coloring with Advice and Randomized Adversary - (Extended Abstract). SOFSEM 2016: 229-240 - [i2]Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger:
Online Exploration of Rectangular Grids. CoRR abs/1611.00934 (2016) - 2015
- [c26]Sascha Geulen, Martina Josevski, Johanna Nellen, Janosch Fuchs, Lukas Netz, Benedikt Wolters, Dirk Abel, Erika Ábrahám, Walter Unger:
Learning-based control strategies for hybrid electric vehicles. CCA 2015: 1722-1728 - [c25]Benjamin Ries, Bernhard Schamberg, Walter Unger:
The k-Observer Problem on d-regular Graphs. SSS 2015: 81-93 - 2014
- [c24]Benjamin Ries, Walter Unger, Maximilian Odendahl, Rainer Leupers:
A heuristic for logical data buffer allocation in multicore platforms. IPCCC 2014: 1-2 - 2013
- [c23]Sebastian Seibert, Andreas Sprock, Walter Unger:
Advice Complexity of the Online Coloring Problem. CIAC 2013: 345-357 - 2011
- [j20]Chandan K. Dubey, Uriel Feige, Walter Unger:
Hardness results for approximating the bandwidth. J. Comput. Syst. Sci. 77(1): 62-90 (2011) - [p3]Dirk Bongartz, Walter Unger:
Public-Key Cryptography. Algorithms Unplugged 2011: 147-158 - 2010
- [j19]George B. Mertzios, Walter Unger:
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. Math. Comput. Sci. 3(1): 73-84 (2010) - [j18]George B. Mertzios, Walter Unger:
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs. Math. Comput. Sci. 3(1): 85-96 (2010) - [p2]Lenka Carr-Motycková, Alfredo Navarra, Tomas Johansson, Walter Unger:
Topology Control and Routing in Ad Hoc Networks. Graphs and Algorithms in Communication Networks 2010: 401-418
2000 – 2009
- 2009
- [j17]Juraj Hromkovic, Przemyslawa Kanarek, Ralf Klasing, Krzysztof Lorys, Walter Unger, Hubert Wagener:
On the Size of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks. SIAM J. Discret. Math. 23(3): 1612-1645 (2009) - [c22]Xavier Muñoz, Sebastian Seibert, Walter Unger:
The Minimal Manhattan Network Problem in Three Dimensions. WALCOM 2009: 369-380 - 2008
- [j16]Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger:
On k-connectivity problems with sharpened triangle inequality. J. Discrete Algorithms 6(4): 605-617 (2008) - [c21]George B. Mertzios, Walter Unger:
An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs. IWOCA 2008: 197-211 - [p1]Dirk Bongartz, Walter Unger:
Public-Key-Kryptographie. Taschenbuch der Algorithmen 2008: 157-169 - 2007
- [j15]Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
On-line load balancing made simple: Greedy strikes back. J. Discrete Algorithms 5(1): 162-175 (2007) - [c20]Mordechai Shalom, Walter Unger, Shmuel Zaks:
On the Complexity of the Traffic Grooming Problem in Optical Networks. FUN 2007: 262-271 - 2006
- [j14]Axel Sikora, Frank-Peter Pesl, Walter Unger, Uwe Paschen:
Technologies and reliability of modern embedded flash cells. Microelectron. Reliab. 46(12): 1980-2005 (2006) - 2005
- [b2]Juraj Hromkovic, Ralf Klasing, Andrzej Pelc, Peter Ruzicka, Walter Unger:
Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance. Texts in Theoretical Computer Science. An EATCS Series, Springer 2005, ISBN 978-3-540-00846-0, pp. 1-361 - [c19]Sebastian Seibert, Walter Unger:
A 1.5-Approximation of the Minimal Manhattan Network Problem. ISAAC 2005: 246-255 - 2004
- [j13]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. Theor. Comput. Sci. 326(1-3): 137-153 (2004) - 2003
- [j12]Daniel Keysers, Walter Unger:
Elastic image matching is NP-complete. Pattern Recognit. Lett. 24(1-3): 445-453 (2003) - [c18]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. CIAC 2003: 189-200 - [c17]Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger:
Online Load Balancing Made Simple: Greedy Strikes Back. ICALP 2003: 1108-1122 - 2002
- [j11]Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002) - [j10]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. Theor. Comput. Sci. 285(1): 3-24 (2002) - [j9]Sebastian Seibert, Walter Unger:
The hardness of placing street names in a Manhattan type map. Theor. Comput. Sci. 285(1): 89-99 (2002) - [c16]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. FSTTCS 2002: 59-70 - 2001
- [j8]Rusins Freivalds, Juraj Hromkovic, Gheorghe Paun, Walter Unger:
Foreword. Theor. Comput. Sci. 264(1): 1-2 (2001) - [c15]Xavier Muñoz, Walter Unger, Imrich Vrto:
One Sided Crossing Minimization Is NP-Hard for Sparse Graphs. GD 2001: 115-123 - 2000
- [j7]Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger:
Approximation algorithms for the TSP with sharpened triangle inequality. Inf. Process. Lett. 75(3): 133-138 (2000) - [c14]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. CIAC 2000: 72-86 - [c13]Sebastian Seibert, Walter Unger:
The Hardness of Placing Street Names in a Manhattan Type Map. CIAC 2000: 102-112 - [c12]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. STACS 2000: 382-394
1990 – 1999
- 1999
- [i1]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. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [j6]Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83(1-3): 21-29 (1998) - [j5]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. J. Parallel Distributed Comput. 49(1): 40-56 (1998) - [c11]Walter Unger:
The Complexity of the Approximation of the Bandwidth Problem. FOCS 1998: 82-91 - [c10]Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger:
Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278 - 1997
- [j4]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener:
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes. Inf. Comput. 133(1): 1-33 (1997) - 1996
- [c9]Alessandro Roncato, Walter Unger:
Systolic Gossip in Complete Trees. SIROCCO 1996: 279-291 - 1995
- [c8]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). FCT 1995: 273-282 - [c7]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. STACS 1995: 255-266 - 1994
- [j3]Yoshihide Igarashi, Shingo Osawa, Walter Unger:
Automorphisms of Broadcasting Schemes with Respect to Start Rounds. Inf. Process. Lett. 51(1): 35-41 (1994) - [j2]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. RAIRO Theor. Informatics Appl. 28(3-4): 303-342 (1994) - [c6]Markus Röttger, Ulf-Peter Schroeder, Walter Unger:
Embedding 3-dimensional Grids into Optimal Hypercubes. Canada-France Conference on Parallel and Distributed Computing 1994: 81-94 - [c5]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener, Dana Pardubská:
The Complexity of Systolic Dissemination of Information in Interconnection Networks. Canada-France Conference on Parallel and Distributed Computing 1994: 235-249 - [c4]Juraj Hromkovic, Ralf Klasing, Walter Unger, Hubert Wagener:
Optimal Algorithms for Broadcast and Gossip in the Edge-Disjoint Path Modes (Extended Abstract). SWAT 1994: 219-230 - 1992
- [j1]Rainer Feldmann, Walter Unger:
The Cube-Connected Cycles Network Is a Subgraph of the Butterfly Network. Parallel Process. Lett. 2: 13-19 (1992) - [c3]Walter Unger:
The Complexity of Colouring Circle Graphs (Extended Abstract). STACS 1992: 389-400 - 1991
- [c2]Ralf Heckmann, Ralf Klasing, Burkhard Monien, Walter Unger:
Optimal Embedding of Complete Binary Trees into Lines and Grids. WG 1991: 25-35 - 1990
- [b1]Walter Unger:
Färbung von Kreissehnengraphen. University of Paderborn, Germany, 1990, pp. 1-175
1980 – 1989
- 1988
- [c1]Walter Unger:
On the k-Colouring of Circle-Graphs. STACS 1988: 61-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
