2018 (25)
Böhmová, K.; Chalopin, J.; Mihalák, M.; Proietti, G.; and Widmayer, P. Sequence Hypergraphs: Paths, Flows, and Cuts. In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pages 191–215, 2018.
Sequence Hypergraphs: Paths, Flows, and Cuts [link]Paper   doi   bibtex
Geissmann, B.; and Penna, P. Inversions from Sorting with Distance-Based Errors. In 44th International Conference on Current Trends in Theory and Practice of Computer Science Theory and Practice of Computer Science - , (SOFSEM), volume 10706, of Lecture Notes in Computer Science, pages 508–522, 2018.
Inversions from Sorting with Distance-Based Errors [link]Paper   doi   bibtex
Almanza, M.; Leucci, S.; and Panconesi, A. Trainyard is NP-Hard. Theoretical Computer Science, In Press. 2018.
doi   bibtex
Bärtschi, A.; Graf, D.; and Mihalák, M. Collective fast delivery by energy-efficient agents. In Potapov, I.; Spirakis, P.; and Worrell, J., editor(s), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), volume 117, of Leibniz International Proceedings in Informatics (LIPIcs), pages 56, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018); Conference Location: Liverpool, United Kingdom; Conference Date: August 27-31, 2018
doi   bibtex
Bilò, D.; Colella, F.; Gualà, L.; Leucci, S.; and Proietti, G. Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges. In Proc. of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017) In Press, of Lecture Notes in Computer Science, 2018. Springer
bibtex
Bilò, D.; Colella, F.; Gualà, L.; Leucci, S.; and Proietti, G. An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner. In Proc. of the 28th International Symposium on Algorithms and Computation (ISAAC 2017) In Press, of Leibniz International Proceedings in Informatics (LIPIcs), 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
bibtex
Bilò, D.; Gualà, L.; Leucci, S.; and Proietti, G. Fault-Tolerant Approximate Shortest-Path Trees. Algorithmica, In Press. 2018.
doi   bibtex
Buhmann, J. M.; Gronskiy, A.; Mihalák, M.; Pröger, T.; Srámek, R.; and Widmayer, P. Robust optimization in the presence of uncertainty: A generic approach. J. Comput. Syst. Sci., 94: 135–166. 2018.
Robust optimization in the presence of uncertainty: A generic approach [link]Paper   doi   bibtex
Chen, C.; Penna, P.; and Xu, Y. Online scheduling of jobs with favorite machines. bibtex
Das, S.; Dereniowski, D.; and Uznanski, P. Brief Announcement: Energy Constrained Depth First Search. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pages 165:1–165:5, 2018.
Brief Announcement: Energy Constrained Depth First Search [link]Paper   doi   bibtex
Frank, Y.; Hruz, T.; Tschager, T.; and Venzin, V. Improved de novo peptide sequencing using LC retention time information. Algorithms for Molecular Biology, 13(1): 14. Aug 2018.
Improved de novo peptide sequencing using LC retention time information [link]Paper   doi   bibtex   abstract
Frank, Yves; Hruz, T.; Tschager, T.; and Venzin, V. Improved De Novo Peptide Sequencing using LC Retention Time Information. In In Press, volume 88, pages 26:1–26:17, Dagstuhl, Germany, 2018. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
doi   bibtex
Gavenčiak, T.; Geissmann, B.; and Lengler, J. Sorting by Swaps with Noisy Comparisons. . 2018.
doi   bibtex
Gawrychowski, P.; and Uznanski, P. Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pages 62:1–62:13, 2018.
Towards Unified Approximate Pattern Matching for Hamming and L_1 Distance [link]Paper   doi   bibtex
Geissmann, B. Longest Increasing Subsequence Under Persistent Comparison Errors. In Epstein, L.; and Erlebach, T., editor(s), Approximation and Online Algorithms - 16th International Workshop, WAOA 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers, volume 11312, of Lecture Notes in Computer Science, pages 259–276, 2018. Springer
doi   bibtex
Geissmann, B.; and Gianinazzi, L. Parallel Minimum Cuts in Near-linear Work and Low Depth. In Scheideler, C.; and Fineman, J. T., editor(s), Proceedings of the 30th Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018, pages 1–11, 2018. ACM
doi   bibtex
Geissmann, B.; Leucci, S.; Liu, C.; and Penna, P. Optimal dislocation with persistent errors in subquadratic time. In Niedermeier, R.; and Vallée, B., editor(s), 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), volume 96, of Leibniz International Proceedings in Informatics (LIPIcs), pages 36, 2018. Schloss Dagstuhl, Leibniz-Zentrum für Informatik 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018); Conference Location: Caen, France; Conference Date: February 28 - March 3, 2018
doi   bibtex
Geissmann, B.; Leucci, S.; Liu, C.; and Penna, P. Optimal Sorting with Persistent Comparison Errors. bibtex
Geissmann, B.; Leucci, S.; Liu, C.; and Penna, P. Sorting with Recurrent Comparison Errors. In Proc. of the 28th International Symposium on Algorithms and Computation (ISAAC 2017) In Press, of Leibniz International Proceedings in Informatics (LIPIcs), 2018. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
bibtex
Graf, D.; Labib, K.; and Uznanski, P. Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pages 109:1–109:4, 2018.
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication [link]Paper   doi   bibtex
Graf, D. S.; Labib, K.; and Uznanski, P. Brief announcement: Hamming distance completeness and sparse matrix multiplication. In Leibniz International Proceedings in Informatics (LIPIcs), volume 107, pages 109, 2018. Schloss Dagstuhl, Leibniz-Zentrum für Informatik 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018); Conference Location: Prague, Czech Republic; Conference Date: July 9-13, 2018
doi   bibtex
Kosowski, A.; and Uznanski, P. Brief Announcement: Population Protocols Are Fast. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018, pages 475–477, 2018.
Brief Announcement: Population Protocols Are Fast [link]Paper   doi   bibtex
Leucci, S.; Mamageishvili, A.; and Penna, P. No truthful mechanism can be better than \emphn approximate for two natural problems. Games and Economic Behavior, 111: 64–74. 2018.
No truthful mechanism can be better than \emphn approximate for two natural problems [link]Paper   doi   bibtex
Liu, C. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. In 34th International Symposium on Computational Geometry (SoCG 2018), pages 58:1–58:14, 2018.
A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon [link]Paper   doi   bibtex
Penna, P. The price of anarchy and stability in general noisy best-response dynamics. International Journal of Game Theory, 47(3): 839–855. Sep 2018.
The price of anarchy and stability in general noisy best-response dynamics [link]Paper   doi   bibtex
  2017 (26)
Geissmann, B.; Leucci, S.; Liu, C.; and Penna, P. Sorting with Recurrent Comparison Errors. In 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, pages 38:1–38:12, 2017.
Sorting with Recurrent Comparison Errors [link]Paper   doi   bibtex
Alistarh, D.; Aspnes, J.; Eisenstat, D.; Gelashvili, R.; and Rivest, R. L. Time-Space Trade-offs in Population Protocols. In Klein, P. N., editor(s), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 2560–2579, 2017. SIAM
doi   bibtex
Alistarh, D.; Dudek, B.; Kosowski, A.; Soloveichik, D.; and Uznanski, P. Robust Detection in Leak-Prone Population Protocols. In Brijder, R.; and Qian, L., editor(s), DNA Computing and Molecular Programming - 23rd International Conference, DNA 23, Austin, TX, USA, September 24-28, 2017, Proceedings, volume 10467, of Lecture Notes in Computer Science, pages 155–171, 2017. Springer
doi   bibtex
Alistarh, D.; Dudek, B.; Kosowski, A.; Soloveichik, D.; and Uznanski, P. Robust Detection in Leak-Prone Population Protocols. ,155–171. 2017.
Robust Detection in Leak-Prone Population Protocols [link]Paper   doi   bibtex
Alistarh, D.; Grubic, D.; Li, J.; Tomioka, R.; and Vojnovic, M. QSGD: Communication-Efficient SGD via Randomized Quantization. In Proceedings of the 31st Annual Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, California, 2017.
bibtex
Alistarh, D.; Kopinsky, J.; Li, J.; and Nadiradze, G. The Power of Choice in Priority Scheduling. In Schiller, E. M.; and Schwarzmann, A. A., editor(s), Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 283–292, 2017. ACM
The Power of Choice in Priority Scheduling [link]Paper   doi   bibtex
Alistarh, D.; Leiserson, W. M.; Matveev, A.; and Shavit, N. Forkscan: Conservative Memory Reclamation for Modern Operating Systems. In Alonso, G.; Bianchini, R.; and Vukolic, M., editor(s), Proceedings of the Twelfth European Conference on Computer Systems, EuroSys 2017, Belgrade, Serbia, April 23-26, 2017, pages 483–498, 2017. ACM
Forkscan: Conservative Memory Reclamation for Modern Operating Systems [link]Paper   doi   bibtex
Bärtschi, A.; Chalopin, J.; Das, S.; Disser, Y.; Graf, D.; Hackfeld, J.; and Penna, P. Energy-Efficient Delivery by Heterogeneous Mobile Agents. In Vollmer, H.; and Vallée, B., editor(s), 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), volume 66, of Leibniz International Proceedings in Informatics (LIPIcs), pages 10:1–10:14, Dagstuhl, Germany, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Energy-Efficient Delivery by Heterogeneous Mobile Agents [link]Paper   doi   bibtex
Baig, G.; Alistarh, D.; Karagiannis, T.; Radunovic, B.; Balkwill, M.; and Qiu, L. Towards Unlicensed Cellular Networks in TV White Spaces. In Proceedings of the 13th International Conference on Emerging Networking EXperiments and Technologies, of CoNEXT '17, pages 2–14, New York, NY, USA, 2017. ACM
Towards Unlicensed Cellular Networks in TV White Spaces [link]Paper   doi   bibtex
Bärtschi, A.; Chalopin, J.; Das, S.; Disser, Y.; Geissmann, B.; Graf, D.; Labourel, A.; and Mihalák, M. Collaborative delivery with energy-constrained mobile robots. Theoretical Computer Science. 2017. to appear
doi   bibtex
Bärtschi, A.; Graf, D.; and Penna, P. Truthful Mechanisms for Delivery with Agents. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems ATMOS'17, pages 2:1–2:17, 2017.
doi   bibtex
Bärtschi, A.; and Tschager, T. Energy-Efficient Fast Delivery by Mobile Agents. In 21st International Symposium on Fundamentals of Computation Theory FCT'2017, pages 82–95, 2017.
doi   bibtex
Brandt, S.; Hirvonen, J.; Korhonen, J. H.; Lempiäinen, T.; Österg\aard, P. R. J.; Purcell, C.; Rybicki, J.; Suomela, J.; and Uznanski, P. LCL Problems on Grids. ,101–110. 2017.
LCL Problems on Grids [link]Paper   doi   bibtex
Bressan, M.; Chierichetti, F.; Kumar, R.; Leucci, S.; and Panconesi, A. Counting Graphlets: Space vs Time. In Proc. of the 10th ACM International Conference on Web Search and Data Mining (WSDM 2017), pages 557-566, 2017. ACM
doi   bibtex
Chen, C.; Penna, P.; and Xu, Y. Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy. In 11th International Conference on Combinatorial Optimization and Applications - , (COCOA), volume 10628, of Lecture Notes in Computer Science, pages 226–240, 2017.
Selfish Jobs with Favorite Machines: Price of Anarchy vs. Strong Price of Anarchy [link]Paper   doi   bibtex
Dereniowski, D.; Kosowski, A.; Uznanski, P.; and Zou., M. Approximation Strategies for Generalized Binary Search in Weighted Trees. In Chatzigiannakis, I.; Indyk, P.; Kuhn, F.; and Muscholl, A., editor(s), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80, of Leibniz International Proceedings in Informatics (LIPIcs), pages 84:1–84:14, Dagstuhl, Germany, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Approximation Strategies for Generalized Binary Search in Weighted Trees. [link]Paper   doi   bibtex
Gavenciak, T.; Geissmann, B.; and Lengler, J. Sorting by swaps with noisy comparisons. In Bosman, P. A. N., editor(s), Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, July 15-19, 2017, pages 1375–1382, 2017. ACM
Sorting by swaps with noisy comparisons [link]Paper   doi   bibtex
Geissmann, B.; and Gianinazzi, L. Cache Oblivious Minimum Cut. In Fotakis, D.; Pagourtzis, A.; and Paschos, V. T., editor(s), Algorithms and Complexity - 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings, volume 10236, of Lecture Notes in Computer Science, pages 285–296, 2017.
Cache Oblivious Minimum Cut [link]Paper   doi   bibtex
Georgiadis, L.; Graf, D.; Italiano, G. F.; Parotsidis, N.; and Uznanski, P. All-Pairs 2-Reachability in O(n^w log n) Time. In Chatzigiannakis, I.; Indyk, P.; Kuhn, F.; and Muscholl, A., editor(s), 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017), volume 80, of Leibniz International Proceedings in Informatics (LIPIcs), pages 74:1–74:14, Dagstuhl, Germany, 2017. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
All-Pairs 2-Reachability in O(n^w log n) Time [link]Paper   doi   bibtex
Graf, D. How to Sort by Walking and Swapping on Paths and Trees. Algorithmica, 78(4): 1151–1181. Aug 2017.
How to Sort by Walking and Swapping on Paths and Trees [link]Paper   doi   bibtex
Haider, S. K.; Hasenplaugh, W.; and Alistarh, D. Lease/Release: Architectural Support for Scaling Contended Data Structures. TOPC, 4(2): 8:1–8:25. 2017.
Lease/Release: Architectural Support for Scaling Contended Data Structures [link]Paper   doi   bibtex
Kara, K.; Alistarh, D.; Alonso, G.; Mutlu, O.; and Zhang, C. FPGA-Accelerated Dense Linear Machine Learning: A Precision-Convergence Trade-Off. In 25th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, FCCM 2017, Napa, CA, USA, April 30 - May 2, 2017, pages 160–167, 2017. IEEE Computer Society
doi   bibtex
Menc, A.; Pajak, D.; and Uznanski, P. Time and space optimality of rotor-router graph exploration. Inf. Process. Lett., 127: 17–20. 2017.
Time and space optimality of rotor-router graph exploration [link]Paper   doi   bibtex
Penna, P. The price of anarchy and stability in general noisy best-response dynamics. International Journal of Game Theory. Nov 2017.
The price of anarchy and stability in general noisy best-response dynamics [link]Paper   doi   bibtex
Tschager, T.; Rösch, S.; Gillet, L.; and Widmayer, P. A better scoring model for de novo peptide sequencing: the symmetric difference between explained and measured masses. BMC Algorithms for Molecular Biology, 12(1): 12. 2017.
doi   bibtex
Zhang, H.; Li, J.; Kara, K.; Alistarh, D.; Liu, J.; and Zhang, C. ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning. In Precup, D.; and Teh, Y. W., editor(s), Proceedings of the 34th International Conference on Machine Learning, ICML 2017, Sydney, NSW, Australia, 6-11 August 2017, volume 70, of Proceedings of Machine Learning Research, pages 4035–4043, 2017. PMLR
ZipML: Training Linear Models with End-to-End Low Precision, and a Little Bit of Deep Learning [link]Paper   bibtex
  2016 (24)
Gawrychowski, P.; Suomela, J.; and Uznanski, P. Randomized Algorithms for Finding a Majority Element. In 15th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2016, June 22-24, 2016, Reykjavik, Iceland, pages 9:1–9:14, 2016.
Randomized Algorithms for Finding a Majority Element [link]Paper   doi   bibtex
Albrecht, D.; Winterflood, C. M.; Sadeghi, M.; Tschager, T.; Noé, F.; and Ewers, H. Nanoscopic compartmentalization of membrane protein motion at the axon initial segment. The Journal of Cell Biology, 215(1): 37–46. 2016.
Nanoscopic compartmentalization of membrane protein motion at the axon initial segment [link]Paper   doi   bibtex
Alistarh, D.; Censor-Hillel, K.; and Shavit, N. Are Lock-Free Concurrent Algorithms Practically Wait-Free?. J. ACM, 63(4): 31:1–31:20. September 2016.
Are Lock-Free Concurrent Algorithms Practically Wait-Free? [link]Paper   doi   bibtex
Böhmová, K.; Chalopin, J.; Mihalák, M.; Proietti, G.; and Widmayer, P. Sequence Hypergraphs. In 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, Istanbuul, Turkey (WG 2016), 2016. To appear
bibtex
Böhmová, K.; Mihalák, M.; Pröger, T.; Sacomoto, G.; and Sagot, M. Computing and Listing st-Paths in Public Transportation Networks. In Computer Science - Theory and Applications - 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings, pages 102–116, 2016.
bibtex
Böhmová, K.; Disser, Y.; Mihalák, M.; and Šrámek, R. Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs. In 12th Latin American Symposium, LATIN 2016, Ensenada, Mexico, April 11-15, 2016, volume 9644, pages 220–234, 2016. Springer
bibtex
Bärtschi, A.; Chalopin, J.; Das, S.; Disser, Y.; Geissmann, B.; Graf, D.; Labourel, A.; and Mihalák, M. Collaborative Delivery with Energy-Constrained Mobile Robots. In 23rd International Colloquium on Structural Information and Communication Complexity SIROCCO'16, Helsinki, Finland, July 19-21, 2016, 2016. To appear
bibtex
Bärtschi, A.; Geissmann, B.; Graf, D.; Hruz, T.; Penna, P.; and Tschager, T. On Computing the Total Displacement Number via Weighted Motzkin Paths. In Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings, volume 9843, of Lecture Notes in Computer Science, pages 423–434, 2016. Springer
On Computing the Total Displacement Number via Weighted Motzkin Paths [link]Paper   doi   bibtex
Böhmová, K.; Kravina, E.; and Mihalák, M. Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores. In 4th International Symposium on Combinatorial Optimization, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, 2016. Springer To appear
bibtex
Collet, S.; Fraigniaud, P.; and Penna, P. Local Distributed Algorithms for Selfish Agents. Technical Report 2016.
Local Distributed Algorithms for Selfish Agents [link]Paper   bibtex
Crescenzi, P.; Fraigniaud, P.; Lotker, Z.; and Penna, P. Core-periphery clustering and collaboration networks. In 2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pages 525-528, Los Alamitos, CA, USA, 2016. IEEE Computer Society
doi   bibtex
Dereniowski, D.; Kosowski, A.; Pajak, D.; and Uznanski, P. Bounds on the cover time of parallel rotor walks. J. Comput. Syst. Sci., 82(5): 802–816. 2016.
Bounds on the cover time of parallel rotor walks [link]Paper   doi   bibtex
Gawrychowski, P.; Kosowski, A.; and Uznanski, P. Brief Announcement: Sublinear-Space Distance Labeling Using Hubs. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC 2016, Chicago, IL, USA, July 25-28, 2016, pages 43–45, 2016.
Brief Announcement: Sublinear-Space Distance Labeling Using Hubs [link]Paper   doi   bibtex
Gawrychowski, P.; Kosowski, A.; and Uznanski, P. Sublinear-Space Distance Labeling Using Hubs. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27-29, 2016. Proceedings, pages 230–242, 2016.
Sublinear-Space Distance Labeling Using Hubs [link]Paper   doi   bibtex
Gawrychowski, P.; Merkurev, O.; Shur, A.; and Uznanski, P. Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams. In 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016, June 27-29, 2016, Tel Aviv, Israel, pages 18:1–18:13, 2016.
Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams [link]Paper   doi   bibtex
Geissmann, B.; and Penna, P. Sort well with energy-constrained comparisons. Technical Report 2016.
Sort well with energy-constrained comparisons [link]Paper   bibtex
Giessler, P.; Mamageishvili, A.; Mihalák, M.; and Penna, P. Sequential Solutions in Machine Scheduling Games. Technical Report 2016.
Sequential Solutions in Machine Scheduling Games [pdf]Paper   bibtex
Gillet, L.; Rösch, S.; Tschager, T.; and Widmayer, P. A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses. In Frith, M.; and Storm Pedersen, C. N., editor(s), Algorithms in Bioinformatics: 16th International Workshop, WABI 2016, Aarhus, Denmark, August 22-24, 2016. Proceedings, volume 9838, of Lecture Notes in Computer Science, pages 185–196, 2016. Springer International Publishing
A Better Scoring Model for De Novo Peptide Sequencing: The Symmetric Difference Between Explained and Measured Masses [link]Paper   doi   bibtex
Grütter, S.; Graf, D.; and Schmid, B. Watch them Fight! Creativity Task Tournaments of the Swiss Olympiad in Informatics. Olympiads in Informatics, 10: 73-85. 2016.
doi   bibtex
Haider, S. K.; Hasenplaugh, W.; and Alistarh, D. Lease/Release: Architectural Support for Scaling Contended Data Structures. In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, of PPoPP '16, pages 17:1–17:12, New York, NY, USA, 2016. ACM
Lease/Release: Architectural Support for Scaling Contended Data Structures [link]Paper   doi   bibtex
Mamageishvili, A.; and Penna, P. Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games. Oper. Res. Lett., 44(5): 645–648. 2016.
Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games [link]Paper   doi   bibtex
Mihalák, M.; Srámek, R.; and Widmayer, P. Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs. Theory Comput. Syst., 58(1): 45–59. 2016.
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs [link]Paper   doi   bibtex
Mihalák, M.; Penna, P.; and Widmayer, P. Bribeproof Mechanisms for Two-Values Domains. In Gairing, M.; and Savani, R., editor(s), Algorithmic Game Theory: 9th International Symposium, SAGT 2016, Liverpool, UK, September 19–21, 2016, Proceedings, pages 289–301, Berlin, Heidelberg, 2016. Springer Berlin Heidelberg
Bribeproof Mechanisms for Two-Values Domains [link]Paper   doi   bibtex
Penna, P.; and Viennot, L. Independent lazy better-response dynamics on network games. CoRR, abs/1609.08953. 2016.
Independent lazy better-response dynamics on network games [link]Paper   bibtex
  2015 (25)
Dütting, P.; and Kesselheim, T. Algorithms against Anarchy: Understanding Non-Truthful Mechanisms. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015, pages 239–255, 2015.
Algorithms against Anarchy: Understanding Non-Truthful Mechanisms [link]Paper   bibtex
Geissmann, B.; Mihalák, M.; and Widmayer, P. Recurring Comparison Faults: Sorting and Finding the Minimum. In Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings, pages 227–239, 2015.
Recurring Comparison Faults: Sorting and Finding the Minimum [link]Paper   doi   bibtex
Mamageishvili, A.; and Mihalák, M. Multicast Network Design Game on a Ring. In Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, pages 439–451, 2015.
Multicast Network Design Game on a Ring [link]Paper   doi   bibtex
Böhmová, K.; Disser, Y.; Mihalák, M.; Kravina, E.; and Widmayer, P. Interval Selection on Unrelated Machines. In In Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2015, pages 95 - 97, 2015.
Interval Selection on Unrelated Machines [pdf]Paper   bibtex
Böhmová, K.; Mihalák, M.; Neubert, P.; Pröger, T.; and Widmayer, P. Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015, September 17, 2015, Patras, Greece, pages 68–81, 2015.
bibtex
Böhmová, K.; Mihalák, M.; Pröger, T.; and Widmayer, P. Modelling Urban Public Transportation Networks to Support Robust Routing. In 13th Conference on Advanced Systems in Public Transport, CASPT 2015, July 19-23, 2015, Rotterdam, The Netherlands, 2015.
Modelling Urban Public Transportation Networks to Support Robust Routing [pdf]Paper   bibtex
Bärtschi, A.; and Grandoni, F. On Conflict-Free Multi-coloring. In Dehne, F.; Sack, J.; and Stege, U., editor(s), Algorithms and Data Structures, volume 9214, of Lecture Notes in Computer Science, pages 103-114, 2015. Springer International Publishing
On Conflict-Free Multi-coloring [link]Paper   doi   bibtex
Chalopin, J.; Das, S.; Disser, Y.; Mihalák, M.; and Widmayer, P. Mapping simple polygons: The power of telling convex from reflex. ACM Transactions on Algorithms, 11(4): 33–. June 2015.
bibtex
Dütting, P.; Fischer, F. A.; Jirapinyo, P.; Lai, J. K.; Lubin, B.; and Parkes, D. C. Payment Rules through Discriminant-Based Classifiers. ACM Trans. Economics and Comput., 3(1): 5. 2015.
Payment Rules through Discriminant-Based Classifiers [link]Paper   bibtex
Dütting, P.; Kesselheim, T.; and Tardos, É. Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round. In Proceedings of the Sixteenth ACM Conference on Economics and Computation, EC '15, Portland, OR, USA, June 15-19, 2015, pages 187–201, 2015.
Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round [link]Paper   bibtex
Dütting, P.; and Kleinberg, R. Polymatroid Prophet Inequalities. In Algorithms - ESA 2015 - 23rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, pages 437–449, 2015.
Polymatroid Prophet Inequalities [link]Paper   bibtex
Disser, Y.; Feldmann, A. E.; Klimm, M.; and Mihalak, M. Improving the H-k-bound on the price of stability in undirected Shapley network design games. Theoretical Computer Science, 562: 557–564. 2015.
bibtex
Feldmann, A. E.; and Foschini, L. Balanced Partitions of Trees and Applications. Algorithmica, 71(2): 354–376. February 2015.
bibtex
Feldmann, A. E.; and Widmayer, P. An O(n4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. Algorithmica, 71(1): 181–200. 2015.
An O(n\(^\mbox4\)) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs [link]Paper   doi   bibtex
Ferraioli, D.; and Penna, P. Imperfect Best-Response Mechanisms. Theory Comput. Syst., 57(3): 681–710. 2015.
Imperfect Best-Response Mechanisms [link]Paper   doi   bibtex
Flier, H.; Mihalák, M.; Widmayer, P.; Zych, A.; Kobayashi, Y.; and Schöbel, A. Selecting vertex disjoint paths in plane graphs. Networks, 66(2): 136–144. September 2015.
bibtex
Graf, D. How to Sort by Walking on a Tree. In Bansal, N.; and Finocchi, I., editor(s), Algorithms - ESA 2015, volume 9294, of Lecture Notes in Computer Science, pages 643–655, Heidelberg, 2015. Springer
bibtex
Liu, C.; and Montanari, S. Minimizing the Diameter of a Spanning Tree for Imprecise Points. In Algorithms and Computation - 26th InternationalSymposium, ISAAC 2015, Nagoya, Japan, December 9-11,2015, Proceedings, pages 381–392, 2015.
bibtex
Mamageishvili, A.; and Penna, P. Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games. Technical Report 2015.
Tighter Bounds on the Inefficiency Ratio of Stable Equilibria in Load Balancing Games [link]Paper   bibtex
Mihalák, M.; and Montanari, S. Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks. In 15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2015, September 17, 2015, Patras, Greece, pages 82–94, 2015.
bibtex
Mihalák, M.; Penna, P.; and Widmayer, P. Bribeproof mechanisms for two-values domains. Technical Report 2015.
Bribeproof mechanisms for two-values domains [link]Paper   bibtex
Montanari, S.; and Penna, P. On Sampling Simple Paths in Planar Graphs According to Their Lengths. In Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II, pages 493–504, 2015.
bibtex
Penna, P. The price of anarchy and stability in general noisy best-response dynamics. Technical Report 2015.
The price of anarchy and stability in general noisy best-response dynamics [link]Paper   bibtex
Widmayer, P. Preface: FUN with algorithms. Theoretical Computer Science, 586: 1. June 2015.
bibtex
Paschos, V. T.; and Widmayer, P. , editor s. Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Volume 9079, of Lecture Notes in Computer Science. 2015.Springer.
Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. [link]Paper   doi   bibtex
  2014 (20)
Chalopin, J.; Jacob, R.; Mihalák, M.; and Widmayer, P. Data Delivery by Energy-Constrained Mobile Agents on a Line. In Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part II, pages 423–434, 2014.
Data Delivery by Energy-Constrained Mobile Agents on a Line [link]Paper   doi   bibtex
Disser, Y.; Mihalák, M.; Montanari, S.; and Widmayer, P. Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods. In Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, pages 208–220, 2014.
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods [link]Paper   doi   bibtex
Funke, S.; and Mihalák, M. Frontmatter, Table of Contents, Preface, Workshop Organization. In 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland, pages i–ix, 2014.
Frontmatter, Table of Contents, Preface, Workshop Organization [link]Paper   doi   bibtex
Bärtschi, A.; and Suri, S. Conflict-Free Chromatic Art Gallery Coverage. Algorithmica, 68(1): 265-283. 2014.
doi   bibtex
Bärtschi, A.; Ghosh, S. K.; Mihalák, M.; Tschager, T.; and Widmayer, P. Improved bounds for the conflict-free chromatic art gallery problem. In Proceedings of the 30th Annual Symposium on Computational Geometry, of SoCG '14, New York, NY, USA, June 2014. ACM
doi   bibtex
Bollig, B.; Gillé, M.; and Pröger, T. Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. Theor. Comput. Sci., 560(2): 131–146. 2014.
doi   bibtex
Bollig, B.; and Pröger, T. On efficient implicit OBDD-based algorithms for maximal matchings. Information and Computation, 239: 29–43. 2014.
On efficient implicit OBDD-based algorithms for maximal matchings [link]Paper   doi   bibtex
Disser, Y.; Ghosh, S. K.; Mihalák, M.; and Widmayer, P. Mapping a polygon with holes using a compass. Theor. Comput. Sci., 553: 106–113. 2014.
doi   bibtex
Gall, D.; Jacob, R.; Richa, A. W.; Scheideler, C.; Schmid, S.; and Täubig, H. A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization. Theory Comput. Syst., 55(1): 110–135. 2014.
A Note on the Parallel Runtime of Self-Stabilizing Graph Linearization [link]Paper   doi   bibtex
Hupp, P. Performance of Unidirectional Hierarchization for Component Grids Virtually Maximized. In 2014 International Conference on Computational Science, volume 29, of Procedia Computer Science, pages 2272–2283, 2014. Elsevier
Performance of Unidirectional Hierarchization for Component Grids Virtually Maximized [link]Paper   doi   bibtex
Hupp, P.; Jacob, R.; Heene, M.; Pflüger, D.; and Hegland, M. Global Communication Schemes for the Sparse Grid Combination Technique. In Parallel Computing - Accelerating Computational Science and Engineering (CSE), volume 25, of Advances in Parallel Computing, pages 564–573, March 2014. IOS Press
doi   bibtex
Jacob, R.; Lieber, T.; and Mnich, M. Treewidth Computation and Kernelization in the Parallel External Memory Model. In Diaz, J.; Lanese, I.; and Sangiorgi, D., editor(s), Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings, volume 8705, of Lecture Notes in Computer Science, pages 78–89, 2014. Springer
Treewidth Computation and Kernelization in the Parallel External Memory Model [link]Paper   bibtex
Jacob, R.; Lieber, T.; and Sitchinava, N. On the Complexity of List Ranking in the Parallel External Memory Model. In Csuhaj-Varjú, E.; Dietzfelbinger, M.; and Ésik, Z., editor(s), Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings Part II, volume 8635, of Lecture Notes in Computer Science, 2014. Springer
bibtex
Jacob, R.; Lieber, T.; and Sitchinava, N. On the Complexity of List Ranking in the Parallel External Memory Model. CoRR, abs/1406.3279. 2014.
On the Complexity of List Ranking in the Parallel External Memory Model [link]Paper   bibtex
Mamageishvili, A.; Mihalák, M.; and Montemezzani, S. An \textdollarH_\n/2\\textdollar Upper Bound on the Price of Stability of Undirected Network Design Games. Technical Report 2014.
An \textdollarH_\n/2\\textdollar Upper Bound on the Price of Stability of Undirected Network Design Games [link]Paper   bibtex
Mamageishvili, A.; Mihalák, M.; and Montemezzani, S. An \${H}_\{n/2\}\$ Upper Bound on the Price of Stability of Undirected Network Design Games. In 39th International Symposium on Mathematical Foundations of Computer Science, Budapest, August 25-29, MFCS 2014., 2014.
bibtex
Widmayer, P. The Presburger Award 2015 - Call for Nominations. Technical Report Greece, October 2014.
bibtex
Zimmermann, P.; Bleuler, S.; Laule, O.; Martin, F.; Ivanov, N. V.; Campanoni, P.; Oishi, K.; Lugon-Moulin, N.; Wyss, M.; Hruz, T.; and Gruissem, W. ExpressionData - A public resource of high quality curated datasets representing gene expression across anatomy, development and experimental conditions. BioData Mining, 7: 18. 2014.
ExpressionData - A public resource of high quality curated datasets representing gene expression across anatomy, development and experimental conditions [link]Paper   doi   bibtex
Ferro, A.; Luccio, F.; and Widmayer, P. , editor s. Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings. Volume 8496, of Lecture Notes in Computer Science. 2014.Springer.
Fun with Algorithms - 7th International Conference, FUN 2014, Lipari Island, Sicily, Italy, July 1-3, 2014. Proceedings [link]Link   bibtex
Funke, S.; and Mihalák, M. , editor s. 14th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2014, September 11, 2014, Wroclaw, Poland. Volume 42, of OASICS. 2014.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
bibtex
  2013 (19)
Davide Bilò, Y. D.; and Widmayer, P. Polygon-Constrained Motion Planning Problems. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013), pages 67-82, 2013.
Polygon-Constrained Motion Planning Problems [link]Link   bibtex
Jérémie Chalopin, S. D.; and Widmayer, P. Data Delivery by Energy-Constrained Mobile Agents. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2013), pages 111-122, 2013.
Data Delivery by Energy-Constrained Mobile Agents [link]Link   bibtex
Widmayer, P. To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), pages 36, 2013.
To Be Uncertain Is Uncomfortable, But to Be Certain Is Ridiculous [link]Link   bibtex
Andreas Emil Feldmann, S. D.; and Widmayer, P. Corner Cuts Are Close to Optimal: From Solid Grids to Polygons and Back. Discrete Applied Mathematics, 161(7-8): 970-998. 2013.
Corner Cuts Are Close to Optimal: From Solid Grids to Polygons and Back [link]Link   bibtex
Böhmová, K.; Disser, Y.; Mihalák, M.; and Widmayer, P. Interval Selection with Machine-Dependent Intervals. In Proceedings of the Workshop on Algorithms and Data Structures (WADS 2013), volume 8037, of LNCS, pages 170-181, 2013. Springer-Verlag Berlin Heidelberg
bibtex
Böhmová, K.; Disser, Y.; Mihalák, M.; and Widmayer, P. Interval Selection with Machine-Dependent Intervals. Technical Report Zurich, 2013.
bibtex
Böhmová, K.; Mihalák, M.; Pröger, T.; Šrámek, R.; and Widmayer, P. Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations. In Proceedings of the 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2013), September 5, 2013, Sophia Antipolis, France, pages 27-41, 2013.
Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations [link]Link   bibtex
Buhmann, J. M.; Mihalák, M.; Srámek, R.; and Widmayer, P. Robust Optimization in the Presence of Uncertainty. In Proceedings of the 4th Conference on Innovations in Theoretical Computer Science (ITCS 2013), 2013.
Robust Optimization in the Presence of Uncertainty [link]Paper   bibtex
Chalopin, J.; Das, S.; Disser, Y.; Mihalák, M.; and Widmayer, P. Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons. Discrete Applied Mathematics, 161(10-11): 1287–1307. July 2013.
bibtex
Chalopin, J.; Das, S.; Disser, Y.; Mihalák, M.; and Widmayer, P. Mapping Simple Polygons: How Robots Benefit from Looking Back. Algorithmica, 65(1): 43-59. 2013.
Mapping Simple Polygons: How Robots Benefit from Looking Back [link]Paper   bibtex
Disser, Y.; Feldmann, A. E.; Klimm, M.; and Mihalák, M. Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games. In Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC 2013), 2013.
bibtex
Hruz, T.; Wyss, M.; Lucas, C.; Laule, O.; von Rohr, P.; Zimmermann, P.; and Bleuler, S. A Multilevel Gamma-Clustering Layout Algorithm for Visualization of Biological Networks. Advances in bioinformatics, 2013. 2013.
bibtex
Hupp, P. Hierarchization for the Sparse Grid Combination Technique. Technical Report August 2013. CoRR abs/1309.0392
doi   bibtex
Hupp, P.; and Jacob, R. Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. In Proceedings of the 13th International Symposiums in Algorithms and Data Structures (WADS 2013), volume 8037, of Lecture Notes in Computer Science, pages 415-426, 2013. Springer Berlin Heidelberg
Tight Bounds for Low Dimensional Star Stencils in the External Memory Model [link]Paper   bibtex
Kröger, P.; Tanin, E.; and Widmayer, P. Highlights from ACM SIGSPATIAL GIS 2012 the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Redondo Beach, California, November 6-9, 2012). SIGSPATIAL Special, 5(1): 2-4. 2013.
Highlights from ACM SIGSPATIAL GIS 2012 the 20th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (Redondo Beach, California, November 6-9, 2012) [link]Link   bibtex
Mamageishvili, A.; Mihalák, M.; and Müller, D. Tree Nash Equilibria in the Network Creation Game. In Proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph (WAW 2013), pages 118–129, 2013.
doi   bibtex
Matús Mihalák, R. S.; and Widmayer, P. Counting Approximately-Shortest Paths in Directed Acyclic Graphs. In Proceedings of the 11th Workshop on Approximation and Online Algorithms (WAOA 2013), 2013.
bibtex
Mihalák, M.; and Schlegel, J. C. The Price of Anarchy in Network Creation Games Is (Mostly) Constant. Theory Comput. Syst., 53(1): 53–72. 2013.
doi   bibtex
Peter Widmayer, Y. X.; and Zhu, B. , editor s. Combinatorial Optimization and Applications. In Peter Widmayer, Y. X.; and Zhu, B., editor(s), Proceedings of the 7th International Conference (COCOA 2013), Chengdu, China, December 12-14, volume 8287, of Lecture Notes in Computer Science. Springer, 2013.
Combinatorial Optimization and Applications [link]Link   bibtex
  2012 (15)
Achakeev, D.; Seeger, B.; and Widmayer, P. Sort-Based Query-Adaptive Loading of R-trees. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM 2012), 2012. to appear
Sort-Based Query-Adaptive Loading of R-trees [pdf]Paper   bibtex
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; and Widmayer, P. Reconstructing Visibility Graphs with Simple Robots. Theoretical Computer Science, 444: 52-59. 2012.
Reconstructing Visibility Graphs with Simple Robots [link]Paper   bibtex
Bohlin, M.; Dahms, F.; Flier, H.; and Gestrelius, S. Optimal Freight Train Classification using Column Generation. In Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012), volume 25, of OpenAccess Series in Informatics (OASIcs), pages 10–22, 2012. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Optimal Freight Train Classification using Column Generation [pdf]Paper   bibtex
Bollig, B.; Gillé, M.; and Pröger, T. Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations. In Proceedings of the 9th Annual Conference of the Theory and Applications of Models of Computation (TAMC 2012), of LNCS, pages 473–486, 2012. Springer
doi   bibtex
Bollig, B.; and Pröger, T. An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings. In Proceedings of the 6th International Conference on Language and Automata Theory and Applications (LATA 2012), of LNCS, pages 143–154, 2012. Springer
An Efficient Implicit OBDD-Based Algorithm for Maximal Matchings [pdf]Paper   bibtex
Disser, Y.; Mihalák, M.; Ghosh, S. K.; and Widmayer, P. Mapping a Polygon with Holes Using a Compass. In Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (Algosensors 2012), 2012.
Mapping a Polygon with Holes Using a Compass. [pdf]Paper   bibtex
Disser, Y.; Mihalák, M.; and Widmayer, P. Mapping Polygons with Agents that Measure Angles. In Proceedings of the 10th International Workshop on Algorithmic Foundations of Robotics (WAFR 2012), 2012. to apper
Mapping Polygons with Agents that Measure Angles. [pdf]Paper   bibtex
Feldmann, A. E. Fast Balanced Partitioning is Hard, Even on Grids and Trees. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), 2012. To appear
Fast Balanced Partitioning is Hard, Even on Grids and Trees [link]Paper   bibtex
Feldmann, A. E.; and Foschini, L. Balanced Partitions of Trees and Applications. In Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012), 2012. To appear
Balanced Partitions of Trees and Applications [link]Paper   bibtex
Feldmann, A. E.; Röglin, H.; and Vöcking, B. Computing Approximate Nash eEquilibria in Network Congestion Games. Networks, 59: 380 - 386. 2012.
doi   bibtex
Hruz, T.; and Schöngens, M. Partially Specified Nearest Neighbor Search. In Proceedings of 18th Annual International Computing and Combinatorics Conference (COCOON 2012), volume 7434, of LNCS, pages 372-383, 2012. Springer
doi   bibtex
Mihalák, M.; and Schlegel, J. C. Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), LNCS, pages 693-704. 2012., 2012. To appear
Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games [link]Paper   bibtex
Ottmann, T.; and Widmayer, P. . In Algorithmen und Datenstrukturen, of isbn 978-3-8274-2803-5, I-XXII, pages 1-774. Spektrum Akademischer Verlag, 5 edition, 2012.
[link]Paper   bibtex
Schöngens, M.; and Hruz, T. A Simple Framework for the Generalized Nearest Neighbor Problem. In Proceedings of the 13th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2012), 2012. To appear
A Simple Framework for the Generalized Nearest Neighbor Problem [pdf]Paper   bibtex
Zych, A.; and Bilò, D. New Advances in reoptimizing the Minimum Steiner Tree problem. In Proceedings of the 37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012), 2012. To appear
New Advances in reoptimizing the Minimum Steiner Tree problem [link]Paper   bibtex
  2011 (20)
Ackermann, H.; Fischer, S.; Hoefer, M.; and Schöngens, M. Distributed algorithms for QoS load balancing. Distributed Computing, 23(5-6): 321-330. 2011.
Distributed algorithms for QoS load balancing [link]Paper   doi   bibtex
Bilò, D.; Böckenhauer, H.; Komm, D.; Královic, R.; Mömke, T.; Seibert, S.; and Zych, A. Reoptimization of the Shortest Common Superstring Problem. Algorithmica, 61(2): 227–251. 2011.
Reoptimization of the Shortest Common Superstring Problem [link]Paper   doi   bibtex
Bohlin, M.; Flier, H.; Maue, J.; and Mihalák, M. Track Allocation in Freight-Train Classification with Mixed Tracks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2011), volume 20, pages 38-51, 2011. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Track Allocation in Freight-Train Classification with Mixed Tracks [link]Paper   bibtex
Chalopin, J.; Das, S.; Disser, Y.; Mihalák, M.; and Widmayer, P. Telling Convex from Reflex Allows to Map a Polygon. In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), volume 9, of Leibniz International Proceedings in Informatics (LIPIcs), pages 153–164, 2011. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik
Telling Convex from Reflex Allows to Map a Polygon [link]Paper   doi   bibtex
Disser, Y.; Mihalák, M.; and Widmayer, P. A Polygon Is Determined by its Angles. Computational Geometry: Theory and Applications, 44: 418–426. 2011.
A Polygon Is Determined by its Angles [link]Paper   doi   bibtex
Feldmann, A. E. Fast Balanced Partitioning of Grid Graphs is Hard. Technical Report arXiv, 2011.
Fast Balanced Partitioning of Grid Graphs is Hard [link]Paper   bibtex
Feldmann, A. E.; Das, S.; and Widmayer, P. Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. In Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), volume 6986, of LNCS, pages 143–154, 2011. Springer
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons [link]Paper   doi   bibtex
Feldmann, A. E.; Röglin, H.; and Vöcking, B. Computing approximate Nash equilibria in network congestion games. Networks. 2011. Available online. To appear in print.
Computing approximate Nash equilibria in network congestion games [link]Paper   doi   bibtex
Feldmann, A. E.; and Widmayer, P. An O(n4) Time Algorithm to Compute the Bisection Width of Grid Graphs. In Proceedings of the 19th Annual European Symposium on Algorithms (ESA 2011), volume 6942, of LNCS, pages 143-154, 2011. Springer
doi   bibtex
Flier, H.; Mihalák, M.; Widmayer, P.; and Zych, A. Maximum Independent Set in 2-Direction Outersegment Graphs. In Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011), volume 6986, of LNCS, pages 155-166, 2011. Springer
Maximum Independent Set in 2-Direction Outersegment Graphs [link]Paper   doi   bibtex
Fomin, F. V.; Golovach, P. A.; Hall, A.; Mihalák, M.; Vicari, E.; and Widmayer, P. How to Guard a Graph?. Algorithmica, 61(4): 839–856. 2011.
How to Guard a Graph? [link]Paper   doi   bibtex
Gatto, M.; and Widmayer, P. On Robust Online Scheduling Algorithms. J. Scheduling, 14(2): 141-156. 2011.
On Robust Online Scheduling Algorithms [link]Paper   bibtex
Gfeller, B.; Santoro, N.; and Widmayer, P. A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree. IEEE Transactions on Dependable and Secure Computing, 8(1): 1-12. 2011.
A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree [link]Paper   doi   bibtex
Hruz, T.; and Peter, U. Non-growing Preferential Attachment Random Graphs. Internet Mathematics, 6(4): 461–487. 2011.
Non-growing Preferential Attachment Random Graphs [link]Paper   doi   bibtex
Hruz, T.; Wyss, M.; Docquier; Mylene; Pfaffl; Michael; Masanetz; Sabine; Borghi; Lorenzo; Verbrugghe; Phebe; Kalaydjieva; Luba; Bleuler; Stefan; Laule; Oliver; Descombes; Patrick; Gruissem; Wilhelm; Zimmermann; and Philip RefGenes: identification of reliable and condition specific reference genes for RT-qPCR data normalization. BMC genomics, 12(1): 156. 2011.
RefGenes: identification of reliable and condition specific reference genes for RT-qPCR data normalization [link]Paper   bibtex
Jacob, R.; Marton, P.; Maue, J.; and Nunkesser, M. Multistage Methods for Freight Train Classification. Networks, 57(1): 87–105. 2011.
Multistage Methods for Freight Train Classification [link]Link   Multistage Methods for Freight Train Classification [link]Paper   doi   bibtex
Mihalák, M.; Schöngens, M.; Srámek, R.; and Widmayer, P. On the Complexity of the Metric TSP under Stability Considerations. In Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), volume 6543, of LNCS, pages 382–393, 2011. Springer
On the Complexity of the Metric TSP under Stability Considerations [link]Paper   doi   bibtex
Ottmann, T.; and Widmayer, P. . In Programmierung mit PASCAL.. Vieweg Teubner Verlag, 2011. 8. Auflage
[link]Paper   bibtex
Widmayer, P.; Anderegg, L.; Eidenbenz, S.; and Peeters, L. Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol. In Nikoletseas, S.; and Rolim, J. D., editor(s), Theoretical Aspects of Distributed Computing in Sensor Networks, of Monographs in Theoretical Computer Science. An EATCS Series, pages 85–107. Springer, 2011.
Optimal Placement of Ad Hoc Devices Under a VCG-Style Routing Protocol [link]Paper   bibtex
Zych, A.; and Bilò, D. New Reoptimization Techniques applied to Steiner Tree Problem. Electronic Notes in Discrete Mathematics, 37: 387–392. 2011.
New Reoptimization Techniques applied to Steiner Tree Problem [link]Paper   doi   bibtex
  2010 (13)
Büsing, C.; and Maue, J. Robust Algorithms for Sorting Railway Cars. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA 2010), volume 6346, of LNCS, pages 350-361, 2010. Springer
Robust Algorithms for Sorting Railway Cars [link]Paper   doi   bibtex
Bilò, D.; Erlebach, T.; Mihalák, M.; and Widmayer, P. Discovery of Network Properties with All-Shortest-Paths Queries. Theoretical Computer Science, 411 (14-15): 1626-1637. 2010.
Discovery of Network Properties with All-Shortest-Paths Queries. [pdf]Paper   bibtex
Bohlin, M.; Flier, H.; Maue, J.; and Mihalák, M. Hump Yard Track Allocation with Temporary Car Storage. Technical Report ETH Zurich, SICS, 2010.
Hump Yard Track Allocation with Temporary Car Storage [pdf]Paper   bibtex
Chalopin, J.; Das, S.; Disser, Y.; Mihalák, M.; and Widmayer, P. How Simple Robots Benefit from Looking Back. In Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC 2010), volume 6078, of LNCS, pages 229-239, 2010. Springer
doi   bibtex
Chalopin, J.; Das, S.; and Widmayer, P. Rendezvous of Mobile Agents in Directed Graphs. In Proceedings of the 23th International Symposium on DIStributed Computing (DISC 2010), volume 6343, of LNCS, pages 282-296, 2010.
doi   bibtex
Das, S.; Gfeller, B.; and Widmayer, P. Computing All Best Swaps for Minimum-Stretch Tree Spanners. Journal of Graph Algorithms and Applications, 14(2): 287–306. 2010.
Computing All Best Swaps for Minimum-Stretch Tree Spanners [pdf]Paper   bibtex
Derungs, J.; Jacob, R.; and Widmayer, P. Approximate Shortest Paths Guided by a Small Index. Algorithmica, 57(4): 668–688. 2010.
Approximate Shortest Paths Guided by a Small Index [link]Paper   doi   bibtex
Disser, Y.; Mihalák, M.; and Widmayer, P. Reconstructing a Simple Polygon from Its Angles. In Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010), volume 6139, of LNCS, pages 13-24, 2010. Springer
doi   bibtex
Feldmann, A. E.; Das, S.; and Widmayer, P. Simple Cuts are Fast and Good: Optimum Right-Angled Cuts in Solid Grids. In Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), volume 6508, pages 11–20, 2010.
Simple Cuts are Fast and Good: Optimum Right-Angled Cuts in Solid Grids [link]Paper   doi   bibtex
Flier, H.; Mihalák, M.; Schöbel, A.; Widmayer, P.; and Zych, A. Vertex Disjoint Paths for Dispatching in Railways. In Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2010), volume 14, pages 61–73, 2010. Schloss Dagstuhl–Leibniz-Zentrum für Informatik
Vertex Disjoint Paths for Dispatching in Railways [link]Paper   doi   bibtex
Hauser, A.; and Maue, J. Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars. In Festa, P., editor(s), Proceedings of the 9th International Symposium on Experimental Algorithms (SEA 2010), volume 6049, of LNCS, pages 154–165, 2010. Springer
Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars [link]Paper   doi   bibtex
Hruz, T.; Geisseler, S.; and Schöngens, M. Parallelism in simulation and modeling of scale-free complex networks. Parallel Computing, 36(8): 469–485. 2010.
Parallelism in simulation and modeling of scale-free complex networks [link]Paper   doi   bibtex
Mihalák, M.; and Schlegel., J. C. The Price of Anarchy in Network Creation Games is (Mostly) Constant. In Proceedings of the Third International Symposium on Algorithmic Game Theory, (SAGT 2010), volume 6386, of LNCS, pages 276–287, 2010. Springer
doi   bibtex
  2009 (27)
Ackermann, H.; Fischer, S.; Hoefer, M.; and Schöngens, M. Distributed algorithms for QoS load balancing. In Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2009), pages 197-203, 2009. ACM
doi   bibtex
Anderegg, L.; Penna, P.; and Widmayer, P. Online Train Disposition: To Wait or not to Wait?. In Ahuja, R. K.; Möhring, R. H.; and Zaroliagis, C. D., editor(s), Robust and Online Large-Scale Optimization, volume 5868, of LNCS, pages 387-398. Springer, 2009.
doi   bibtex
Bilò, D.; Böckenhauer, H.; Komm, D.; Královic, R.; Mömke, T.; Seibert, S.; and Zych, A. Reoptimization of the Shortest Common Superstring Problem. In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009), volume 5577, of LNCS, pages 78-91, 2009. Springer
doi   bibtex
Bilò, D.; Disser, Y.; Mihalák, M.; Suri, S.; Vicari, E.; and Widmayer, P. Reconstruction Visibility Graphs with Simple Robots. In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), pages 88-99, 2009.
Reconstruction Visibility Graphs with Simple Robots. [pdf]Paper   bibtex
Bilò, D.; Guala, L.; Proietti, G.; and Widmayer, P. Stability of Networks in Stretchable Graphs. In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), 2009.
Stability of Networks in Stretchable Graphs. [link]Paper   bibtex
Das, S.; Liu, H.; Nayak, A.; and Stojmenovic, I. A localized algorithm for bi-connectivity of connected mobile robots. Telecommunication Systems, 40(3-4): 129-140. 2009.
doi   bibtex
Disser, Y.; Bilò, D.; Mihalák, M.; Suri, S.; Vicari, E.; and Widmayer, P. On the Limitations of Combinatorial Visibilities. In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG 2009), pages 207-210, 2009.
doi   bibtex
Erlebach, T.; and Mihalák, M. A (4 + ϵ)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. In Proceedings of the 7th Workshop on Approximation and Online Algorithms (WAOA 2009), of LNCS, 2009. Springer
A (4 + $\epsilon$)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs. [link]Paper   bibtex
Nunkesser, H. F. A. A. G. A. M. Combinatorial Aspects of Move-up Crews. In Operations Research Proceedings 2008, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR 2009), pages 569-574, 2009. Springer
doi   bibtex
Flier, H.; Gelashvili, R.; Graffagnino, T.; and Nunkesser, M. Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data. In Ahuja, R. K.; Möhring, R. H.; and Zaroliagis, C. D., editor(s), Robust and Online Large-Scale Optimization, volume 5868, of LNCS, pages 354-368. Springer, 2009.
doi   bibtex
Flier, H.; Gelashvili, R.; Graffagnino, T.; and Nunkesser, M. Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data. Technical Report 204, Project ARRIVAL, 2009.
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data. [link]Paper   bibtex
Flier, H.; Graffagnino, T.; and Nunkesser, M. Scheduling Additional Trains on Dense Corridors. In Proceedings of the 8th International Symposium on Experimental Algorithms (SEA 2009), volume 5526, of LNCS, pages 149-160, 2009. Springer
doi   bibtex
Gatto, M.; Maue, J.; Mihalák, M.; and Widmayer, P. Shunting for Dummies: An Introductory Algorithmic Survey. In Ahuja, R. K.; Möhring, R. H.; and Zaroliagis, C. D., editor(s), Robust and Online Large-Scale Optimization, volume 5868, of LNCS, pages 310-337. Springer, 2009.
doi   bibtex
Gfeller, B.; Peeters, L.; Weber, B.; and Widmayer, P. Single Machine Batch Scheduling with Release Times. Journal of Combinatorial Optimization, 17(3): 323-338. 2009.
doi   bibtex
Gfeller, B.; and Sanders, P. Towards Optimal Range Medians. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), volume 5555, of LNCS, pages 475-486, 2009. Springer
doi   bibtex
Komuravelli, A.; and Mihalák, M. Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. In Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2009), volume 5873, of LNCS, pages 458-471, 2009. Springer
doi   bibtex
Márton, P.; Maue, J.; and Nunkesser, M. An Improved Classification Procedure for the Hump Yard Lausanne Triage. In Clausen, J.; and Stefano, G. D., editor(s), Proceedings of the 9th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2009), 2009. IBFI Schloss Dagstuhl
An Improved Classification Procedure for the Hump Yard Lausanne Triage. [link]Paper   bibtex
Maue, J.; and Nunkesser, M. Evaluation of Computational Methods for Freight Train Classification. Technical Report 184, Project ARRIVAL, 2009.
Evaluation of Computational Methods for Freight Train Classification. [link]Paper   bibtex
Maue, J.; Sanders, P.; and Matijevic, D. Goal-Directed Shortest-Path Queries Using Precomputed Cluster Distances. J. Exp. Algorithmics, 14: 3.2:1–3.2:27. 2009.
Goal-Directed Shortest-Path Queries Using Precomputed Cluster Distances [link]Paper   bibtex
Michael Gatto, J. M.; and Matús Mihalák, P. W. Shunting for Dummies: An Introductory Algorithmic Survey. In Proceedings of the Robust and Online Large-Scale Optimization Conference, pages 310-337, 2009.
bibtex
Penna, P.; Proietti, G.; and Widmayer, P. Strongly Polynomial-Time Truthful Mechanisms in One Shot. Theoretical Computer Science, 410(17): 1607-1615. 2009.
doi   bibtex
Penna, P.; Schoppmann, F.; Silvestri, R.; and Widmayer, P. Pseudonyms in Cost-Sharing Games. In Proceedings of the 5th International Workshop on Internet and Network Economics (WINE 2009), volume 5929, of LNCS, pages 256-267, 2009. Springer
doi   bibtex
Peter, U.; and Hruz, T. Clustering Signature in Complex Social Networks. In Proceedings of the12th IEEE International Conference on Computational Science and Engineering (CSE 2009), volume 4, pages 237-244, 2009. IEEE
Clustering Signature in Complex Social Networks. [pdf]Paper   doi   bibtex
Peter, U.; and Hruz, T. Distribution Hierarchies in Directed Networks. Technical Report 621, ETH Zürich, 2009.
Distribution Hierarchies in Directed Networks. [pdf]Paper   bibtex
Srámek, R.; Fischer, B.; Vicari, E.; and Widmayer, P. Optimal Transition Selection for Targeted Protein Quantification. Technical Report ETH Zürich, 2009.
Optimal Transition Selection for Targeted Protein Quantification [pdf]Paper   bibtex
Srámek, R.; Fischer, B.; Vicari, E.; and Widmayer, P. Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. In Proceedings of the15th Annual International Conference on Computing and Combinatorics (COCOON 2009), volume 5609, of LNCS, pages 287-296, 2009. Springer
doi   bibtex
Widmayer, P. How to Sort a Train. In Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science (MFCS 2009), volume 5734, of LNCS, pages 77, 2009. Springer
doi   bibtex
  2008 (17)
Fischetti, M.; and Widmayer, P. ATMOS 2008 Preface. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008), 2008.
ATMOS 2008 Preface [link]Link   bibtex
Fischetti, M.; and Widmayer, P. ATMOS 2008 Abstracts Collection. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2008), 2008.
ATMOS 2008 Abstracts Collection. [link]Link   bibtex
Böckenhauer, H.; Hromkovic, J.; Mömke, T.; and Widmayer, P. On the Hardness of Reoptimization. In Proceedings of the Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2008), pages 50-65, 2008. Springer
doi   bibtex
Bilò, D.; Böckenhauer, H.; Hromkovic, J.; Královic, R.; Mömke, T.; Widmayer, P.; and Zych, A. Reoptimization of Steiner Trees. In Proceedings of the11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), of LNCS, pages 258-269, 2008. Springer
doi   bibtex
Bilò, D.; Erlebach, T.; Mihalák, M.; and Widmayer, P. Discovery of Network Properties with All-Shortest-Paths Queries. In Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), of LNCS, pages 89-103, 2008. Springer
doi   bibtex
Bilò, D.; Gualà, L.; Proietti, G.; and Widmayer, P. Computational Aspects of a 2-Player Stackelberg Shortest Paths Tree Game. In Proceedings of the 4th International Workshop of Internet and Network Economics (WINE 2008), pages 251-262, 2008. Springer
doi   bibtex
Bilò, D.; Widmayer, P.; and Zych, A. Reoptimization of Weighted Graph and Covering Problems. In Proceedings of the 6th International Workshop on Approximation and Online Algorithms (WAOA 2008), pages 201-213, 2008. Springer
doi   bibtex
Brunner, J.; Mihalák, M.; Suri, S.; Vicari, E.; and Widmayer, P. Simple Robots in Polygonal Environments: A Hierarchy. In Proceedings of the International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS 2008), pages 111-124, 2008. Springer
doi   bibtex
Ceselli, A.; Gatto, M.; Lübbecke, M. E.; Nunkesser, M.; and Schilling, H. Optimizing the Cargo Express Service of Swiss Federal Railways. Transportation Science, 42(4): 450-465. 2008.
doi   bibtex
Das, S.; Gfeller, B.; and Widmayer, P. Computing Best Swaps in Optimal Tree Spanners. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 716-727, Gold Coast, Australia, 2008. Springer
doi   bibtex
Das, S.; Mihalák, M.; Srámek, R.; Vicari, E.; and Widmayer, P. Rendezvous of Mobile Agents When Tokens Fail Anytime. In Proceedings of the 12th International Conference on Principles of Distributed Systems (OPODIS 2008), pages 463-480, 2008. Springer
doi   bibtex
Flocchini, P.; Pagli, L.; Prencipe, G.; Santoro, N.; and Widmayer, P. Computing All the Best Swap Edges Distributively. J. Parallel Distrib. Comput., 68(7): 976-983. 2008.
doi   bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Arbitrary Pattern Formation by Asynchronous, Anonymous, Oblivious Robots. Theoretical Computer Science, 407(1-3): 412-447. 2008.
doi   bibtex
Fomin, F. V.; Golovach, P. A.; Hall, A.; Mihalák, M.; Vicari, E.; and Widmayer, P. How to Guard a Graph?. In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), pages 318-329, 2008. Springer
doi   bibtex
Gfeller, B.; Mihalák, M.; Suri, S.; Vicari, E.; and Widmayer, P. Angle Optimization in Target Tracking. In 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), pages 65-76, Gothenburg, Sweden, 2008. Springer
doi   bibtex
Hruz, T.; Laule, O.; Szabó, G.; Wessendorp, F.; Bleuler, S.; Oertle, L.; Widmayer, P.; Gruissem, W.; and Zimmermann, P. Genevestigator V3: A Reference Expression Database for the Meta-Analysis of Transcriptomes. Advances in Bioinformatics, 2008. 2008. Article ID 420747, 5 pages
bibtex
Suri, S.; Vicari, E.; and Widmayer, P. Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry. I. J. Robotic Research, 27(9): 1055-1067. 2008.
doi   bibtex
  2007 (17)
Anderegg, L.; Eidenbenz, S.; Peeters, L.; and Widmayer, P. Optimal Placement of Ad-Hoc Devices Under a VCG-Style Routing Protocol. In Proceedings of the 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2007) Wroclaw, Poland, volume 4837, of LNCS, 2007.
bibtex
Böckenhauer, H.; Forlizzi, L.; Hromkovic, J.; Kneis, J.; Kupke, J.; Proietti, G.; and Widmayer, P. On the Approximability of TSP on Local Modifications of Optimally Solved Instances. Algorithmic Operations Research, 2: 1000-1009. 2007.
bibtex
Bilò, D.; Derungs, J.; Guala, L.; Proietti, G.; and Widmayer, P. Locating Facilities on a Network to Minimize their Average Service Radius. In Springer Lecture Notes in Computer Science, 5., editor(s), Proceedings of the 18th International Symposium on Algorithms and Computation, Sendai (ISAAC 2007), of LNCS, pages 587-598, 2007.
bibtex
Derungs, J.; Jacob, R.; and Widmayer, P. Approximate Shortest Paths Guided by a Small Index. In Proceedings of the Workshop on Algorithms and Data Structures (WADS 2007), Halifax., volume 4619, of LNCS, pages 553-564, 2007.
bibtex
Erlebach, T.; Jacob, R.; Mihalák, M.; Nunkesser, M.; and Widmayer, P. An Algorithmic View on OVSF Code Assignment. Algorithmica, 47(3): 269-298. 2007.
bibtex
Gatto, M.; and Widmayer, P. On the Robustness of Graham's Algorithm for Online Scheduling. In Proceedings of the Workshop on Algorithms and Data Structures (WADS 2007), Halifax, volume 4619, of LNCS, pages 349-361, 2007. Springer
bibtex
Gfeller, B.; Mihalak, M.; Suri, S.; Vicari, E.; and Widmayer, P. Counting Targets with Mobile Sensors in an Unknown Environment. In Proceedings of the 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2007), Wroclaw, Poland, volume 4837, of LNCS, 2007.
bibtex
Gfeller, B.; Santoro, N.; and Widmayer, P. A Distributed Algorithm for Finding all best Swap Edges of a Minimum Diameter Spanning Tree. In Proceedings of the 21st International Symposium on Distributed Computing, Lemesos, Cyprus (DISC 2007), volume 4731, of LNCS, pages 268-282, 2007.
bibtex
Hall, A.; Pomm, C.; and Widmayer, P. A Combinatorial Approach to Multi-Domain Sketch Recognition. In Proceedings of the EUROGRAPHICS Workshop on Sketch-Based Interfaces and Modelling, Riverside, California (SBIM 2007), 2007.
bibtex
Hromkovic, J.; Mömke, T.; Steinhöfel, K.; and Widmayer, P. Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Operations Research, Vol. 2. 2007.
bibtex
Jacob, R. On shunting over a hump. Technical Report 576, ETH Zürich, Theoretical Computer Science, 2007.
On shunting over a hump [pdf]Paper   bibtex
Roos, F.; Jacob, R.; Grossmann, J.; Fischer, B.; Buhmann, J.; Gruissem, W.; Baginsky, S.; and Widmayer, P. PepSplice: Cache-Efficient Search Algorithms for Comprehensive Identification of Tandem Mass Spectra. Bioinformatics, 22(23): 3016-3023. 2007.
bibtex
Santoro, N.; and Widmayer, P. Distributed Computing in Presence of Mobile Faults. In Rajasekaran, S.; and Reif, J., editor(s), Handbook of Parallel and Distributed Computing. CRC Press, 2007.
bibtex
Santoro, N.; and Widmayer, P. Agreement in Synchronous Networks with Ubiquitous Faults. Theoretical Computer Science, 384 (2-3): 232-249. 2007.
bibtex
Suri, S.; Vicari, E.; and Widmayer, P. Simple Robots with Minimal Sensing. In Proceedings of the 22nd Conference on Artificial Intelligence, Vancouver (AAAI 2007), Canada, 2007.
bibtex
Suri, S.; Wattenhofer, R.; and Widmayer, P. 07151 Abstracts Collection. In Geometry in Sensor Networks. Dagstuhl. 2007.
bibtex
Hromkovic, J.; Kralovic, R.; Nunkesser, M.; and Widmayer, P. , editor s. 4th International Symposium on Stochastic Algorithms: Foundations and Applications. Volume 4665, of LNCS. 2007.Springer.
bibtex
  2006 (4)
Böcckenhauer, H.; Forlizzi, L.; Hromkovic, J.; Kneis, J.; Kupke, J.; Proietti, G.; and Widmayer, P. Reusing Optimal TSP Solutions for Locally Modified Input Instances. In Proceedings of the 4th IFIP International Conference on Theoretical Computer Science (IFIP TCS), Santiago de Chile, 2006.
bibtex
Gfeller, B.; Peeters, L.; Weber, B.; and Widmayer, P. Online Single Machine Batch Scheduling. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science (MFCS 2006), Stará Lesná, Slovakia, pages 424-435, 2006.
bibtex
Penna, P.; Proietti, G.; and Widmayer, P. Strongly Polynomial-Time Truthful Mechanisms in One Shot. In Proceedings of the 2nd International Workshop on Internet and Network Economics (WINE 2006), volume 4286, of LNCS, pages 377-388, 2006. Springer
bibtex
Proietti, G.; and Widmayer, P. Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii. In Proceedings of the International Symposium on Algorithms and Computation, Colcata (ISAAC 2006), volume 4288, of LNCS, pages 578-587, 2006. Springer
bibtex
  2005 (7)
Erlebach, T.; Jacob, R.; Mihalák, M.; Nunkessern, M.; Szabó, G.; and Widmayer, P. Joint Base Station Scheduling. In Persiano, G.; and Solis-Oba, R., editor(s), Proceedings of the Second International Workshop, Approximation and Online Algorithms, Bergen, Norway, September 14-16, Revised Selected Papers (WAOA 2004), volume 3351, of LNCS, 2005.
bibtex
Fischer, B.; Roth, V.; Roos, F.; Grossmann, J.; Baginsky, S.; Widmayer, P.; Gruissem, W.; and Buhmann, J. M. NovoHMM: A Hidden Markov Model for de Novo Peptide Sequencing. Anal. Chem., 77(22): 7265 -7273. 2005.
bibtex
Flocchini, P.; Pagli, L.; Prencipe, G.; Santoro, N.; Widmayer, P.; and Zuva, T. Computing All the Best Swap Edges Distributively. Principles of Distributed Systems. In Higashino, T., editor(s), Proceedings of the 8th International Conference, Grenoble, France, December 15-17, Revised Selected Papers (OPODIS 2004), volume 3544,, of LNCS, 2005. Springer
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Gathering of Asynchronous Robots with Limited Visibility. Theoretical Computer Science, 33(7(1-3)): 147-168. 2005.
bibtex
Proietti, G.; and Widmayer, P. A Truthful Mechanism for the Non-Utilitarian Minimum Radius Spanning Tree Problem. In Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms (ACM 2005), of LNCS, pages 195-202, 2005.
bibtex
Santoro, N.; and Widmayer, P. Majority and Unanimity in Synchronous Networks With Ubiquitous Dynamic Faults. In Proceedings of the 12 International Colloquium, Structural Information and Communication Complexity (SIROCCO 2005), volume 3499, of LNCS, pages 262-276, 2005. Springer
bibtex
Wattenhofer, M.; Wattenhofer, R.; and Widmayer, P. Geometric Routing Without Geometry. In Proceedigns of the 12 International Colloquium, Structural Information and Communication Complexity (SIROCCO 2005), volume 3499, of LNCS, pages 195-202, 2005. Springer
bibtex
  2004 (14)
Cieliebak, M.; Erlebach, T.; Hennecke, F.; Weber, B.; and Widmayer, P. Scheduling with Release Times and Deadlines on a Minimum Number of Machines. In Levy, J.; Mayr, E.; Mitchell, J.; and Kluwer, editor(s), Proceedings of the 18th IFIP World Computer Congress (WCC 2004), TC1 3rd International Conference on Theoretical Computer Science , Toulouse, France (TCS 2004), pages 209-222, 2004.
bibtex
Eidenbenz, S.; Hennessy, M.; Bueno, R. M.; Ruiz, F. T.; Widmayer, P.; and Conejo, R. Preface. Technical Report 312(1): 1-2, 2004.
bibtex
Erlebach, T.; Jacob, R.; Mihalák, M.; Nunkesser, M.; Szabó, G.; and Widmayer, P. An Algorithmic View on OVSF Code Assignment. In Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS 2004), pages 270-281, 2004.
bibtex
Fischer, B.; Roth, V.; Buhmann, J.; Grossmann, J.; Baginsky, S.; Gruissem, W.; Roos, F.; and Widmayer, P. A Hidden Markov Model for De Novo Peptide Sequencing. In Proceedings of the 18th Annual Conference on Neural Information Processing Systems (NIPS 2004), 2004.
bibtex
Gatto, M.; Glaus, B.; Jacob, R.; Peeters, L.; and Widmayer, P. Railway Delay Management: Exploring its Algorithmic Complexity. In Proceedings of 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), volume 3111, of LNCS, pages 199-211, 2004.
bibtex
Gatto, M.; Jacob, R.; Peeters, L.; Weber, B.; and Widmayer, P. Theory on the Tracks: A Selection of Railway Optimization Problems. Technical Report 4, 41-70, 2004.
bibtex
Gatto, M.; Jacob, R.; Peeters, L.; and Widmayer, P. On-Line Delay Management on a Single Transit Line. In Proceedings of the 4th Workshop on Algorithmic Methods and Models for Optimization of Railways, Bergen, Norway (ATMOS 2004), 2004.
bibtex
Melideo, G.; Penna, P.; Proietti, G.; Wattenhofer, R.; and Widmayer, P. Truthful Mechanisms for Generalized Utilitarian Problems. In Levy, J.; Mayr, E.; Mitchell, J.; and Kluwer, editor(s), Proceedings of the 18th IFIP World Computer Congress (WCC), TC1 3rd International Conference on Theoretical Computer Science (TCS), Toulouse, France (TCS 2004), pages 167-180, 2004.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Nearly Linear Time Minimum Spanning Tree Maintenance for Transient Node Failures. Algorithmica, 40(2): 119-132. 2004.
bibtex
Ottmann, T.; and Widmayer, P. . In Programmierung mit PASCAL.. Teubner Verlag, Stuttgart, 7 edition, 2004.
bibtex
Seeger, B.; and Widmayer, P. Geographical Information Systems. In Mehta, D. P.; and S.Sahni, editor(s), Handbook of Data Structures and Applications, of CRC, pages 1–22. Chapman & Hall, 2004.
bibtex
Wattenhofer, R.; and Widmayer, P. The Counting Pyramid: An Adaptive, Distributed Counting Scheme. Journal of Par¬allel and Distributed Computing, 64, No. 4: 449-460. 2004.
bibtex
Widmayer, P. Information Science - Datenfluten bändigen. Technical Report 6, 52-53, 2004.
bibtex
Eidenbenz, S.; Hennessy, M.; Morales, R.; Triguero, F.; Widmayer, P.; and Conejo, R. , editor s. Special Issue on ICALP 2002. Volume 312, Issue 1, 1-142, of Theoretical Computer Science. 2004.
bibtex
  2003 (13)
Alonso, G.; Kranakis, E.; Sawchuk, C.; Wattenhofer, R.; and Widmayer, P. Probabilistic Protocols for Node Discovery in Ad Hoc Multichannel Broadcast Networks. In Proceedings of the 2nd International Conference on Ad-Hoc, Mobile and Wireless Networks (ADHOC-NOW 2003), pages 104-115, 2003.
bibtex
Alonso, G.; Kranakis, E.; Wattenhofer, R.; and Widmayer, P. Probabilistic Protocols for Node Discovery in Ad-hoc, Single Broadcast Channel Network. In Proceedings of the 3rd International Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN 2003), of IPDPS 2003 WORKSHOPS, Nice, France, 2003.
bibtex
Anderegg, L.; Eidenbenz, S.; Gantenbein, M.; Stamm, C.; Taylor, D. S.; Weber, B.; and Widmayer, P. Train Routing Algorithms: Concepts, Design Choices, and Practical Consideration. In Proceedings 5th Workshop on Algorithm Engineering and Experiments (ALENEX 2003), 2003.
bibtex
Dittrich, J.; Seeger, B.; Taylor, D.; and Widmayer, P. On Producing Join Results Early. In Proceedings of the ACM SIGMOD/PODS 2003 Conference, pages 134-142, 2003.
bibtex
Eidenbenz, S.; Pagourtzis, A.; and Widmayer, P. Flexible Train Rostering. In Proceeings of the 14th International Symposium, Kyoto, Japan, December 15-17 (ISAAC 2003), of LNCS, pages 615-624, 2003.
bibtex
Eidenbenz, S.; and Widmayer, P. An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Computing, 32, No. 3: 654-670. 2003.
bibtex
Erlebach, T.; Jacob, R.; Mihalák, M.; Nunkesser, M.; Szabó, G.; and Widmayer, P. An Algorithmic View on OVSF Code Assignment. Technical Report 173, August 2003.
bibtex
Kranakis, E.; Penna, P.; Schludea, K.; Taylor, D.; and Widmayer, P. Improving Customer Proximity to Railway Stations. In Proceedings of the 5th Conference on Algorithms and Complexity May 28-30, 2003 Rome, Italy (CIAC 2003), pages 264-276, 2003.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Swapping a Failing Edge of a Single Source Shortest Paths Tree is Good and Fast. Algorithmica, 35(1): 56-74. 2003.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Finding the Most Vital Node of a Shortest Path. Theoretical Computer Science, 296, No. 1: 167-177. 2003.
bibtex
Schlude, K.; Soisalon-Soininen, E.; and Widmayer, P. Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst., 36, No. 6: 611-629. 2003.
bibtex
Soisalon-Soininen, E.; and Widmayer, P. Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. In Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, volume 2598, of LNCS, pages 278-292. Springer, 2003.
bibtex
Szabó, G.; Weicker, K.; Weicker, N.; and Widmayer, P. Evolutionary Multiobjective Optimization for Base Station Transmitter Placement with Frequency Assignment. IEEE Transactions on Evolutionary Computation (Special Issue on Evolutionary Multiobjective Optimization) April, 7, No. 2: 189-203. 2003.
bibtex
  2002 (8)
Anderegg, L.; Penna, P.; and Widmayer, P. Online Train Disposition: To Wait or Not To Wait?. In Proceedings of the ATMOS 2002, Satellite Workshop on Algorithmic Methods and Models for Optimization of Railways, Electronic Notes (ICALP 2002), volume 66 No. 6, of Theoretical Computer Science, 2002.
bibtex
Dittrich, J.; Seeger, B.; Taylor, D.; and Widmayer, P. Progressive Merge Join: A Generic and Non-Blocking Sort-Based Join Algorithm. In Proceedings of the 28th Very Large Databases Conference (VLDB 2002), Hong Kong, pages 299-310, 2002.
bibtex
Erlebach, T.; Gantenbein, M.; Hürliman, D.; Neyer, G.; Pagourtzis, A.; Penna, P.; Schlude, K.; Steinöfel, K.; Taylor, D.; and Widmayer, P. On the Complexity of Train Assignment Problems. In Proceedings of the 12th Intternational Symposium on Algorithms and Computation (ISAAC 01), volume 2223, of LNCS, pages 390-402, 2002. Springer
bibtex
Pomm, C.; and Widmayer, P. Developing Course Material With the Authoring On the Fly Concept - An Evaluation. In Proceedings of the 4th International Conference on New Educational Environments (ICNEE), volume 3.2, pages 11-14, 2002.
bibtex
Schlude, K.; Soisalon-Soininen, E.; and Widmayer, P. Distributed Highly Available Search Trees. In Proceedings of the 9th International Colloquium on Structural Information & Communication Complexity (SIROCCO 2002), Andros, Greece, volume Informatics 13, of Carleton Scientific, pages 259-274,, 2002.
bibtex
Soisalon-Soininen, E.; and Widmayer, P. Amortized Complexity of Bulk Updates in AVL-trees. In Penttonen, M.; and Schmidt, E. M., editor(s), Proceedings of the Algorithm Theory 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002), Turku, Finland, July 3-5, volume 2368, pages 439-448, 2002. Springer
bibtex
Szabó, G.; Weicker, N.; and Widmayer, P. Base Station Transmitter Placement with Frequency Assignment: an Evolutionary Approach. In Proceedings of the Advances in Nature-Inspired Computing workshops (PPSN VII 2002), pages 47-48, 2002.
bibtex
Widmayer, P.; Triguero, F.; Morales, R.; Hennessy, M.; Eidenbenz, S.; and Conejo, R. , editor s. Automata, Languages and Programming. Proceedings of the 29th International Colloquium (ICALP 2002), Malaga, Spain. Volume 2380, of LNCS. 2002.Springer.
bibtex
  2001 (12)
Eidenbenz, S.; Stamm, C.; and Widmayer, P. Inapproximability Results for Guarding Polygons and Terrains. Algorithmica, 31: 79-113. 2001.
bibtex
Eidenbenz, S.; and Widmayer, P. An Approximation Algorithm for Convex Cover with Logarithmic Performance Guarantee. In Proceedigns of the 9th Annual European Symposium on Algorithms (ESA 2001), volume 2161, of LNCS, pages 333-343, 2001. Springer
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Gathering of Asynchronous Oblivious Robots With Limited Visibility. In Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), volume 2010, of LNCS, pages 247-258, 2001. Springer
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Pattern Formation by Anonymous Robots Without Chirality. In Proceedings of the International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001),, of Carleton Scientific, Ottawa, Canada, 2001.
bibtex
Hromkovic, J.; Steinhöfel, K.; and Widmayer, P. Job Shop Scheduling With Unit Length Tasks: Bounds and Algorithms. In Proceedings of the 7th Italian Conference on Theoretical Computer Science (ICTCS 2001), Torino, volume 2202, of LNCS, pages 90-106, 2001. Springer
bibtex
Larsen, K.; Soisalon-Soininen, E.; and Widmayer, P. Relaxed Balance Through Standard Rotations. Algorithmica, 31: 501-512. 2001.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Finding a Most Vital Node of a Shortest Path. In Wang, J., editor(s), Proceedings of the 7th Annual International Conference on Computing and Combinatorics (COCOON) 2001, volume 2108, of LNCS, pages 278-287, 2001. Springer
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Finding all the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. Journal of Graph Algorithms and Applications, 5, No. 5: 39-57. 2001.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. A Faster Computation of the Most Vital Edge of a Shortest Path. Information Processing Letters, 79, No. 2: 81-85. 2001.
bibtex
Pagourtzis, A.; Penna, P.; Schlude, K.; Steinhöfel, K.; Taylor, D. S.; and Widmayer, P. Server Placements, Roman Domination and other Dominatin Set Variants. In Proceedings of the IFIP Theoretical Computer Science Conference (IFIP TCS 2001), 2001.
bibtex
Pajarola, R.; and Widmayer, P. Virtual Geoexploration: Concepts and Design Choices. International Journal of Computational Geometry and Applications, 11(1): 1-14. 2001.
bibtex
Widmayer, P.; Neyer, G.; and Eidenbenz, S. , editor s. Special Issue of Discrete and Applied Mathematics (DAM) on the 25th International Workshop, WG 1999, Ascona, Switzerland. Volume 113.September 2001.
bibtex
  2000 (9)
Doddi, S.; Marathe, M.; Ravi, S.; Taylor, D.; and Widmayer, P. Approximation Algorithms for Clustering to Minimize the Sum of Diameters. In Proceedings of the Scandinavian Workshop on Algorithms Theory (SWAT 2000), Bergen, of LNCS, pages 237-250, 2000. Springer
bibtex
Doddi, S. R.; Marathe, M.; Ravi, S.; Taylor, D.; and Widmayer, P. Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nordic J. Computing, 7(3): 185-203. 2000.
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Limits to Pattern Formation by Autonomous Mobile Robots. In Proceedings of the 3rd International Conference on Complex Systems (ICCS 2000), New England, 2000.
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Distributed Coordination of a Set of Autonomous Mobile Robots. In Proceedings of the of IEEE Intelligent Vehicles Symposium (IV 2000), Dearborn, USA, pages 480-485, 2000.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Maintaining a Minimum Spanning Tree Under Transient Node Failures. In Proceedings of the 8th Annual European Symposium on Algorithms (ESA), volume 1879, of LNCS, pages 346-355, 2000. Springer
bibtex
Nievergelt, J.; and Widmayer, P. Spatial Data Structures: Concepts and Design Choices. In Sack, J.; and Urrutia, J., editor(s), Handbook of Computational Geometry, pages 725-764. Elsevier, 2000.
bibtex
Pajarola, R.; and Widmayer, P. An Image Compression Method for Spatial Search. IEEE Transactions on Image Processing, 9(3): 357-365. 2000.
bibtex
Schneider, M.; Stamm, C.; Symanzik, J.; and Widmayer, P. Virtual Reality and Dynamic Statistical Graphics: A Bidirectional Link in a Heterogeneous, Distributed Computing Environment. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2000), Las Vegas, Nevada, USA,, volume IV, pages 2345- 2351, 2000.
bibtex
Hepp, K.; Nievergelt, J.; and Widmayer, P. , editor s. Latsis-Symposium 2000, ETH Zürich, Online Proceedings at www.inf.ethz.ch/latsis2000. 2000.
bibtex
  1999 (14)
Beck, M.; Eidenbenz, S.; Stamm, C.; Stucki, P.; and Widmayer, P. Worldview: A Virtual Reality Framework for the Design, Optimization and Management of Mobile Telematics Infrastructure. Technical Report 3, 32-33, June 1999.
bibtex
den Bercken, J. V.; Seeger, B.; and Widmayer, P. The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. In Proceedings of the International Conference on Data Engineering (IEEE1999), pages 257, 1999.
bibtex
Flocchini, P.; Prencipe, G.; Santoro, N.; and Widmayer, P. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In Proceedings of the 10th International Symposium on Algorithms and Computation (ISAAC 1999), Chennai, India, volume 1741, of LNCS, pages 93-102, 1999.
bibtex
Frank, A. U.; Grumbach, S.; Güting, R. H.; Jensen, C. S.; Koubarakis, M.; Lorentzos, N. A.; Manolopoulos, Y.; Nardelli, E.; Pernici, B.; Schek, H.; Scholl, M.; Sellis, T. K.; Theodoulidis, B.; and Widmayer, P. Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Record, 28(3): 12-21. 1999.
Chorochronos: A Research Network for Spatiotemporal Database Systems [link]Link   bibtex
Ihler, E.; Reich, G.; and Widmayer, P. Class Steiner Trees and VLSI Design. Discrete Applied Mathematics, 90: 173-194. 1999.
bibtex
Maeser, F.; Nievergelt, J.; Rolim, J.; Schlude, K.; Sosnowska, D.; Widmayer, P.; and Wirth, C. Worldview Transport Network Management – Cooperative and Competitive Decisions in Distributed Combinatorial Optimization. Technical Report 3, 28-29, June 1999.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. How to Swap a Failing Edge of a Single Source Shortest Paths Tree. In Proceedings of the 5th Annual International Computing and Combinatorics Conference (COCOON 99), Tokyo, Japan, volume 1627, of LNCS, pages 144–153, 1999. Springer
bibtex
Soisalon-Soininen, E.; and Widmayer, P. Concurrency and Recovery in Full-Text Indexing. In Proceedings of the String Processing and Information Retrieval Symposium (SPIRE 1999), Cancun, Mexico, of IEEE Computer Society, pages 192-198, Los Alamos, California, 1999.
bibtex
Wattenhofer, R.; and Widmayer, P. A Unified Analysis of Distributed Counting with Queueing Theory. In Santoro, N.; and Widmayer, P., editor(s), Distributed Data and Structures (WDAS 1999), of Proceedings in Informatics 2, pages 84-97,, 1999. Carleton Scientific
bibtex
Widmayer, P. Die Konkurrenz selbstsüchtiger Computer: Ein ökonomisches Problem?. In Lausen, G.; Oberweis, A.; and Schlageter, G., editor(s), Angewandte Informatik und Formale Beschreibungsverfahren, Festschrift zum 60. Geburtstag von Wolffried Stucky, volume 9, of Teubner-Texte zur Informatik, pages 287-298. Teubner-Verlag, Stuttgart, 1999.
bibtex
Widmayer, P.; Neyer, G.; and Eidenbenz, S. . In Special issue of the International Journal of Foundations of Computer Science (IJFCS) on the 25th International Workshop, WG 1999, Ascona, Switzerland, volume 11. September 1999.
bibtex
Breitbart, Y.; Das, S. K.; Santoro, N.; and Widmayer, P. , editor s. Distributed Data and Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999. Volume 6, of Proceedings in Informatics. 1999.Carleton Scientific.
bibtex
Munro, I.; Näher, S.; and Widmayer, P. , editor s. The Fourth Dagstuhl Seminar on Data Structures. Volume 202, of Dagstuhl-Seminar-Report. 1999.
bibtex
Widmayer, P.; Neyer, G.; and Eidenbenz, S. , editor s. Graph Theoretic Concepts in Computer Science. Proceedings of the 25th International Workshop, WG 1999, Ascona. Volume 1665, of LNCS. 1999.Springer.
bibtex
  1998 (11)
Eidenbenz, S.; Stamm, C.; and Widmayer, P. Inapproximability of Some Art Gallery Problems. In Proceedings of the 10th Canadian Conference on Computational Geometry (CCCG 1998), Montreal, Canada, 1998.
bibtex
Eidenbenz, S.; Stamm, C.; and Widmayer, P. Positioning Guards at Fixed Height Above a Terrain - an Optimum Inapproximability Result. In Proceedings of the 6th Annual European Symposium on Algorithms (ESA 1998), volume 1461, pages 187-198, 1998. Springer
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Finding a Detour-Critical Edge of a Shortest Path Between Two Nodes. Infor¬mation Processing Letters, 67, No. 1: 51-54. 1998.
bibtex
Nardelli, E.; Proietti, G.; and Widmayer, P. Finding all the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. In Proceedings of the 6th Annual European Symposium on Algorithms (ESA), volume 1461, of LNCS, pages 55-66, 1998. Springer
bibtex
Pajarola, R.; Ohler, T.; Stucki, P.; Szabó, K.; and Widmayer, P. The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. In Proceedings of the 14th International Conference on Data Engineering (ICDE 1998), Orlando, pages 550-557, 1998.
bibtex
Stamm, C.; Eidenbenz, S.; Beck, M.; Stucki, P.; and Widmayer, P. A Prototype System for Light Propagation in Terrains. In F.-E. Wolter, N. M. P., editor(s), Proceedings of the Computer Graphics International (CGI 1998), Hannover, of IEEE Computer Society, Los Alamitos, CA, 1998.
bibtex
Symanzik, J.; Pajarola, R.; and Widmayer, P. XGobi and XploRe Meet ViRGIS. In Proceedings of the 1998 Section on Statistical Graphics, American Statistical Association, Alexandria, VA, pages 50-55, 1998.
bibtex
Wattenhofer, R.; and Widmayer, P. The Counting Pyramid: an Adaptive Distributed Counting Scheme. In Gargano, L.; and Peleg, D., editor(s), Proceedings of the 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO 1998),, of Carleton Scientific, pages 145-157, Ottawa, Canada, 1998.
bibtex
Wattenhofer, R.; and Widmayer, P. Fast Counting With the Optimum Combining Tree. Technical Report 1998.
bibtex
Wattenhofer, R.; and Widmayer, P. An Inherent Bottleneck in Distributed Counting. Journal of Parallel and Distributed Computing, 49: 135-145. 1998.
bibtex
Wattenhofer, R.; and Widmayer, P. Distributed Counting at Maximum Speed. Technical Report 1998.
bibtex
  1997 (12)
Asano, T.; Ranjan, D.; Roos, T.; Welzl, E.; and Widmayer, P. Space Filling Curves and Their Use in the Design of Geometric Data Structures. Theoretical Computer Science, 181: 3-15. 1997.
bibtex
den Bercken, J. V.; Seeger, B.; and Widmayer, P. A Generic Approach to Bulk Loading Multidimensional Index Structures. In Proceedings of the 23rd International Conference on Very Large Databases (VLDB 1997), Athens, pages 406-415, 1997. Morgan Kaufmann Publishing
bibtex
Bugnion, E.; Roos, T.; Wattenhofer, R.; and Widmayer, P. Space Filling Curves Versus Random Walks. In Kreveld, v.; Nievergelt; Roos; and Widmayer, editor(s), Proceedings of the Algorithmic Foundations of Geographic Information Systems, volume 1340, of LNCS, 1997. Springer
bibtex
Larsen, K.; Soisalon-Soininen, E.; and Widmayer, P. Relaxed Balance Through Standard Rotations. In Proceedings of the 5th International Workshop on Algorithms and Data Structures (WADS 1997), volume 1272, of LNCS, pages 450-461, 1997. Springer
bibtex
Neyer, G.; and Widmayer, P. Singularities Make Spatial Join Scheduling Hard. In Algorithms and Computation, volume 1350, of LNCS, pages 293-302, 1997. Springer
bibtex
Nievergelt, J.; and Widmayer, P. Spatial Data Structures - Concepts and Design Choices. In Kreveld, v.; Nievergelt; Roos; and Widmayer, editor(s), Proceedings of the Algorithmic Foundations of Geographic Information Systems, volume 1340, of LNCS, 1997. Springer
bibtex
Pajarola, R.; and Widmayer, P. In 80 Sekunden um die Welt. Technical Report 266, 38 - 41, ETH Zürich, June 1997.
bibtex
Soisalon-Soininen, E.; and Widmayer, P. Relaxed Balancing in Search Trees. In Du, D.; and Ko, K., editor(s), Invited Contribution to the Festschrift for the 60th Birthday of Ron Book, of Advances in Algorithms, Languages, and Complexity, pages 267- 283. Kluwer Academic Publishers, 1997.
bibtex
Wattenhofer, R.; and Widmayer, P. Das Schweizer Taschenmesser der parallelen Algorithmen. In Prinzipien des Algorithmenentwurfs, pages 103- 121. Spektrum Akademischer Verlag, Heidelberg, T. Ottmann edition, 1997.
bibtex
Wattenhofer, R.; and Widmayer, P. Towards Decentralized Distributed Data Structures. In Proceedings of the World Conference on Systemics, Cybernetics and Informatics (IIIS 1997), Caracas, pages 490 - 496, 1997.
bibtex
van Kreveld, M.; Nievergelt, J.; and T. Roos, P. W. , editor s. Algorithmic Foundations of Geographic Information Systems. Volume 1340, of LNCS. 1997.Springer.
bibtex
Krizanc, D.; and Widmayer, P. , editor s. 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO 1997), Monte Verita, Ascona, Switzerland, July 24-26. of Proceedings in Informatics 1. 1997.Carleton Scientific.
bibtex
  1996 (9)
Becker, B.; Franciosa, P.; Gschwind, S.; Leonardi, S.; Ohler, T.; and Widmayer, P. Enclosing a Set of Objects by Two Minimum Area Rectangles. Journal of Algorithms, 21: 520-541. 1996.
bibtex
Becker, B.; Gschwind, S.; Ohler, T.; Seeger, B.; and Widmayer, P. An Asymptotically Optimal Multiversion B-tree. The VLDB Journal, Vol. 5,, 5(4): 264-275. 1996.
bibtex
Fei, S.; and Widmayer, P. Approximate Multiple String Searching by Clustering. In Proceedings of the 7th Workshop on Genome Informatics (GIW 1996), of Universal Academy Press, pages 33 - 41, 1996.
bibtex
Pajarola, R.; and Widmayer, P. Pattern Matching in Compressed Raster Images. In Proceedings of the 3rd South American Workshop on String Processing (WSP 1996), of Carleton University Press, pages 228 - 242, 1996.
bibtex
Pajarola, R.; and Widmayer, P. Spatial Indexing into Compressed Raster Images. In Proceedings of the International Workshop on Multimedia Database Management Systems (MMDMS 1996), of IEEE Computer Society Press, pages 94 - 100, 1996.
bibtex
Pajarola, R.; Widmayer, P.; Stucki, P.; and Szabó, K. ViRGIS - Virtual Reality und Geographische Informationssysteme. Technical Report 17, 25 - 28, 1996.
bibtex
Pajarola, R.; Widmayer, P.; Stucki, P.; and Szabó, K. Virtuell durch die Realität. Technical Report 2, 40 - 41, 1996.
bibtex
Widmayer, P. ERASMUS / ECTS Information Package. Technical Report Department of Computer Science, 1996.
bibtex
Swiridow, A.; Widmayer, P.; Oberhoff, W.; and Unger, H. , editor s. New Media for Education and Training in Computer Science. Proceedings of 2nd Russian-German Symposium, Moscow. 1996.infix publishing, St. Augustin.
bibtex
  1995 (16)
Nguyen, V. H.; and Widmayer, P. Binary Space Partitions for Sets of Hyperrectangles. In Proceedings of the Asian Computing Science Conference on Algorithms, Concurrency and Knowledge (ACSC 1995), pages 59-72, 1995.
Binary Space Partitions for Sets of Hyperrectangles [link]Link   bibtex
d'Amore , F.; Nguyen, V.; Roos, T.; and Widmayer, P. On Optimal Cuts of Hyperrectangles. Computing, 55: 191-206. 1995.
bibtex
Asano, T.; Ranjan, D.; Roos, T.; Welzl, E.; and Widmayer, P. Space Filling Curves and Their Use in the Design of Geometric Data Structures. In Proceedings of Second Latin American Symposium on Theoretical Informatics (LATIN 1995, Santiago de Chile, volume 911, of LNCS, pages 36-48, 1995. Springer
bibtex
Becker, B.; Franciosa, P.; Gschwind, S.; Ohler, T.; Thiemt, G.; and Widmayer, P. A Polynomial Time Algorithm for Splitting R-Tree Blocks Optimally. Technical Report 1995.
bibtex
Becker, B.; Pfefferle, G.; and Widmayer, P. Der PR-Baum: Eine dynamische Zugriffsstruktur zur Speicherung gewichteter, ausgedehnter Objekte. Technical Report 1995.
bibtex
Bugnion, E.; Roos, T.; Shi, F.; Widmayer, P.; and Widmer, F. A Spatial Index for Approximate Multiple String Matching. JBCS Special Issue on String Processing, J1(3): 28-35. 1995.
bibtex
Bugnion, E.; Roos, T.; and Widmayer, P. Indexing Points With Space Filling Curves, In Preparation. Technical Report 1995.
bibtex
Ihler, E.; Reich, G.; and Widmayer, P. Class Steiner Trees and VLSI Design. Technical Report 1995.
bibtex
Kröll, B.; and Widmayer, P. Balanced Distributed Search Trees Do Not Exist. In Proceedings of the 4th International Workshop on Algorithms and Data Structures (WADS 1995), volume 955, of LNCS, pages 50-61, 1995.
bibtex
Kröll, B.; and Widmayer, P. How To Distribute a Tree. Technical Report 1995.
bibtex
Malmi, L.; Nurmi, O.; Soisalon-Soininen, E.; and Widmayer, P. Relaxed-Balanced Search Structures for Large Embedded Systems. Technical Report 1995.
bibtex
Malmi, L.; Soisalon-Soininen, E.; and Widmayer, P. Periodical Rebalancing of AVL trees. Technical Report 1995.
bibtex
Szabó, K.; Stucki, P.; Aschwanden, P.; Ohler, T.; Pajarola, R.; and Widmayer, P. A Virtual Reality Based System Environment for Intuitive Walk-Through and Exploration of Large-Scale Tourist Information. In Schertler; Schmid, W.; Tjoa, B. M.; and A., W. H., editor(s), Enter'95: Information and Communication Technologies in Tourism, pages 10-15, 1995. Springer
bibtex
Widmayer, P. Grundlegende Datenstrukturen. In Taschenbuch der Mathematik, Teil II, 7th Edition. Teubner Verlag, 7 edition, 1995.
bibtex
Widmayer, P. Review on the Book "The Steiner Tree Problem". Technical Report Hwang, Richards and Winter, 1995.
bibtex
Huber-Wäschle, F.; Schauer, H.; and Widmayer, P. , editor s. Herausforderungen eines globalen Informationsverbundes für die Informatik, Jahrestagung GI und SI (GISI 1995). of Informatik aktuell. 1995.Spring.
bibtex
  1994 (10)
Fessler, R.; Ottmann, T.; and Widmayer, P. Lower Bounds on the Space Requirement of a Class of Geometric Problems. Technical Report 60, Universität Freiburg, Institut für Informatik, October 1994.
bibtex
Kröll, B.; and Widmayer, P. Distributing a Search Tree Among a Growing Number of Processors. In Proceedings of the International Conference on the Management of Data (ACM SIGMOD 1994), Minneapolis, pages 265-276, 1994.
bibtex
Nguyen, V.; Ohler, T.; and Widmayer, P. VisTool: A Visualization Tool for Spatial Access Structures. In Proceedings of the International Conference on Advanced Research in Geographic Information Systems (IGIS 1994), Ascona, volume 884, of LNCS, 1994. Springer
bibtex
Ohler, T.; and Widmayer, P. A Brief Tutorial Introduction to Data Structures for Geometric Databases. In Paredaens, E. J.; and Tenenbaum, L., editor(s), Advances in Database Systems, Implementations and Applications, volume 347, of CISM Courses and Lectures, pages 329-351, 1994. International Centre for Mechanical Sciences, Udine, Springer
bibtex
Ohler, T.; and Widmayer, P. Data Structures and Algorithms for Geometric Information Systems: Selected Topics. In Paredaens, J.; and Tenenbaum, L., editor(s), Advances in Database Systems, Implementations and Applications, volume 347, of CISM Courses and Lectures, pages 353-364, 1994. International Centre for Mechanical Sciences, Udine, Springer
bibtex
Ohler, T.; and Widmayer, P. Geographic Information Systems: An Example. In Paredaens, J.; and Tenenbaum, L., editor(s), Advances in Database Systems, Implementations and Applications, volume 347, of CISM Courses and Lectures, pages 365-377, 1994. International Centre for Mechanical Sciences, Udine, Springer
bibtex
Roos, T.; Fei, S.; and Widmayer, P. A Data Structure for Approximate String Searching. In Proceedings of the 27th Hawaii International Conference on Systems Sciences (ACM-IEEE 1994), Maui, Hawaii, 1994.
bibtex
Roos, T.; and Widmayer, P. k-Violation Linear Programming. In Proceedings of the 16th Conference on System Modelling and Optimization (IFIP-TC 7), Compiegne, France, volume 180, of LNCS, pages 855 - 862, 1994. Springer
bibtex
Roos, T.; and Widmayer, P. k-Violation Linear Programming. Information Processing Letters, 52: 109-114. 1994.
bibtex
Nievergelt, J.; Roos, T.; Schek, H.; and Widmayer, P. , editor s. Proceedings of the International Workshop on Advanced Research in Geographic Information Systems IGIS 1994, Ascona, Switzerland. 1994.
bibtex
  1993 (8)
d'Amore , F.; Roos, T.; and Widmayer, P. An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. In Mudur, S.; and Pattanaik, S., editor(s), Proceedings of the International Conference on Computer Graphics: Interaction, Design, Modelling and Visualization (ICCG 1993), Bombay, India, volume 9, of IFIP Transactions B, 1993. Elsevier Science Publishers B. V., North-Holland
bibtex
Becker, B.; Gschwind, S.; Ohler, T.; Seeger, B.; and Widmayer, P. On Optimal Multiversion Access Structures. In Proceedings of the 3rd International Symposium on Advances in Spatial Databases., volume 692, of LNCS, pages 123-141, 1993. Springer
bibtex
Bugnion, E.; Roos, T.; Shi, F.; Widmayer, P.; and Widmer:, F. A Spatial Index for Approximate Multiple String Matching. In Baeza-Yates, R.; and Ziviani, N., editor(s), Proceedings of the 1st South American Workshop on String Processing (SP 1993), Belo Horizonte, Brazil, pages 43-53, 1993.
bibtex
Hein, H.; Heyderhoff, P.; Krückeberg, F.; Miklitz, G.; and Widmayer, P. 4th International Olympiad in Informatics: Report. Technical Report Broschüre beim Bundeswettbewerb Informatik, Tübingen, Deutschland, 1993.
bibtex
Nguyen, V.; Roos, T.; and Widmayer, P. Balanced Cuts of a Set of Hyperrectangles. In Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG 1993), Waterloo, Ontario, pages 121-126, 1993.
bibtex
Nievergelt, J.; and Widmayer, P. Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. The Computer Journal, 36, No. 2: 107-116,. 1993.
bibtex
Pagel, B.; Six, H.; Toben, H.; and Widmayer, P. Towards an Analysis of Range Query Performance in Spatial Data Structures. In Proceedings of the 12th Symposium on Principles of Database Systems (ACM SIGACT-SIGMOD-SIGART 1993), Washington, DC, USA, pages 214-221, 1993.
bibtex
Widmayer, P. Von der gelegentlichen Unfähigkeit, Fragen zu beantworten. Technical Report Verein der Informatikstudenten, 1993.
bibtex
  1992 (4)
Becker, B.; Franciosa, P.; Gschwind, S.; Ohler, T.; Thiemt, G.; and Widmayer, P. Enclosing Many Boxes by an Optimal Pair of Boxes. In Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1992), Cachan, volume 577, of LNCS, pages 475-486, 1992. Springer
bibtex
Hutflesz, A.; Widmayer, P.; and Zimmermann, C. Global Order Makes Spatial Access Faster. In Proceedings of the International Workshop on Data Base Management Systems for Geographical Applications (ESPRIT 1992), of ESPRIT Basic Research, pages 161-176, 1992. Springer
bibtex
van Leeuwen, J.; and Widmayer, P. Fundamental Algorithms and Data Structures. In Jr., E. C.; Lenstra, J.; and Kan, A. R., editor(s), Handbooks in Operations Research and Management Science, volume 3, of Computation. Elsevier Science Publishers, 1992.
bibtex
Six, H.; and Widmayer, P. Spatial Access Structures for Geometric Databases. In Monien, B.; and Ottmann, T., editor(s), Data Structures and Efficient Algorithms, Final Report on the DFG Special Joint Initiative, volume 594, of LNCS, pages 214-232, 1992. Springer
bibtex
  1991 (6)
Becker, B.; Franciosa, P.; Gschwind, S.; Ohler, T.; Thiemt, G.; and Widmayer, P. An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. In Proceedings of the International Workshop on Computational Geometry (CG 1991), Bern, volume 553, of LNCS, pages 13-25, 1991. Springer
bibtex
Becker, B.; Six, H.; and Widmayer, P. Spatial Priority Search: An Access Technique for Scaleless Maps. In Proceedings of the International Conference on the Management of Data (ACM SIGMOD 1991), Denver, pages 128-137, 1991.
bibtex
Henrich, A.; Hilbert, A.; Six, H.; and Widmayer, P. Anbindung einer räumlich clusternden Zugriffsstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. In Proceedings of the GI-Workshop Datenbanksysteme in Büro, Technik und Wissenschaft (GI 1999), Kaiserslautern, volume 270, of Informatik Fachberichte, pages 161-177, 1991. Springer
bibtex
Ihler, E.; Reich, G.; and Widmayer, P. On Shortest Networks for Classes of Points in the Plane. In Proceedings of the International Workshop on Computational Geometry (CG 1991), Bern, volume 553, of LNCS, pages 103-111, 1991. Springer
bibtex
Widmayer, P. Datenstrukturen für Geodatenbanken. In Vossen, G.; and K.-U. Witt, O., editor(s), Entwicklungstendenzen bei Datenbank-Systemen., pages 317-361. Oldenburg, 1991.
bibtex
Widmayer, P. On Graphs Preserving Rectilinear Shortest Paths in the Presence of Obstacles. Annals of Operations Research, Ed. P.L. Hammer, 33, Topological Network Design, Baltzer: 557-575. 1991.
bibtex
  1990 (5)
Becker, B.; Six, H.; and Widmayer, P. Massstabsunabhängige Verwaltung von Landschaftsdaten. In Proceedings Vol. II of the 20th Annual Symposium of the Gesellschaft für Informatik, Stuttgart, volume 258, of Informatik-Fachberichte, pages 487-496, 1990. Springer
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. The R-File: An Efficient Access Structure for Proximity Queries. In Proceedings of the 6th International Conference on Data Engineering (IEEE 1990), pages 372-379, 1990.
bibtex
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. On the Power of Safe Locking. Journal of Computer and System Sciences, 40, No. 2: 269-288. 1990.
bibtex
Santoro, N.; and Widmayer, P. Distributed Function Evaluation in the Presence of Transmission Faults. In Proceedings of the International Symposium on Algorithms (SIGAL 1990), Tokyo,, volume 450, of LNCS, pages 358-367, 1990. Spr
bibtex
Widmayer, P.; and et al Bundeswettbewerb Informatik, Aufgaben und Lösungen. Bände 1 und 2. Technical Report P. Heyderhoff, Klett-Verlag, 1989 und, 1990.
bibtex
  1989 (12)
Friedel, J.; and Widmayer, P. A Simple Proof of the Steiner Ratio Conjecture for Five Points. SIAM J. Appl. Math., 49, No. 3: 960-967. 1989.
bibtex
Henrich, A.; Six, H.; and Widmayer, P. Paging Binary Trees with External Balancing. In Nagl, M., editor(s), Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science WG 1989), Castle Rolduc, volume 411, of LNCS, pages 260-276, 1989.
bibtex
Henrich, A.; Six, H.; and Widmayer, P. The LSD-Tree: Spatial Access to Multidimensional Point- and Non-Point Objects. In Proceedings of the 15th International Conference on Very Large Data Bases (VLDB 1989), pages 45-53, 1989.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. Proximity Queries in Geometric Databases. Technical Report 16, Institut für Informatik and Universiät Freiburg and Germany., 1989.
bibtex
Ottmann, T.; and Widmayer, P. COSTOC - Computerunterstützter Informatikunterricht. In Fischer, P.; Mandl, H.; and Meynersen, K., editor(s), Invited paper in: Interaktives Lernen mit neuen Medien: Möglichkeiten und Grenzen, pages 157-163, 1989. Deutsches Institut für Fernstudien an der Universitüt Tübingen
bibtex
Ottmann, T.; and Widmayer, P. Hashverfahren. HyperCOSTOC-Course and Documentation COSTOC Course. H. Maurer, Hofbauer edition, 1989.
bibtex
Ottmann, T.; and Widmayer, P. Ausgewählte Algorithmen und Datenstrukturen. HyperCOSTOC-Course Vol. 26 and Documentation COSTOC Course. Ed. H. Maurer, Hofbauer, edition, 1989.
bibtex
Ottmann, T.; and Widmayer, P. Trees. HyperCOSTOC-Course Vol. 6 and Documentation COSTOC Course. H. Maurer, Hofbauer, 1988; German Version: Baume edition, 1989.
bibtex
Reich, G.; and Widmayer, P. Beyond Steiner's Problem: A VLSI Oriented Generalization. In Nagl, M., editor(s), Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, Castle Rolduc, volume 444, of LNCS, pages 196-210, 1989.
bibtex
Santoro, N.; and Widmayer, P. Time is not a Healer. In Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS 1989), volume 349, of LNCS, pages 304-313, 1989.
bibtex
Widmayer, P. Network Design Issues in VLSI. In Smith, J. M.; and Winter, P., editor(s), Invited paper at NATO ARW on Topological Network Design: Analysis and Synthesis, Kopenhagen, 1989.
bibtex
Widmayer, P.; Wu, Y.; and Wong, C. A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Informatica, Vol. 23, 223-229, 1986; also in: Advances in Discrete Mathematics and Computer Science, Vol. IV-V: Steiner Minimal Trees, Eds. F.K. Hwang, D. Richards, Hadronic Press, Nonantum, Massachusetts,1989. 1989.
bibtex
  1988 (12)
Hutflesz, A.; Six, H.; and Widmayer, P. Dynamic Z-Hashing. Technical Report 189, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Germany, 1988.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. Globally Order Preserving Multidimensional Linear Hashing. In Proceedings of the 4th International Conference on Data Engineering (IEEE 1988), pages 572-579, 1988.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. Twin Grid Files: Space Optimizing Access Schemes. In Proceedings of the Conference on Management of Data (ACM SIGMOD 1988), pages 183-190, 1988.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. The Twin Grid File: A Nearly Space Optimal Index Structure. In Proceedings of the Intenational Conference on Extending Database Technology (EDBT 1988), volume 303, of LNCS, pages 352-363, 1988.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. Twin Grid Files: A Performance Evaluation. In Proceedings of the Workshop on Computational Geometry (CG 1988), volume 333, of LNCS, pages 15-24, 1988.
bibtex
Hutflesz, A.; Six, H.; and Widmayer, P. Beschreibungsverfahren. Technical Report 189, Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Germany, 1988.
bibtex
Ottmann, T.; and Widmayer, P. Computational Geometry. HyperCOSTOC-Course Vol. 1 and Documentation COSTOC Course. H. Maurer, Hofbauer 1988; German Version: Geometrische Algorithmen edition, 1988.
bibtex
Ottmanna, T.; and Widmayer, P. Erstellung und Nutzung von Präsentationsgraphiklektionen für den Informatikunterricht. Technical Report Computer-Investitionsprogramm (CIP) im Hochschulbereich: Sachstand und Perspektiven, 1988.
bibtex
Rawlins, G.; Widmayer, P.; and Wood, D. Hole Problems for Rectangles in the Plane. SIAM Journal on Discrete Mathematics, 1: 86-97. 1988.
bibtex
Six, H.; and Widmayer, P. Spatial Searching in Geometric Databases. In Proceedings of the 4th IEEE International Conference on Data Engineering (IEEE 1988), pages 496-503, 1988.
bibtex
Widmayer, P.; Woo, L.; and Wong, C. Maximizing Pin Alignment in Semi-Custom Chip Circuit Layout. Integration, the VLSI journal, 6: 3-33. 1988.
bibtex
Widmayer, P.; and Wood, D. A Time and Space Optimal Algorithm for Boolean Mask Operations for Orthogonal Polygons. Computer Vision, Graphics, and Image Processing, 41: 4-27. 1988.
bibtex
  1987 (7)
Ottmann, T.; and Widmayer, P. Erstellung und Einsatz von Präsentationsgraphiklektionen für den Informatikunterricht. Technical Report 3, Institut für Informatik, Universität Freiburg, Germany, 1987.
bibtex
Rottke, T.; Six, H.; and Widmayer, P. On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. In Göttler, H.; and Schneider, H. J., editor(s), Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, volume 314, of LNCS, pages 94-105, 1987.
bibtex
Widmayer, P. Programmier-Olympiade 1987 in Sofia. In Informatik Spektrum, volume 10, pages 223-224. August 1987.
bibtex
Widmayer, P. Programmier-Olympiade 1987 in Sofia. Technical Report 10, 223-224, August 1987.
bibtex
Widmayer, P.; and Wood, D. Time and Space Optimal Contour Computation For a Set of Rectangles. Information Processing Letterscessing Letters, 24: 35-338. 1987.
bibtex
Widmayer, P.; Wu, Y.; and Wong, C. On Some Distance Problems in Fixed Orientations. SIAM Journal on Computing, 16: 728-746. 1987.
bibtex
Wu, Y.; Widmayer, P.; Schlag, M.; and Wong, C. Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IEEE Transactions on Computers, C-36: 321-331. 1987.
bibtex
  1986 (8)
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. Towards On-Line Schedulers Based on Pre-Analysis Locking. In Ausiello, G.; and Atzeni, P., editor(s), Proceedings of the International Conference on Database Theory (ICDT 1986), Rome, volume 243, of LNCS, pages 242-259, 1986.
bibtex
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. Pre-Analysis Locking. Information and Control, 70: 193-215. 1986.
bibtex
Ottmann, T.; Stork, H.; and Widmayer, P. Hochschul-Didaktik: Können Computer Professoren ersetzen?. Technical Report November 1986.
bibtex
Ottmann, T.; and Widmayer, P. Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. In Proceedings of the GI-Fachtagung Informatik-Grundbildung in Schule und Beruf (GI 1986), Kaiserslautern, volume 129, of Informatik-Fachberichte, pages 420-431, 1986. Springer
bibtex
Six, H.; and Widmayer, P. Hintergrundspeicherstrukturen für ausgedehnte Objekte. In Hommel, G.; and Schindler, S., editor(s), Proceedings of the 16. Jahrestagung der Gesellschaft für Informatik, Berlin, volume 126, of Informatik-Fachberichte, pages 538-552, 1986. Springer
bibtex
Widmayer, P. On Approximation Algorithms for Steiner's Problem in Graphs. In Tinhofer, G.; and Schmidt, G., editor(s), Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1986), Bernried, volume 246, of LNCS, pages 17-28, 1986.
bibtex
Widmayer, P. Fast Approximation Algorithms for Steiner's Problem in Graphs. Ph.D. Thesis, Universität Karlsruhe, Germany, 1986.
bibtex
Widmayer, P.; Wu, Y.; Schlag, M.; and Wong, C. On Some Union and Intersection Problems for Polygons with Fixed Orientations. Computing, 36: 183-197. 1986.
bibtex
  1985 (8)
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. In Proceeding of the 11th International Conference on Very Large Data Bases (VLDB 1985) , Stockholm, pages 270-281, 1985.
bibtex
Ottmann, T.; Widmayer, P.; and Wood, D. A Fast Algorithm for the Boolean Masking Problem. Computer Vision, Graphics, and Image Processing, 30: 249-268. 1985.
bibtex
Ottmann, T.; Widmayer, P.; and Wood, D. A Worst-Case Efficient Algorithm for Hidden-Line Elimination. International Journal of Computer Mathematics, 18: 93-119. 1985.
bibtex
Widmayer, P.; Woo, L.; and Wong, C. Maximizing Pin Alignment in VLSI-Layout. In Proceedings of the IFIP International Conference (VLSI 1985), Tokyo, pages 369-378, 1985.
bibtex
Widmayer, P.; Wu, Y.; and Wong, C. Distance Problems in Computational Geometry for Fixed Orientations. In Proceedings of the Symposium on Computational Geometry ( ACM-SIGGRAPH-SIGACT 1985), Baltimore, pages 186-195, 1985.
bibtex
Widmayer, P.; Wu, Y.; and Wong, C. On the Approximation of Steiner Minimal Trees in Graphs. Technical Report Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Germany, 1985.
bibtex
Wong, C.; and Widmayer, P. An Optimal Algorithm for the Maximum Alignment of Terminals. Information Processing Letters, 20: 75-82. 1985.
bibtex
Wu, Y.; Widmayer, P.; Schlag, M.; and Wong, C. Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. In Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science (WG 1985), Würzburg, pages 409-420, 1985.
bibtex
  1984 (4)
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. Maximal Concurrency by Locking. In 3rd Symposium on Principles of Database Systems (ACM SIGACT-SIGMOD 1984), Waterloo, Ontario, Canada, pages 38-44, 1984.
bibtex
Lausen, G.; Soisalon-Soininen, E.; and Widmayer, P. On Maximal Concurrency by Locking in Database Systems. In Proceedings of the W. S. on Theoretical Computer Science, Lammi, Finnland, pages 315-327, 1984.
bibtex
Ottmann, T.; and Widmayer, P. Solving Visibility Problems by Using Skeleton Structures. In Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science (MFCS 1984), Prag, Lecture Notes in Computer Science 176, pages 459-470, 1984.
bibtex
Soisalon-Soininen, E.; and Widmayer, P. On the Complexity of Concurrency Control by Locking in Distributed Data¬base Systems. Information and Control, 60: 103-108. 1984.
bibtex
  1983 (5)
Bentley, J.; Ottmann, T.; and Widmayer, P. The Complexity of Manipulating Hierarchically Defined Sets of Rectangles. Advances in Computing Research, Ed.: F.P. Preparata, 1: 127-158. 1983.
bibtex
Ottmann, T.; Schrapp, M.; and Widmayer, P. Pascal in 100 Beispielen. Teubner Verlag, 1983.
bibtex
Ottmann, T.; and Widmayer, P. On Translating a Set of Line Segments. Computer Vision, Graphics, and Image Processing, 24: 382-389. 1983.
bibtex
Soisalon-Soininen, E.; Mannila, H.; and Widmayer, P. On the Complexity of Safety and Deadlock-Freedom in Distributed Locking. Technical Report Institut für Angewandte Informatik und Formale Beschreibungsverfahren, Universität Karlsruhe, Germany, 1983.
bibtex
Widmayer, P. Computational Complexity in Computer Graphics and VLSI Design. Ph.D. Thesis, Fakultät für Wirtschaftswissenschaften, Universität Karlsruhe, Germany, 1983.
bibtex
. Technical Report .
bibtex   3 downloads

bibtex