( en | de | ru )

 

Disambiguation of "Unger, Walter"

Author of the publication

copydeleteadd this publication to your clipboard
Topology Control and Routing in Ad Hoc Networks.

, , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Walter Unger

Walter Unger

Walter Unger

Walter Unger

Walter Unger

 

Other publications of authors with the same name

Systolic Gossip in Complete Trees., and . SIROCCO, page 279-291. Carleton Scientific, (1996)Automorphisms of Broadcasting Schemes with Respect to Start Rounds., , and . Inf. Process. Lett., 51 (1): 35-41 (1994)Optimal Embedding of Complete Binary Trees into Lines and Grids., , , and . J. Parallel Distributed Comput., 49 (1): 40-56 (1998)Preemptive Scheduling of Equal-Length Jobs in Polynomial Time., and . Math. Comput. Sci., 3 (1): 73-84 (2010)Exploring Sparse Graphs with Advice (Extended Abstract)., , and . WAOA, volume 11312 of Lecture Notes in Computer Science, page 102-117. Springer, (2018)One Sided Crossing Minimization Is NP-Hard for Sparse Graphs., , and . GD, volume 2265 of Lecture Notes in Computer Science, page 115-123. Springer, (2001)Online Matching in Regular Bipartite Graphs., , , and . Parallel Process. Lett., 28 (2): 1850008:1-1850008:13 (2018)On the Complexity of the Traffic Grooming Problem in Optical Networks., , and . FUN, volume 4475 of Lecture Notes in Computer Science, page 262-271. Springer, (2007)Topology Control and Routing in Ad Hoc Networks., , , and . Graphs and Algorithms in Communication Networks, Springer, (2010)Hardness results for approximating the bandwidth., , and . J. Comput. Syst. Sci., 77 (1): 62-90 (2011)