| # |  | Year | | Title | AG Editor Comment | Type | |
|---|
| 1 |
 | Ueckerdt, T. |
| |
| 1 |
| |
| 1 |
| Uhrig, C |
| |
| 16 |
| |
| 1 |
| Urrutia, Jorg |
| |
| 1 |
| |
| 1 |
| Uznanski, Przemyslaw |
| |
| 6 |
| Vahdati Daneshmand, Siavash |
| |
| 1 |
| Vainshtein, Alek |
| |
| 1 |
| |
| 1 |
| van der Ster, Suzanne |
| |
| 1 |
| |
| 1 |
| Van Hentenryck, Pascal |
| |
| 1 |
| |
| 3 |
| van Leeuwen, Erik Jan |
| |
| 1 |
| |
| 1 |
| van Loon, Joyce |
| |
| 43 |
| |
| 10 |
| van Zuylen, Anke |
| |
| 2 |
| |
| 2 |
| Varma, Girish |
| |
| 2 |
| |
| 1 |
| Veeramachaneni, Kalyan |
| |
| 3 |
| |
| 1 |
| Vengroff, Darren Erik |
| |
| 1 |
| |
| 1 |
| Verbeek, Rutger |
| |
| 3 |
| |
| 2 |
| Vialette, Stephane |
| |
| 5 |
| |
| 1 |
| Vijaykumar, P.I. |
| |
| 3 |
| |
| 2 |
| Villanger, Yngve |
| |
| 5 |
| |
| 2 |
| Vishkin, Uzi |
| |
| 1 |
| |
| 1 |
| Vitanyi, Paul |
| |
| 8 |
| |
| 25 |
| Vöcking, Berthold |
| |
| 1 |
| |
| 1 |
| Vollmar, R. |
| |
| 1 |
| |
| 1 |
| von Stengel, Bernhard |
| |
| 1 |
| |
| 1 |
| Voss, Thomas |
| |
| 1 |
| |
| 1 |
| Vredeveld, Tjark |
| |
| 1 |
| |
| 3 |
| Wagener, Hubert |
| |
| 1 |
| |
| 2 |
| Wagner, Frank |
| |
| 2 |
| |
| 4 |
| Wagner, Markus |
| |
| 25 |
| |
| 2 |
| Wahl, Jürgen |
| |
| 2 |
| |
| 1 |
| Waldmann, Uwe |
| |
| 2 |
| |
| 1 |
| Wang, Yusu |
| |
| 1 |
| |
| 3 |
| Warken, Thomas |
| |
| 1 |
| |
| 1 |
| Weber, Andreas |
| |
| 3 |
| |
| 12 |
| Weber, Ingmar |
| |
| 1 |
| |
| 2 |
| Wedelin, Dag |
| |
| 2 |
| |
| 2 |
| Wegener, Ingo (ed.) |
| |
| 1 |
| |
| 5 |
| Weikum, Gerhard |
| |
| 2 |
| |
| 1 |
| Weinand, Caroline |
| |
| 8 |
| |
| 4 |
| Weiskircher, Rene |
| |
| 9 |
| |
| 4 |
| Wendt, Ulrich |
| |
| 1 |
| |
| 1 |
| Wernet, Norbert |
| |
| 1 |
| |
| 1 |
| Werth, Sören |
| |
| 1 |
| |
| 1 |
| Westbrook, Jeffery |
| |
| 1 |
| |
| 1 |
| Westphal, Stefan |
| |
| 1 |
| |
| 1 |
| Wetzel, Susanne |
| |
| 7 |
| |
| 2 |
| Wigderson, A. |
| |
| 1 |
| |
| 3 |
| Wilhelm, Reinhard |
| |
| 3 |
| |
| 1 |
| Winlaw, Manda |
| |
| 1 |
| |
| 27 |
| Winzen, Carola |
| |
| 1 |
| |
| 23 |
| Witt, Carsten |
| |
| 3 |
| |
| 1 |
| Woelfel, Philipp |
| |
| 1 |
| Wojtaszczyk, Jakub Onufry |
| |
| 1 |
| Wolf, Lars |
| |
| 1 |
| |
| 20 |
| Wolpert, Nicola |
| |
| 1 |
| |
| 1 |
| Wong, Prudence W. H. |
| |
| 1 |
| |
| 2 |
| Wormald, Nicholas |
| |
| 1 |
| |
| 1 |
| Wren, Howard |
| |
| 1 |
| |
| 1 |
| Xia, Mingji |
| |
| 7 |
| |
| 7 |
| Yap, Chee |
| |
| 5 |
| |
| 1 |
| Yap, Chee K. |
| |
| 1 |
| |
| 1 |
| Yuster, Raphael |
| |
| 3 |
| |
| 2 |
| Zafeirakopoulos, Zafeirakis |
| |
| 1 |
| Zafeirakopoulos,Zafeirakis |
| |
| 2 |
| Zarges, Christine |
| |
| 28 |
| |
| | 2007 | | Efficient models for timetable information in public transportation systems
In: ACM Journal of Experimental Algorithmics [12], 1-39 | | Journal Article | |
| | 2000 | | A simple parallel algorithm for the single-source shortest path problem on planar digraphs
In: Journal of Parallel and Distributed Computing [60], 1103-1124 | | Journal Article | |
| | 2000 | | Computing mimicking networks
In: Algorithmica [26], 31-49 | | Journal Article | |
| | 2000 | | Improved algorithms for dynamic shortest paths
In: Algorithmica [28], 367-389 | | Journal Article | |
| | 2000 | | Shortest paths in digraphs of small treewidth. Part I, Sequential algorithms
In: Algorithmica [27], 212-226 | Not MPII Authors: Christos herausgelöscht. | Journal Article | |
| | 1999 | | Transmissions in a network with capacities and delays
In: Networks [33
], 167-174 | q / ch 8.9.03 | Journal Article | |
| | 1998 | | A Parallel Priority Queue with Constant Time Operations
In: Journal of Parallel and Distributed Computing, Special Issue on Parallel Data Structures [49], 4-21 | | Journal Article | |
| | 1998 | | A Software Library of Dynamic Graph Algorithms
In: Proceedings of Workshop on Algorithms and Experiments (ALEX-98), 129-136 | | Proceedings Article | |
| | 1998 | | All-Pairs Min-Cut in Sparse Networks
In: Journal of Algorithms [29], 82-110 | | Journal Article | |
| | 1998 | | An experimental study of dynamic algorithms for directed graphs
In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), 368-380 | | Proceedings Article | |
| | 1998 | | Computing Mimicking Networks
In: Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP-98), 556-567 | | Proceedings Article | |
| | 1998 | | Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms
In: Theoretical Computer Science [203], 205-223 | Noch nicht erschienen. Für 1997 eingetragen | Journal Article | |
| | 1997 | | A First Experimental Study of a Dynamic Transitive Closure Algorithm
In: Proceedings of the Workshop on Algorithm Engineering (WAE-97), 64-73 | | Proceedings Article | |
| | 1997 | | A parallel priority data structure with applications
In: 11th Internatinal Parallel Processing Symposium (IPPS-97), 689-693 | | Proceedings Article | |
| | 1997 | | Efficient Computation of implicit representations of sparse graphs
In: Discrete Applied Mathematics [78], 1-16 | gefunden durch Bibliotheksabgleich | Journal Article | |
| | 1997 | | Simple and Work-Efficient Parallel Algorithms for the Minimum Spanning Tree Problem
In: Parallel Processing Letters [7], 25-37 | | Journal Article | |
| | 1996 | | A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs
In: Parallel Algorithms for Irregularly Structured Problems: 3rd International Workshop (IRREGULAR'96), 183-194 | | Proceedings Article | |
| | 1996 | | Hammock-on-ears decomposition : a technique for the efficient parallel solution of shortest paths and other problems
In: Theoretical Computer Science [168], 121-154 | | Journal Article | |
| | 1996 | | On the Parallel Complexity of Acyclic Logic Programs
In: Parallel Processing Letters [6], 223-230 | | Journal Article | |
| | 1996 | | Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane
In: Algorithms - ESA '96: 4th Annual European Symposium, 514-528 | | Proceedings Article | |
| | 1995 | | All-Pairs Min-Cut in Sparse Networks
In: Foundations of software technology and theoretical computer science (FSTTCS-95) : 15th conference, 363-376 | | Proceedings Article | |
| | 1995 | | Fast Algorithms for Maintaining Shortest Paths
In: Fundamentals of Computation Theory: 10th International Conference (FCT95), 191-200 | | Proceedings Article | |
| | 1995 | | On-line and Dynamic Algorithms for Shortest Path Problems
In: STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science, 193-204 | | Proceedings Article | |
| | 1995 | | On the Computation of Fast Data Transmissions in Networks
In: Algorithms and Data Structures: 4th International Workshop (WADS95), 291-302 | | Proceedings Article | |
| | 1995 | | Optimal Parallel Shortest Paths in Small Treewidth Digraphs
In: Algorithms - ESA'95: 3rd Annual European Symposium, 31-45 | | Proceedings Article | |
| | 1995 | | Quickest Paths: Parallelization and Dynamization
In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 39-44 | | Proceedings Article | |
| | 1995 | | Shortest Path Queries in Digraphs of Small Treewidth
In: Automata, Languages, and Programming: 22nd International Colloquium (ICALP95), 244-255 | | Proceedings Article | |
| | 1995 | | The Fourth Moment in Luby's Distribution
In: Theoretical Computer Science [148], 133-140 | | Journal Article | |
| 5 |
| Zeh, Norbert |
| |
| 3 |
| |
| 1 |
| Zhang, Huimin |
| |
| 2 |
| |
| 1 |
| Zhang, Yong |
| |
| 1 |
| |
| 1 |
| Zhu, Hong |
| |
| 4 |
| |
| 1 |
| Ziegenbein, Kurt |
| |
| 2 |
| |
| 5 |
| Ziegler, Thomas |
| |
| 1 |
| |
| 2 |
| Zitzler, Eckart |
| |
| 1 |
| |
| 1 |
| Zolliker, Peter |
| |
| 1 |
| |
| 1 |
| Zotenko, Elena |
| |
| 1 |
| |
| 1 |
| Zweig, K. |
| |
| 1 |
| |
| 6215 |
| |
