1989 …2022

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    Algorithmic trade-offs for girth approximation in undirected graphs

    Kadria, A., Roditty, L., Sidford, A., Williams, V. V. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1471-1492 22 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Simulating a stack using queues

    Kaplan, H., Tarjan, R. E., Zamir, O. & Zwick, U., 2022, ACM-SIAM Symposium on Discrete Algorithms, SODA 2022. Association for Computing Machinery, p. 1901-1924 24 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2022-January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2021

    On the mysteries of max nae-sat

    Brakensiek, J., Huang, N., Potechin, A. & Zwick, U., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 484-503 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2019

    A faster deterministic exponential time algorithm for energy games and mean payoff games

    Dorfman, D., Kaplan, H. & Zwick, U., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 114. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Dynamic ordered sets with approximate queries, approximate heaps and soft heaps

    Thorup, M., Zamir, O. & Zwick, U., 1 Jul 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Baier, C., Chatzigiannakis, I., Flocchini, P. & Leonardi, S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 95. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 132).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Faster k-SAT algorithms using Biased-PPSZ

    Hansen, T. D., Kaplan, H., Zamir, O. & Zwick, U., 23 Jun 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 578-589 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Random k-out subgraph leaves only O(n/k) inter-component edges

    Holm, J., King, V., Thorup, M., Zamir, O. & Zwick, U., Nov 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE Computer Society, p. 896-909 14 p. 8948658. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2019-November).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Selection from heaps, row-sorted matrices, and X + Y using soft heaps

    Kaplan, H., Kozma, L., Zamir, O. & Zwick, U., Jan 2019, 2nd Symposium on Simplicity in Algorithms, SOSA 2019 - Co-located with the 30th ACM-SIAM Symposium on Discrete Algorithms, SODA 2019. Fineman, J. T. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 5. (OpenAccess Series in Informatics; vol. 69).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2018

    Improved bounds for multipass pairing heaps and path-balanced binary search trees

    Dorfman, D., Kaplan, H., Kozma, L., Pettie, S. & Zwick, U., 1 Aug 2018, 26th European Symposium on Algorithms, ESA 2018. Bast, H., Herman, G. & Azar, Y. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 112).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Pairing heaps: The forward variant

    Dorfman, D., Kaplan, H., Kozma, L. & Zwick, U., 1 Aug 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 117).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2016

    Bottleneck paths and trees and deterministic Graphical games

    Chechik, S., Kaplan, H., Thorup, M., Zamir, O. & Zwick, U., 1 Feb 2016, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016. Vollmer, H. & Ollinger, N. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 47).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Brief announcement: Public vs. private randomness in simultaneous multi-party communication complexity

    Fischer, O., Oshman, R. & Zwick, U., 2016, Distributed Computing - 30th International Symposium, DISC 2016, Proceedings. Gavoille, C. & Ilcinkas, D. (eds.). Springer Verlag, p. 487-489 3 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9888 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Public vs. private randomness in simultaneous multi-party communication complexity

    Fischer, O., Oshman, R. & Zwick, U., 2016, Structural Information and Communication Complexity - 23rd International Colloquium, SIROCCO 2016, Revised Selected Papers. Suomela, J. (ed.). Springer Verlag, p. 60-74 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9988 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Random-edge is slower than random-facet on abstract cubes

    Hansen, T. D. & Zwick, U., 1 Aug 2016, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Rabani, Y., Chatzigiannakis, I., Sangiorgi, D. & Mitzenmacher, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 55).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2015

    Adjacency labeling schemes and induced-universal graphs

    Alstrup, S., Kaplan, H., Thorup, M. & Zwick, U., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 625-634 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • An improved version of the random-facet pivoting rule for the simplex algorithm

    Hansen, T. D. & Zwick, U., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 209-218 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Hollow heaps

    Dueholm, T., Kaplan, H., Tarjan, R. E. & Zwick, U., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 689-700 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • The amortized cost of finding the minimum

    Kaplan, H., Zamir, O. & Zwick, U., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. Association for Computing Machinery, p. 757-768 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    Open Access
  • 2014

    Dantzig's pivoting rule for shortest paths, deterministic MDPs, and minimum cost to time ratio cycles

    Hansen, T. D., Kaplan, H. & Zwick, U., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 847-860 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved upper bounds for random-edge and random-jump on abstract cubes

    Hansen, T. D., Paterson, M. & Zwick, U., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. Association for Computing Machinery, p. 874-881 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Listing triangles

    Björklund, A., Pagh, R., Williams, V. V. & Zwick, U., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 223-234 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2013

    A forward-backward single-source shortest paths algorithm

    Wilson, D. B. & Zwick, U., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 707-716 10 p. 6686207. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2011

    A subexporiential lower bound for the Random Facet algorithm for Parity Games

    Friedmarm, O., Hansen, T. D. & Zwick, U., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. p. 202-216 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Collapse

    Rote, G. & Zwickt, U., 2011, Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011. Association for Computing Machinery, p. 603-613 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Subexponential lower bounds for randomized pivoting rules for the simplex algorithm

    Friedmann, O., Hansen, T. D. & Zwick, U., 2011, STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 283-292 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2010

    All-pairs shortest paths in O(n2) time with high probability

    Peres, Y., Sotnikov, D., Sudakov, B. & Zwick, U., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 663-672 10 p. 5671327. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Lower bounds for Howard's algorithm for finding minimum mean-cost cycles

    Hansen, T. D. & Zwick, U., 2010, Algorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings. PART 1 ed. p. 415-426 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6506 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2009

    A simpler implementation and analysis of Chazelle's Soft Heaps

    Kaplan, H. & Zwick, U., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 477-485 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

    Madani, O., Thorup, M. & Zwick, U., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 958-967 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Efficient algorithms for the 2-gathering problem

    Shalita, A. & Zwick, U., 2009, Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 96-105 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2008

    An algorithm for orienting graphs based on cause-effect pairs and its applications to orienting protein networks

    Medvedovsky, A., Bafna, V., Zwick, U. & Sharan, R., 2008, Algorithms in Bioinformatics - 8th International Workshop, WABI 2008, Proceedings. p. 222-232 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5251 LNBI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Maximum overhang (extended abstract)

    Paterson, M., Peres, Y., Thorup, M., Winkler, P. & Zwick, U., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 756-765 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Simple stochastic games, mean payoff games, parity games

    Zwick, U., 2008, Computer Science - Theory and Applications - Third International Computer Science Symposium in Russia, CSR 2008, Proceedings. p. 29 1 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5010 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2007

    All-Pairs Bottleneck Paths in vertex weighted graphs

    Shapira, A., Yuster, R. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 978-985 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Deterministic rendezvous, treasure hunts and strongly universal exploration sequences

    Ta-Shma, A. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 599-608 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Maximum matching in graphs with an excluded minor

    Yuster, R. & Zwick, U., 2007, Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007. Association for Computing Machinery, p. 108-117 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 07-09-January-2007).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • New bounds for the nearly equitable edge coloring problem

    Xie, X., Yagiura, M., Ono, T., Hirata, T. & Zwick, U., 2007, Algorithms and Computation - 18th International Symposium, ISAAC 2007, Proceedings. Springer Verlag, p. 280-291 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4835 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2006

    Improved approximation algorithms for MAX NAE-SAT and MAX SAT

    Avidor, A., Berkovitch, I. & Zwick, U., 2006, Approximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers. p. 27-40 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3879 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2005

    Answering distance queries in directed graphs using fast matrix multiplication

    Yuster, R. & Zwick, U., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 389-396 8 p. 1530731. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2004

    Dynamic approximate all-pairs shortest paths in undirected graphs

    Roditty, L. & Zwick, U., 2004, Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Sciences, FOCS 2004. p. 499-508 10 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2002

    Approximating MIN κ-SAT

    Avidor, A. & Zwick, U., 2002, Algorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings. p. 465-475 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2518 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Computer assisted proof of optimal approximability results

    Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 496-505 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems

    Lewin, M., Livnat, D. & Zwick, U., 2002, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Cook, W. J. & Schulz, A. S. (eds.). Springer Verlag, p. 67-82 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2337 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Jenga

    Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 243-246 4 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • MAX CUT in cubic graphs

    Halperin, E., Livnat, D. & Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 506-513 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Reachability and distance queries via 2-hop labels

    Cohen, E., Halperin, E., Kaplan, H. & Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 937-946 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Roundtrip spanners and roundtrip routing in directed graphs

    Roditty, L., Thorup, M. & Zwick, U., 2002, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002. Association for Computing Machinery, p. 844-851 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 06-08-January-2002).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2001

    A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

    Halperin, E. & Zwick, U., 2001, Integer Programming and Combinatorial Optimization - 8th International IPCO Conference, Proceedings. Aardal, K. & Gerards, B. (eds.). Springer Verlag, p. 210-225 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2081).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Coloring k-colorable graphs using smaller palettes

    Halperin, E., Nathaniel, R. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 319-326 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Combinatorial approximation algorithms for the maximum directed cut problem

    Halperjn, E. & Zwick, U., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1-7 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review