Publications  Group  Widmayer  1991  -­  2006    

2006 Journals O.Laule, M. Hirsch-Hoffmann, T. Hruz, W. Gruissem and P. Zimmermann Web-based analysis of the mouse transcriptome using Genevestigator. BMC Bioinformatics, 7, 311, 2006, BioMed Central H. Attiya, F. Kuhn, C.G. Plaxton, M. Wattenhofer, R. Wattenhofer Efficient adaptive collect using randomization. Distributed Computing, 18, 179-188, 2006, Springer, Berlin Z. Beerliová, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann, M. Mihalák, S. Ram Network Discovery and Verification. IEEE Journal on Selected Areas in Communications (JSAC), 24, pages 2168-2181, 2006. Conference Papers B. Gfeller, L. Peeters, B. Weber, and P. Widmayer Online Single Machine Batch Scheduling. Proceedings Mathematical Foundations of Computer Science 2006 (MFCS'06), LNCS 4162, pp. 424-435, 2006, Springer, Berlin B. Gfeller, E. Vicari, and P. Widmayer Small Backbones for Wireless Ad Hoc Networks. Poster MICS 2006 5th Scientific Conference and Panel Review, 2006, Zurich. C. Ambuhl, T. Erlebach, M. Mihalak, M. Nunkesser, Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. Proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), LNCS 4110, 3-14, 2006, Springer, Berlin T. Hruz, M. Hirsch-Hoffmann, W. Gruissem, P. Zimmermann, Reducing Java internet project risks: a case study of public measurement of client component functionality in the user community. Proceedings of the 4th international symposium on Principles and practice of programming in Java, ACM ICPS 178, 199-202, 2006, ACM Press, New York T. Erlebach, A. Hall, M. Hoffmann and M. Mihalak Network Discovery and Verification with Distance Queries. Proceedings of the 6th Italian Conference on Algorthms and Complexity (CIAC), LNCS 3998, 69-80, 2006, Springer T. Erlebach, A. Hall and M. Mihalak Network Discovery in Random Graphs. Poster in Proceedings of the European Conference on Complex Systems (ECCS), 92, 2006, ECS, Paris. G. Proietti, P. Widmayer Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. Proceedings 17th International Symposium on Algorithms and Computation (ISAAC 2006), LNCS 4288, 578-587, 2006, Springer, Berlin P. Penna, G. Proietti, P. Widmayer Strongly Polynomial-Time Truthful Mechanisms in One Shot. Proceedings 2nd International Workshop on Internet and Network Economics (WINE 2006), LNCS 4286, 377-388, 2006, Springer, Berlin G. Baier, T. Erlebach, A. Hall, E. Kohler, H. Schilling, M. Skutella Length-Bounded Cuts and Flows.

Proceedings 33rd International Colloquium on Automata, anguages and Programming (ICALP 2006), LNCS 4051, 679-690, 2006, Springer, Berlin T. Erlebach, A. Hall, L. Moonen, A. Panconesi, F. Spieksma, D. Vukadinovic Robustness of the Internet at the Topology and Routing Level. Proceedings Dependable Systems, Software, Computing, Networks, LNCS 4028, 260-274, 2006, Springer, Berlin Technical reports B. Gfeller, L. Peeters, B. Weber, and P. Widmayer Single Machine Batch Scheduling with Release Times. Technical Report Institute of Theoretical Computer Science, 514, 2006, ETH Zurich, Zurich. B. Gfeller, E. Vicari A Faster Distributed Approximation Scheme for the Connected Dominating Set Problem for Growth-Bounded Graphs. Technical Report Institute of Theoretical Computer Science, 540, 2006, ETH Zurich, Zurich. M.A. Bender, G.S. Brodal, R. Fagerberg, R. Jacob, E. Vicari Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. Technical Report Institute of Theoretical Computer Science, 523, 2006, ETH Zurich, Zurich. L. Shankar Ram, E. Vicari", Distributed Small Connected Spanning Subgraph Breaking the Diameter Bound. Technical Report Institute of Theoretical Computer Science, 530, 2006, ETH Zurich, Zurich. T. Erlebach, A. Hall and M. Mihalak Approximate Discovery of Random Graphs. Technical Report of DELIS -- Dynamically Evolving, Large-Scale Information Systes, 413, 2006, DELIS. A. Barrat, A. Hall, M. Mihalak Network Discovery on Snapshots of the Internet Graph. Technical Report of DELIS -- Dynamically Evolving, Large-ScaleInformation Systems, 465, 2006, DELIS.

2005 Journals P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 1-3, 147-168, 2005. B. Fischer, V. Roth, F. Roos, J. Grossmann, S. Baginsky, P. Widmayer, W. Gruissem, J. M. Buhmann NovoHMM: A Hidden Markov Model for de Novo Peptide Sequencing. Anal. Chem. 77 , 22, 7265-7273, 2005. J. Grossmann, FF. Roos, M. Cieliebak, Z. Lipták, LK.Mathis, M. Müller, W. Gruissem, S. Baginsky AUDENS: A Tool for Automated Peptide de Novo Sequencing. Journal of Proteome Research 4, 5, 1768-74, 2005. A. Nesvizhskii, F. Roos, J. Grossmann, M. Vogelzang, J. Eddes, W. Gruissem, S. Baginsky, R. Aebersold Dynamic spectrum quality assessment and iterative computational analysis of shotgun proteomic data: toward more efficient identification of post-translational modifications, sequence polymorphisms, and novel peptides. Molecular and Cellular Proteomics, accepted, epub ahead of print,2005. Conference Papers

G. Proietti, P. Widmayer A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. Proc. 17th annual ACM symposium on Parallel Algorithms, 195-202, 2005. L. Graf, T. Hruz, M. Schönbächler Role Based Access Control, Wer was darf. IX, 9, 2005, Heise,Hannover. T. Erlebach, R. Jacob, M. Mihalák, M. Nunkesser, G. Szabó, P. Widmayer Joint Base Station Scheduling. LNCS WAOA 2004 3351, 225-238, Springer,Berlin. F. Eberhard, A. Hall, T. Erlebach, and M. Mihalak A Simulation Study of Network Discovery Strategies. Preproceedings of the European Conference on Complex Systems (ECCS 05), 2005, Paris. L. Anderegg, M. Cieliebak, and G. Prencipe Efficient Algorithms for Detecting Regular Point Configurations. LNCS 3701, 23-35, 2005, Springer, Berlin. D. Koschützki, K.A. Lehmann, L. Peeters, S. Richter, D. Tenfelde-Podehl, and O. Zlotowski Centrality Indices. LNCS Network Analysis: Methodological Foundations 3418, 16-61, 2005,U. Brandes and T. Erlebach, Springer, Berlin. C. Pomm Designing Presentation Recording Applications: A Hierarchy for Quality Issues of Capturing Techniques. Proceedings of the 11th International Conference on Human-Computer Interaction, 2005. Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann, M. Mihalak, L. Shankar Ram Network Discovery and Verification. Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 05), 2005. A. Hall, C. Papadimitriou Approximating the Distortion. Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 05), August 2005. A. Hall, H. Schilling Flows over Time: Towards a more Realistic and Computationally Tractable Model. Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 05), January 2005. M. Gatto, M. Nunkesser, R. Jacob Optimization of a Railway Hub-and-Spoke System: Routing and Shunting. Poster Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA05), 2005. M. Wattenhofer, R. Wattenhofer, P. Widmayer Geometric Routing without Geometry. Sirocco, 2005. M. O'Dell, R. O'Dell, M. Wattenhofer, R. Wattenhofer Lost in Space Or Positioning In Sensor Networks. REALWSN, 2005. P. Hoai Ha, P. Tsigas, M. Wattenhofer, R. Wattenhofer Efficient Multi-Word Locking using Randomization. PODC, 2005. N. Santoro, P. Widmayer

Majority and unanimity in synchronous networks with ubiquitous dynamic faults. Sirocco, 2005. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Coordination of autonomous mobile robots : Minimal capabilities and algorithmic solutions. IEEE Control Systems Society Conference, Decision and Control, invited paper, Sevilla, December 2005. G. Proietti, P. Widmayer A truthful mechanism for the non- utilitarian minimum radius spanning tree problem. To appear at Proc. SPAA, 2005. M. Gatto, R. Jacob, L. Peeters, A. Schoebel The Computational Complexity of Delay Management WG 2005, Metz, France, 2005. Books Ulrik Brandes, Thomas Erlebach Network Analysis, Chapter 10, Blockmodels (M. Nunkesser, D. Sawitzki), LNCS Tutorial 3418, 2005. Technical reports M. Bläser, E. Vicari Algebraic Communication Complexity of Distributed Computation. ETH Technical Report , 501, 2005, ETH Zurich, Zurich.

2005 Journals P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337, 1-3, 147-168, 2005. B. Fischer, V. Roth, F. Roos, J. Grossmann, S. Baginsky, P. Widmayer, W. Gruissem, J. M. Buhmann NovoHMM: A Hidden Markov Model for de Novo Peptide Sequencing. Anal. Chem. 77 , 22, 7265-7273, 2005. J. Grossmann, FF. Roos, M. Cieliebak, Z. Lipták, LK.Mathis, M. Müller, W. Gruissem, S. Baginsky AUDENS: A Tool for Automated Peptide de Novo Sequencing. Journal of Proteome Research 4, 5, 1768-74, 2005. A. Nesvizhskii, F. Roos, J. Grossmann, M. Vogelzang, J. Eddes, W. Gruissem, S. Baginsky, R. Aebersold Dynamic spectrum quality assessment and iterative computational analysis of shotgun proteomic data: toward more efficient identification of post-translational modifications, sequence polymorphisms, and novel peptides. Molecular and Cellular Proteomics, accepted, epub ahead of print,2005. Conference Papers G. Proietti, P. Widmayer A truthful mechanism for the non-utilitarian minimum radius spanning tree problem. Proc. 17th annual ACM symposium on Parallel Algorithms, 195-202, 2005. L. Graf, T. Hruz, M. Schönbächler Role Based Access Control, Wer was darf. IX, 9, 2005, Heise,Hannover. T. Erlebach, R. Jacob, M. Mihalák, M. Nunkesser, G. Szabó, P. Widmayer

Joint Base Station Scheduling. LNCS WAOA 2004 3351, 225-238, Springer,Berlin. F. Eberhard, A. Hall, T. Erlebach, and M. Mihalak A Simulation Study of Network Discovery Strategies. Preproceedings of the European Conference on Complex Systems (ECCS 05), 2005, Paris. L. Anderegg, M. Cieliebak, and G. Prencipe Efficient Algorithms for Detecting Regular Point Configurations. LNCS 3701, 23-35, 2005, Springer, Berlin. D. Koschützki, K.A. Lehmann, L. Peeters, S. Richter, D. Tenfelde-Podehl, and O. Zlotowski Centrality Indices. LNCS Network Analysis: Methodological Foundations 3418, 16-61, 2005,U. Brandes and T. Erlebach, Springer, Berlin. C. Pomm Designing Presentation Recording Applications: A Hierarchy for Quality Issues of Capturing Techniques. Proceedings of the 11th International Conference on Human-Computer Interaction, 2005. Z. Beerliova, F. Eberhard, T. Erlebach, A. Hall, M. Hoffmann, M. Mihalak, L. Shankar Ram Network Discovery and Verification. Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 05), 2005. A. Hall, C. Papadimitriou Approximating the Distortion. Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 05), August 2005. A. Hall, H. Schilling Flows over Time: Towards a more Realistic and Computationally Tractable Model. Proceedings of the 7th Workshop on Algorithm Engineering and Experiments (ALENEX 05), January 2005. M. Gatto, M. Nunkesser, R. Jacob Optimization of a Railway Hub-and-Spoke System: Routing and Shunting. Poster Proceedings of the 4th International Workshop on Efficient and Experimental Algorithms (WEA05), 2005. M. Wattenhofer, R. Wattenhofer, P. Widmayer Geometric Routing without Geometry. Sirocco, 2005. M. O'Dell, R. O'Dell, M. Wattenhofer, R. Wattenhofer Lost in Space Or Positioning In Sensor Networks. REALWSN, 2005. P. Hoai Ha, P. Tsigas, M. Wattenhofer, R. Wattenhofer Efficient Multi-Word Locking using Randomization. PODC, 2005. N. Santoro, P. Widmayer Majority and unanimity in synchronous networks with ubiquitous dynamic faults. Sirocco, 2005. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Coordination of autonomous mobile robots : Minimal capabilities and algorithmic solutions. IEEE Control Systems Society Conference, Decision and Control, invited paper, Sevilla, December 2005. G. Proietti, P. Widmayer

A truthful mechanism for the non- utilitarian minimum radius spanning tree problem. To appear at Proc. SPAA, 2005. M. Gatto, R. Jacob, L. Peeters, A. Schoebel The Computational Complexity of Delay Management WG 2005, Metz, France, 2005. Books Ulrik Brandes, Thomas Erlebach Network Analysis, Chapter 10, Blockmodels (M. Nunkesser, D. Sawitzki), LNCS Tutorial 3418, 2005. Technical reports M. Bläser, E. Vicari Algebraic Communication Complexity of Distributed Computation. ETH Technical Report , 501, 2005, ETH Zurich, Zurich. Anmerkung: es existiert bereits eine publizierte oder geschlossene Version dieses Inhaltes. Änderungen können nur in einer neuen Version gemacht werden.

2004 Journals M. Gatto, R. Jacob, L. Peeters, B. Weber and P. Widmayer Theory on the Tracks: A Selection of Railway Optimization Problems EATCS Bulletin, vol. 84, pp. 41-70, 2004. R. Wattenhofer and P. Widmayer The counting pyramid: An adaptive, distributed counting scheme. Journal of Parallel and Distributed Computing 4, vol. 64, pp. 449-460, 2004. E. Nardelli G. Proietti P. Widmayer Nearly linear time minimum spanning tree maintenance for transient node failures. Algorithmica 2, vol. 40, pp. 119-132, 2004. T. Erlebach and A. Hall NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. Journal of Scheduling, vol. 7, pp. 223-241, 2004. Conference Papers B. Fischer V. Roth J. Buhmann J. Grossmann S. Baginsky W. Gruissem F. Roos P. Widmayer A hidden Markov model for de novo peptide sequencing. Advances in Neural Information Processing Systems 17 (NIPS 2004), MIT Press, 457-464, 2005. P. Flocchini L. Pagli G. Prencipe N. Santoro P. Widmayer T. Zuva Computing all the best swap edges distributively. Proceedings of the 8th Internationa Conference on Principles of Distributed Systems (OPODIS 2004), LNCS 3544, 154-168, 2005. L. Peeters Cyclic Railway Timetable Optimization. MET, 2004. M. Wattenhofer and R. Wattenhofer Distributed Weighted Matching. Proceedings Distributed Computing, 18th International Conference (DISC 2004), LNCS 3274, 335-348, 2004. H. Attiya F. Kuhn M. Wattenhofer R. Wattenhofer

Efficient Adaptive Collect using Randomization. Proceedings Distributed Computing, 18th International Conference, DISC 2004, LNCS 3274, 159-173, 2004. T. Moscibroda R. O'Dell M. Wattenhofer R. Wattenhofer Virtual Coordinates for Ad hoc and Sensor Networks. Proceedings Foundations of Mobile Computing, DIALM 2004, ACM, 8-16, 2004. C. Pomm, S. Werlen Smooth Morphing of Handwritten Text. Proceedings of the working conference on Advanced Visual Interfaces (AVI), ACM, pp. 328-335, 2004. G. Melideo, P. Penna, G. Proietti, R. Wattenhofer, P. Widmayer Truthful Mechanisms for Generalized Utilitarian Problems. Proceedings of 3rd IFIP International Conference on Theoretical Computer Science, Kluwer Academic Publisher, pp. 175-188, 2004. M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, P. Widmayer Scheduling with Release Times and Deadlines on a Minimum Number of Machines. Proceedings 18th IFIP World Computer Congress (WCC), TC1 3rd International Conference on Theoretical Computer Science (TCS), pp. 209-222, 2004. M. Gatto, B. Glaus, R. Jacob, L. Peeters, P. Widmayer Railway Delay Management: Exploring its Algothmic Complexity. Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 3111, pp. 199-211, 2004. J. Zimmermann, Z. Lipták, S. Hazelhurst A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering. Proceedings of IEEE Fourth Symposium on Bioinformatics and Bioengineering (BIBE), May 19-21, IEEE COmputer Society, 2004. M. Wattenhofer, R. Wattenhofer Fast and Simple Algorithms for Weighted Perfect Matching. CTW on Graphs and Combinatorial Optimizations, May 31-June 2, 2004. C. Ambühl, B. Weber Parallel Prefetching and Caching is Hard. Proc. of 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 211-221, March 24-27, 2004. T. Erlebach, R. Jacob, M. Mihalak, M. Nunkesser, G. Szabó, P. Widmayer An Algorithmic View on OVSF Code Assignment. Proc. of 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 270-281, March 24-27, 2004. http://people.inf.ethz.ch/gattom/pub/Theory_On_The_Tracks.pdf Books T. Ottmann and P. Widmayer Programmierung mit Pascal, 7th edition. Teubner, Stuttgart, 2004. B. Seeger and P. Widmayer Geographical Information Systems. Handbook of Data Structures and Applications, vol. 55, pp. 1-22, Chapman & Hall, 2004. Technical reports T. Erlebach R. Jacob M. Mihalak M. Nunkesser G. Szabo P. Widmayer Joint Base Station Scheduling. Technical Report 462, ETH Zurich, 2004. M. Gatto, B. Glaus, R. Jacob, L. Peeters, P. Widmayer

Railway Delay Management: Exploring its Algorithmic Complexity. Technical Report ETH no. 441, October 2004. M. Wattenhofer, R. Wattenhofer Fast and Simple Algorithms for Weighted Perfect Matching. Technical Report ETH no. 433, January 2004. M. Gatto R. Jacob L. Peeters A. Schöbel The Computational Complexity of Delay Management. Technical Report 456, ETH Zurich, 2004.

2003 Journals E. Nardelli, G. Proietti, P. Widmayer Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica 35(1), 56-74, 2003. K. Schlude, E. Soisalon-Soininen, P. Widmayer Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory of Computing Systems 36(6), 611-629, November 2003. S. Eidenbenz, P. Widmayer An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM Journal on Computing 32(3), 654-670, 2003. L. Kroon, L. Peeters A Variable Trip Time Model for Cyclic Railway Timetabling. Transportation Science 37(2), 198-212, 2003. G. Szabó, K. Weicker, N. Weicker, P. Widmayer Evolutionary Multiobjective Optimization for Base Station Transmitter Placement with Frequency Assignment. IEEE Transactions on Evolutionary Computation 7, 189-203, April 2003. E. Nardelli, G. Proietti, P. Widmayer Finding the most vital node of a shortest path. Theoretical Computer Science 296(1), 167-177, March 2003. Conference Papers G. Alonso, E. Kranakis, C. Sawchuk, R. Wattenhofer, P. Widmayer Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. Proceedings of the 2nd International Conference on Ad-Hoc, Mobile, and Wireless Networks (ADHOC-NOW) 2003, 104-115, October 2003. G. Alonso, E. Kranakis, R. Wattenhofer, P. Widmayer Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. Proceedings of International Parallel and Distributed Processing Symposium (IPDPS) 2003, 218, April 2003. J.-P. Dittrich, B. Seeger, D.S. Taylor, P. Widmayer On producing join reults early. Proceedings of the 22nd symposium on Principle of database systems (PODS) 2003, 134-142, 2003. L. Anderegg, S. Eidenbenz Ad hoc VCG: A Truthful and Cost-Efficient Routing Protocol for Mobile Ad hoc Networks with Selfish Agents. Proceedings of Mobicom 2003, 245-259, 2003.

M. Cieliebak, S. Eidenbenz, P. Penna Noisy Data Make the Partial Digest Problem NP-hard. Proceedings of the 3rd Workshop on Algorithms in Bioinformatics (WABI 2003), LNBI 2812, 111-123, 2003. M. Cieliebak, S. Eidenbenz, A. Pagourtzis Composing Equipotent Teams. Proceedings of the 14th International Symposium on Fundamentals of Computation Theory (FCT 2003), LNCS 2751, 98-108, 2003. M. Cieliebak, P. Flocchini, G. Prencipe, N. Santoro Solving the Robots Gathering Problem. Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), LNCS 2719, 1181-1196, 2003. M. Cieliebak, S. Eidenbenz, G. Woeginger Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003), LNCS 2697, 519-527, 2003. E. Kranakis, P. Penna, K. Schlude, D. Taylor, P. Widmayer Improving Customer Proximity to Railway Stations. CIAC 2003, LNCS 2653, 264-276, 2003. L. Anderegg, S. Eidenbenz, M. Gantenbein, C. Stamm, D.S. Taylor, B. Weber, P. Widmayer Train Routing Algorithms: Concepts, Design Choices, and Practical Considerations. Proceedings of ALENEX'03, SIAM, ISBN:0-89871-542-3, 106-118, 2003. S. Eidenbenz, A. Pagourtzis, P. Widmayer Flexible Train Rostering. Proceedings of the 14th International Symposium on Algorithms and Computation (ISAAC 2003), LNCS 2906, 615-624, 2003. Books E. Soisalon-Soininen, P. Widmayer Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective: Essays Dedicated to Thomas Ottmann, 278-292, January 2003. 2003. [ pdf-file ] Technical reports M. Wattenhofer, R. Wattenhofer Distributed Weighted Matching. Technical Report ETH no.420, September 2003. T. Erlebach, R. Jacob, M. Mihalak, M. Nunkesser, G. Szabo, P. Widmayer An Algorithmic View on OVSF Code Assignment. TIK Report Nr. 173, August 2003. M. Cieliebak, T. Erlebach, F. Hennecke, B. Weber, P.Widmayer Scheduling with Release Times and Deadlines on a Minimum Number of Machines. Technical Report ETH no. 419, August 2003. K. Schlude, E. Specker Zum Problem der Damen auf dem Torus. Technical Report ETH no. 412, July 2003. K. Schlude Point Formation on a line: Contraction Functions and Weber point. Technical Report ETH no. 406, June 2003.

K. Schlude From Robotics to Facility Location: Contraction Functions, Weber Point, Convex Core. Technical Report ETH no. 403, June 2003. C. Ambühl, B. Weber Parallel Prefetching and Caching is NP-hard Technical Report ETH no. 398, May 2003. L. Anderegg, M. Cieliebak, G. Prencipe The Weber Point can be Found in Linear Time for Points in Biangular Configuration. Technical Report Univ. di Pisa TR-03-01, January 2003.

2002 Journals C. Stamm PGF - A new progressive file format for lossy and lossless image compression. Journal of WSCG, Vol. 10, Nr. 2, pp. 421-428, 2002. P. Penna On the Approximability of Two Tree Drawing Conventions. Information Processing Letters, Vol. 82, Nr. 5, pp. 237-242, 2002. S. Eidenbenz Inapproximability of Finding Maximum Hidden Sets on Polygons and Terrains. Computational Geometry: Theory and Applications (CGTA), Vol. 21, pp. 139-153, 2002. S. Eidenbenz Approximation algorithms for Terrain Guarding Information Processing Letters. IPL, Vol. 82, pp. 99 - 105, 2002. Conference Papers J.-P. Dittrich, B. Seeger, D.S. Taylor, P. Widmayer Progressive Merge Join: A generic and non-blocking sort-based join algorithm. 28th Very Large Databases Conference (VLDB), 2002, Hong Kong. G. Szabó, N. Weicker, P. Widmayer Base Station Transmitter Placement with Frequency Assignment: an Evolutionary Approach. Proceedings Advances in Nature-inspired Computing (PPSN VII workshops), pp.47-48, 2002. E. Soisalon-Soininen, P. Widmayer Amortized complexity of bulk updates in AVL-trees. In: Martti Penttonen, Erik Meineche Schmidt (Eds.): Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings. Lecture Notes in Computer Science 2368, Springer, 439-448, 2002. L. Anderegg, P. Penna, P. Widmayer http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B75H1-­‐4DDWJ1W-­‐3D&_user=791130&_coverDate=06%2F30%2F2002&_rdoc=4&_fmt=high&_orig=browse&_srch=doc-­‐info%28%23toc%2313109%232002%23999339993%23587093%23FLP%23display%23Volume%29&_cdi=13109&_sort=d&_docanchor=&_ct=7&_acct=C000043379&_version=1&_urlVersion=0&_userid=791130&md5=6d579dd7b7a0d467d1a7a277209dd67eOnline Train Disposition: to wait or not to wait?

ATMOS'02, ICALP 2002 Satellite Workshop on Algorithmic Methods and Models for Optimization of Railways, Electronic Notes in Theoretical Computer Science 66 No. 6. K. Schlude, E. Soisalon-Soininen, P. Widmayer Distributed Highly Available Search Trees. SIROCCO 2002, Proceedings in Informatics 13, p. 259-274. M. Cieliebak, G. Prencipe Gathering Autonomous Mobile Robots. SIROCCO 2002, Proceedings in Informatics 13, p. 57-72. C. Pomm, P. Widmayer Developing Course Material with the "Authoring on the Fly" Concept - an Evaluation. Proceedings of 4th International Conference on New Educational Environments (ICNEE), p. 3.2/11-14, 2002. A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D.S. Taylor and P. Widmayer Server Placements, Roman Domination and Other Dominating Set Variants. To appear in: Proceedings of TCS'02, 2nd IFIP, 2002. S. Eidenbenz Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains To appear in: Proceedings of 8th Scandinavian Workshop on Algorithm Theory (SWAT), 2002. M. Cieliebak, T. Erlebach, Zs. Lipták, J. Stoye, E. Welzl Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. Proceedings of 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002). Foundations of Information Technology in the Era of Network and Mobile Computing", Montreal, Canada, Sept. 2002. Ricardo Baeza-Yates, Ugo Montanari, and Nicola Santoro (editors). Kluwer Adacemic Publishers, pp. 143-156. Books P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conjeo (eds.) Automata, Languages and Programming. Proceedings from the 29th International Colloquium (ICALP 2002), Lecture Notes in Computer Science 2380, 2002. T. Ottmann, P. Widmayer Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, Heidelberg-Berlin-Oxford, 4th edition, 2002. Technical reports L. Anderegg, S. Eidenbenz, M. Gantenbein, Ch. Stamm, D.S. Taylor, B. Weber, P. Widmayer Train Routing Algorithms: Concepts, Design Choices, and Practical Considerations. Technical Report ETH no. 384, December 2002. S. Baginsky, M. Cieliebak, W. Gruissem, T.n Kleffmann, Z. Lipták, M. Müller, P. Penna AuDeNS, A Tool for Automatic De Novo Peptide Sequencing. Technical Report ETH no. 383, October 2002. M. Cieliebak, St. Eidenbenz, G. J. Woeginger Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. Technical Report ETH no. 382, November 2002. M. Cieliebak, St. Eidenbenz, P. Penna Noisy Data Make the Partial Digest Problem NP-hard. Technical Report ETH no. 381, October 2002. M. Cieliebak, G. Prencipe Gathering Autonomous Mobile Robots in Non Totally Symmetric Configurations. Technical Report ETH no. 379, October 2002.

E. Kranakis, P. Penna, K. Schlude, D. Taylor, P. Widmayer Improving Customer Proximity to Railway Stations. Technical Report ETH no. 371, June 2002. M. Cieliebak, St. Eidenbenz, A. Pagourtzis, K. Schlude Equal Sum Subsets: Complexity of Variations. Technical Report ETH no. 370, June 2002.

2001 Journals E. Nardelli, G. Proietti, P. Widmayer Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. JGAA, Vol. 5, No. 5, pp. 39-57, 2001. E. Nardelli, G. Proietti, P. Widmayer A faster computation of the most vital edge of a shortest path. IPL, Vol. 79, No. 2, pp. 81-85, 2001. K. Larsen, E. Soisalon-Soininen, P. Widmayer Relaxed balance through standard rotations. Algorithmica (31), pp. 501-512, 2001. S. Eidenbenz, C. Stamm, P. Widmayer Inapproximability results for guarding polygons and terrains. Algorithmica (31), pp. 79-113, 2001. R. Pajarola, P. Widmayer Virtual Geoexploration: Concepts and design choices. International Journal of Computational Geometry and Applications, Vol. 11, Nr. 1, pp. 1-14, 2001. Conference Papers P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Gathering of asynchronous oblivious robots with limited visibility. In: Proc. 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science, Vol. 2010, Springer, pp. 247-258, 2001. E. Nardelli, G. Proietti, P. Widmayer Finding a most vital node of a shortest path. Computing and Combinatorics, 7th Annual International Conference (COCOON), Lecture Notes in Computer Science, Vol. 2108, Springer, pp. 278-287, 2001. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Pattern Formation by Anonymous Robots Without Chirality. Sirocco 8 (2001) Proceedings in Informatics 11, Carleton Scientific, 2001. J. Hromkovic, K. Steinhöfel, P. Widmayer Job Shop Scheduling With Unit Length Tasks: Bounds and Algorithms. 7th Italian Conference on Theoretical Computer Science (ICTCS), Lecture Notes in Computer Science, Vol. 2202, Springer, pp. 90-106, 2001. S. Eidenbenz, P. Widmayer An Approximation Algorithm for Convex Cover with Logarithmic Performance Guarantee. Lecture Notes in Computer Science 2161 (ESA 2001), pp. 333-343, 2001. T. Erlebach, M. Gantenbein, D. Hürlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D.

Taylor, P. Widmayer On the complexity of train assignment problems. Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes In Computer Science, Vol. 2223, Springer, pp. 390-402, 2001. C. Schindelhauer, B. Weber Tree Approximation for the Weighted Cost-Distance Problem. Proceedings of the 12th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes In Computer Science, Vol. 2223, Springer, pp. 185-195, 2001. Books T. Ottmann, P. Widmayer Algorithmen und Datenstrukturen. Spektrum Akademischer Verlag, Heidelberg-Berlin-Oxford, 4th edition, 2001. Technical reports M. Cieliebak, T. Erlebach, Zs. Lipták, J. Stoye, E. Welzl Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. Technical Report ETH no. 361, August 2001. T. Erlebach, M. Gantenbein, D. Hürlimann, G. Neyer, A. Pagourtzis, P. Penna, K.Schlude, D. Taylor, P. Widmayer On the complexity of train assignment problems. Technical Report ETH no. 363, September 2001. K. Schlude, E. Soisalon-Soininen, P. Widmayer Distributed Highly Available Search Trees. Technical Report ETH no. 364, October 2001. A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D. Taylor, P. Widmayer Server Placements, Roman Domination and Other Dominating Set Variants Technical Report ETH no. 365, October 2001.

2000 Journals R. Pajarola, P. Widmayer An image compression method for spatial search. IEEE Transactions on Image Processing, Vol. 9, No. 3, 357-365, March 2000. S. Doddi, M. Marathe, S.S. Ravi, D.S. Taylor, P. Widmayer Approximation Algorithms for Clustering to Minimize the Sum of Diameters, Nordic J. Computing, Vol. 7, No. 3, 185-203, 2000. Conference Papers S.R. Doddi, M.V. Marathe, S.S. Ravi, D.S. Taylor, P. Widmayer Approximation algorithms for clustering to minimize the sum of diameters. In: Proc. Scandinavian Workshop on Algorithms Theory (SWAT 00), Bergen, Lecture Notes in Computer Science, Springer, 237-250, 2000. M. Schneider, C. Stamm, J. Symanzik, P. Widmayer Virtual Reality and Dynamic Statistical Graphics: A Bidirectional Link in a Heterogeneous, Distributed Computing Environment. 2000 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2000), Las Vegas, Nevada, USA, Vol. IV, 2345-2351, 2000. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer

Distributed coordination of a set of autonomous mobile robots, Proc. of IEEE Intelligent Vehicles Symposium (IV 2000), Dearborn, USA, 480-485, 2000. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Limits to pattern formation by autonomous mobile robots, Proc. 3rd International Conference on Complex Systems (ICCS 2000), New England, 2000. E. Nardelli, G. Proietti, P. Widmayer Maintaining a minimum spanning tree under transient node failures. In: Proc. 8th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 1879, Springer, 346-355, 2000. Lipták Zs., Nickelsen A. Broadcasting in Complete Networks with Dynamic Edge Faults. Proceedings of the 4th International Conference on Principles of Distributed Systems (OPODIS 2000), La Villette, France. Special Issue of Studia Informatica Universalis, Saint Denis,123-142, 2000. Eidenbenz S., Stamm Ch. Maximum Clique and Minimum Clique Partition in Visibility Graphs. IFIP International Conference on Theoretical Computer Science (IFIP TCS2000), Sendai, Japan. Lecture Notes in Computer Science, Vol. 1872, 200-212, 2000. Books J. Nievergelt, P. Widmayer Spatial data structures: Concepts and design choices. In: Handbook of Computational Geometry, J.R. Sack, J. Urrutia (eds.), Elsevier, 725-764, 2000. P. Widmayer, G. Neyer, S. Eidenbenz (Eds.) Special issue of the International Journal of Foundations of Computer Science (IJFCS), 11(3), September 2000. 25th International Workshop, WG '99, Ascona, Switzerland, September 2000. K. Hepp, J. Nievergelt, P. Widmayer (Eds.) Latsis-Symposium 2000, ETH Zürich. Technical reports Oliver Bröker, Gabriele Neyer, Nora Sleumer Kursmaterialien Schnupperstudium Informatik. Technical Report 334, ETH Zürich, Institute of Theoretical Computer Science, January 2000.

1999 Journals E. Ihler, G. Reich, P. Widmayer Class Steiner trees and VLSI design. Discrete Applied Mathematics 90, 173-194, 1999. C. Gold, P. Remmele, T. Roos Fully dynamic and kinematic Voronoi diagrams in GIS Algorithmica (Special Issue on Cartography and GIS), 1999. U. Brandes, G. Neyer, W. Schlickenrieder, D. Wagner, K. Weihe PlaNet - A Software Package of Algorithms and Heuristics on Planar Networks. Discrete Applied Mathematics 92, pp 91-110, 1999. K. Schlude

Bemerkungen zu beschränkt homogenen Funktionen. Elemente der Mathematik, Vol. 53, 1-2, 1999. Conference Papers J. Van den Bercken, B. Seeger, P. Widmayer The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. In: Proc. IEEE International Conf. on Data Engineering, 257, 1999. E. Nardelli, G. Proietti, P. Widmayer How to swap a failing edge of a single source shortest paths tree. In: Proc. 5th Annual International Computing and Combinatorics Conference (COCOON 99), Tokyo, Japan, Lecture Notes in Computer Science, Vol. 1627, Springer, 144--153, 1999. E. Soisalon-Soininen, P. Widmayer Concurrency and Recovery in Full-Text Indexing. In: Proc. String Processing and Information Retrieval Symposium (SPIRE'99), Cancun, Mexico, IEEE Computer Society, Los Alamos, California, 192-198, 1999. P. Flocchini, G. Prencipe, N. Santoro, P. Widmayer Hard tasks for weak robots: The role of common knowledge in pattern formation by autonomous mobile robots. In: Proc. 10th Intl. Symposium on Algorithms and Computation (ISAAC 99), Chennai, India, Lecture Notes in Computer Science, Vol. 1741, Springer, 93-102, 1999. S. Eidenbenz How Many People Can Hide in a Terrain, In: Proc. 10th Intl. Symposium on Algorithms and Computation (ISAAC 99), Chennai, India, Lecture Notes in Computer Science, Vol. 1741, Springer, pp. 184-194, 1999. G. Neyer Line Simplification with Restricted Orientations Algorithms and Data Structures. WADS 1999: 13-24 R. Ulber On the Number of Star-Shaped Polygons and Polyhedra, 11th Canadian Conf. On Computational Geometry, Vancouver, Canada, 1999. R. Wattenhofer, P. Widmayer A unified analysis of distributed counting with queueing theory. In: Distributed Data and Structures (WDAS), eds. N. Santoro and P. Widmayer, Proceedings in Informatics 2, Carleton Scientific, 84-97, 1999. Books N. Santoro, P. Widmayer (eds) Distributed Data and Structures. Carleton Scientific, Ottawa, Canada, Proceedings in Informatics 2, 1999. I. Munro, S. Näher, P. Widmayer (eds.) The Fourth Dagstuhl Seminar on Data Structures. Dagstuhl-Seminar-Report 202, Schloss Dagstuhl, 1999. P. Widmayer Die Konkurrenz selbstsüchtiger Computer: Ein ökonomisches Problem? G. Lausen, A. Oberweis, G. Schlageter (Eds.): Angewandte Informatik und Formale Beschreibungsverfahren, Festschrift zum 60. Geburtstag von Wolffried Stucky, Teubner-Texte zur Informatik, Vol. 29, Teubner-Verlag, Stuttgart, 287-298, 1999. Y. Breitbart, S. Das, N. Santoro, P. Widmayer (eds) Distributed Data and Structures 2. Carleton Scientific, Ottawa, Canada, Proceedings in Informatics 6, 1999.

P. Widmayer, G. Neyer, S. Eidenbenz (eds.) Graph Theoretic Concepts in Computer Science. Proceedings of the 25th International Workshop, WG '99, Ascona, Switzerland, Lecture Notes in Computer Science, Vol. 1665, Springer-Verlag, Berlin, 1999.

1998 Journals E. Nardelli, G. Proietti, P. Widmayer Finding a detour-critical edge of a shortest path between two nodes. Information Processing Letters, Vol. 67, No. 1, 51-54, 1998. R. Wattenhofer, P. Widmayer An inherent bottleneck in distributed counting. Journal of Parallel and Distributed Computing, Vol. 49, 135-145, 1998. Conference Papers R. Pajarola, T. Ohler, P. Stucki, K. Szabó, P. Widmayer The Alps at your fingertips: Virtual reality and geoinformation systems. In: Proc. 14th International Conference on Data Engineering, Orlando, 550-557, 1998. E. Nardelli, G. Proietti, P. Widmayer Finding all the best swaps of a minimum diameter spanning tree under transient edge failures. In: Proc. 6th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 1461, Springer, 55-66, 1998. S. Eidenbenz, C. Stamm, P. Widmayer Positioning guards at fixed height above a terrain - an optimum inapproximability result. In: Proc. 6th Annual European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 1461, Springer, 187-198, 1998. S. Eidenbenz, C. Stamm, P. Widmayer Inapproximability of some art gallery problems. In: Proc. CCCG '98, Montreal, Canada, 1998. C. Stamm, S. Eidenbenz, M. Beck, P. Stucki, P. Widmayer A prototype system for light propagation in terrains. Proc. Computer Graphics International (CGI '98), Hannover, ed. F.-E. Wolter, N. M. Patrikalakis, IEEE Computer Society, Los Alamitos, CA, 1998. R. Wattenhofer, P. Widmayer The counting pyramid: An adaptive distributed counting scheme. Proc. 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO), eds. L. Gargano, D. Peleg, Carleton Scientific, Ottawa, Canada, 145-157, 1998. J. Symanzik, R. Pajarola, P. Widmayer XGobi and XploRe meet ViRGIS. 1998 Proceedings of the Section on Statistical Graphics, American Statistical Association, Alexandria, VA, 50-55, 1998. S. Eidenbenz Inapproximability results for guarding polygons without holes. ISAAC 98 Algorithms and Computation, Chwa, K.Y, Ibarra O.H. (Eds.), LNCS 1533, pp 427-436, 1998. S. Eidenbenz, C. Stamm, R. Pajarola A modified longest side bisection triangulation, Proc. 10th Canadian Conf. On Computational Geometry (CCCG 98), 1998.

1997 Journals T. Asano, D. Ranjan, T. Roos, E. Welzl, P. Widmayer Space filling curves and their use in the design of geometric data structures. Theoretical Computer Science, Vol. 181, 3-15, 1997. T. Roos Tighter bounds on Voronoi diagrams of moving points. Nordic Journal of Computing (4), pp 167-171, 1997. Conference Papers J. Nievergelt, P. Widmayer Spatial data structures - concepts and design choices. In: Proc. Algorithmic Foundations of Geographic Information Systems, eds. van Kreveld, Nievergelt, Roos, Widmayer, Lecture Notes in Computer Science, Vol. 1340, Springer, 1997. E. Bugnion, T. Roos, R. Wattenhofer, P. Widmayer Space filling curves versus random walks. In: Proc. Algorithmic Foundations of Geographic Information Systems, eds. van Kreveld, Nievergelt, Roos, Widmayer, Lecture Notes in Computer Science, Vol. 1340, Springer, 1997. R. Wattenhofer, P. Widmayer Towards decentralized distributed data structures. Proc. World Conf. on Systemics, Cybernetics, and Informatics, IIIS, Caracas, 490 - 496, 1997. J. Van den Bercken, B. Seeger, P. Widmayer A Generic Approach to Bulk Loading Multidimensional Index Structures. In: Proc. 23rd Int'l. Conf. on Very Large Databases (VLDB), Athens, Morgan Kaufmann Publishing, 406-415, 1997. R. Wattenhofer, P. Widmayer An inherent bottleneck in distributed counting. In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC), Santa. Barbara, 159-167, 1997. K. Larsen, E. Soisalon-Soininen, P. Widmayer Relaxed balance through standard rotations. Proc. 5th Int'l Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science, Vol. 1272, Springer-Verlag, 450 - 461, 1997. G. Neyer, P. Widmayer Singularities make spatial join scheduling hard. In: Algorithms and Computation, Lecture Notes in Computer Science, Vol. 1350, Springer Verlag, 293-302, 1997. C. Gold, P. Remmele, T. Roos Voronoi methods in GIS, Algorithmic Foundations of Geographic Information Systems, M. van Kreveld et al (Eds.), LNCs 1340, pp 21-35, 1997. M. Kropp, P. Remmele, and T. Roos A simulated annealing algorithm for approximation triangulated surfaces, Proc. 2nd MATHMOD, 1997. Books M. van Kreveld, J. Nievergelt, T. Roos, P. Widmayer (Eds.) Algorithmic Foundations of Geographic Information Systems. Lecture Notes in Computer Science, Vol. 1340, Springer, 1997.

R. Wattenhofer, P. Widmayer Parallele Präfixsummation: Das Schweizer Taschenmesser der parallelen Algorithmen. Prinzipien des Algorithmenentwurfs, ed. T. Ottmann, Spektrum Akademischer Verlag, Heidelberg, 103-121, 1997. E. Soisalon-Soininen, P. Widmayer Relaxed balancing in search trees. Invited contribution to the Festschrift for the 60th birthday of Ron Book, eds. D.-Z. Du, K.-I Ko, Advances in Algorithms, Languages, and Complexity, 267-283, Kluwer Academic Publishers, 1997. D. Krizanc, P. Widmayer (eds) The 4th International Colloquium on Structural Information and Communication Complexity (Sirocco 97) Carleton Scientific, Proceedings in Informatics 1, 1997. T. Roos Randomisierte Algorithmen, Prinzipien des Algorithmenentwurfs T. Ottmann (Ed.), Spektrum Akad. Verlag, Heidelberg, pp 49-66, 1997.

1996 Journals B. Becker, P.G. Franciosa, S. Gschwind, S. Leonardi, T. Ohler, P. Widmayer Enclosing a set of objects by two minimum area rectangles. Journal of Algorithms, Vol. 21, 520-541, 1996. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer An asymptotically optimal multiversion B-tree. The VLDB Journal, Vol. 5, No. 4, 264-275, 1996. Conference Papers R. Pajarola, P. Widmayer Pattern matching in compressed raster images. 3rd South American Workshop on String Processing (WSP), Carleton University Press, 228 - 242, 1996. R. Pajarola, P. Widmayer Spatial indexing into compressed raster images. Proc. Int'l Workshop on Multimedia Database Management Systems, IEEE Computer Society Press, 94 - 100, 1996. Shi Fei, P. Widmayer Approximate multiple string searching by clustering. Proc. 7th Workshop on Genome Informatics, Universal Academy Press, 33 - 41, 1996. Books A.P. Swiridow, P. Widmayer, W.-D. Oberhoff, H. Unger (Eds.) New Media for Education and Training in Computer Science. Proc. 2nd Russian-German Symposium, Moscow; infix publishing, St. Augustin, 1996.

1995 Journals

E. Bugnion, T. Roos, F. Shi, P. Widmayer, F. Widmer A spatial index for approximate multiple string matching. JBCS, Special Issue on String Processing, Vol. 1, No. 3, 28-35, 1995. F. d'Amore, V.H. Nguyen, T. Roos, P. Widmayer On Optimal Cuts of Hyperrectangles. Computing, Vol. 55, Springer-Verlag, 191-206, 1995. Conference Papers T. Asano, D. Ranjan, T. Roos, E. Welzl, P. Widmayer Space filling curves and their use in the design of geometric data structures, LATIN '95, Santiago de Chile, Springer Lecture Notes in Computer Science, Vol. 911, 36-48, 1995. B. Kröll, P. Widmayer Balanced Distributed Search Trees Do Not Exist. 4th International Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 955, 50-61, 1995. K. Szabó, P. Stucki, P. Aschwanden, T. Ohler, R. Pajarola, P. Widmayer A virtual reality based system environment for intuitive walk-through and exploration of large-scale tourist information. In: Enter'95: Information and Communication Technologies in Tourism, Schertler, W. Schmid, B. Min Tjoa, A., Werthner, H. (Eds.), Springer, 10-15, 1995. V. H. Nguyen, P. Widmayer Binary space partitions for sets of hyperrectangles. In: Algorithms, Concurrency and Knowledge, Proc. Asian Computing Science Conference ACSC '95, Pathumthani, Thailand, LNCS 1023, Springer-Verlag, 59-72, 1995. Shi Fei Fast Approximate dictionary matching. Proc. of 6th International Symposium on Algorithms and Computation, LNCS, 1004, 1995. Shi Fei An algorithm for two-dimensional pattern matching, Proc. of the Second South American Workshop on String Processing, Valparaiso, Chile, 1995. Books P. Widmayer Grundlegende Datenstrukturen. Teubner-Taschenbuch der Mathematik, Teil II, 7th edition, 1995. F. Huber-Wäschle, H. Schauer, P. Widmayer (Eds.) Herausforderungen eines globalen Informationsverbundes für die Informatik. Jahrestagung GI und SI (GISI 95), Informatik aktuell, Springer-Verlag, 1995. T. Ottmann, P. Widmayer Programmierung mit Pascal. Teubner Verlag, Stuttgart, 6th edition, 1995.

1994 Journals T. Roos, P. Widmayer k-Violation Linear Programming. Information Processing Letters 52, 109-114, 1994. Conference Papers

T. Roos, P. Widmayer k-Violation Linear Programming. 16th IFIP-TC 7 Conference on System Modelling and Optimization, Compiegne, France, Springer Lecture Notes in Computer Science, Vol. 180, 855 - 862, 1994. T. Ohler, P. Widmayer A brief tutorial introduction to data structures for geometric databases. In: Advances in Database Systems, Implementations and Applications, Ed. J. Paredaens, L. Tenenbaum, CISM Courses and Lectures No. 347, International Centre for Mechanical Sciences, Udine, Springer-Verlag, 329-351, 1994. T. Ohler, P. Widmayer Data structures and algorithms for geometric information systems: Selected topics. In: Advances in Database Systems, Implementations and Applications, Ed. J. Paredaens, L. Tenenbaum, CISM Courses and Lectures No. 347, International Centre for Mechanical Sciences, Udine, Springer-Verlag, 353-364, 1994. T. Ohler, P. Widmayer Geographic information systems: An example. In: Advances in Database Systems, Implementations and Applications, Ed. J. Paredaens, L. Tenenbaum, CISM Courses and Lectures No. 347, International Centre for Mechanical Sciences, Udine, Springer-Verlag, 365-377, 1994. T. Roos, Shi Fei, P. Widmayer A data structure for approximate string searching. Proc. 27th ACM-IEEE Hawaii International Conference on Systems Sciences, Maui, Hawaii, 1994. B. Kröll, P. Widmayer Distributing a Search Tree Among a Growing Number of Processors. Proc. ACM SIGMOD International Conference on the Management of Data, Minneapolis, 265-276, 1994. V.-H. Nguyen, T. Ohler, P. Widmayer VisTool: A Visualization Tool for Spatial Access Structures. Proc. International Conference on Advanced Research in Geographic Information Systems,IGIS '94, Ascona, Springer Lecture Notes in Computer Science, Vol. 884, 1994. C. Gold, T. Roos Surface Modelling with Guaranteed Consistency - An Object-Based Approach, Proc. International Workshop on Advanced Research in Geographic Information Systems IGIS’94, Ascona, LNCS 884, pp 70-87, 1994. Books J. Nievergelt, T. Roos, H.-J. Schek, P. Widmayer (Eds.) Proceedings of the International Workshop on Advanced Research in Geographic Information Systems IGIS'94, Ascona, Switzerland, Springer LNCS 884, 1994

1993 Journals J. Nievergelt, P. Widmayer Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. The Computer Journal, Vol. 36, No. 2, 107-116, 1993. T. Roos Voronoi diagrams over dynamic scenes. Discrete Applied Mathematics, Vol 43, pp 243-259, 1993. Conference Papers

T. Roos Tighter bounds on Voronoi diagrams of moving points, Proc. 5th Canadian Conf. On Computational Geometry Waterloo, Ont., 1993. F. d'Amore, T. Roos, P. Widmayer An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. Proc. International Conference on Computer Graphics: Interaction, Design, Modelling and Visualization, ICCG'93, Bombay, India, (IFIP Transactions B-9), S.P. Mudur, S.N. Pattanaik (Eds.), Elsevier Science Publishers B. V. (North-Holland), 1993. B.-U. Pagel, H.-W. Six , H. Toben, P. Widmayer Towards an Analysis of Range Query Performance in Spatial Data Structures. 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Washington, DC, USA, 214-221, 1993. B. Becker, S. Gschwind, T. Ohler, B. Seeger, P. Widmayer On optimal multiversion access structures. Proc. 3rd International Symposium on Advances in Spatial Databases. Springer Lecture Notes in Computer Science, Vol. 692, Springer-Verlag, Berlin, 123-141, 1993. E. Bugnion, T. Roos, F. Shi, P. Widmayer, F. Widmer A spatial index for approximate multiple string matching. Proc. 1st South American Workshop on String Processing, Belo Horizonte, Brazil, R. Baeza-Yates, N. Ziviani (eds.), 43-53, 1993. V.H. Nguyen, T. Roos, P. Widmayer Balanced Cuts of a set of hyperrectangles. Proc. 5th Canadian Conference on Computational Geometry CCCG'93, Waterloo, Ontario, 121-126, 1993. Books Fessler, R. A Solution of the Global Asymptotic Stability Jacobian Conjecture and a Generalization. M. Sabatini (Ed.) Recent Results on the Global Asymptotic Stability Jacobian Conjecture, Universita di Trento, 1993.

1992 Conference Papers B. Becker, P. Franciosa, S. Gschwind, T. Ohler, G. Thiemt, P. Widmayer Enclosing many boxes by an optimal pair of boxes. Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science STACS, Cachan, Lecture Notes in Computer Science, Vol. 577, Springer-Verlag, 1992, 475-486. A. Hutflesz, P. Widmayer, C. Zimmermann Global Order Makes Spatial Access Faster. International Workshop on Data Base Management Systems for Geographical Applications, ESPRIT Basic Research Series Proc., Springer, 161-176, 1992. G. Albers, T. Roos Voronoi Diagrams of Moving Points in Higher Dimensional Spaces, Proc. 3rd Scandinavian Workshop on Algorithm Theory SWAT '92, LNCS 6221, 399-409, 1992. H. Noltemeier, T. Roos, C. Zirkelbach Motion Planning in Dynamically Changing Environments: A Robust On-Line Approach, Proc. of the GI Jahrestagung, Karlsruhe, 1992. T. Ohler The Multi Grid File: An Access Structure for Multi Class Range Queries, Proc. 5th Int. Symp. On Spatial Data Handling, 260-271, 1992. T. Roos, G. Albers Maintaining Proximity in Higher Dimensional Spaces, Proc. 17th Int. Symp. Ob Mathematic Foundation of Computer Science, LNCS 629, 483-493, 1992.

Books J. van Leeuwen, P. Widmayer Fundamental Algorithms and Data Structures. In: Handbooks in Operations Research and Management Science, Vol. 3: Computation, Ed. E.G. Coffman Jr., J.K. Lenstra, A.H.G. Rinnooy Kan, Elsevier Science Publishers, 1992.

 

1991 Journals P. Widmayer On Graphs Preserving Rectilinear Shortest Paths in the Presence of Obstacles. Annals of Operations Research, Ed. P.L. Hammer, Vol. 33, Topological Network Design, Baltzer, 557-575, 1991. Conference Papers A. Henrich, A. Hilbert, H.-W. Six, P. Widmayer Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. GI-Workshop Datenbanksysteme in Büro, Technik und Wissenschaft '91, Kaiserslautern, Informatik-Fachberichte Bd. 270, Springer, 161-177, 1991. B. Becker, H.-W. Six, P. Widmayer Spatial Priority Search: An Access Technique for Scaleless Maps. Proc. ACM SIGMOD International Conference on the Management of Data, Denver, 128-137, 1991. E. Ihler, G. Reich, P. Widmayer On Shortest Networks for Classes of Points in the Plane. International Workshop on Computational Geometry CG'91, Bern, Lecture Notes in Computer Science Bd. 553, Springer, 103-111, 1991. Books P. Widmayer Datenstrukturen für Geodatenbanken. In: Entwicklungstendenzen bei Datenbank-Systemen. Ed. G. Vossen and K.-U. Witt, Oldenbourg, 317-361, 1991.