[AAALZ23]
Bogdan Alecu, Vladimir E. Alekseev, Aistis Atminas, Vadim V. Lozin, and Viktor Zamaraev. Graph parameters, implicit representations and factorial properties. Discrete Mathematics, 346(10):113573, October 2023.
[AAB25]
Sharareh Alipour, Arash Ahadi, and Kajal Baghestani. Improved wake-up time for euclidean freeze-tag problem. In 37th Canadian Conference on Computational Geometry (CCCG), pages 331–339, August 2025.
[AAB25a]
Sharareh Alipour, Arash Ahadi, and Kajal Baghestani. Improved wake-up time for euclidean freeze-tag problem. Technical Report 2507.16269v1 [cs.CG], arXiv, July 2025.
[AABBx25]
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou de Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane Souvaine, and Leonidas Theocharous. An improved bound for plane covering paths. In Anne Benoit, Haim Kaplan, Sebastian Wild, and Grzegorz Herman, editors, 33rd Annual European Symposium on Algorithms (ESA), volume 351 of LIPIcs, pages 75:1–75:10. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2025.
[AABBx25a]
Hugo A. Akitaya, Greg Aloupis, Ahmad Biniaz, Prosenjit Bose, Jean-Lou de Carufel, Cyril Gavoille, John Iacono, Linda Kleist, Michiel Smid, Diane Souvaine, and Leonidas Theocharous. An improved bound for plane covering paths. Technical Report 2507.06477v1 [cs.CG], arXiv, July 2025.
[AABHx11]
Yehuda Afek, Noga Alon, Omer Barad, Eran Hornstein, Naama Barkai, and Zvi Bar-Joseph. A biological solution to a fundamental distributed computing problem. Science, 331:183–185, January 2011.
[AAGH21]
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, and Dan Halperin. On two-handed planar assembly partitioning with connectivity constraints. In 32nd Symposium on Discrete Algorithms (SODA), pages 1740–1756. ACM-SIAM, January 2021.
[AAGH25]
Pankaj K. Agarwal, Boris Aronov, Tzvika Geft, and Dan Halperin. On two-handed planar assembly partitioning with connectivity constraints. ACM Transactions on Algorithms, 21(2):Article No. 19, pp. 1–31, April 2025.
[AAHBx16]
Mikkel Abrahansen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, and Morten Stöckel. Near-optimal induced universal graphs for cycles and paths. Technical Report 1607.04911v2 [cs.DS], arXiv, July 2016.
[AAHBx17]
Mikkel Abrahansen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, and Morten Stöckel. Near-optimal induced universal graphs for bounded degree graphs. In 44th International Colloquium on Automata, Languages and Programming (ICALP), volume 80 of LIPIcs, pages 130:1–130:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2017.
[AAHBx20]
Mikkel Abrahansen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, and Morten Stöckel. Near-optimal induced universal graphs for cycles and paths. Discrete Applied Mathematics, 282:1–13, August 2020.
[AAHPx16]
Oswin Aichholzer, Victor Alvarez, Thomas Hackl, Alexander Pilz, Bettina Speckmann, and Birgit Vogtenhuber. An improved lower bound on the minimum number of triangulations. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 7:1–7:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[AAK93]
Hosame Abu-Amara and Arkady Kanevsky. On the complexities of leader election algorithms. In 5th International Conference on Computing and Information (ICCI), pages 202–206. IEEE Computer Society, May 1993.
[AAKMR06]
Serge Abiteboul, Stephen Alstrup, Haim Kaplan, Tova Milo, and Theis Rauhe. Compact labeling schemes for ancestor queries. SIAM Journal on Computing, 35(6):1295–1309, January 2006.
[AAPS87]
Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, and Michael E. Saks. Local management of a global resource in a communication network. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 347–357. IEEE Computer Society Press, October 1987.
[AAPS96]
Yehuda Afek, Baruch Awerbuch, Serge A. Plotkin, and Michael E. Saks. Local management of a global resource in a communication network. Journal of the ACM, 43(1):1–19, 1996.
[AAS10]
Amitai Armona, Adi Avidora, and Oded Schwartz. Cooperative TSP. Theoretical Computer Science, 411(31-33):2847–2863, June 2010.
[AAT02]
Sanjeev Arora, Nir Ailon, and Iannis Tourlakis. Lecture 13: Topological non-constructive methods, 2002.
[AAY17]
Zachary Abel, Hugo A. Akitaya, and Jingjin Yu. Freeze tag awakening in 2D is NP-hard. In 27th Annual Fall Workshop on Computational Geometry (FWCG), November 2017.
[AB09]
Sanjeev Arora and Boaz Barak. Computational complexity: A modern approach. Cambridge, June 2009.
[AB16]
Amir Abboud and Gregory Bodwin. Error amplification for pairwise spanner lower bounds. In 27th Symposium on Discrete Algorithms (SODA), pages 841–854. ACM-SIAM, January 2016.
[AB16a]
Amir Abboud and Gregory Bodwin. The 4/3 additive spanner exponent is tight. In 48th Annual ACM Symposium on Theory of Computing (STOC), pages 351–361. ACM Press, June 2016.
[AB16b]
Sanjeev Arora and Boaz Barak. Computational complexity: A modern approach. Cambridge, 2016.
[AB91]
Michael O. Albertson and David M. Berman. The number of cut-vertices in a graph of given minimum degree. Discrete Mathematics, 89(1):97–100, May 1991.
[ABBAx10]
Mafalda L. Almeida, Jean-Daniel Bancal, Nicolas Brunner, Antonio Acín, Nicolas Gisin, and Stefano Pironio. Guess your neighbor's input: A multipartite nonlocal game with no quantum advantage. Physical Review Letters, 104(230404), June 2010.
[ABBCx20]
Oswin Aichholzer, Manuel Borrazzo, Prosenjit Bose, Jean Cardinal, Fabrizio Frati, Pat Morin, and Birgit Vogtenhuber. Drawing graphs as spanners. Technical Report 2002.05580v1 [cs.DS], arXiv, February 2020.
[ABBCx25]
Sepehr Assadi, Soheil Behnezhad, Sayan Bhattacharya, Martín Costa, Shay Solomon, and Tianyi Zhang. Vizing's theorem in near-linear time. In Michal Koucký and Mikhil Bansal, editors, 57th Annual ACM Symposium on Theory of Computing (STOC), pages 24–35. ACM Press, June 2025.
[ABBE18]
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, and Louis Esperet. Distributed coloring in sparse graphs with fewer colors. In 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 419–425. ACM Press, July 2018.
[ABBM11]
Noga Alon, József Balogh, Béla Bollobás, and Robert Morris. The structure of almost all graphs in a hereditary property. Journal of Combinatorial Theory, Series B, 101(2):85–110, March 2011.
[ABBMx05]
Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia Malkhi, Sharad Maloo, and Saar Ron. Practical locality-awareness for large scale information sharing. In 4th Annual International Workshop on Peer-To-Peer Systems (IPTPS), volume 3640 of Lecture Notes in Computer Science, pages 173–181. Springer, February 2005.
[ABBRT20]
Anders Aamand, Mathias Bæk Tejs Knudsen, Jakob Bæk Tejs Knudsen, Peter Michael Reichstein Rasmussen, and Mikkel Thorup. Fast hashing with strong concentration bounds. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 1265–1278. ACM Press, June 2020.
[ABCC06]
David L. Applegate, Robert E. Bixby, Vašek Chvátal, and William J. Cook. The traveling salesman problem. Princeton Series in Applied Mathematics. Wiley-Interscience, 2006.
[ABCCx18]
Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Matthew J. Katz, Joseph S.B. Mitchell, and Marina Simakov. Selecting and covering colored points. Discrete Applied Mathematics, 250:75–86, December 2018.
[ABCDx05]
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon M. Kleinberg, Ofer Neiman, and Aleksandrs Slivkins. Metric embeddings with relaxed guarantees. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 83–100. IEEE Computer Society Press, October 2005.
[ABCFx90]
Juan M. Alonso, T. Brady, Daryl Cooper, Vincent Ferlini, Martin Lustig, Michael L. Mihalik, Michael Shapiro, and Hamish Short. Notes on word hyperbolic groups. In Étienne Ghys, Andre Haefliger, and Alberto Verjovsky, editors, Group Theory from a Geometric Viewpoint, pages 3–63. World Scientific, March 1990.
[ABCP93]
Baruch Awerbuch, Bonnie Berger, Lenore Jennifer Cowen, and David Peleg. Near-linear cost sequential and distributed constructions of sparse neighborhood covers. In 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 638–647. IEEE Computer Society Press, November 1993.
[ABCP96]
Baruch Awerbuch, Bonnie Berger, Lenore Jennifer Cowen, and David Peleg. Fast distributed network decompositions and covers. Journal of Parallel and Distributed Computing, 39(2):105–114, December 1996.
[ABCP98]
Baruch Awerbuch, Bonnie Berger, Lenore Jennifer Cowen, and David Peleg. Near-linear time construction of sparse neighborhood covers. SIAM Journal on Computing, 28(1):263–277, February 1998.
[ABD95]
Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124–142, January 1995.
[ABDGx18]
Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, and Alessandra Tappini. Greedy rectilinear drawings. In Therese C. Biedl and Andreas Kerren, editors, 26th International Symposium on Graph Drawing and Network Visualization (GD), volume 11282 of Lecture Notes in Computer Science, pages 495–508. Springer, September 2018.
[ABDVZ18]
Amir Abboud, Arthurs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, and Or Zamir. Subtree isomorphism revisited. ACM Transactions on Algorithms, 14(3):Article No. 27, pp. 1–23, June 2018.
[ABEHx12]
Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, and Yoshio Okamoto. Universal point subsets for planar graphs. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 423–432. Springer, December 2012.
[ABFMS02]
Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S.B. Mitchell, and Martin Skutella. The freeze-tag problem: How to wake up a swarm of robots. In 13th Symposium on Discrete Algorithms (SODA), pages 568–577. ACM-SIAM, 2002.
[ABFMS06]
Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S.B. Mitchell, and Martin Skutella. The freeze-tag problem: How to wake up a swarm of robots. Algorithmica, 46:193–221, 2006.
[ABFN00]
Jochen Alber, Hans Leo Bodlaender, Henning Fernau, and Rolf Niedermeier. Fixed parameter algorithms for \textscPlanar Dominating Set and related problems. In 7th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1851 of Lecture Notes in Computer Science, pages 613–619. Springer, July 2000.
[ABFN02]
Jochen Alber, Hans Leo Bodlaender, Henning Fernau, and Rolf Niedermeier. Fixed parameter algorithms for \textscDominating Set and related problems on planar graphs. Algorithmica, 33(4):461–493, August 2002.
[ABFPT96]
Richa Agarwala, Vineet Bafna, Martin Farach-Colton, Mike Paterson, and Mikkel Thorup. On the approximability of numerical taxonomy (fitting distances by tree metrics). In 7th Symposium on Discrete Algorithms (SODA), pages 365–372. ACM-SIAM, January 1996.
[ABFPT99]
Richa Agarwala, Vineet Bafna, Martin Farach-Colton, Mike Paterson, and Mikkel Thorup. On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, 28(3):1073–1085, February 1999.
[ABG06]
Lars Arge, Gerth Stølting Brodal, and Loukas Georgiadis. Improved dynamic planar point location. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 305–314. IEEE Computer Society Press, October 2006.
[ABGHM03]
Esther M. Arkin, Michael A. Bender, Dongdong Ge, Simai He, and Joseph S.B. Mitchell. Improved approximation algorithms for the freeze-tag problem. In 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 295–303. ACM Press, June 2003.
[ABGLx26]
Noga Alon, Thomas F. Bloom, W.T. Gowers, Daniel Litt, will Sawin, Arul Shankar, Jacob Tsimerman, Victor Wang, and Melanie Matchett Wood. Remarks on the disproof of the unit distance conjecture. Technical Report 2605.20695v1 [math.CO], arXiv, May 2026.
[ABHM00]
Robert E.L. Aldred, Sheng Bau, Derek A. Holton, and Brendan D. McKay. Nonhamiltonian 3-connected cubic planar graphs. SIAM Journal on Discrete Mathematics, 13(1):25–32, 2000.
[ABI86]
Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms, 7(4):567–583, December 1986.
[ABIKx19]
Andris Ambainis, Kaspars Balodis, Jānis Iraids, Martins Kokainis, Krišjānis Prūsis, and Jevgēnijs Vihrovs. Quantum speedups for exponential-time dynamic programming algorithms. In 30th Symposium on Discrete Algorithms (SODA), pages 1783–1793. ACM Press, January 2019.
[ABK25]
Peter Allen, Julia Böttcher, and Jasmin Katz. Universality for degenerate hypergraphs. In Luciano N. Grippo and Martín D. Safe, editors, 13rd Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 273, pages 381–388. Procedia Computer Science, November 2025.
[ABKM15]
Patrizio Angelini, Till Bruckdorfer, Michael Kaufmann, and Tamara Mchedlidze. A universal point set for 2-outerplanar graphs. In 23rd International Symposium on Graph Drawing and Network Visualization (GD), volume 9411 of Lecture Notes in Computer Science, pages 409–422. Springer, September 2015.
[ABKMx07]
Ittai Abraham, Mahesh Balakrishnan, Fabian Kuhn, Dahlia Malkhi, Kunal Talwar, and Venugopalan Ramasubramanian. Reconstructing approximate tree metrics. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 43–52. ACM Press, August 2007.
[ABL23]
Peter Allen, Julia Böttcher, and Anita Liebenau. Universality for graphs of bounded degeneracy. Technical Report 2309.05468v1 [math.CO], arXiv, September 2023.
[ABLP89]
Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Compact distributed data structures for adaptive routing. CWI Quarterly, 2(4):277–305, December 1989.
[ABLP89a]
Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Compact distributed data structures for adaptive routing. In 21st Annual ACM Symposium on Theory of Computing (STOC), pages 479–489. ACM Press, May 1989.
[ABLP90]
Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, and David Peleg. Improved routing strategies with succinct tables. Journal of Algorithms, 11(3):307–341, September 1990.
[ABLP91]
Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290–298, October 1991.
[ABLP92]
Noga Alon, Amotz Bar-Noy, Nathan Linial, and David Peleg. Single round simulation on radio networks. Journal of Algorithms, 13(2):188–210, June 1992.
[ABMP91]
Helmut Alt, Norbert Blum, Kurt Mehlhorn, and Markus Paul. Computing a maximum cardinality matching in a bipartite graph in time O(n1.5√m/logn). Information Processing Letters, 37(4):237–240, February 1991.
[ABMS25]
Sharareh Alipour, Kajal Baghestani, Mahdis Mirzaei, and Soroush Sahraei. Geometric freeze-tag problem. In 24th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages 87–95. ACM Press, May 2025.
[ABMS25a]
Sharareh Alipour, Kajal Baghestani, Mahdis Mirzaei, and Soroush Sahraei. Geometric freeze-tag problem. Technical Report 2412.19706v2 [cs.DC], arXiv, January 2025.
[ABN06]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Advances in metric embedding theory. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 271–286. ACM Press, May 2006.
[ABN07]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Local embeddings of metric spaces. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 631–640. ACM Press, June 2007.
[ABN07a]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion. In 18th Symposium on Discrete Algorithms (SODA), pages 502–511. ACM-SIAM, January 2007.
[ABN08]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Embedding metric spaces in their intrinsic dimension. In 19th Symposium on Discrete Algorithms (SODA), pages 363–372. ACM-SIAM, January 2008.
[ABN08a]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Nearly tight low stretch spanning trees. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 781–790. IEEE Computer Society Press, October 2008.
[ABN09]
Ittai Abraham, Yair Bartal, and Ofer Neiman. On low dimensional local embeddings. In 20th Symposium on Discrete Algorithms (SODA), pages 875–884. ACM-SIAM, January 2009.
[ABN11]
Ittai Abraham, Yair Bartal, and Ofer Neiman. Advances in metric embedding theory. Advances in Mathematics, 228(6):3026–3126, December 2011.
[ABNG94]
Baruch Awerbuch, Amotz Bar-Noy, and Madan Gopal. Approximate distributed Bellman-Ford algorithms. IEEE Transactions on Communications, 42(8):2515–2517, 1994.
[ABP17]
Amir Abboud, Gregory Bodwin, and Seth Pettie. A hierarchy of lower bounds for sublinear additive spanners. In 28th Symposium on Discrete Algorithms (SODA), pages 568–576. ACM-SIAM, January 2017.
[ABR00]
Stephen Alstrup, Gerth Stølting Bordal, and Theis Rauhe. New data structures for orthogonal range searching. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 198–207. IEEE Computer Society Press, November 2000.
[ABR01]
Stephen Alstrup, Gerth Stølting Bordal, and Theis Rauhe. Optimal static range reporting in one dimension. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 476–482. ACM Press, July 2001.
[ABR03]
Stephen Alstrup, Philip Bille, and Theis Rauhe. Labeling schemes for small distances in trees. In 14th Symposium on Discrete Algorithms (SODA), pages 689–698. ACM-SIAM, January 2003.
[ABR05]
Stephen Alstrup, Philip Bille, and Theis Rauhe. Labeling schemes for small distances in trees. SIAM Journal on Discrete Mathematics, 19(2):448–462, 2005.
[ABRSW25]
Louigi Addario Berry, Bruce A. Reed, Alex Scott, and David R. Wood. A logarithmic bound for the chromatic number of the associahedron. Technical Report 1811.08972v2 [math.CO], arXiv, February 2025.
[ABS90]
Brian Alspach, Jean-Claude Bermond, and Dominique Sotteau. Decomposition into cycles I: Hamilton decompositions. In Gena Hahn, Gert Sabidussi, and Robert E. Woodrow, editors, Cycles and Rays, volume 301 of NATO ASI Series, pages 9–18. Kluwer Academic Publishers, Dordrecht, 1990.
[ABtBB13]
Sander P.A. Alewijnse, Quirijn W. Bouts, Alex P. ten Brink, and Kevin Buchin. Computing the greedy spanner in linear space. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 37–48. Springer, September 2013.
[AbuKhzam14]
Faisal N. Abu-Khzam. Maximum common induced subgraph parameterized by vertex cover. Information Processing Letters, 114(3):99–103, March 2014.
[ABY63]
Louis Auslander, Thomas A. Brown, and John W.T. Youngs. The imbedding of graphs in manifolds. Journal of Mathematics and Mechanics, 12(4):629–634, 1963.
[AC07]
Noga Alon and Michael R. Capalbo. Sparse universal graphs for bounded-degree graphs. Random Structures and Algorithms, 31(2):123–133, September 2007.
[AC07a]
Hagit Attiya and Keren Censor. Tight bounds for asynchronous randomized consensus. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 155–164. ACM Press, June 2007.
[AC08]
Noga Alon and Michael R. Capalbo. Optimal universal graphs with deterministic embedding. In 19th Symposium on Discrete Algorithms (SODA), pages 373–378. ACM-SIAM, January 2008.
[AC12]
Abhijin Adiga and L. Sunil Chandran. Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions. In 28th Annual ACM Symposium on Computational Geometry (SoCG), pages 387–396. ACM, June 2012.
[AC14]
Ittai Abraham and Shiri Chechik. Distance labels with optimal local stretch. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, 41st International Colloquium on Automata, Languages and Programming (ICALP), volume 8572 of Lecture Notes in Computer Science (ARCoSS), pages 52–63. Springer, July 2014.
[ACCDx96]
Srinivasa R. Arikati, Danny Ziyi Chen, L. Paul Chew, Gautam Das, Michiel Smid, and Christos D. Zaroliagis. Planar spanners and approximate shortest path queries among obstacles in the plane. In Josep Díaz and Maria Serna, editors, 4th Annual European Symposium on Algorithms (ESA), volume 1136 of Lecture Notes in Computer Science, pages 514–528. Springer, September 1996.
[ACDGW16]
Ittai Abraham, Shiri Chechik, Daniel Delling, Andrew V. Goldberg, and Renato Foncesa Werneck. On dynamic approximate shortest paths for planar graphs with worst-case costs. In 27th Symposium on Discrete Algorithms (SODA), pages 740–753. ACM-SIAM, January 2016.
[ACDPS00]
Carme Alvarez, Rafel Cases, Josep Díaz, Jordi Petit, and María Serna. Routing tree problems on random graphs, March 2000. ICALP Satellite Workshops.
[ACEFN17]
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, and Ofer Neiman. Ramsey spanning trees and their applications. Technical Report 1707.08769 [cs.DS], arXiv, July 2017.
[ACEFN20]
Ittai Abraham, Shiri Chechik, Michael Elkin, Arnold Filtser, and Ofer Neiman. Ramsey spanning trees and their applications. ACM Transactions on Algorithms, 16(2):Article No. 19, pp. 1–21, March 2020.
[ACFLx04]
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R. Fellows, Michael A. Langston, W. Henry Suters, and Chris T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In 6th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 62–69. SIAM, January 2004.
[ACG12]
Ittai Abraham, Shiri Chechik, and Cyril Gavoille. Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 1199–1217. ACM Press, May 2012.
[ACGP10]
Ittai Abraham, Shiri Chechik, Cyril Gavoille, and David Peleg. Forbidden-set distance labels for graphs of bounded doubling dimension. In 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 192–200. ACM Press, July 2010.
[ACGP16]
Ittai Abraham, Shiri Chechik, Cyril Gavoille, and David Peleg. Forbidden-set distance labels for graphs of bounded doubling dimension. ACM Transactions on Algorithms, 12(2):Article No. 22, pp. 1–17, February 2016.
[ACHK16]
Amir Abboud, Keren Censor-Hillel, and Seri Khoury. Near-linear lower bounds for distributed distance computations, even in sparse networks. In 30th International Symposium on Distributed Computing (DISC), volume 9888 of Lecture Notes in Computer Science (ARCoSS), pages 29–42. Springer, September 2016.
[ACHS21]
Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, and Sophie Theresa Spirkl. Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth. Technical Report 2109.013104v1 [math.CO], arXiv, September 2021.
[ACIM99]
Donald Aingworth, Chandra Chekuri, Piotr Indyk, and Rajeev Motwani. Fast estimation of diameter and shortest paths (without matrix multiplication). SIAM Journal on Computing, 28(4):1167–1181, January 1999.
[ACJR19]
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, and Satti Srivivasa Rao. Succinct data structures for families of interval graphs. In Zachary Friggstad, Jörg-Rüdiger Sack, and Mohammad R. Salavatipour, editors, 16th International Workshop on Algorithms and Data Structures (WADS), volume 11646 of Lecture Notes in Computer Science, pages 1–13. Springer, August 2019.
[ACJR20]
Hüseyin Acan, Sankardeep Chakraborty, Seungbum Jo, and Satti Srivivasa Rao. Succinct encodings for families of interval graphs. Algorithmica, 39, April 2020.
[ACK09]
Stavros Athanassopoulos, Ioannis Caragiannis, and Christos Kaklamanis. Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory of Computing Systems, 45(3):555–576, 2009.
[ACK19]
Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Sublinear algorithms for (Δ+1) vertex coloring. In 30th Symposium on Discrete Algorithms (SODA), pages 767–786. ACM Press, January 2019.
[ACK19a]
Sepehr Assadi, Yu Chen, and Sanjeev Khanna. Sublinear algorithms for (Δ+1) vertex coloring. Technical Report 1807.08886v2 [cs.DS], arXiv, January 2019.
[Ackerman14]
Eyal Ackerman. A note on 1-planar graphs. Discrete Applied Mathematics, 175:104–108, October 2014.
[ACKMP91]
Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Broadcast with partial knowledge. In 10th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 153–163. ACM Press, 1991.
[ACKMP98]
Baruch Awerbuch, Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Optimal broadcast with partial knowledge. SIAM Journal on Computing, 28(2):511–524, April 1998.
[ACKRx00]
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtěch Rödl, Andrzej Ruciński, and Endre Szemerédi. Universality and tolerance. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 14–21. IEEE Computer Society Press, November 2000.
[ACL00]
William Aillo, Fan R.K. Chung, and Linyuan Lu. A random graph model for massive graphs. In 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 171–180. ACM Press, May 2000.
[ACL03]
Marta Arias, Lenore Jennifer Cowen, and Kofi Ambrose Laing. Compact roundtrip routing with topology-independent node names. In 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 43–52. ACM Press, July 2003.
[ACL08]
Marta Arias, Lenore Jennifer Cowen, and Kofi Ambrose Laing. Compact roundtrip routing with topology-independent node names. Journal of Computer and System Sciences, 74(5):775–795, August 2008.
[ACL95]
Mikhail J. Atallah, Danny Ziyi Chen, and Der-Tsai Lee. An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications. Algorithmica, 14(5):429–441, November 1995.
[ACLRT03]
Marta Arias, Lenore Jennifer Cowen, Kofi Ambrose Laing, Rajmohan Rajaraman, and Orjeta Taka. Compact routing with name independence. In 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 184–192. ACM Press, June 2003.
[ACLRT06]
Marta Arias, Lenore Jennifer Cowen, Kofi Ambrose Laing, Rajmohan Rajaraman, and Orjeta Taka. Compact routing with name independence. SIAM Journal on Discrete Mathematics, 20(3):705–726, 2006.
[ACLZ15]
Aistis Atminas, Andrew Collins, Vadim V. Lozin, and Viktor A. Zamaraev. Implicit representations and factorial properties of graphs. Discrete Mathematics, 338(2):164–179, February 2015.
[ACP87]
Stefan Arnborg, Derek G. Corneil, and Andrzej Proskurowski. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods, 8(2):277–284, April 1987.
[ACRSZ07]
Andris Ambainis, Andrew M. Childs, Ben W. Reichardt, Robert Špalek, and Shengyu Zhang. Any AND-OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 363–372. IEEE Computer Society Press, October 2007.
[ACT14]
Ittai Abraham, Shiri Chechik, and Kunal Talwar. Fully dynamic all-pairs shortest paths: Breaking the O(n) barrier. In 17th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and 18th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 28 of LIPIcs, pages 1–16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2014.
[AD02]
Afek Yehuda and Shlomi Dolev. Local stabilizer. Journal of Parallel and Distributed Computing, 62(5):745–765, May 2002.
[AD10]
Scott Aaronson and Andrew Drucker. A full characterization of quantum advice. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 131–140. ACM Press, June 2010.
[AD15]
Richard Arratia and Stephen Desalvo. Probabilistic divide-and-conquer: A new exact simulation method, with integer partitions as an example. Technical Report 1110.3856v7 [math.PR], arXiv, November 2015.
[AD16]
Amir Abboud and Søren Dahlgaard. Popular conjectures as a barrier for dynamic planar graph algorithms. Technical Report 1605.03797v1 [cs.DS], arXiv, May 2016.
[AD16a]
Amir Abboud and Søren Dahlgaard. Popular conjectures as a barrier for dynamic planar graph algorithms. In 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 477–486. IEEE Computer Society Press, October 2016.
[AD96]
Lyudmil Aleksandrov and Hristo N. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM Journal on Discrete Mathematics, 9(1):129–150, February 1996.
[AdBFG07]
Mohammad Ali Abam, Mark T. de Berg, Mohammad Farshi, and Joachim Gudmundsson. Region-fault tolerant geometric spanners. In 18th Symposium on Discrete Algorithms (SODA), pages 1–10. ACM-SIAM, January 2007.
[AdBFG09]
Mohammad Ali Abam, Mark T. de Berg, Mohammad Farshi, and Joachim Gudmundsson. Region-fault tolerant geometric spanners. Discrete & Computational Geometry, 41(4):556–582, June 2009.
[ADBTK15]
Stephen Alstrup, Søren Dahlgaard, and Mathias Bæk Tejs Knudsen. Optimal induced universal graphs and adjacency labeling for trees. In 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1311–1326. IEEE Computer Society Press, October 2015.
[ADBTK17]
Stephen Alstrup, Søren Dahlgaard, and Mathias Bæk Tejs Knudsen. Optimal induced universal graphs and adjacency labeling for trees. Journal of the ACM, 64(4):Article No. 27, pp. 1–22, August 2017.
[ADBTx15]
Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, and Ely Porat. Sublinear distance labeling for sparse graphs. Technical Report 1507.02618v1 [cs.DS], arXiv, July 2015.
[ADBTx16]
Stephen Alstrup, Søren Dahlgard, Mathias Bæk Tejs Knudsen, and Ely Porat. Sublinear distance labeling. In 24th Annual European Symposium on Algorithms (ESA), volume 57 of LIPIcs, pages 5:1–5:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2016.
[ADDJ90]
Ingo Althöfer, Gautam Das, David P. Dobkin, and Deborah A. Joseph. Generating sparse spanners for weighted graphs. In 2nd Scandinavian Workshop on Algorithm Theory (SWAT), volume 447 of Lecture Notes in Computer Science, pages 26–37. Springer, July 1990.
[ADDJS93]
Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah A. Joseph, and José Soares. On sparse spanners of weighted graphs. Discrete & Computational Geometry, 9(1):81–100, January 1993.
[ADFST11]
Isolde Alber, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, and Dimitrios M. Thilikos. Faster parameterized algorithms for minor containment. Theoretical Computer Science, 412(50):7018–7028, November 2011.
[ADFST12]
Isolde Alber, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, and Dimitrios M. Thilikos. Fast minor testing in planar graphs. Algorithmica, 64(1):69–84, September 2012.
[ADGW10]
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato Foncesa Werneck. A hub-based labeling algorithm for shortest paths on road networks. Technical Report MSR-TR-2010-165, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, December 2010.
[ADGW11]
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato Foncesa Werneck. A hub-based labeling algorithm for shortest paths on road networks. In 10th International Symposium on Experimental Algorithms (SEA), volume 6630 of Lecture Notes in Computer Science, pages 230–241. Springer, May 2011.
[ADGW12]
Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato Foncesa Werneck. Hierarchical hub labelings for shortest paths. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 24–35. Springer-Verlag, September 2012.
[Adhar03]
Gur Saran Adhar. Optimal interval routing for k-caterpillars and maximal outerplanar networks. In M.H. Hamza, editor, 21st IASTED International Multi-Conference on Applied Informatics (AI), pages 692–696. ACTA Press, February 2003.
[ADJMcx24]
Noga Alon, Natalie Dodson, Carmen Jackson, Rose McCarty, Rajko Nenadov, and Lani Southern. Universality for graphs with bounded density. Technical Report 2311.05500v2 [math.CO], arXiv, January 2024.
[ADOV03]
Noga Alon, Guoli Ding, Bogdan Oporowski, and Dirk Vertigan. Partitioning into graphs with only small components. Journal of Combinatorial Theory, Series B, 87(2):231–243, March 2003.
[ADS02]
James Aspnes, Zoë Diamadi, and Gauri Shah. Fault-tolerant routing in peer-to-peer systems. In 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 223–232. ACM Press, 2002.
[AEFLP15]
Annalisa D'Andrea, Mattia D'Emidio, Daniele Frigiono, Stefano Leucci, and Guido Proietti. Path-fault-tolerant approximate shortest-path trees. In 22nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 9439 of Lecture Notes in Computer Science, pages 224–238. Springer, July 2015.
[AEGPx22]
Simon Apers, Yuval Efron, Paweł Gawrychowski, Troy Lee, Sagnik Mukhopadhyay, and Danupon Nanongkai. Cut query algorithms with star contraction. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 507–518. IEEE Computer Society Press, October 2022.
[AEGW89]
Jin Akiyama, Hiroshi Era, Severino V. Gervacio, and Mamoru Watanabe. Path chromatic numbers of graphs. Journal of Graph Theory, 13(5):569–575, November 1989.
[AET08]
Robert Adler, John Exing, and Peter Taylor. Citation statistics, December 2008. A report from the International Mathematical Union (IMU) in cooperation with the International Council of Industrial and Applied Mathematics (ICIAM) and the Institute of Mathematical Statistics (IMS).
[AF03]
Micah Adler and Faith Ellen Fich. The complexity of end-to-end communication in memoryless networks, 2003.
[AF09]
Noga Alon and Uriel Feige. On the power of two, three and four probes. In 20th Symposium on Discrete Algorithms (SODA), pages 346–354. ACM-SIAM, January 2009.
[AF12]
Heger Arfaoui and Pierre Fraigniaud. What can be computed without communications?In 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 7355 of Lecture Notes in Computer Science, pages 135–146. Springer, June 2012.
[AF12a]
Heger Arfaoui and Pierre Fraigniaud. Brief announcement: what can be computed without communication?In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 87–88. ACM Press, July 2012.
[AF13]
Heger Arfaoui and Pierre Fraigniaud. What can be computed without communications?, November 2013.
[AF84]
Martin Aigner and Michael Fromme. A game of cops and robbers. Discrete Applied Mathematics, 8(1):1–12, April 1984.
[AF99]
Micah Adler and Faith Ellen Fich. The complexity of end-to-end communication in memoryless networks. In 18th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 239–248. ACM Press, May 1999.
[AFFFx05]
Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Frances A. Rosamond, and Ulrike Stege. A refined search tree technique for Dominating Set on planar graphs. Journal of Computer and System Sciences, 71(4):385–405, November 2005.
[AFGN18]
Ittai Abraham, Arnold Filtser, Gupta Anupam, and Neiman Ofer. Metric embedding via shortest path decompositions. In 50th Annual ACM Symposium on Theory of Computing (STOC), pages 952–963. ACM Press, June 2018.
[AFGP00]
Micah Adler, Faith Ellen Fich, Leslie Ann Goldberg, and Mike Paterson. Tight size bounds for packet headers in narrow meshes. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 756–767. Springer, July 2000.
[AFGW10]
Ittai Abraham, Amos Fiat, Andrew V. Goldberg, and Renato Foncesa Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In 21st Symposium on Discrete Algorithms (SODA), pages 782–793. ACM-SIAM, January 2010.
[AFI05]
Giorgio Ausiello, Paolo Giulio Franciosa, and Giuseppe Francesco Italiano. Small stretch spanners on dynamics graphs. In 13th Annual European Symposium on Algorithms (ESA), volume 3669 of Lecture Notes in Computer Science, pages 532–543. Springer, October 2005.
[AFIR13]
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, and Andrea Ribichini. On resilient graph spanners. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 85–96. Springer, September 2013.
[AFIR13a]
Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe Francesco Italiano, and Andrea Ribichini. On robust graph spanners. Technical Report 1303.1559v1 [cs.DS], arXiv, March 2013.
[AFK21]
Sharareh Alipour, Ehsan Futuhi, and Shayan Karimi. On distributed algorithms for minimum dominating set problem, from theory to application. Technical Report 2012.04883v2 [cs.DC], arXiv, January 2021.
[AFLS07]
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, and W. Henry Suters. Crown structures for vertex cover kernelization. Theory of Computing Systems, 41(3):411–430, 2007.
[AFN03]
Jochen Alber, Henning Fernau, and Rolf Niedermeier. Graph separators: A parameterized view. Journal of Computer and System Sciences, 67(4):808–832, December 2003.
[AFN04]
Jochen Alber, Michael R. Fellows, and Rolf Niedermeier. Polynomial-time data reduction for dominating set. Journal of the ACM, 51(3):363–384, May 2004.
[AFPS14]
Eyal Ackerman, Jacob Fox, János Pach, and Andrew Suke. On grids in topological graphs. Computational Geometry: Theory and Applications, 47(7):710–723, August 2014.
[Afshani21]
Peyman Afshani. A lower bound for dynamic fractional cascading. In 32nd Symposium on Discrete Algorithms (SODA), pages 2229–2248. ACM-SIAM, January 2021.
[AG06]
Ittai Abraham and Cyril Gavoille. Object location using path separators. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 188–197. ACM Press, July 2006.
[AG06a]
Ittai Abraham and Cyril Gavoille. Object location using path separators. Research Report RR-1394-06, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, March 2006.
[AG07]
Noga Alon and Shai Gutner. Balanced families of perfect hash functions and their applications. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 435–446. Springer, July 2007.
[AG11]
Ittai Abraham and Cyril Gavoille. On approximate distance labels and routing schemes with affine stretch. In 25th International Symposium on Distributed Computing (DISC), volume 6950 of Lecture Notes in Computer Science (ARCoSS), pages 404–415. Springer, September 2011.
[AG13]
Rachit Agarwal and Philip Brighten Godfrey. Distance oracles for stretch less than 2. In 24th Symposium on Discrete Algorithms (SODA), pages 526–538. ACM-SIAM, January 2013.
[AG87]
Baruch Awerbuch and Robert G. Gallager. A new distributed algorithm to find breadth first search trees. IEEE Transactions on Information Theory, 33(3):315–322, 1987.
[AG88]
Yehuda Afek and Eli Gafni. End-to-end communication in unreliable networks. In 7th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 131–148. ACM Press, August 1988.
[AG99]
Didier Arquès and Alain Giorgetti. Énumération des cartes pointées sur une surface orientable de genre quelconque en fonction des nombres de sommets et de faces. Journal of Combinatorial Theory, Series B, 77(1):1–24, September 1999.
[Agama26]
Theophilus Agama. On the Erdős-Turán additive base conjecture. Technical Report 2010.11857v3 [math.GM], arXiv, March 2026.
[AGGM05]
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, and Dahlia Malkhi. Routing in networks with low doubling dimension. Technical Report MSR-TR-2005-175, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, December 2005.
[AGGM06]
Ittai Abraham, Cyril Gavoille, Andrew V. Goldberg, and Dahlia Malkhi. Routing in networks with low doubling dimension. In 26th IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE Computer Society Press, July 2006.
[AGGMW22]
Frederick Anderson, Anirban Ghosh, Matthew Graham, Lucas Mougeot, and David Wisnosky. Bounded-degree plane geometric spanners in practice. Technical Report 2205.03204v1 [cs.CG], arXiv, May 2022.
[AGGNT13]
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. Technical Report 1311.3048v1 [cs.DS], arXiv, November 2013.
[AGGNT14]
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. In 46th Annual ACM Symposium on Theory of Computing (STOC), pages 79–88. ACM Press, May 2014.
[AGGNT19]
Ittai Abraham, Cyril Gavoille, Anupam Gupta, Ofer Neiman, and Kunal Talwar. Cops, robbers, and threatening skeletons: Padded decomposition for minor-free graphs. SIAM Journal on Computing, 48(3):1120–1145, January 2019.
[AGH11]
Rachit Agarwal, Philip Brighten Godfrey, and Sariel Har-Peled. Approximate distance queries and compact routing in sparse graphs. In 30th Annual IEEE Conference on Computer Communications (INFOCOM), pages 1754–1762, April 2011.
[AGHJx25]
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi, Peyman Jabbarzade, and Mohammad Mahdavi. Breaking a long-standing barrier: 2-ε approximation for steiner forest. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 373–444. IEEE Computer Society Press, December 2025.
[AGHP15]
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, and Holger Petersen. Simpler, faster and shorter labels for distances in graphs. Technical Report 1504.04498v1 [cs.DS], arXiv, April 2015.
[AGHP15b]
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, and Ely Porat. Distance labeling schemes for trees. Technical Report 1507.02618v1 [cs.DS], arXiv, July 2015.
[AGHP16]
Stephen Alstrup, Cyril Gavoille, Esben Bistrup Halvorsen, and Holger Petersen. Simpler, faster and shorter labels for distances in graphs. In 27th Symposium on Discrete Algorithms (SODA), pages 338–350. ACM-SIAM, January 2016.
[AGHP16b]
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, and Ely Porat. Distance labeling schemes for trees. In 43rd International Colloquium on Automata, Languages and Programming (ICALP), volume 55 of LIPIcs, pages 132:1–132:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2016.
[AGK08]
Isolde Adler, Martin Grohe, and Stephan Kreutzer. Computing excluded minors. In 19th Symposium on Discrete Algorithms (SODA), pages 641–650. ACM-SIAM, January 2008.
[AGKKW98]
Sanjeev Arora, Michelangelo Grigni, David R. Karger, Philip N. Klein, and Andrzej Woloszyn. A polynomial-time approximation scheme for weighted planar graph TSP. In 9th Symposium on Discrete Algorithms (SODA), pages 33–41. ACM-SIAM, 1998.
[AGKMS10]
Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis. Proceedings of the 37th international colloquium on automata, languages and programming, icalp 2010, bordeaux, france, july 6-10, 2010, part I & II, volume 6198 & 6199 of Lecture Notes in Computer Science (ARCoSS). Springer, July 2010.
[AGKR01]
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, and Theis Rauhe. Identifying nearest common ancestors in a distributed environment. Technical Report IT-C Series 2001-6, ISSN 1600-6100, The IT University of Copenhagen, August 2001.
[AGKR02]
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, and Theis Rauhe. Nearest common ancestors: A survey and a new distributed algorithm. In 14th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 258–264. ACM Press, August 2002.
[AGKR04]
Stephen Alstrup, Cyril Gavoille, Haim Kaplan, and Theis Rauhe. Nearest common ancestors: A survey and a new algorithm for a distributed environment. Theory of Computing Systems, 37(3):441–456, May 2004.
[AGL04]
Mattias Andersson, Joachim Gudmundsson, and Christos Levcopoulos. Approximate distance oracles for graphs with dense clusters. In 15th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3341 of Lecture Notes in Computer Science, pages 53–64. Springer, 2004.
[AGLLV23]
Dorit Aharonov, Xun Gao, Zeph Landau, Yunchao Liu, and Umesh V. Vazirani. A polynomial-time classical algorithm for noisy random circuit sampling. In 55th Annual ACM Symposium on Theory of Computing (STOC), pages 945–957. ACM Press, June 2023.
[AGLP89]
Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, and Serge A. Plotkin. Network decomposition and locality in distributed computation. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 364–369. IEEE Computer Society Press, May 1989.
[AGM04]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. Routing with improved communication-space trade-off. In 18th International Symposium on Distributed Computing (DISC), volume 3274 of Lecture Notes in Computer Science, pages 305–319. Springer, October 2004.
[AGM04a]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. Routing with improved communication-space trade-off. Research Report RR-1330-04, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, July 2004.
[AGM05]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. Compact routing for graphs excluding a fixed minor. In 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 442–456. Springer, September 2005.
[AGM05a]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. On space-stretch trade-offs for compact routing schemes. Research Report RR-1374-05, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, November 2005.
[AGM06a]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. On space-stretch trade-offs: Upper bounds. In 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 207–216. ACM Press, July 2006.
[AGM06b]
Ittai Abraham, Cyril Gavoille, and Dahlia Malkhi. On space-stretch trade-offs: Lower bounds. In 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 217–224. ACM Press, July 2006.
[AGMNT04]
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, and Mikkel Thorup. Compact name-independent routing with minimum stretch. In 16th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 20–24. ACM Press, July 2004.
[AGMNT08]
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, and Mikkel Thorup. Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms, 3(4):Article No. 37, pp. 1–12, June 2008.
[AGMW06]
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder. Strongly-bounded sparse decompositions of minor free graphs. Technical Report MSR-TR-2006-192, Microsoft Research, Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, December 2006.
[AGMW07]
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder. Strong-diameter decompositions of minor free graphs. In 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 16–24. ACM Press, June 2007.
[AGMW10]
Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, and Udi Wieder. Strong-diameter decompositions of minor free graphs. Theory of Computing Systems, 47(4):837–855, November 2010.
[AGMW18]
Amir Abboud, Paweł Gawrychowski, Shay Mozes, and Oren Weimann. Near-optimal compression for the planar graph metric. In 29th Symposium on Discrete Algorithms (SODA), pages 530–549. ACM-SIAM, 2018.
[AGPV88]
Baruch Awerbuch, Oded Goldreich, David Peleg, and Ronen Vainish. A tradeoff between information and communication in broadcast protocols. Technical report, MIT/LCS/TM-365, 1988.
[AGPV90]
Baruch Awerbuch, Oded Goldreich, David Peleg, and Ronen Vainish. A trade-off between information and communication in broadcast protocols. Journal of the ACM, 37(2):238–256, April 1990.
[AGR89]
Yehuda Afek, Eli Gafni, and Moty Ricklin. Upper and lower bounds for routing schemes in dynamic networks. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 370–375. IEEE Computer Society Press, October 1989.
[AGR92]
Yehuda Afek, Eli Gafni, and Adi Rosén. The slide mechanism with applications in dynamic networks. In 11th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 35–46. ACM Press, October 1992.
[AGRC18]
Stephen Alstrup, Agelos Georgakopoulos, Eva Rotenberg, and Carsten Thomassen. A Hamiltonian cycle in the square of a 2-connected graph in linear time. In 29th Symposium on Discrete Algorithms (SODA), pages 1645–1649. ACM-SIAM, 2018.
[AGRTZ05]
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe, Mikkel Thorup, and Uri Zwick. Union-find with constant time deletions. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 78–89. Springer, August 2005.
[AH00]
Susanne Albers and Monika Rauch Henzinger. Exploring unknown environments. SIAM Journal on Computing, 29(4):1164–1188, January 2000.
[AH89]
Dan Steven Archdeacon and John Philip Huneke. A Kuratowski theorem for nonorientable surfaces. Journal of Combinatorial Theory, Series B, 46(2):173–231, April 1986.
[AHdLT05]
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms, 1(2):243–264, 2005.
[AHdLT98]
Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Direct routing on trees. In 9th Symposium on Discrete Algorithms (SODA), pages 342–349. ACM-SIAM, 1998.
[AHGL14]
Stephen Alstrup, Esben Bistrup Halvorsen, and Kasper Green Larsen. Near-optimal labeling schemes for nearest common ancestors. In 25th Symposium on Discrete Algorithms (SODA), pages 972–982. ACM-SIAM, January 2014.
[AHK87]
Sheldon B. Akers, Dov Harel, and Balakrishnan Krishnamurthy. The star graph: An attractive alternative to the n-cube. In 2nd International Conference on Parallel Processing (ICPP), pages 393–400, August 1987.
[AHL02]
Noga Alon, Shlomo Hoory, and Nathan Linial. The Moore bound for irregular graphs. Graphs and Combinatorics, 18(1):53–57, March 2002.
[Ahmed09]
Mustaq Ahmed. Ordered interval routing schemes. Journal of Discrete Algorithms, 7(4):363–376, December 2009.
[Aho90]
Alfred V. Aho. Algorithms for finding patterns in strings. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 255–300. North-Holland, 1990.
[AHR98]
Stephen Alstrup, Thore Husfeldt, and Theis Rauhe. Marked ancestor problems. In 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 534–543. IEEE Computer Society Press, November 1998.
[AHU74]
Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
[AHVHx06]
Oswin Aichholzer, Thomas Hackl, Birgit Vogtenhuber, Clemens Huemer, Ferran Hurtado, and Hannes Krasser. On the number of plane graphs. In 17th Symposium on Discrete Algorithms (SODA), pages 504–513. ACM-SIAM, January 2006.
[Aider02]
Méziane Aïder. Almost distance-hereditary graphs. Discrete Mathematics, 242(1-3):1–16, January 2002.
[AINR14]
Alexandr Andoni, Piotr Indyk, Huy L. Nguyễn, and Ilya Razenshteyn. Beyond locality-sensitive hashing. In 25th Symposium on Discrete Algorithms (SODA), pages 1018–1028. ACM-SIAM, January 2014.
[AIY13]
Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In ACM International Conference on Management of Data (SIGMOD), pages 349–360. ACM Press, June 2013.
[AIY13a]
Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. Fast exact shortest-path distance queries on large networks by pruned landmark labeling. Technical Report 1304.4661v1 [cs.DS], arXiv, April 2013.
[AJ20]
Sharareh Alipour and Amir Jafari. A LOCAL constant approximation factor algorithm for minimum dominating set of certain planar graphs. In 32nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 501–502. ACM Press, July 2020.
[AJB99]
Réka Albert, Hawoong Jeong, and Albert-László Barabasi. Diameter of the world-wide web. Nature, 401:130–131, 1999.
[AJKK25]
Tara Albrisshami, Raphael W. Jacobs, Paul Knappe, and Jonas Kobler. Locally chordal graphs. Technical Report 2501.17320v1 [math.CO], arXiv, January 2025.
[AJKW24]
Sandra Albrechtsen, Raphael W. Jacobs, Paul Knappe, and Paul Wollan. A characterisation of graphs quasi-isometric to K4-minor-free graphs. Technical Report 2408.15335v1 [math.CO], arXiv, August 2024.
[Ajtai13]
Miklós Ajtai. Lower bounds for RAMs and quantifier elimination. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 803–812. ACM Press, June 2013.
[Ajtai98]
Miklós Ajtai. The shortest vector problem in L2 is NP-hard for randomized reductions. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 10–19. ACM Press, May 1998.
[AK15]
Isolde Adler and Mamadou Moustapha Kanté. Linear rank-width and linear clique-width of trees. Theoretical Computer Science, 589:87–98, July 2015.
[AK90]
Alok Aggarwal and Maria Klawe. Applications of generalized matrix searching to geometric algorithms. Discrete Applied Mathematics, 27(1-2):3–23, May 1990.
[AK97]
Paola Alimonti and Viggo Kann. Hardness of approximating problems on cubic graphs. In 3rd Italian Conference on Algorithms and Complexity (CIAC), volume 1203 of Lecture Notes in Computer Science, pages 288–298. Springer, March 1997.
[AK97b]
Amihood Amir and Dmitry Keselman. Maximum agreement subtree in a set of evolutionary trees: Metrics and efficient algorithms. SIAM Journal on Computing, 26(6):1656–1669, December 1997.
[AKBS17]
Faisal N. Abu-Khzam, Édouard Bonnet, and Florian Sikora. On the complexity of various parameterizations of common induced subgraph isomorphism. Theoretical Computer Science, 697:69–78, October 2017.
[AKJ05]
Nadeem Ahmed, Salil S. Kanhere, and Sanjay Jha. The holes problem in wireless sensor networks: A survey. ACM SIGMOBILE Mobile Computing and Communications Review, 9(2):4–18, 2005.
[AKK16]
Andris Ambainis, Martins Kokainis, and Robin Kothari. Nearly optimal separations between communication (or query) complexity and partitions. In Ran Raz, editor, 31st Conference on Computational Complexity (CCC), volume 50 of LIPIcs, pages 4:1–4:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, May 2016.
[AKKV05]
Mikhail Alekhnovich, Subhash A. Khot, Guy Kindler, and Nisheeth K. Vishnoi. Hardness of approximating the closest vector problem with pre-processing. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 216–225. IEEE Computer Society Press, October 2005.
[AKLPx22]
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, and Ohad Trabelsi. Breaking the cubic barrier for all-pairs max-flow: Gomory-Hu tree in nearly quadratic time. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 884–895. IEEE Computer Society Press, October 2022.
[AKLPx25]
Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Wuwei Yuan, and Weixuan Yuan. Deterministic almost-linear-time Gomory-Hu trees. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 660–667. IEEE Computer Society Press, December 2025.
[AKLZ24]
Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, and Viktor Zamaraev. Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions. Technical Report 2402.12559v1 [math.CO], arXiv, February 2024.
[AKM01]
Serge Abiteboul, Haim Kaplan, and Tova Milo. Compact labeling schemes for ancestor queries. In 12th Symposium on Discrete Algorithms (SODA), pages 547–556. ACM-SIAM, January 2001.
[AKP91]
Baruch Awerbuch, Shay Kutten, and David Peleg. Efficient deadlock-free routing. In 10th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 177–188. ACM Press, July 1991.
[AKPR05]
Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, and Radhika Ramamurthi. Graph minors and reliable single message transmission. SIAM Journal on Discrete Mathematics, 19(4):815–847, 2005.
[AKPW95]
Noga Alon, Richard M. Karp, David Peleg, and Douglas B. West. A graph-theoretic game and its application to the k-serveur problem. SIAM Journal on Computing, 24(1):78–100, February 1995.
[AKR03]
Eyal Amir, Robert Krauthgamer, and Satish B. Rao. Constant factor approximation of vertex-cuts in planar graphs. In 35th Annual ACM Symposium on Theory of Computing (STOC), pages 90–99. ACM Press, 2003.
[AKS03]
Noga Alon, Michael Krivelevich, and Benny Sudakov. Turán numbers of bipartite graphs and related Ramsey-type questions. Combinatorics, Probability and Computing, 12(5-6):477–494, 2003.
[AKS04]
Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. PRIMES is in P. Annals of Mathematics, 160(2):781–793, 2004.
[AKS12]
Hyung-Chan An, Robert D. Kleinberg, and David B. Shmoys. Improving christofides' algorithm for the s-t path TSP. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 875–885. ACM Press, May 2012.
[AKS80]
Miklós Ajtai, János Komlós, and Endre Szemerédi. A note on Ramsey numbers. Journal of Combinatorial Theory, Series A, 29(3):354–360, November 1980.
[AKTZ15]
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, and Uri Zwick. Adjacency labeling schemes and induced-universal graphs. In 47th Annual ACM Symposium on Theory of Computing (STOC), pages 625–634. ACM Press, June 2015.
[AKTZ19]
Stephen Alstrup, Haim Kaplan, Mikkel Thorup, and Uri Zwick. Adjacency labeling schemes and induced-universal graphs. SIAM Journal on Discrete Mathematics, 33(1):116–137, 2019.
[AL03]
Faisal N. Abu-Khzam and Michael A. Langston. Faces in the crowd: On the algorithmic utility of disks and covers. Technical report, University of Tennesse, Knoxville, USA, 2003.
[AL04]
Faisal N. Abu-Khzam and Michael A. Langston. A direct algorithm for the parameterized face cover problem. In 1st International Workshop on Parameterized and Exact Computation (IWPEC), volume 3162 of Lecture Notes in Computer Science, pages 213–222. Springer, September 2004.
[AL07]
Faisal N. Abu-Khzam and Michael A. Langston. Linear-time algorithms for planar graphs of fixed disk dimension. Information Processing Letters, 101(1):36–40, January 2007.
[AL08]
Mustaq Ahmed and Anna Lubiw. Shortest paths avoiding forbidden subpaths. Technical Report 0807.0807v1 [cs.DM], arXiv, July 2008.
[AL09]
Mustaq Ahmed and Anna Lubiw. Shortest paths avoiding forbidden subpaths. In 26th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3 of LIPIcs, pages 63–74. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2009.
[AL97]
Emile H.L. Aarts and Jan Karel Lenstra. Local search in combinatorial optimization. Jon Wiley & Sons, 1997.
[Alekseev93]
Vladimir E. Alekseev. On the entropy of hereditary classes of graphs. Discrete Mathematics and Applications, 3(2):191–199, 1993.
[Alfonsin05]
Jorge Luis Ramírez Alfonsín. The diophantine frobenius problem, volume 30 of Lecture Series in Mathematics and Its Applications. Oxford University Press, 2005.
[ALMMx03]
Cédric Adjih, Anis Laouiti, Pascale Minet, Paul Mühlethaler, Amir Qayyum, and Laurent Viennot. The optimised routing protocol for mobile ad-hoc networks: protocol specification. Technical Report 5145, INRIA, March 2003.
[ALN05]
Sanjeev Arora, James R. Lee, and Assaf Naor. Euclidean distortion and the sparsest cut. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 553–562. ACM Press, May 2005.
[ALNP17]
Chen Avin, Lotker Zvi, Yinon Nahum, and David Peleg. Improved degree bounds and full spectrum power laws in preferential attachment networks. In ACM SIG Conference on Knowledge, Discovery and Data Mining (KDD), pages 45–53. ACM Press, August 2017.
[Alon10]
Noga Alon. A non-linear lower bound for planar epsilon-nets. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 341–346. IEEE Computer Society Press, October 2010.
[Alon17]
Noga Alon. Asymptotically optimal induced universal graphs. Geometric and Functional Analysis, 27(1):1–32, February 2017.
[Alon24]
Noga Alon. Implicit representation of sparse hereditary families. Discrete & Computational Geometry, 72(2):476–482, 2024.
[Alon87]
Noga Alon. Splitting necklaces. Advances in Mathematics, 63(3):247–253, March 1987.
[ALP18]
Hugo A. Akitaya, Maarten Löffler, and Irene Parada. How to fit a tree in a box. In Therese C. Biedl and Andreas Kerren, editors, 26th International Symposium on Graph Drawing and Network Visualization (GD), volume 11282 of Lecture Notes in Computer Science, pages 361–367. Springer, September 2018.
[ALQRx24]
Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich, Igor Razgon, and Viktor Zamaraev. The treewidth and pathwidth of graph unions. SIAM Journal on Discrete Mathematics, 38(1):261–276, 2024.
[Alspach08]
Brian Alspach. The wonderful Walecki construction. Bulletin of the Institute of Combinatorics & Its Applications, 52:7–20, January 2008.
[Alspach97]
Brian Alspach. Isomorphism and Cayley graphs on abelian groups. In Gena Hahn and Gert Sabidussi, editors, Graph Symmetry: Algebraic Methods and Applications, volume 497 of NATO ASI Series C: Mathematical and Physical Sciences, pages 1–22. Kluwer Academic, July 1997.
[ALW07]
Noga Alon, Andrzej Lingas, and Martin Wahlen. Approximating the maximum clique minor and some subgraph homeomorphism problems. Theoretical Computer Science, 374(1-3):149–158, April 2007.
[ALWZ20]
Ryan Alweiss, Shachar Lovett, Kewen Wu, and Jiapeng Zhang. Improved bounds for the sunflower lemma. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 624–630. ACM Press, June 2020.
[AM04]
Ittai Abraham and Dahlia Malkhi. Compact routing on Euclidian metrics. In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 141–149. ACM Press, July 2004.
[AM05]
Ittai Abraham and Dahlia Malkhi. Name independent routing for growth bounded networks. In 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 49–55. ACM Press, July 2005.
[AM13]
Arash Farzana and J. Ian Munro. Succinct encoding of arbitrary graphs. Theoretical Computer Science, 513:38–52, November 2013.
[AM17]
Haris Aziz and Simon Mackenzie. A discrete and bounded envy-free cake cutting protocol for any number of agents. Technical Report 1604.03655v12 [cs.DS], arXiv, August 2017.
[AM25]
Aryan Agarwala and Ian Mertz. Bipartite matching is in catalytic logspace. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 360–372. IEEE Computer Society Press, December 2025.
[AM85]
Noga Alon and V.D. Milman. λ1, isoperimetric inequalities for graphs, and superconcentrators. Journal of Combinatorial Theory, Series B, 38(1):73–88, February 1985.
[Ambainis13]
Andris Ambainis. Superlinear advantage for exact quantum algorithms. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 891–900. ACM Press, June 2013.
[AMD04]
Ittai Abraham, Dahlia Malkhi, and Oren Dobzinski. LAND: stretch (1+ε) locality-aware networks for DHTs. In 15th Symposium on Discrete Algorithms (SODA), pages 550–559. ACM-SIAM, January 2004.
[Amir01]
Eyal Amir. Efficient approximation for triangulation of minimum treewidth. In 17th Conference on Uncertainty in Artificial Intelligence (UAI), pages 7–15. Morgan Kaufmann, August 2001.
[AMM01]
Sunil Arya, Theocharis Malamatos, and David M. Mount. A simple entropy-based algorithm for planar point location. In 12th Symposium on Discrete Algorithms (SODA), pages 262–268. ACM-SIAM, January 2001.
[AMM09]
Sunil Arya, Theocharis Malamatos, and David M. Mount. Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM, 57(1):Article No. 1, pp. 1–54, November 2009.
[AMO93]
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: Theory, algorithms, and applications. Prentice Hall, 1993.
[AMP25]
Julio A. Alonso, Pedro A. Martín, and Pier Luigi Papini. Perimeter of triangles inscribed in the unit ball of normed planes. Mediterranean Journal of Mathematics, 22(46), February 2025.
[AMR09]
Ittai Abraham, Dahlia Malkhi, and David Ratajczak. Compact multicast routing. In 23rd International Symposium on Distributed Computing (DISC), volume 5805 of Lecture Notes in Computer Science, pages 364–378. Springer, September 2008.
[AMRT96]
Arne Andersson, Peter Bro Miltersen, Søren Riis, and Mikkel Thorup. Static dictionaries on AC0 RAMs: Query time θ(√logn/loglogn) is necessary and sufficient. In 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 441–450. IEEE Computer Society Press, October 1996.
[AMS89]
Baruch Awerbuch, Yishay Mansour, and Nir Shavit. Polynomial end-to-end communication. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 358–363. IEEE Computer Society Press, October 1989.
[AMW23]
Amir Abboud, Shay Mozes, and Oren Weimann. What else can Voronoi diagrams do for diameter in planar graphs?In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 4:1–4:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[AMY16]
Noga Alon, Shay Moran, and Amir Yehudayoff. Sign rank versus VC dimension. In Vitaly Feldman, Alexander Rakhlin, and Ohad Shamir, editors, 29th Annual Conference on Learning Theory, volume 49 of Proceedings of Machine Learning Research, pages 47–80, June 2016.
[AMY16a]
Noga Alon, Shay Moran, and Amir Yehudayoff. Sign rank versus VC dimension. Technical Report 1503.07648v2 [math.CO], arXiv, July 2016.
[AMZ97]
Srinivasa R. Arikati, Anil Maheshwari, and Christos D. Zaroliagis. Efficient computation of implicit representations of sparse graphs. Discrete Applied Mathematics, 78(1-3):1–16, October 1997.
[AN12]
Ittai Abraham and Ofer Neiman. Using petal-decompositions to build a low stretch spanning tree. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 395–405. ACM Press, May 2012.
[AN17]
Noga Alon and Rajko Nenadov. Optimal induced universal graphs for bounded-degree graphs. In 28th Symposium on Discrete Algorithms (SODA), pages 1149–1157. ACM-SIAM, January 2017.
[AN96]
Noga Alon and Moni Naor. Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica, 16(4-5):434–449, October 1996.
[Andersen92]
Lars Døvling Andersen. The strong chromatic index of a cubic graph is at most 10. Discrete Mathematics, 108(1-3):231–252, October 1992.
[Anderson05]
James W. Anderson. Hyperbolic geometry. Springer Undergraduate Mathematics Series. Springer, 2005.
[Andreae86]
Thomas Andreae. On a pursuit game played on graphs for which a minor is excluded. Journal of Combinatorial Theory, Series B, 41(1):37–47, August 1986.
[ANIM96]
Nechama Allenberg-Navony, Alon Itai, and Shlomo Moran. Average and randomized complexity of distributed problems. SIAM Journal on Computing, 25(6):1254–1267, 1996.
[AOdMx18]
Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz. Distributed domination on graph classes of bounded expansion. In 30th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 143–151. ACM Press, July 2018.
[AP86]
Stefan Arnborg and Andrzej Proskurowski. Characterization and recognition of partial 3-trees. SIAM Journal on Algebraic and Discrete Methods, 7(2):305–314, April 1987.
[AP89]
Stefan Arnborg and Andrzej Proskurowski. Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics, 23(1):11–24, April 1989.
[AP90]
Baruch Awerbuch and David Peleg. Sparse partitions. In 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 503–513. IEEE Computer Society Press, October 1990.
[AP90a]
Baruch Awerbuch and David Peleg. Network synchronization with polylogarithmic overhead. In 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 514–522. IEEE Computer Society Press, October 1990.
[AP92]
Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM Journal on Discrete Mathematics, 5(2):151–162, May 1992.
[APC90]
Stefan Arnborg, Andrzej Proskurowski, and Derek G. Corneil. Forbidden minors characterization of partial 3-trees. Discrete Mathematics, 80(1):1–19, February 1990.
[Apostol76]
Tom M. Apostol. Introduction to analytic number theory. Springer, Berlin, 1976.
[Apostol95]
Tom M. Apostol. Introduction to analytic number theory (corrected fourth printing). Springer, 1995.
[AppierHanzelet26]
Jean Appier Hanzelet. Récréation mathématicqve composée de plvsievrs problèmes plaisants et facétievx. Vniversité de Pont-à-Mousson, 1626.
[APR10]
Avi Averbuch, I. Peeri, and Yehuda Roditty. Improved upper bound on m-time-relaxed k-broadcasting communication networks, 2010.
[APT05]
Juan Carlos Álvarez Paiva and Anthony Thompson. On the perimeter and area of the unit disc. The American Mathematical Monthly, 112(2):141–154, February 2005.
[AR01]
Stephen Alstrup and Theis Rauhe. Improved labeling scheme for ancestor queries. Technical Report IT-C Series 2001-5, ISSN 1600-6100, The IT University of Copenhagen, August 2001.
[AR02]
Stephen Alstrup and Theis Rauhe. Improved labeling scheme for ancestor queries. In 13th Symposium on Discrete Algorithms (SODA), pages 947–953. ACM-SIAM, January 2002.
[AR02b]
Stephen Alstrup and Theis Rauhe. Small induced-universal graphs and compact implicit graph representations. In 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 53–62. IEEE Computer Society Press, November 2002.
[AR14]
David Adjiashvili and Noy Rotbart. Labeling schemes for bounded degree graphs. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, 41st International Colloquium on Automata, Languages and Programming (ICALP), volume 8573 of Lecture Notes in Computer Science (ARCoSS), pages 375–386. Springer, July 2014.
[AR20]
Maor Akav and Liam Roditty. An almost 2-approximation for all-pairs of shortest paths in subquadratic time. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 1–11. ACM-SIAM, January 2020.
[AR25]
Aida Abiad and Luuk Reijnders. Eigenvalue bounds for distance-edge colorings. Technical Report 2506.20976v1 [math.CO], arXiv, June 2025.
[AR92]
Yehuda Afek and Moty Ricklin. Sparser: A paradigm for running distributed algorithms. In 6th International Workshop on Distributed Algorithms (WDAG), volume 647 of Lecture Notes in Computer Science, pages 1–10, November 1992.
[AR93]
Yehuda Afek and Moty Ricklin. Sparser: A paradigm for running distributed algorithms. Journal of Algorithms, 14(2):316–328, March 1993.
[Archdeacon80]
Dan Steven Archdeacon. A Kuratowski theorem for the projective plane. PhD thesis, The Ohio State University, 1980.
[Archdeacon81]
Dan Steven Archdeacon. A Kuratowski theorem for the projective plane. Journal of Graph Theory, 5(3):243–246, 1981.
[Arfaoui14]
Heger Arfaoui. Local distributed decision and verification. PhD thesis, Université Paris Diderot, France, July 2014.
[Arkhipov12]
Alex Arkhipov. Extending and characterizing quantum magic games. Technical Report 1209.3819v1 [quant-ph], arXiv, September 2012.
[Arnborg85]
Stefan Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability. BIT Numerical Mathematics, 25(1):2–23, 1985.
[Arora98]
Sanjeev Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5):753–782, September 1998.
[ARS97]
Laurent Alonso, Jean-Luc Rémy, and René Schott. A linear-time algorithm for the generation of trees. Algorithmica, 17(2):162–182, February 1997.
[AS00]
Noga Alon and Joel H. Spencer. The probabilistic method. Wiley-Interscience Publication, 2000.
[AS03]
Baruch Awerbuch and Christian Scheideler. Peer-to-peer systems for prefix search. In 22nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 123–132. ACM Press, 2003.
[AS10]
Matti Astrand and Jukka Suomela. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In 22nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 294–302. ACM Press, June 2010.
[AS15]
Alessandro Arlotto and J. Michael Steele. Beardwood-Halton-Hammersley theorem for stationary ergodic sequences: a counterexample. Technical Report 1307.0221v4 [math.PR], arXiv, August 2015.
[AS25]
Sepehr Assadi and Janani Sundaresan. Distributed triangle detection is hard in few rounds. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 757–768. IEEE Computer Society Press, December 2025.
[AS80]
D.B. Arnold and M. Ronan Sleep. Uniform random generation of balanced parenthesis strings. ACM Transactions on Programming Languages and Systems, 2(1):122–128, 1980.
[AS92]
Noga Alon and Joel H. Spencer. The probabilistic method. John Wiley & Sons, 1992.
[Aspnes05]
James Aspnes. Distributed breadth-first search. In Notes on Theory of Distributed Systems, chapter 5. Yale University, 2005.
[ASS19]
Saeed Akhoondian Amiri, Stefan Schmid, and Sebastian Siebertz. Distributed dominating set approximations beyond planar graphs. ACM Transactions on Algorithms, 15(3):Article No. 39, pp. 1–18, 2019.
[AST90]
Noga Alon, Paul D. Seymour, and Robin Thomas. A separator theorem for graphs with an excluded minor and its applications. In 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 293–299. ACM Press, May 1990.
[AST94]
Noga Alon, Paul D. Seymour, and Robin Thomas. Planar separators. SIAM Journal on Discrete Mathematics, 7(2):184–193, 1994.
[ASZ22]
Akanksha Agrawal, Saket Saurabh, and Meirav Zehavi. A finite algorithm for the realizabilty of a Delaunay triangulation. Technical Report 2210.03932v1 [cs.DS], arXiv, October 2022.
[AT00]
Charles L. Adler and James Tanton. 𝜋 is the minimum value for pi. The College Mathematics Journal, 31(2):102–106, March 2000.
[AT03]
David L. Applegate and Mikkel Thorup. Load optimal MPLS routing with N+M labels. In 22nd Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 1, pages 555–565, June 2003.
[ATG05]
Saeed Alaei, Mohammad Toossi, and Mohammad Ghodsi. Skiptree: A scalable range-queryable distributed data structure for multidimensional data. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 298–307. Springer, December 2005.
[Atminas17]
Aistis Atminas. Classes of graphs without star forests and related graphs. Technical Report 1711.01483v2 [math.CO], arXiv, November 2017.
[ATMT15]
Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, and Atsuhiro Takasu. On the complexity of finding a largest common subtree of bounded degree. Theoretical Computer Science, 590:2–16, July 2015.
[Avis81]
David Avis. Worst case bounds for the Euclidean matching problem. Computers & Mathematics with Applications, 7(3):251–257, 1981.
[AVW21]
Josh Alman and Virginia Vassilevska Williams. A refined laser method and faster matrix multiplication. In 32nd Symposium on Discrete Algorithms (SODA), pages 522–539. ACM-SIAM, January 2021.
[AVWW16]
Amir Abboud, Virginia Vassilevska Williams, and Joshua Wang. Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In 27th Symposium on Discrete Algorithms (SODA), pages 377–391. ACM-SIAM, January 2016.
[AW04]
Hagit Attiya and Jennifer Welch. Distributed computing: Fundamentals, simulations, and advanced topics. Wiley-Interscience Publication, 2004.
[AW86]
Noga Alon and Douglas B. West. The Borsuk-Ulam theorem and bisection of necklaces. Proceedings of the American Mathematical Society, 98(4):623–628, December 1986.
[Awerbuch85]
Baruch Awerbuch. Complexity of network synchronization. Journal of the ACM, 32(4):804–823, 1985.
[Awerbuch87]
Baruch Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 230–240. ACM Press, May 1987.
[Awerbuch87a]
Baruch Awerbuch. Distributed shortest paths algorithms. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 490–500. ACM Press, May 1987.
[AWY05]
Pankaj K. Agarwal, Yusu Wang, and Peng Yin. Lower bound for sparse Euclidean spanners. In 16th Symposium on Discrete Algorithms (SODA), pages 670–671. ACM-SIAM, January 2005.
[AY05]
Noga Alon and Raphael Yuster. On a hypergraph matching problem. Graphs and Combinatorics, 21:377–384, December 2005.
[AY16]
Hugo A. Akitaya and Jingjin Yu. Freeze tag awakening in euclidean spaces. In 26th Annual Fall Workshop on Computational Geometry (FWCG), October 2016.
[AYZ95]
Noga Alon, Raphael Yuster, and Uri Zwick. Color-coding. Journal of the ACM, 42(4):844–856, 1995.
[AZ06]
Martin Aigner and Günter M. Ziegler. Raisonnements divins. Springer, 2006.
[AZ20]
Ernst Althaus and Sarah Ziegler. Optimal tree decompositions revisited: A simpler linear-time FPT algorithm. In Claudio Gentile, Giuseppe Stecca, and Paolo Ventura, editors, Graphs and Combinatorial Optimization: from Theory to Applications (CTW), volume 5 of AIRO Springer Series, pages 67–78, September 2020.
[Babai16]
László Babai. Graph isomorphism in quasipolynomial time [extended abstract]. In 48th Annual ACM Symposium on Theory of Computing (STOC), pages 684–697. ACM Press, June 2016.
[Babai19]
László Babai. Canonical form for graphs in quasipolynomial time [preliminary report]. In Moses Charikar and Edith Cohen, editors, 51st Annual ACM Symposium on Theory of Computing (STOC), pages 1237–1246. ACM Press, June 2019.
[Baez87]
John Baez. Bell's inequality for C*-algebras. Letters in Mathematical Physics, 13(2):136–137, February 1987.
[BAG01]
Amir M. Ben-Amram and Zvi Galil. A generalization of a lower bound technique due to Fredman and Saks. Algorithmica, 30(1):34–66, May 2001.
[BAJ00]
Albert-László Barabasi, Réka Albert, and Hawoong Jeong. Scale-free characteristics of random networks: The topology of the world wide web. Physica A: Statistical Mechanics and its Applications, 281(1-4):69–77, June 2000.
[Baker94]
Brenda S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153–180, January 1994.
[Bakker91]
Erwin Maria Bakker. Combinatorial problems in information networks and distributed datastructuring. PhD thesis, Utrecht University, Nederlands, May 1991.
[Balliu17]
Alkida Ballui. Distributed local decision with applications to routing schemes. PhD thesis, GSSI Gran Sasso Science Institute, L'Aquila, Italy and IRIF, Université Paris 7, France, October 2017.
[Banachowski80]
Lech Banachowski. A complement to Tarjan's result about the lower bound on the complexity of the set union problem. Information Processing Letters, 11(2):59–65, October 1980.
[Banerjee22]
Avah Banerjee. An adjacency labeling scheme based on a decomposition of trees into caterpillars. In Cristina Bazgan and Henning Fernau, editors, 33rd International Workshop on Combinatorial Algorithms (IWOCA), volume 13270 of Lecture Notes in Computer Science, pages 114–127. Springer, June 2022.
[Baniata25]
Hamza Baniata. On "solving the travelling salesman problem using a single qubit" vs. quantum genetic optimization: Are we there?In Cristina Bazgan and Henning Fernau, editors, Proceedings of the Genetic and Evolutionary Computation Conference Companion (GECCO), pages 2396–2402. ACM, August 2025.
[Barat24]
János Barát. On the number of edges in a K5-minor-free graph of given girth. Discrete Mathematics, 347(7):114042, July 2024.
[Barbay07]
Jérémy Barbay. Succinct data structures, adaptive (analysis of) algorithms: Overview, combination, and perspective. Technical Report CS-2007-33, Cheriton School of Computer Science, University of Waterloo, Canada, 2007.
[Barenboim12]
Leonid Barenboim. On the locality of some NP-complete problems. In Artur Czumaj, Kurt Mehlhorn, Andrew Pitts, and Roger Wattenhofer, editors, 39th International Colloquium on Automata, Languages and Programming (ICALP), volume 7392 of Lecture Notes in Computer Science, pages 403–415. Springer, July 2012.
[Barenboim15]
Leonid Barenboim. Deterministic (δ+1)-coloring in sublinear (in δ) time in static, dynamic and faulty networks. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 345–354. ACM Press, July 2015.
[Barnette92]
Daniel W. Barnette. 3-trees in polyhedral maps. Israel Journal of Mathematics, 79(2-3):251–256, 1992.
[Barrett06]
Jonathan Barrett. Information processing in generalized probabilistic theories. Technical Report 0508211v3 [quant-ph], arXiv, November 2006.
[Bartal98]
Yair Bartal. On approximating arbitrary metrics by tree metrics. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 161–168. ACM Press, May 1998.
[Bartnik78]
Wladyslaw Georges Bartnik. Algorithmes de couplage dans les graphes. PhD thesis, Université Pierre et Marie Curie - Paris 6 -, France, 1978.
[Baswana06]
Surender Baswana. Dynamic algorithms for graph spanners. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 76–87. Springer, September 2006.
[Baucher26]
Edgar Baucher. Graphes universels isométriques. PhD thesis, Université Bordeaux, Talence, France, June 2026.
[BB06]
Therese C. Biedl and Franz J. Brandenburg. Partitions of graphs into trees. In 14th International Symposium on Graph Drawing (GD), volume 4372 of Lecture Notes in Computer Science, pages 430–439. Springer, 2006.
[BB07]
Mohsen Bahramgiri and Salman Beigi. Enumerating the classes of local equivalency in graphs. Technical Report math/0702267v2 [math.CO], arXiv, July 2007.
[BB08]
Amitabha Bagchi and Sohit Bansal. Brief announcement: Nearest-neighbor graphs on random point sets and their application to sensor networks. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), page 434. ACM Press, August 2008.
[BB20]
Johannes Batzill and Therese C. Biedl. Order-preserving drawings of trees with approximately optimal height (and small width). Journal of Graph Algorithms and Applications, 24(1):1–19, 2020.
[BB98]
Anne Berry and Jean-Paul Bordat. Separability generalizes Dirac's theorem. Discrete Applied Mathematics, 84(1-3):43–53, May 1998.
[BBBCT18]
Marthe Bonamy, Édouard Bonnet, Pierre Charbit, and Stéphan Thomassé. EPTAS for max clique on disks and unit balls. In 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 568–579. IEEE Computer Society Press, October 2018.
[BBCOx19]
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. The distributed complexity of locally checkable problems on paths is decidable. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 262–271. ACM Press, July 2019.
[BBCOx22]
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. Efficient classification of locally checkable problems in regular trees. In Christian Scheideler, editor, 38th International Symposium on Distributed Computing (DISC), volume 246 of LIPIcs, pages 8:1–8:19. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2022.
[BBCR14]
Jasine Babu, Manu Basavaraju, L. Sunil Chandran, and Deepak Rajendraprasad. 2-connecting outerplanar graphs without blowing up the pathwidth. Theoretical Computer Science, 554:119–134, October 2014.
[BBD13]
Gerth Stølting Brodal, Andrej Brodnik, and Pooya Davoodi. The encoding complexity of two dimensional range minimum data structures. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 229–240. Springer, September 2013.
[BBD22]
Pierre Bergé, Édouard Bonnet, and Hugues Déprés. Deciding twin-width at most 4 is NP-complete. In 48th International Colloquium on Automata, Languages, and Programming (ICALP), volume 198 of LIPIcs, pages 18:1–18:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2022.
[BBdCx16]
Ahmad Biniaz, Prosenjit Bose, Jean-Lou de Carufel, Cyril Gavoille, Anil Maheshwari, and Michiel Smid. Towards plane spanners of degree 3. In Seok-Hee Hong, editor, 27th Annual International Symposium on Algorithms and Computation (ISAAC), volume 64 of LIPIcs, pages 19:1–19:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2016.
[BBdCx17]
Ahmad Biniaz, Prosenjit Bose, Jean-Lou de Carufel, Cyril Gavoille, Anil Maheshwari, and Michiel Smid. Towards plane spanners of degree 3. Journal of Computational Geometry, 8(1):11–31, 2017.
[BBdCx17a]
Ahmad Biniaz, Prosenjit Bose, Jean-Lou de Carufel, Cyril Gavoille, Anil Maheshwari, and Michiel Smid. Towards plane spanners of degree 3. Technical Report 1606.08824v2 [cs.CG], arXiv, February 2017.
[BBDGx19]
Carla Binucci, Ulrik Brandes, Tim Dwyer, Martin Gronemann, Reinhard von Hanxleden, Marc J. van Kreveld, Petra Mutzel, Marcus Schaefer, Falk Schreiber, and Bettina Speckmann. 10 reasons to get interested in graph drawing. In Bernhard Steffen and Gerhard Woeginger, editors, Computing and Software Science: State of the Art and Perspectives, volume 10000 of Lecture Notes in Computer Science, pages 85–104. Springer, Cham, 2019.
[BBDNS23]
Marthe Bonamy, Fábio Botler, Francois Dross, Tássio Naia, and Jozef Skokan. Separating the edges of a graph by a linear number of paths. Advances in Combinatorics, 6, October 2023.
[BBDX26]
Richard Bi, Peter PETER Bradshaw, Abhishek Dhawan, and Jingwei Xu. The strong chromatic index of Kt,t-free graphs. Technical Report 2603.15207v1 [math.CO], arXiv, March 2026.
[BBEGx20]
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Francois Pirot, and Alex Scott. Surfaces have (asymptotic) dimension 2. Technical Report 2007.03582v1 [math.CO], arXiv, July 2020.
[BBEGx21]
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, Francois Pirot, and Alex Scott. Asymptotic dimension of minor-closed families and Assouad--Nagata dimension of surfaces. Technical Report 2012.02435v3 [math.CO], arXiv, May 2021.
[BBEGx24]
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, Francois Pirot, and Alex Scott. Asymptotic dimension of minor-closed families and Assouad--Nagata dimension of surfaces. Journal of the European Mathematical Society, 26(10):3739–3791, 2024.
[BBFKx96]
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, and Michael E. Saks. Randomized robot navigation algorithms. In 7th Symposium on Discrete Algorithms (SODA), pages 74–84. ACM-SIAM, January 1996.
[BBFMS97]
Mieczysław Borowiecki, Izak Broere, Marietjie Frick, Peter Mihók, and Gabriel Semanišin. A survey of hereditary properties of graphs. Discussiones Mathematicae Graph Theory, 17(1):5–50, 1997.
[BBHMW13]
Gilles Brassard, Anne Broadbent, Esther Hänggi, André Allan Méthot, and Stefan Wolf. Classical, quantum and nonsignalling resources in bipartite games. Theoretical Computer Science, 486:61–72, May 2013.
[BBHOx19]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. Lower bounds for maximal matchings and maximal independent sets. In 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 481–497. IEEE Computer Society Press, November 2019.
[BBK05]
Daniel K. Blandford, Guy E. Blelloch, and Ian A. Kash. Compact representations of separable graphs. In 14th Symposium on Discrete Algorithms (SODA), pages 679–688. ACM-SIAM, January 2005.
[BBKO22]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. Distributed δ-coloring plays hide-and-seek. In 54th Annual ACM Symposium on Theory of Computing (STOC), pages 464–477. ACM Press, June 2022.
[BBKS23]
Ran Ben-Basat, Guy Even, and Ken-ichi Kawarabayashi. Optimal distributed covering algorithms. Distributed Computing, 36(1):45–55, March 2023.
[BBL22]
John Bamberg, Anurag Bishnoi, and Thomas Lesgourgues. The minimum degree of minimal ramsey graphs for cliques. Bulletin of the London Mathematical Society, 54(5):1827–1838, October 2022.
[BBPDx14]
Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, and Ge Xia. New and improved spanning ratios for Yao graphs. In 30th Annual ACM Symposium on Computational Geometry (SoCG), pages 30–39. ACM, June 2014.
[BBR07]
Étienne Birmelé, J. Adrian Bondy, and Bruce A. Reed. The Erdős-Posá property for long circuits. Combinatorica, 27(2):135–145, March 2007.
[BBR07a]
Étienne Birmelé, J. Adrian Bondy, and Bruce A. Reed. Brambles, prisms and grids. In Graph Theory in Paris, Trends in Mathematics, Conference in Memory of Claude Berge, pages 37–44, 2007.
[BBR09]
Étienne Birmelé, J. Adrian Bondy, and Bruce A. Reed. Tree-width of graphs without a 3× 3 grid minor. Discrete Applied Mathematics, 157(12):2577–2596, June 2009.
[BBS04]
József Balogh, Béla Bollobás, and Miklós Simonovits. The number of graphs without forbidden subgraphs. Journal of Combinatorial Theory, Series B, 91(1):1–24, May 2004.
[BBS11]
József Balogh, Béla Bollobás, and Miklós Simonovits. The fine structure of octahedron-free graphs. Journal of Combinatorial Theory, Series B, 101:67–84, March 2011.
[BBSS09]
József Balogh, Béla Bollobás, Michael Saks, and Vera T. Sós. The unlabelled speed of a hereditary graph property. Journal of Combinatorial Theory, Series B, 99(1):9–19, January 2008.
[BBT16]
Marthe Bonamy, Nicolas Bousquet, and Stéphan Thomassé. The Erdős--Hajnal Conjecture for long holes and antiholes. SIAM Journal on Discrete Mathematics, 30(2):1159–1164, 2016.
[BBTvL06]
Erwin Maria Bakker, Hans Leo Bodlaender, Richard B. Tan, and Jan van Leeuwen. Interval routing and minor-monotone graph parameters. Technical Report UU-CS-2006-001, Department of Computer Science, University of Utrecht, Utrecht, 2006.
[BBW00]
József Balogh, Béla Bollobás, and David Weinreich. The speed of hereditary properties of graphs. Journal of Combinatorial Theory, Series B, 79(2):131–156, July 2000.
[BBW01]
József Balogh, Béla Bollobás, and David Weinreich. The penultimate rate of growth for graph properties. European Journal of Combinatorics, 22(3):277–289, March 2001.
[BC03]
Hans-Jürgen Bandelt and Victor D. Chepoi. 1-hyperbolic graphs. SIAM Journal on Discrete Mathematics, 16(2):323–334, 2003.
[BC06]
Arthur Brady and Lenore Jennifer Cowen. Compact routing on power law graphs with additive stretch. In 8th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 119–128. SIAM, January 2006.
[BC06a]
Arthur Brady and Lenore Jennifer Cowen. Exact distance labelings yield additive-stretch compact routing schemes. In 20th International Symposium on Distributed Computing (DISC), volume 4167 of Lecture Notes in Computer Science, pages 339–354. Springer, September 2006.
[BC06b]
Arthur Brady and Lenore Jennifer Cowen. Brief announcement: Compact routing with additive stretch using distance labelings. In 18th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 233–233. ACM Press, July 2006.
[BC17]
Aaron Bernstein and Shiri Chechik. Deterministic partially dynamic single source shortest paths for sparse graphs. In 28th Symposium on Discrete Algorithms (SODA), pages 453–469. ACM-SIAM, January 2017.
[BC22]
J. Yogesh Bagul and Christophe Chesneau. Generalized bounds for sine and cosine functions. Asian-European Journal of Mathematics, 15(1):2250012, 2022.
[BCCFx06]
Hans Leo Bodlaender, Leizhen Cai, Jianer Chen, Michael R. Fellows, Jan Arne Telle, and Dániel Marx. Open problems in parameterized and exact computation - IWPEC 2006. Technical Report UU-CS-2006-052, Department of Computer Science, University of Utrecht, Utrecht, 2006.
[BCCK16]
Surender Baswana, Shreejit Ray Chaudhury, Keerti Choudhary, and Shahbaz Khan. Dynamic DFS in undirected graphs: breaking the O(m) barrier. In 27th Symposium on Discrete Algorithms (SODA), pages 730–739. ACM-SIAM, January 2016.
[BCCS08]
Prosenjit Bose, Paz Carmi, Sébastien Collette, and Michiel Smid. On the stretch factor of convex Delaunay graphs. In 19th Annual International Symposium on Algorithms and Computation (ISAAC), volume 5369 of Lecture Notes in Computer Science, pages 656–667. Springer, December 2008.
[BCD09]
Prosenjit Bose, Paz Carmi, and Stephane Durocher. Bounding the locality of distributed routing algorithms. In 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 250–259. ACM Press, August 2009.
[BCD99]
Andreas Brandstädt, Victor D. Chepoi, and Feodor F. Dragan. Distance approximating trees for chordal and dually chordal graphs. Journal of Algorithms, 30(1):166–184, January 1999.
[BCDEx07]
Peter Brass, Eowyn Cenek, Christian A. Duncan, Alon Efrat, Cesim Erten, Dan P. Ismailescu, Stephen G. Kobourov, Anna Lubiw, and Joseph S.B. Mitchell. On simultaneous planar graph embeddings. Computational Geometry: Theory and Applications, 36(2):117–130, February 2007.
[BCdWZ99]
Harry Buhrman, Richard Cleve, Ronald de Wolf, and Christof Zalka. Bounds for small-error and zero-error quantum algorithms. In 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 358–368. IEEE Computer Society Press, October 1999.
[BCE03]
Béla Bollobás, Don Coppersmith, and Michael Elkin. Sparse distance preservers and additive spanners. In 14th Symposium on Discrete Algorithms (SODA), pages 414–423. ACM-SIAM, January 2003.
[BCE06]
Béla Bollobás, Don Coppersmith, and Michael Elkin. Sparse distance preservers and additive spanners. SIAM Journal on Discrete Mathematics, 19(4):1029–1055, 2006.
[BCEGS82]
László Babai, Fan R.K. Chung, Paul Erdős, Ronald Lewis Graham, and Joel H. Spencer. On graphs which contain all sparse graphs. Annals of Discrete Mathematics, 12:21–26, 1982.
[BCEMO19]
Therese C. Biedl, Erin Wolf Chambers, David Eppstein, Arnaud de Mesmay, and Tim Ophelders. Homotopy height, grid-major height and graph-drawing height. In 27th International Symposium on Graph Drawing and Network Visualization (GD), volume 11904 of Lecture Notes in Computer Science, pages 468–481. Springer, September 2019.
[BCF05]
Anthony Busson, Guillaume Chelius, and Eric Fleury. From euclidian to hop distance in multi-hop radio networks: a discrete approach. Technical Report 5505 -- v2, INRIA, Thème COM, September 2005.
[BCGH24]
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, and Nicolas Hanusse. Freeze-tag in L1 has wake-up time five with linear complexity. In Dan Alistarh, editor, 38th International Symposium on Distributed Computing (DISC), volume 319 of LIPIcs, pages 9:1–9:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2024.
[BCGH24a]
Nicolas Bonichon, Arnaud Casteigts, Cyril Gavoille, and Nicolas Hanusse. Freeze-tag in L1 has wake-up time five. Technical Report 2402.03258v1 [cs.DS], arXiv, February 2024.
[BCGMP20]
Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar. Disjointness through the lens of Vapnik-Chervonenkis dimension: Sparsity and beyond. In Jarosław Byrka and Raghu Meka, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), volume 176 of LIPIcs, pages 23:1–23:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2020.
[BCGSW21]
Aviv Bar-Natan, Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes, and Oren Weimann. Fault-tolerant distance labeling for planar graphs. In Tomasz Jurdziński and Stefan Schmid, editors, 28th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 12810 of Lecture Notes in Computer Science, pages 315–333. Springer, Cham, June 2021.
[BCGW21]
Marthe Bonamy, Linda Cook, Carla Groenland, and Alexandra Wesolek. A tight local algorithm for the minimum dominating set problem in outerplanar graphs. In Seth Gilbert, editor, 35th International Symposium on Distributed Computing (DISC), volume 209 of LIPIcs, pages 13:1–13:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2021.
[BCH95]
Jean-Claude Bermond, Francesc Comellas, and D. Frank Hsu. Distributed loop computer networks: A survey. Journal of Parallel and Distributed Computing, 24(1):2–10, January 1995.
[BCHDx19]
Nir Bacrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, and Ami Paz. Hardness of distributed optimization. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 238–247. ACM Press, July 2019.
[BCHM07]
Jérémy Barbay, Luca Castelli Aleardi, Meng He, and J. Ian Munro. Succinct representation of labeled graphs. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 316–328. Springer, December 2007.
[BCHMM09]
Prosenjit Bose, Eric Y. Chan, Meng He, Anil Maheshwari, and Pat Morin. Succinct geometric indexes supporting point location queries. In 20th Symposium on Discrete Algorithms (SODA), pages 635–644. ACM-SIAM, January 2009.
[BCKM13]
Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, and Veli Mäkinen. Versatile succinct representations of the bidirectional burrows-wheeler transform. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 133–144. Springer, September 2013.
[BCKMx17]
Bahareh Banyassady, Man-Kwun Chiu, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein, Birgit Vogtenhuber, and Max Willert. Routing in polygonal domains. In Yoshio Okamoto and Takeshi Tokuyama, editors, 27th Annual International Symposium on Algorithms and Computation (ISAAC), volume 92 of LIPIcs, pages 10:1–10:13. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2017.
[BCKS01]
Christian Borgs, Jennifer Tour Chayes, Harry Kesten, and Joel H. Spencer. The birth of the infinite cluster: Finite-size scaling in percolation. Communications in Mathematical Physics, 224(1):153–204, November 2001.
[BCL25]
Ambroise Baril, Miguel Couceiro, and Victor Lagerkvist. Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings. Technical Report 2509.05122v1 [cs.CC], arXiv, September 2025.
[BCL98]
Hans-Jürgen Bandelt, Victor D. Chepoi, and M. Laurent. Embedding into rectilinear spaces. Discrete & Computational Geometry, 19(4):595–604, April 1998.
[BCLR89]
Sandeep N. Bhatt, Fan R.K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. Universal graphs for bounded-degree trees and planar graphs. SIAM Journal on Discrete Mathematics, 2(2):145–155, May 1989.
[BCLR95]
Sandeep N. Bhatt, Fan R.K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. Salvage-embeddings of complete trees. SIAM Journal on Discrete Mathematics, 8(4):617–637, 1995.
[BCLS16]
Paweł Brach, Marek Cygan, Jakub Łącki, and Piotr Sankowski. Algorithmic complexity of power law networks. In 27th Symposium on Discrete Algorithms (SODA), pages 1306–1325. ACM-SIAM, January 2016.
[BCMdW09]
Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf. Non-locality and communication complexity. Technical Report 0907.3584v1 [quant-ph], arXiv, July 2009.
[BCMdW10]
Harry Buhrman, Richard Cleve, Serge Massar, and Ronald de Wolf. Nonlocality and communication complexity. Reviews of Modern Physics, 82(1):665–697, March 2010.
[BCMW03]
Prosenjit Bose, Jurek Czyzowicz, Pat Morin, and David R. Wood. The maximum number of edges in a three-dimensional grid-drawing. In 19th European Workshop on Computational Geometry (EuroCG), pages 101–103, March 2003.
[BCPdB03]
John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, and Giuseppe di Battista. Stop minding your P's and Q's: Implementing a fast and simple DFS-based planarity testing and embedding algorithm. In Giuseppe Liotta, editor, 11th International Symposium on Graph Drawing and Network Visualization (GD), volume 2912 of Lecture Notes in Computer Science, pages 25–36. Springer, September 2003.
[BCR15]
Surender Baswana, Keerti Choudhary, and Liam Roditty. Fault tolerant reachability for directed graphs. In 29th International Symposium on Distributed Computing (DISC), volume 9363 of Lecture Notes in Computer Science, pages 528–543. Springer, October 2015.
[BCT17]
Michele Borassi, Pierluigi Crescenzi, and Luca Trevisan. An axiomatic and an average-case analysis of algorithms and heuristics for metric properties of graphs. In 28th Symposium on Discrete Algorithms (SODA), pages 920–939. ACM-SIAM, January 2017.
[BCvD01]
Harry Buhrman, Richard Cleve, and Wim van Dam. Quantum entanglement and communication complexity. SIAM Journal on Computing, 30(6):1829–1841, January 2001.
[BD02]
Tian Bu and Don Towsley. On distinguishing between internet power law topology generators. In 21st Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 638–647, June 2002.
[BD13]
Baueur Matthew and Mirela Damian. An infinite class of sparse-Yao spanners. In 24th Symposium on Discrete Algorithms (SODA), pages 184–196. ACM-SIAM, January 2013.
[BD17]
Therese C. Biedl and Philippe Demontigny. A 2-approximation for the height of maximal outerplanar graph drawings. Technical Report 1702.01719v1 [cs.DS], arXiv, February 2017.
[BD22]
Édouard Bonnet and Hugues Déprés. Twin-width can be exponential in treewidth. Technical Report 2204.07670v1 [math.CO], arXiv, April 2022.
[BD24]
Anton Bernshteyn and Abhishek Dhawan. Fast algorithms for Vizing's theorem on bounded degree graphs. Technical Report 2303.05408v4 [cs.DS], arXiv, April 2024.
[BD93]
Daniel Bienstock and Nathaniel Dean. Bounds for rectilinear crossing numbers. Journal of Graph Theory, 17(3):333–348, July 1993.
[BdCD13]
Prosenjit Bose, Jean-Lou de Carufel, and Stephane Durocher. Revisiting the problem of searching on a line. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 205–216. Springer, September 2013.
[BDCMx15]
Prosenjit Bose, Jean-Lou de Carufel, Pat Morin, and André van Renssen. Towards tight bounds on theta-graphs: More is not always better. Theoretical Computer Science, 616:70–93, February 2015.
[BdCS24]
Prosenjit Bose, Jean-Lou de Carufel, and John Stuart. The exact routing and spanning ratio of arbitrary triangle Delaunay graphs. In 36th Canadian Conference on Computational Geometry (CCCG), pages 83–89, July 2024.
[BdCvR18]
Prosenjit Bose, Jean-Lou de Carufel, Pat Morin, and André van Renssen. Constrained generalized Delaunay graphs are plane spanners. Computational Geometry: Theory and Applications, 74:50–65, October 2018.
[BDDFx13]
Hans Leo Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, and Daniel Lokshtanov. A O(ck n) 5-approximation algorithm for treewidth. In 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 499–508. IEEE Computer Society Press, October 2013.
[BDDFx16]
Hans Leo Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, and Daniel Lokshtanov. A ckn 5-approximation algorithm for treewidth. SIAM Journal on Computing, 45(2):317–378, January 2016.
[BDDOR10]
Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wuhrer. 𝜋/2-angle Yao graphs are spanners. In Algorithms and Computation, volume 6507 of Lecture Notes in Computer Science, pages 446–457. Springer, 2010.
[BDDOR12]
Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wuhrer. 𝜋/2-angle Yao graphs are spanners. International Journal of Computational Geometry and Applications, 22(1):61–82, 2012.
[BDDOx10]
Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, and Stefanie Wuhrer. 𝜋/2-angle Yao graphs are spanners. Technical Report 1001.2913v1 [cs.CG], arXiv, January 2010.
[BDDT07]
Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, and Sébastien Tixeuil. Transient fault detectors. Distributed Computing, 20(1):39–51, 2007.
[BDFC00]
Michael A. Bender, Erik D. Demaine, and Martin Farach-Colton. Cache-oblivious B-trees. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 399–409. IEEE Computer Society Press, November 2000.
[BDG23]
Edgar Baucher, Francois Dross, and Cyril Gavoille. Graphes universels isométriques. In 25es Journées Graphes et Algorithmes, page 25, November 2023.
[BDG25]
Edgar Baucher, Francois Dross, and Cyril Gavoille. Isometric-universal graphs for trees. In Paweł Gawrychowski, Filip Mazowiecki, and Michał Skrzypczak, editors, 50th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 345 of LIPIcs, pages 16:1–16:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2025.
[BDG25a]
Edgar Baucher, Francois Dross, and Cyril Gavoille. Isometric-universal graphs for trees. Technical Report 2506.11704v1 [cs.DS], arXiv, June 2025.
[BDGJ24]
Edgar Baucher, Francois Dross, Cyril Gavoille, and Amaury Jacques. Super-graphe de deux arbres: entre P et NPC. In 26es Journées Graphes et Algorithmes, November 2024.
[BDGPx26]
Marthe Bonamy, Avinandan Das, Cyril Gavoille, Timothé Picavet, Jukka Suomela, and Alexandra Wesolek. Meta-theorems for cuttable distributed problems. In 45th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 382–389. ACM Press, July 2026.
[BDGPx26a]
Marthe Bonamy, Avinandan Das, Cyril Gavoille, Timothé Picavet, Jukka Suomela, and Alexandra Wesolek. Meta-theorems for cuttable distributed problems. Technical Report 2605.19157v1 [cs.DC], arXiv, May 2026.
[BDGRx05]
Mihai Bǎdoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, and Anastasios Sidiropoulos. Approximation algorithms for low-distortion embeddings into low-dimensional spaces. In 16th Symposium on Discrete Algorithms (SODA), pages 119–128. ACM-SIAM, January 2005.
[BDHS23]
Júlia Baligács, Yann Disser, Irene Heinrich, and Pascal Schweitzer. Exploration of graphs with excluded minors. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 11:1–11:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[BDKW25]
Greg Bodwin, Michael Dinitz, Ama Koranteng, and Lily Wang. Light edge fault tolerant graph spanners. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 32:1–32:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[BDLL04]
Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, and Van Bang Le. Tree spanners on chordal graphs: Complexity and algorithms. Theoretical Computer Science, 310:329–354, February 2004.
[BDLP08]
Christian Boulinier, Ajoy K. Datta, Lawrence L. Larmore, and Franck Petit. Space efficient and time optimal distributed BFS tree construction. Information Processing Letters, 108(5):273–278, November 2008.
[BdLP99]
Elena Barcucci, Alberto del Lungo, and Elisa Pergola. Random generation of trees and other combinatorial objects. Theoretical Computer Science, 218(2):219–232, May 1999.
[BDLS00]
Andreas Brandstädt, Feodor F. Dragan, Van Bang Le, and Thomas Szymczak. On stable cutsets in graphs. Discrete Applied Mathematics, 105(1-3):39–50, October 2000.
[BDLSV09]
Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, and Vishal Verma. The spanning ratio of the Delaunay triangulation is greater than 𝜋/2. In 21st Canadian Conference on Computational Geometry (CCCG), pages 165–167, August 2009.
[BDLSV11]
Prosenjit Bose, Luc Devroye, Maarten Löffler, Jack Snoeyink, and Vishal Verma. Almost all Delaunay triangulations have stretch factor greater than 𝜋/2. Computational Geometry: Theory and Applications, 44(2):121–127, February 2011.
[BdlV82]
Béla Bollobás and Fernandez W. de la Vega. The diameter of random regular graphs. Combinatorica, 2(2):125–134, June 1982.
[BdMPV17]
Étienne Birmelé, Fabien de Montgolfier, Léo Planche, and Laurent Viennot. Decomposing a graph into shortest paths with bounded eccentricity. In 28th International Symposium on Algorithms and Computation (ISAAC), volume 92 of LIPIcs, pages 15:1–15:13. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2017.
[BDMRx05]
David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman, and Satti Srivivasa Rao. Representing trees of higher degree. Algorithmica, 43(4):275–292, December 2005.
[BDPED19]
A. Boussard, J. Delescluse, A. Pérez-Escudero, and Audrey Dussutour. Memory inception and preservation in slime moulds: the quest for a common mechanism. Philosophical Transactions of the Royal Society B, 374, April 2019.
[BDSZZ23]
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii. Small but unwieldy: A lower bound on adjacency labels for small classes. Technical Report 2307.11225v1 [math.CO], arXiv, November 2023.
[BDSZZ23a]
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii. Tight bounds on adjacency labels for monotone graph classes. Technical Report 2310.20522v1 [math.CO], arXiv, October 2023.
[BDSZZ24]
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii. Small but unwieldy: A lower bound on adjacency labels for small classes. SIAM Journal on Computing, 53(5):1578–1601, 2024.
[BDSZZ24a]
Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev, and Maksim Zhukovskii. Tight bounds on adjacency labels for monotone graph classes. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming (ICALP), volume 297 of LIPIcs, pages 31:1–31:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2024.
[BDT14]
Mikhail Bogdanov, Olivier Devillers, and Monique Teillaud. Hyperbolic Delaunay complexes and Voronoi diagrams made practical. Technical Report hal-00961390, HAL, March 2014.
[BDV03]
Doina Bein, Ajoy K. Datta, and Vincent Villain. Self-stabilizing pivot interval routing in general networks, June 2003.
[BDV05]
Doina Bein, Ajoy K. Datta, and Vincent Villain. Self-stabilizing pivot interval routing in general networks. In International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), December 2005.
[BE08]
Leonid Barenboim and Michael Elkin. Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 25–34. ACM Press, August 2008.
[BE09]
Leonid Barenboim and Michael Elkin. Distributed (δ+1)-coloring in linear (in δ) time. In 41st Annual ACM Symposium on Theory of Computing (STOC), pages 111–120. ACM Press, May 2009.
[BE10]
Leonid Barenboim and Michael Elkin. Deterministic distributed vertex coloring in polylogarithmic time. In 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 410–419. ACM Press, July 2010.
[BE11]
Leonid Barenboim and Michael Elkin. Distributed deterministic edge coloring using bounded neighborhood independence. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 129–138. ACM Press, June 2011.
[BE11a]
Leonid Barenboim and Michael Elkin. Combinatorial algorithms for distributed graph coloring. In 25th International Symposium on Distributed Computing (DISC), volume 6950 of Lecture Notes in Computer Science (ARCoSS), pages 66–81. Springer, September 2011.
[BE11b]
Leonid Barenboim and Michael Elkin. Distributed deterministic vertex coloring in polylogarithmic time. Journal of the ACM, 58(5):Article No. 23, pp. 1–25, October 2011.
[BE11c]
Andries E. Brouwer and Tuvi Etzion. Some new distance-4 constant weight codes. Advances in Mathematics of Communications, 5(3):417–424, 2011.
[BE13]
Leonid Barenboim and Michael Elkin. Distributed graph coloring: Fundamentals and recent developments, volume #11 of Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool, 2013.
[BE19]
Étienne Bamas and Louis Esperet. Distributed coloring of graphs with an optimal number of colors. Technical Report 1809.08140v3 [math.CO], arXiv, January 2019.
[BE82]
R. Bar-Yehuda and Shimon Even. On approximating a vertex cover for planar graphs. In 14th Annual ACM Symposium on Theory of Computing (STOC), pages 303–309. ACM Press, May 1982.
[BEG15]
Leonid Barenboim, Michael Elkin, and Cyril Gavoille. A fast network-decomposition algorithm and its applications to constant-time distributed computation. In Christian Scheideler, editor, 22nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 9439 of Lecture Notes in Computer Science, pages 209–223. Springer, July 2015.
[BEG15a]
Leonid Barenboim, Michael Elkin, and Cyril Gavoille. A fast network-decomposition algorithm and its applications to constant-time distributed computation. Technical Report 1505.05697 [cs.DC], arXiv, May 2015.
[BEG18]
Leonid Barenboim, Michael Elkin, and Uri Goldenberg. Locally-iterative distributed δ+1-coloring below Szegedy-Vishwanathan barrier, and applications to self-stabilization and to restricted-bandwidth models. In 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 437–446. ACM Press, July 2018.
[BEGHx25]
Paul Bastide, Louis Esperet, Carla Groenland, Claire Hilaire, Clément Rambaud, and Alexandra Wesolek. Faithful universal graphs for minor-closed classes. Technical Report 2504.19582v2 [math.CO], arXiv, May 2025.
[BEGS20]
Marthe Bonamy, Louis Esperet, Carla Groenland, and Alex Scott. Optimal labelling schemes for adjacency, comparability and reachability. Technical Report 2012.01764v1 [math.CO], arXiv, December 2020.
[BEGS21]
Marthe Bonamy, Louis Esperet, Carla Groenland, and Alex Scott. Optimal labelling schemes for adjacency, comparability and reachability. In 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 1109–1117. ACM Press, June 2021.
[BEHKx10]
Georg Baier, Thomas Erlebach, Alexander Hall, Ekkehard Köhler, Petr Kolman, Ondřej Pangrác, Heiko Schilling, and Martin Skutella. Length-bounded cuts and flows. ACM Transactions on Algorithms, 7(1):Article No. 4, pp. 1–27, November 2010.
[BEIK19]
Shimon Bitton, Yuval Emek, Taisuke Izumi, and Shay Kutten. Message reduction in the LOCAL model is a free lunch. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 300–302. ACM Press, July 2019.
[BEK14]
Leonid Barenboim, Michael Elkin, and Fabian Kuhn. Distributed (δ+1)-coloring in linear (in δ) time. SIAM Journal on Computing, 43(1):72–95, 2014.
[Bellman62]
Richard Bellman. Dynamic programming treatment of the travelling salesman problem. Journal of the ACM, 9(1):61–63, January 1962.
[BEM17]
Leonid Barenboim, Michael Elkin, and Tzalik Maimon. Deterministic distributed (Δ + o(Δ))-edge-coloring, and vertex-coloring of graphs with bounded diversity. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 175–184. ACM Press, July 2017.
[Benoist01]
Yves Benoist. Pavages du plan, 2001. Journées Math. X-UPS.
[Bensmail14]
Julien Bensmail. Partitions et décompositions de graphes. PhD thesis, Université Bordeaux, Talence, France, June 2014.
[Benson66]
Clark T. Benson. Minimal regular graphs of girth eight and twelve. Canadian Journal of Mathematics, 18:1091–1094, 1966.
[Bentley80]
Jon Louis Bentley. Multidimensional divide-and-conquer. Communications of the ACM, 23(4):214–229, April 1980.
[BENW16]
Glencora Borradaile, David Eppstein, Amir Nayyeri, and Christian Wulff-Nilsen. All-pairs minimum cuts in near-linear time for surface-embedded graphs. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 22:1–22:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[BEOPV13]
Mark Braverman, Faith Ellen, Rotem Oshman, Toniann Pitassi, and Vinod Vaikuntanathan. Tight bounds for set disjointness in the message passing model. Technical Report 1305.4696v1 [cs.DS], arXiv, May 2013.
[BEP21]
Nicolas Bousquet, Louis Esperet, and Francois Pirot. Distributed algorithms for fractional coloring. In 24th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 12810 of Lecture Notes in Computer Science, pages 15–30. Springer, Cham, June 2021.
[BEPS12]
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. In 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 321–330. IEEE Computer Society Press, October 2012.
[BEPS16]
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. The locality of distributed symmetry breaking. Journal of the ACM, 63(3):Article No. 20, pp. 1–45, September 2016.
[Berge83]
Claude Berge. Graphs and hypergraphs. North-Holland Publishing, 1983.
[Berge90]
Claude Berge. On two conjectures to generalize Vizing's Theorem. Le Matematiche, 45(1):15–24, May 1990.
[Berman98]
Piotr Berman. On-line searching and navigation. In Online Algorithms, volume 1442 of Lecture Notes in Computer Science, pages 232–241. Springer-Verlag, 1998.
[Bernshteyn20]
Anton Bernshteyn. Distributed algorithms, the lovász local lemma, and descriptive combinatorics. Technical Report 2004.04905v3 [math.CO], arXiv, April 2020.
[Bernstein09]
Aaron Bernstein. Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time. In 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 693–702. IEEE Computer Society Press, October 2009.
[Bernstein12]
Aaron Bernstein. Near linear time (1+ε)-approximation for restricted shortest paths in undirected graphs. In 23rd Symposium on Discrete Algorithms (SODA), pages 189–201. ACM-SIAM, January 2012.
[Bernstein13]
Aaron Bernstein. Maintaining shortest paths under deletions in weighted directed graphs. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 725–734. ACM Press, June 2013.
[Berrizbeita05]
Pedro Berrizbeita. Sharpening "primes is in p" for a large family of numbers. Mathematics of Computation, 252:2043–2059, 2005.
[BF02]
Paul Beame and Faith Ellen Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38–72, August 2002.
[BF19]
Manuel Borrazzo and Fabrizio Frati. On the edge-length ratio of planar graphs. In 27th International Symposium on Graph Drawing and Network Visualization (GD), volume 11904 of Lecture Notes in Computer Science, pages 165–178. Springer, September 2019.
[BF20]
Davood Bakhshesh and Mohammad Farshi. A degree 3 plane 5.19-spanner for points in convex position. In 32nd Canadian Conference on Computational Geometry (CCCG), pages 226–232, August 2020.
[BF21]
Paul Bastide and Pierre Fraigniaud. On extending Brandt's speedup theorem from LOCAL to round-based full-information models. Technical Report 1511.01287v1 [cs.DS], arXiv, August 2021.
[BF21a]
Mahdi Belbasi and Martin Fürer. An improvement of Reed's treewidth approximation. In Ryuhei Uehara, Seok-Hee Hong, and Subhas C. Nandy, editors, 15th International Conference and Workshops on Algorithms and Computation (WALCOM), volume 12635 of Lecture Notes in Computer Science, pages 166–181. Springer, February 2021.
[BF21b]
Mahdi Belbasi and Martin Fürer. Finding all leftmost separators of size ≤ k. In Ding-Zhu Du, Donglei Du, Chenchen Wu, and Dachuan Xu, editors, 15th International Conference on Combinatorial Optimization and Applications (COCOA), volume 13135 of Lecture Notes in Computer Science, pages 273–287. Springer, December 2021.
[BF22]
Mahdi Belbasi and Martin Fürer. An improvement of Reed's treewidth approximation. Journal of Graph Algorithms and Applications, 26(2):257–282, 2022.
[BF67]
Melvin A. Breuer and Jon Folkman. An unexpected result on coding the vertices of a graph. Journal of Mathematical Analysis and Applications, 20(3):583–600, December 1967.
[BF99]
Gerth Stølting Brodal and Rolf Fagerberg. Dynamic representation of sparse graphs. In 6th International Workshop on Algorithms and Data Structures (WADS), volume 1663 of Lecture Notes in Computer Science, pages 342–351. Springer, August 1999.
[BF99a]
Paul Beame and Faith Ellen Fich. Optimal bounds for the predecessor problem and related problems. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 295–304. ACM Press, 1999.
[BFC00]
Michael A. Bender and Martin Farach-Colton. The LCA problem revisited. In 4th Latin American Symposium on Theoretical Informatics (LATIN), volume 1776 of Lecture Notes in Computer Science, pages 88–94. Springer, 2000.
[BFCPx05]
Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven S. Skiena, and Pavel Sumazin. Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms, 57(2):75–94, November 2005.
[BFGK05]
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Bradely C. Kuszmaul. Concurrent cache-oblivious B-trees. In 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 228–237. ACM Press, 2005.
[BFGM00]
Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, and Bernard Mans. Recognizing abelian Cayley colored digraphs. Research Report LRI-1242, LRI, Université Paris-Sud, 91405 Orsay cedex, France, January 2000.
[BFGMR00]
Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, and John Michael Robson. On recognizing Cayley graphs. In 8th Annual European Symposium on Algorithms (ESA), volume 1879 of Lecture Notes in Computer Science, pages 76–87. Springer, September 2000.
[BFH24]
Alain Bretto, Alain Faisant, and Francois Hennecart. The Berge-Füredi conjecture on the chromatic index of hypergraphs with large hyperedges. Technical Report 2403.06850v1 [math.CO], arXiv, March 2024.
[BFHKx16]
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempiäinen, Joel Rybicki, Jukka Suomela, and Jara Uitto. A lower bound for the distributed Lovász Local Lemma. In 48th Annual ACM Symposium on Theory of Computing (STOC), pages 479–488. ACM Press, June 2016.
[BFK81]
Walter A. Burkhard, Michael L. Fredman, and Daniel J. Kleitman. Inherent complexity trade-offs for range query problems. Theoretical Computer Science, 16(3):279–290, December 1981.
[BFKKT06]
Hans Leo Bodlaender, Fedor V. Fomin, Arie M.C.A. Koster, Dieter Kratsch, and Dimitrios M. Thilikos. On exact algorithms for treewidth. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 672–683. Springer, September 2006.
[BFKV07]
Manuel Bodirsky, Éric Fusy, Mihyun Kang, and Stefan Vigerske. Enumeration and asymptotic properties of unlabeled outerplanar graphs. The Electronic Journal of Combinatorics, 14(1):#R66, September 2007.
[BFLPx09]
Hans Leo Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos. (Meta) Kernelization. In 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 629–638. IEEE Computer Society Press, October 2009.
[BFM07]
Nicolas Bonichon, Stefan Felsner, and Mohamed Mosbah. Convex drawings of 3-connected plane graphs. Algorithmica, 47(4):399–420, April 2007.
[BFN01]
Lali Barrière, Pierre Fraigniaud, and Lata Narayanan. Robust position-based routing in wireless ad hoc networks with unstable transmission ranges, 2001.
[BFN16]
Yair Bartal, Arnold Filtser, and Ofer Neiman. On notions of distortion and an almost minimum spanning tree with constant average distortion. In 27th Symposium on Discrete Algorithms (SODA), pages 873–882. ACM-SIAM, January 2016.
[BFP22]
Nicolas Bousquet, Laurent Feuilloley, and Théo Pierron. What can be certified compactly? compact local certification of MSO, properties in tree-like graphs. In 41st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 131–140. ACM Press, February 2022.
[BFPV13]
Ivan Bliznets, Fedor V. Fomin, Michał Pilipczuk, and Yngve Villanger. Largest chordal and interval subgraphs faster than 2n. In Hans Leo Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 193–204. Springer, September 2013.
[BFR72]
K.A. Baker, Peter C. Fishburn, and Fred S. Roberts. Partial orders of dimension 2. Networks, 2(1):11–28, 1972.
[BFS19]
Cristina Bazgan, Florent Foucaud, and Florian Sikora. Parameterized and approximation complexity of \textscPartial VC Dimension. Theoretical Computer Science, 766:1–15, April 2019.
[BFSS00]
Cyril Banderier, Philippe Flajolet, Gilles Schaeffer, and Michèle Soria. Planar maps and airy phenomena. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 388–402. Springer, July 2000.
[BFvRV12]
Prosenjit Bose, Rolf Fagerberg, André van Renssen, and Sander Verdonschot. Competitive routing in the half-θ6-graph. In 23rd Symposium on Discrete Algorithms (SODA), pages 1319–1328. ACM-SIAM, January 2012.
[BFvRV15]
Prosenjit Bose, Rolf Fagerberg, André van Renssen, and Sander Verdonschot. Optimal local routing on Delaunay triangulations defined by empty equilateral triangles. SIAM Journal on Computing, 44(6):1626–1649, 2015.
[BFW26]
Sayan Bhattacharya, Ermiya Farokhnejad, and Haoze Wang. Additive one approximation for minimum degree spanning tree: Breaking the O(mn) time barrier. Technical Report 2002.05580v1 [cs.DS], arXiv, February 2026.
[BG04]
Fabrice Bazzaro and Cyril Gavoille. Étiquetage de distance des graphes de permutation. In E. Duchène and Sylvain Gravier, editors, 6es Journées Graphes et Algorithmes, pages 22–24. Les Cahiers du laboratoire Leibniz, No 114, October 2004.
[BG05]
Fabrice Bazzaro and Cyril Gavoille. Localized and compact data-structure for comparability graphs. Research Report RR-1343-05, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2005.
[BG05a]
Fabrice Bazzaro and Cyril Gavoille. Distance labeling for permutation graphs. In 7th International Colloquium on Graph Theory (ICGT), volume 22 of Electronic Notes in Discrete Mathematics, pages 461–467. Elsevier, October 2005.
[BG05b]
Fabrice Bazzaro and Cyril Gavoille. Localized and compact data-structure for comparability graphs. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 1122–1131. Springer, December 2005.
[BG09]
Fabrice Bazzaro and Cyril Gavoille. Localized and compact data-structure for comparability graphs. Discrete Mathematics, 309(11):3465–3484, June 2009.
[BG11]
Philip Bille and Inge Li Gørtz. The tree inclusion problem: In linear space and faster, July 2011.
[BG12]
Andrej Brodnik and Marko Grgurovič. Speeding up shortest path algorithms. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 156–165. Springer, December 2012.
[BG88]
Alan A. Bertossi and A. Gori. Total domination and irredundance in weighted interval graphs. SIAM Journal on Discrete Mathematics, 1(3):317–327, 1988.
[BG92]
Dimitri P. Bertsekas and Robert G. Gallager. Routing in data networks. In Data Networks (2nd edition), chapter 5, pages 363–492. Prentice Hall, 1992.
[BG95]
H. Brönnimann and Michael T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry, 14:463–479, December 1995.
[BG96]
Graham R. Brightwell and Sarah Goodall. The number of partial orders of fixed width. Order, 13(4):315–337, 1996.
[BGAS13]
József Balogh, Hernán González-Aguilar, and Gelasio Salazar. Large convex holes in random point sets. Computational Geometry: Theory and Applications, 46(6):725–733, August 2013.
[BGH02]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. An information upper bound of planar graphs using triangulation. Research Report RR-1279-02, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, September 2002.
[BGH03]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. An information-theoretic upper bound of planar graphs using triangulation. In 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2607 of Lecture Notes in Computer Science, pages 499–510. Springer, February 2003.
[BGH03b]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. Research Report RR-1295-03, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, March 2003.
[BGH03c]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. In 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2880 of Lecture Notes in Computer Science, pages 81–92. Springer-Verlag, June 2003.
[BGH05]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. Canonical decomposition of outerplanar maps and application to enumeration, coding and generation. Journal of Graph Algorithms and Applications, 9(2):185–204, 2005.
[BGH11]
Nicolas Bonichon, Cyril Gavoille, and Nicolas Hanusse. An information-theoretic upper bound on planar graphs using well-orderly maps. In Matthias Dehmer, Frank Emmert-Streib, and Alexander Mehler, editors, Towards an Information Theory of Complex Networks, chapter 2, pages 17–46. Birkhäuser Boston, July 2011.
[BGHI10]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and David Ilcinkas. Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 6410 of Lecture Notes in Computer Science (ARCoSS), pages 266–278. Springer, June 2010.
[BGHI10a]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and David Ilcinkas. Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. Technical Report hal-00454565, HAL, February 2010.
[BGHIP10]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas, and Ljubomir Perković. Comment résumer le plan. In 12es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume inria-00476151. HAL, June 2010.
[BGHK95]
Hans Leo Bodlaender, John R. Gilbert, Hjálmtýr Hafsteinsson, and Ton Kloks. Approximating treewidth, pathwidth, frontsize, and shortest elimination tree. Journal of Algorithms, 18(2):238–255, March 1995.
[BGHLx26]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé, and Nils Morawietz. Freeze-tag with return. In Michal Koucký and Daniela Petrisan, editors, 51st International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 386 of LIPIcs, pages 38:1–38:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2026.
[BGHLx26a]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, Taïssir Marcé, and Nils Morawietz. Freeze-tag with return. Technical Report 2606.21985v1 [cs.DS], arXiv, June 2026.
[BGHO24]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Saeed Odak. Euclidean freeze-tag problem on plane. In 36th Canadian Conference on Computational Geometry (CCCG), pages 199–205, July 2024.
[BGHP10]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perković. Plane spanners of maximum degree six. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 19–30. Springer, July 2010.
[BGHP12]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perković. The stretch factor of L1- and L\infty-Delaunay triangulations. In Leah Epstein and Paolo Ferragina, editors, 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 205–216. Springer-Verlag, September 2012.
[BGHP12a]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perković. The stretch factor of L1- and L\infty-Delaunay triangulations. Technical Report hal-00673187v2/1202.5127v2 [cs.GC], HAL/arXiv, February 2012.
[BGHP12b]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perković. The stretch factor of L1- and L\infty-Delaunay triangulations, May 2012. Poster at STOC '12.
[BGHP15]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, and Ljubomir Perković. Tight stretch factors for L1- and L\infty-Delaunay triangulations. Computational Geometry: Theory and Applications, 48:237–250, 2015.
[BGHPS04]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, and Gilles Schaeffer. Planar graphs, via well-orderly maps and trees. In 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 3353 of Lecture Notes in Computer Science, pages 270–284. Springer, June 2004.
[BGHPS04a]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, and Gilles Schaeffer. Planar graphs, via well-orderly maps and trees. Research report, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, September 2004.
[BGHPS06]
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, and Gilles Schaeffer. Planar graphs, via well-orderly maps and trees. Graphs and Combinatorics, 22(2):185–202, 2006.
[BGJx09]
Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, and David P. Woodruff. Transitive-closure spanners. In 20th Symposium on Discrete Algorithms (SODA), pages 932–941. ACM-SIAM, January 2009.
[BGK03]
Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Generating labeled planar graphs uniformly at random. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 1095–1107, 2003.
[BGK05]
Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Sampling unlabeled biconnected planar graphs. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 593–603. Springer, December 2005.
[BGK07]
Manuel Bodirsky, Clemens Gröpl, and Mihyun Kang. Generating labeled planar graphs uniformly at random. Theoretical Computer Science, 379(3):377–386, June 2007.
[BGK12]
Yair Bartal, Lee-Ad Gottlieb, and Robert Krauthgamer. The traveling salesman problem: Low-dimensionality implies a polynomial time approximation scheme. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 663–672. ACM Press, May 2012.
[BGKL10]
Yair Bartal, Lee-Ad Gottlieb, Tsvi Kopelowitz, and Moshe Lewenstein. Fast, precise and dynamic distance queries. Technical Report 1008.1480v1 [cs.DS], arXiv, August 2010.
[BGKMT18]
Mark Braverman, Ankit Garg, Young Kun Ko, Jieming Mao, and Dave Touchette. Near-optimal bounds on the bounded-round quantum communication complexity of disjointness. SIAM Journal on Computing, 47(6):2277–2314, 2018.
[BGKMU19]
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, and Jara Uitto. On the complexity of distributed splitting problems. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 280–289. ACM Press, July 2019.
[BGKN07]
Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy. Enumeration and limit laws for series-parallel graphs. European Journal of Combinatorics, 28(8):2091–2105, November 2007.
[BGKPx23]
Kevin Buchin, Joachim Gudmundsson, Antonia Kalb, Aleksandr Popov, Carolin Rehs, André van Renssen, and Sampson Wong. Oriented spanners. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 26:1–26:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[BGKTW20]
Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width II: small classes. Technical Report 2006.09877v1 [cs.DM], arXiv, June 2020.
[BGL05]
Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Edge partition of toroidal graphs into forests in linear time. In 7th International Colloquium on Graph Theory (ICGT), volume 22 of Electronic Notes in Discrete Mathematics, pages 421–425. Elsevier, October 2005.
[BGL06]
Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Short labels by traversal and jumping. In 13th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 4056 of Lecture Notes in Computer Science, pages 143–156. Springer, July 2006.
[BGL06a]
Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Short labels by traversal and jumping. Research Report RR-1389-06, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, March 2006.
[BGL06c]
Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Schéma d'adjacence compact pour les arbres de degrés borné. In 8es Journées Graphes et Algorithmes, November 2006.
[BGL06cor]
Cyril Gavoille. Notes on the paper ``short labels by traversal and jumping'', October 2020. Personnal notes.
[BGL07]
Nicolas Bonichon, Cyril Gavoille, and Arnaud Labourel. Short labels by traversal and jumping. In 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, volume 28 of Electronic Notes in Discrete Mathematics, pages 153–160. Elsevier, March 2007. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday.
[BGLZ98]
Richard Beigel, William I. Gasarch, Ming Li, and Louxin Zhang. Addition in log2 n + O(1) steps on average a simple analysis. Theoretical Computer Science, 191(1-2):245–248, January 1998.
[BGMPW25]
Itai Boneh, Shay Golan, Shay Mozes, Daniel Prigan, and Oren Weimann. Faster construction of a planar distance oracle with Õ(1) query time. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 33:1–33:21. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[BGNS97]
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, and Baruch Schieber. Multicasting in heterogeneous networks, 1997.
[BGP19]
Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter labeling schemes for planar graphs. Technical Report hal-02265219, HAL, August 2019.
[BGP19b]
Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Smaller induced-universal graph for planar graphs. In Bordeaux Graph Workshop (BGW), pages 65–68, October 2019.
[BGP20]
Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter labeling schemes for planar graphs. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 446–462. ACM-SIAM, January 2020.
[BGP20a]
Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter labeling schemes for planar graphs. Technical Report 1908.0334v2 [cs.DS], arXiv, April 2020.
[BGP22]
Marthe Bonamy, Cyril Gavoille, and Michał Pilipczuk. Shorter labeling schemes for planar graphs. SIAM Journal on Discrete Mathematics, 36(3):2082–2099, 2022.
[BGPRV95]
Jean-Claude Bermond, Luisa Gargano, Stéphane Pérennès, Adele Anna Rescigno, and Ugo Vaccaro. Efficient collective communication in optical networks, 1995.
[BGPW24]
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, and Alexandra Wesolek. Algorithmes distribués et dimension asymptotique. In 26es Journées Graphes et Algorithmes, November 2024.
[BGPW25]
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, and Alexandra Wesolek. Local constant approximation for dominating set on graphs excluding large minors. In 44th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 77–87. ACM Press, June 2025.
[BGPW25a]
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, and Alexandra Wesolek. Local constant approximation for dominating set on graphs excluding large minors. Technical Report 2504.01091v2 [cs.DC], arXiv, April 2025.
[BGPW25b]
Marthe Bonamy, Cyril Gavoille, Timothé Picavet, and Alexandra Wesolek. Distributed approximation algorithms for minimum dominating set in locally nice graphs. Technical Report 2507.04960v1 [cs.DC], arXiv, July 2025.
[BGR14]
Michael A. Bekos, Martin Gronemann, and Chrysanthi N. Raftopoulou. Two-page book embeddings of 4-planar graphs. In 31st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 25 of LIPIcs, pages 137–148. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2014.
[BGRS04]
Vittorio Bilò, Vineet Goyal, R. Ravi, and Mohit Singh. On the crossing spanning tree problem. In 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and 8th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 3122 of Lecture Notes in Computer Science, pages 51–60. Springer, August 2004.
[BGS05]
Surender Baswana, Vishrut Goyal, and Sandeep Sen. All-pairs nearly 2-approximate shortest-paths in O(n2 polylog n) time. In 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3404 of Lecture Notes in Computer Science, pages 666–679. Springer, February 2005.
[BGS05a]
Prosenjit Bose, Joachim Gudmundsson, and Michiel Smid. Constructing plane spanners of bounded degree and low weight. Algorithmica, 42(3-4):249–264, July 2005.
[BGS09]
Surender Baswana, Vishrut Goyal, and Sandeep Sen. All-pairs nearly 2-approximate shortest-paths in O(n2 polylog n) time. Theoretical Computer Science, 410(1):84–93, January 2009.
[BGSU08]
Surender Baswana, Akshay Gaur, Sandeep Sen, and Jayant Upadhyay. Distance oracles for unweighted graphs: Breaking the quadratic barrier with constant additive error. In 35th International Colloquium on Automata, Languages and Programming (ICALP), volume 5125 of Lecture Notes in Computer Science, pages 609–621. Springer, July 2008.
[BGW02]
Edward A. Bender, Zhicheng Gao, and Nicholas C. Wormald. The number of labeled 2-connected planar graphs. The Electronic Journal of Combinatorics, 9:#R43, 2002.
[BH05]
Michael Ben-Or and Avinatan Hassidim. Fast quantum byzantine agreement. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 481–485. ACM Press, May 2005.
[BH09]
Anand Bhalgat and Ramesh Hariharan. Fast edge orientation for unweighted graphs. In 20th Symposium on Discrete Algorithms (SODA), pages 265–272. ACM-SIAM, January 2009.
[BH13]
Fernando G.S.L. Brandão and Aram W. Harrow. Quantum de Finetti theorems under local measurements with applications. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 861–870. ACM Press, June 2013.
[BH15]
Judith Brecklinghaus and Stefan Hougardy. The approximation ratio of the greedy algorithm for the metric traveling salesman problem. Operations Research Letters, 43(3):259–261, May 2015.
[BH17]
Fernando G.S.L. Brandão and Aram W. Harrow. Quantum de Finetti theorems under local measurements with applications. Communications in Mathematical Physics, 353(2):469–506, July 2017.
[BH18]
Ravi B. Boppana and Magnús M. Halldórsson. Simple and local independent set approximation. In 25th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 11085 of Lecture Notes in Computer Science, pages 88–101. Springer, June 2018.
[BH19]
Tim Baumann and Torben Hagerup. Rank-select indices without tears. In Zachary Friggstad, Jörg-Rüdiger Sack, and Mohammad R. Salavatipour, editors, 16th International Workshop on Algorithms and Data Structures (WADS), volume 11646 of Lecture Notes in Computer Science, pages 85–98. Springer, August 2019.
[BH22]
Greg Bodwin and Gary Hoppenworth. New additive spanner lower bounds by an unlayered obstacle product. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 778–788. IEEE Computer Society Press, October 2022.
[BH25]
Ravi B. Boppana and Magnús M. Halldórsson. Approximating independent sets in constant distributed rounds. In Ulrich Schmid and Roman Kuznets, editors, 32nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 15671 of Lecture Notes in Computer Science, pages 144–158. Springer, June 2025.
[BH25a]
Mark Brittenham and Susan Hermiller. Unknotting number is not additive under connected sum. Technical Report 2506.24088v2 [math.GT], arXiv, September 2025.
[BH97]
Ulrik Brandes and Dagmar Handke. NP-completeness results for minimum planar spanners. In 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1335 of Lecture Notes in Computer Science, pages 85–99. Springer, 1997.
[BH97a]
Mieczysław Borowiecki and Hałuszczak Mariusz. Partitions of some planar graphs into two linear forests. Discussiones Mathematicae Graph Theory, 17(1):95–102, 1997.
[BH98]
Hans Leo Bodlaender and Torben Hagerup. Tree decompositions of small diameter. In 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1450 of Lecture Notes in Computer Science, pages 702–712. Springer-Verlag, August 1998.
[BH98a]
Ulrik Brandes and Dagmar Handke. NP-completeness results for minimum planar spanners. Discrete Mathematics & Theoretical Computer Science, 3(1):1–10, January 1998.
[BH98b]
Richard Beigel and Tirza Hirst. One help bit doesn't help. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 124–130. ACM Press, May 1998.
[BHGVx21]
Thiago Bergamaschi, Monika Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. New techniques and fine-grained hardness for dynamic near-additive spanners. In 32nd Symposium on Discrete Algorithms (SODA), pages 1836–1855. ACM-SIAM, January 2021.
[BHHK07]
Dan Georges Bucatanschi, Blaine Hoffmann, Kevin R. Hutson, and R. Matthew Kretchmar. A neighborhood search technique for the freeze tag problem. In Extending the Horizons: Advances in Computing, Optimization, and, Decision Technologies, volume 37 of Operations Research/Computer Science Interfaces Series, pages 97–113, 2007.
[BHJ18]
Henning Bruhn, Matthias Heinlein, and Felix Joos. Frames, A-paths, and the Erdős-Posá property. SIAM Journal on Discrete Mathematics, 32(2):1246–1260, January 2018.
[BHK15]
Marijke H.L. Bodlaender, Magnús M. Halldórsson, and Christian Konrad. Local approximation of independent sets and coloring, 2015.
[BHK19]
Matthias Bentert, Klaus Heeger, and Dušan Knop. Length-bounded cuts: Proper interval graphs and structural parameters. Technical Report 1910.03409v1 [cs.DS], arXiv, October 2020.
[BHK20]
Avrim Blum, John E. Hopcroft, and Ravindran Kannan. Foundations of data science. Cambridge University Press, February 2020.
[BHK20a]
Matthias Bentert, Klaus Heeger, and Dušan Knop. Length-bounded cuts: Proper interval graphs and structural parameters. In 31st Annual International Symposium on Algorithms and Computation (ISAAC), volume 181 of LIPIcs, pages 36:1–36:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[BHKK17]
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Narrow sieves for parameterized paths and packings. Journal of Computer and System Sciences, 87:119–139, August 2017.
[BHKLx16]
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R.J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemysław Uznański. LCL problems on grids. In 35th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 101–110. ACM Press, July 2016.
[BHKLx17]
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R.J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemysław Uznański. LCL problems on grids. Technical Report 1702.05456v2 [cs.DC], arXiv, May 2017.
[BHKLx18]
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, and Jukka Suomela. New classes of distributed time complexity. In 50th Annual ACM Symposium on Theory of Computing (STOC), pages 1307–1318. ACM Press, June 2018.
[BHL12]
Mohamed-Amine Boutiche, Hacène Aït Haddadène, and Hoai An Le Thi. Maintaining graph properties of weakly chordal graphs. Applied Mathematical Sciences, 6(16):765–778, 2012.
[BHLY12]
János Barát, Péter Hajnal, Yixun Lin, and Aifeng Yang. On the structure of graphs with path-width at most two. Studia Scientiarum Mathematicarum Hungarica, 49(2):211–222, June 2012.
[BHMM09]
Prosenjit Bose, Meng He, Anil Maheshwari, and Pat Morin. Succinct orthogonal range search structures on a grid with applications to text indexing. In Frank Dehne, Mariya Gavrilova, Jörg-Rüdiger Sack, and Csaba D. Tóth, editors, 11th International Workshop on Algorithms and Data Structures (WADS), volume 5664 of Lecture Notes in Computer Science, pages 98–109. Springer, August 2009.
[BHMR07]
Jérémy Barbay, Meng He, J. Ian Munro, and Satti Srivivasa Rao. Succinct indexes for strings, binary relations and multi-labeled trees. In 18th Symposium on Discrete Algorithms (SODA), pages 680–689. ACM-SIAM, January 2007.
[BHN95]
Hans-Jürgen Bandelt, Anja Henkmann, and Falk Nicolai. Powers of distance-hereditary graphs. Discrete Mathematics, 145(1-3):37–60, 1995.
[BHOS19]
Alkida Balliu, Juho Hirvonen, Dennis Olivetti, and Jukka Suomela. Hardness of minimal symmetry breaking in distributed computing. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 369–378. ACM Press, July 2019.
[BHP01]
Roger C. Baker, Gözde Harman, and J. Pintz. The difference between consecutive primes, II. Proceedings of the London Mathematical Society, 83(3):532–562, November 2001.
[BHS03]
Anne Berry, Pinar Heggernes, and Geneviève Simonet. The minimum degree heuristic and the minimal triangulation process. In 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2880 of Lecture Notes in Computer Science, pages 58–70. Springer-Verlag, May 2003.
[BHV96]
Harry Buhrman, Jaap-Henk Hoepman, and Paul M.B. Vitányi. Optimal routing tables. In 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 134–142. ACM Press, May 1996.
[BHV99]
Harry Buhrman, Jaap-Henk Hoepman, and Paul M.B. Vitányi. Space-efficient routing tables for almost all networks and the incompressibility method. SIAM Journal on Computing, 28(4):1414–1432, 1999.
[Biedl02]
Therese C. Biedl. Drawing outer-planar graphs in O(nlogn) area. In 10th International Symposium on Graph Drawing (GD), volume 2528 of Lecture Notes in Computer Science, pages 133–148. Springer, September 2002.
[Biedl09]
Therese C. Biedl. Small drawings of outer-planar graphs, series-parallel graphs and other planar graphs. In 17th International Symposium on Graph Drawing (GD), volume 5849 of Lecture Notes in Computer Science, pages 280–291. Springer, September 2009.
[Biedl11]
Therese C. Biedl. Small drawings of outerplanar graphs, series-parallel graphs, and other planar graphs. Discrete & Computational Geometry, 45(1):141–160, January 2011.
[Biedl12]
Therese C. Biedl. A 4-approximation for the height of drawing 2-connected outer-planar graphs. In Thomas Erlebach and Giuseppe Persiano, editors, 10th International Workshop on Approximation and Online Algorithms (WAOA), volume 7846 of Lecture Notes in Computer Science, pages 272–285. Springer, September 2012.
[Biedl13]
Therese C. Biedl. Transforming planar graph drawings while maintaining height. Technical Report 1308.6693v1 [cs.CG], arXiv, September 2013.
[Biedl14]
Therese C. Biedl. Straightening out planar poly-line drawings. Technical Report 1404.5892v2 [cs.CG], arXiv, April 2014.
[Biedl14a]
Therese C. Biedl. Height-preserving transformations of planar graph drawings. In 22nd International Symposium on Graph Drawing (GD), volume 8871 of Lecture Notes in Computer Science, pages 380–391. Springer, September 2014.
[Biedl14b]
Therese C. Biedl. On area-optimal planar graph drawings. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, 41st International Colloquium on Automata, Languages and Programming (ICALP), volume 8572 of Lecture Notes in Computer Science, pages 198–210. Springer, July 2014.
[Biedl15]
Therese C. Biedl. On triangulating k-outerplanar graphs. Discrete Applied Mathematics, 181:275–279, January 2015.
[Biedl15a]
Therese C. Biedl. Triangulating planar graphs while keeping the pathwidth small. In Ernst W. Mayr, editor, 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 9224 of Lecture Notes in Computer Science, pages 425–439. Springer, June 2015.
[BILOx24]
Helena Bergold, Vesna Iršič, Robert Lauff, Joachim Orthaber, Manfred Scheucher, and Alexandra Wesolek. Subgraph-universal planar graphs for trees. Technical Report 2409.01678 [quant-ph], arXiv, September 2024.
[BILOx25]
Helena Bergold, Vesna Iršič, Robert Lauff, Joachim Orthaber, Manfred Scheucher, and Alexandra Wesolek. Subgraph-universal planar graphs for trees. In 51st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 16124 of Lecture Notes in Computer Science, pages 62–75. Springer Cham, June 2025.
[Bilski92]
Tomasz Bilski. Embedding graphs in books: A survey. IEE Proceedings E - Computers and Digital Techniques, 139(2):134–138, March 1992.
[BIM23]
David Beltran, Paata Ivanisvili, and José Madrid. On sharp isoperimetric inequalities on the hypercube. Technical Report 2303.06738v1 [math.CA], arXiv, March 2023.
[Biniaz19]
Ahmad Biniaz. Plane hop spanners for unit disk graphs. In Zachary Friggstad, Jörg-Rüdiger Sack, and Mohammad R. Salavatipour, editors, 16th International Workshop on Algorithms and Data Structures (WADS), volume 11646 of Lecture Notes in Computer Science, pages 140–154. Springer, August 2019.
[Biniaz24]
Ahmad Biniaz. Improved bounds for covering paths and trees in the plane. Journal of Computational Geometry, 15(1):88–108, 2024.
[BIS07]
Mihai Bǎdoiu, Piotr Indyk, and Anastasios Sidiropoulos. Approximation algorithms for embedding general metrics into trees. In 18th Symposium on Discrete Algorithms (SODA), pages 515–521. ACM-SIAM, January 2007.
[BJ17]
Boris Bukh and Zilin Jiang. A bound on the number of edges in graphs without an even cycle. Combinatorics, Probability and Computing, 26(1):1–15, January 2017.
[BJ25]
Boris Bukh and R. Amzi Jeffs. Enumeration of interval graphs and d-representable complexes. Israel Journal of Mathematics, pages 1–18, 2025.
[BJ82]
Kellogg S. Booth and J. Howard Johnson. Dominating set in chordal graphs. SIAM Journal on Computing, 11(1):191–199, February 1982.
[BJ86]
Alan E. Baratz and Jeffrey M. Jaffe. Establishing virtual circuits in large computer networks. Computer Networks, 12:27–37, 1986.
[BJK00]
Horst Bunke, Xiaoyi Jiang, and Abraham Kandel. On the minimum common supergraph of two graphs. Computing, 65:13–25, July 2000.
[BJMMSS23]
Marcin Briański, Gwenaël Joret, Piotr Micek, Michał T. Seweryn, and Roohani Sharma. Treedepth vs circumference. Technical Report 2211.11410 [math.CO], arXiv, February 2023.
[BJRNx02]
Albert-László Barabasi, Hawoong Jeong, Zoltán Néda, Erzsébet Ravasz-Regan, András Schubert, and Tamás Vicsek. Evolution of the social network of scientific collaborations. Physica A: Statistical Mechanics and its Applications, 311(3-4):590–614, August 2002.
[BJY23]
Aleksandrs Belovs, Stacey Jeffery, and Duyal Yolcu. Taming quantum time complexity. Technical Report 2311.15873 [quant-ph], arXiv, November 2023.
[BK00]
Sergey Bravyi and Alexei Kitaev. Fermionic quantum computation. Technical Report 0003137v2 [quant-ph], arXiv, April 2000.
[BK03]
Manuel Bodirsky and Mihyun Kang. Generating random outerplanar graphs. In 1st Workshop on Algorithms for Listing, Counting, and Enumeration (ALICE), January 2003.
[BK04]
Manuel Bodirsky and Mihyun Kang. The asymptotic number of outerplanar graphs, 2004.
[BK06]
Surender Baswana and Telikepalli Kavitha. Faster algorithms for approximate distance oracles and all-pairs small stretch paths. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 591–602. IEEE Computer Society Press, October 2006.
[BK06a]
Manuel Bodirsky and Mihyun Kang. Generating outerplanar graphs uniformly at random. Combinatorics, Probability and Computing, 15(3):333–343, April 2006.
[BK08]
Aaron Bernstein and David R. Karger. Improved distance sensitivity oracles via random sampling. In 19th Symposium on Discrete Algorithms (SODA), pages 34–43. ACM-SIAM, January 2008.
[BK08a]
Hans Leo Bodlaender and Arie M.C.A. Koster. Combinatorial optimization on graphs of bounded treewidth. The Computer Journal, 51(3):255–269, 2008.
[BK09]
Aaron Bernstein and David R. Karger. A nearly optimal oracle for avoiding failed vertices and edges. In 41st Annual ACM Symposium on Theory of Computing (STOC), pages 101–110. ACM Press, May 2009.
[BK10]
Hans Leo Bodlaender and Arie M.C.A. Koster. Treewidth computations I. Upper bounds. Information and Computation, 208(3):259–275, March 2010.
[BK11]
József Balogh and Alexandr V. Kostochka. Large minors in graphs with given independence number. Discrete Mathematics, 311:2203–2215, 2011.
[BK11a]
Hans Leo Bodlaender and Arie M.C.A. Koster. Treewidth computations II. Lower bounds. Information and Computation, 209(7):1103–1119, July 2011.
[BK79]
Frank Bernhart and Paul C. Kainen. The book thickness of a graph. Journal of Combinatorial Theory, Series B, 27(3):320–331, December 1979.
[BK86]
Andreas Brandstädt and Dieter Kratsch. On partitions of permutations into increasing and decreasing subsequences. Elektronische Informationsverarbeitung und Kybernetik, 22(5-6):263–273, May 1986.
[BK96]
Hans Leo Bodlaender and Ton Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21(2):358–402, September 1996.
[BK97]
Therese C. Biedl and Michael Kaufmann. Area-efficient static and incremental graph drawings. In 5th Annual European Symposium on Algorithms (ESA), volume 1284 of Lecture Notes in Computer Science, pages 37–52. Springer, September 1997.
[BKC08]
Marián Boguñá, Dmitri Krioukov, and KC Claffy. Navigability of complex networks. Technical Report 0709.0303v2 [physic.soc-ph], arXiv, September 2008.
[BKK23]
Nikhil Bansal, John Kuszmaul, and William Kuszmaul. A nearly tight lower bound for the d-dimensional cow-path problem. Information Processing Letters, 182:106389, August 2023.
[BKKPx20]
Michael A. Bekos, Michael Kaufmann, Fabian Klute, Sergey Pupyrev, Chrysanthi Raftopoulou, and Torsten Ueckerdt. Four pages are indeed necessary for planar graphs. Journal of Computational Geometry, 11(1):332–353, 2020.
[BKKS11]
Boštjan Brešar, František Kardoš, Ján Katrenič, and Gabriel Semanišin. Minimum k-path vertex cover. Discrete Applied Mathematics, 159(12):1189–1195, July 2011.
[BKLMM17]
Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, and Anisur Rahaman Molla. Greedy routing and the algorithmic small-world phenomenon. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 317–380. ACM Press, July 2017.
[BKLNx07]
David Barbella, George Kachergis, David Liben-Nowell, Anna Sallstrom, and Ben Sowell. Depth of field and cautious-greedy routing in social networks. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 574–586. Springer, December 2007.
[BKM01]
Gunnar Brinkmann, Jack H. Koolen, and Vincent Moulton. On the hyperbolicity of chordal graphs. Annals of Combinatorics, 5(1):61–65, 2001.
[BKM20]
Philipp Bamberger, Fabian Kuhn, and Yannic Maus. Efficient deterministic distributed coloring with small bandwidth. In 39th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 243–252. ACM Press, August 2020.
[BKMK07]
Glencora Borradaile, Claire Kenyon-Mathieu, and Philip N. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. In 18th Symposium on Discrete Algorithms (SODA), pages 1285–1294. ACM-SIAM, January 2007.
[BKMM09]
Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, and Bojan Mohar. Linear connectivity forces large complete bipartite minors. Journal of Combinatorial Theory, Series B, 99(3):557–582, March 2009.
[BKMP05]
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. New constructions of (α,β)-spanners and purely additive spanners. In 16th Symposium on Discrete Algorithms (SODA), pages 672–681. ACM-SIAM, January 2005.
[BKMP10]
Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie. Additive spanners and (α,β)-spanners. ACM Transactions on Algorithms, 7(1):Article No. 5, pp. 1–26, November 2010.
[BKMT01]
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, and Ioan Todinca. On treewidth approximations. In 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), volume 8 of Electronic Notes in Discrete Mathematics, pages 98–101, May 2001.
[BKMT04]
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, and Ioan Todinca. On treewidth approximations. Discrete Applied Mathematics, 136(2-3):183–196, February 2004.
[BKOWZ17]
Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, and Igor E. Zverovich. Graphs with maximal induced matchings of the same size. Discrete Applied Mathematics, 216(Part 1):15–28, January 2017.
[BKP14]
Tushar Bisht, Kishore Kothapalli, and Sriram V. Pemmaraju. Brief announcement: Super-fast t-ruling sets. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 379–381. ACM Press, July 2014.
[BKPX14]
Nicolas Bonichon, Iyad A. Kanj, Ljubomir Perković, and Ge Xia. There are plane spanners of maximum degree 4. In 30th Annual ACM Symposium on Computational Geometry (SoCG), pages 20–29. ACM, June 2014.
[BKPY05]
József Balogh, Martin Kochol, András Pluhár, and Xingxing Yu. Covering planar graphs with forests. Journal of Combinatorial Theory, Series B, 94(1):147–158, March 2005.
[BKR17]
Michael A. Bekos, Michael Kaufmann, and Chrysanthi N. Raftopoulou. On optimal 2- and 3-planar graphs. In Boris Aronov and Matthew J. Katz, editors, 33rd International Symposium on Computational Geometry (SoCG), volume 77 of LIPIcs, pages 16:1–16:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2017.
[BKS07]
Boštjan Brešara, Sandi Klavžarb, and Riste Škrekovski. On cube-free median graphs. Discrete Mathematics, 307(3-5):345–351, February 2007.
[BKS10]
Mohsen Bayati, Jeong Han Kim, and Amin Saberi. A sequential algorithm for generating random graphs. Algorithmica, 58(4):860–910, December 2010.
[BKS19]
Amariah Becker, Philip N. Klein, and Aaron Schild. A PTAS for bounded-capacity vehicle routing in planar graphs. In Zachary Friggstad, Jörg-Rüdiger Sack, and Mohammad R. Salavatipour, editors, 16th International Workshop on Algorithms and Data Structures (WADS), volume 11646 of Lecture Notes in Computer Science, pages 99–111. Springer, August 2019.
[BKT25]
Itai Benjamini, Or Kalifa, and Elad Tzalik. Hypercube mimor-universality. Technical Report 2501.13730v3 [math.CO], arXiv, February 2025.
[BKTW20]
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width I: tractable FO model checking. Technical Report 2004.14789v1 [cs.DS], arXiv, April 2020.
[BKTW22]
Édouard Bonnet, Eun Jung Kim, Stéphan Thomassé, and Rémi Watrigant. Twin-width. La Gazette du GDR-IM, #3:5–14, November 2022.
[BKZ15]
Michael A. Bekos, Michael Kaufmann, and Christian Zielke. The book embedding problem from a SAT-solving perspective. In 23rd International Symposium on Graph Drawing and Network Visualization (GD), volume 9411 of Lecture Notes in Computer Science, pages 125–138. Springer, September 2015.
[BL76]
Kellogg S. Booth and George S. Lueker. Testing for the consecutive ones property, interval graphs and graphs planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13(3):335–379, December 1976.
[BL84]
Sandeep N. Bhatt and Frank Thomson Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2):300–343, April 1984.
[Blank90]
Tom Blank. The MasPar MP-1 architecture. In 35th IEEE Computer Society International Conference (COMPCON), pages 20–24. IEEE, February 1990.
[Blelloch08]
Guy E. Blelloch. Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. In 19th Symposium on Discrete Algorithms (SODA), pages 894–903. ACM-SIAM, January 2008.
[BLM00]
Nicolas Bonichon, Bertrand Le Saëc, and Mohamed Mosbah. Orthogonal drawings based on the stratification of planar graphs. Technical Report RR-1246-00, LaBRI, 2000.
[BLM02b]
Nicolas Bonichon, Bertrand Le Saëc, and Mohamed Mosbah. Wagner's theorem on realizers. In 29th International Colloquium on Automata, Languages and Programming (ICALP), volume 2380 of Lecture Notes in Computer Science, pages 1043–1053. Springer, 2002.
[BLM02c]
Nicolas Bonichon, Bertrand Le Saëc, and Mohamed Mosbah. Optimal area algorithm for planar polyline drawings. In 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2573 of Lecture Notes in Computer Science, pages 35–46. Springer, 2002.
[BLM12]
Surender Baswana, Utkarsh Lath, and Anuradha S. Mehta. Single source distance oracle for planar digraphs avoiding a failed node or link. In 23rd Symposium on Discrete Algorithms (SODA), pages 223–232. ACM-SIAM, January 2012.
[BLMN03]
Yair Bartal, Nathan Linial, Manor Mendel, and Assaf Naor. On metric ramsey-type phenomena. In 35th Annual ACM Symposium on Theory of Computing (STOC), pages 463–472. ACM Press, 2003.
[BLMS17]
Ahmad Biniaz, Paul Liu, Anil Maheshwari, and Michiel Smid. Approximation algorithms for the unit disk cover problem in 2D and 3D. Computational Geometry: Theory and Applications, 60:8–18, January 2017.
[BLN18]
Ivan Bardet, Cécilia Lancien, and Ion Nechita. de Finetti reductions for partially exchangeable probability distributions. Technical Report 1801.05240v1 [math.PR], arXiv, January 2018.
[BLP25]
Sébastien Bouchard, Arnaud Labourel, and Andrzej Pelc. Impact of knowledge on the cost of treasure hunt in trees. Technical Report 2503.13100v1 [cs.DS], arXiv, March 2025.
[BLS06]
Costas Busch, Ryan LaFortune, and Srikanta Tirthapura. Improved sparse covers for graphs excluding a fixed minor. Technical Report 06-16, Department of Computer Science, Rensselaer Polytechnic Institute, November 2006.
[BLS07]
Costas Busch, Ryan LaFortune, and Srikanta Tirthapura. Improved sparse covers for graphs excluding a fixed minor. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 61–70. ACM Press, August 2007.
[BLS99]
Andreas Brandstädt, Van Bang Le, and Jeremy P. Spinrad. Graph classes. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
[BLT07]
Costas Busch, Ryan LaFortune, and Srikanta Tirthapura. Improved sparse covers for graphs excluding a fixed minor. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 61–67. ACM Press, August 2007.
[BLT90]
Erwin Maria Bakker, Jan van Leeuwen, and Richard B. Tan. Prefix routing schemes in dynamics networks. Technical Report RUU-CS-90-10, Utrecht University, March 1990.
[BLT91]
Erwin Maria Bakker, Jan van Leeuwen, and Richard B. Tan. Linear interval routing. Algorithms Review, 2:45–61, 1991. Newsletter of the ESPRIT II Basic Research Actions Program Project no. 3075 (ALCOM).
[BLT91a]
Erwin Maria Bakker, Jan van Leeuwen, and Richard B. Tan. Linear interval routing schemes. Technical Report RUU-CS-91-7, Utrecht University, February 1991.
[BLT94]
Erwin Maria Bakker, Jan van Leeuwen, and Richard B. Tan. Unpublished manuscript, 1994.
[BLTT95]
Hans Leo Bodlaender, Jan van Leeuwen, Richard B. Tan, and Dimitrios M. Thilikos. On interval routing schemes and treewidth. In M. Nagl, editor, 21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1017 of Lecture Notes in Computer Science, pages 181–196. Springer-Verlag, June 1995.
[BLTT96]
Hans Leo Bodlaender, Jan van Leeuwen, Richard B. Tan, and Dimitrios M. Thilikos. On interval routing schemes and treewidth. Technical Report UU-CS-1996-41, Utrecht University, 1996.
[BLTT97]
Hans Leo Bodlaender, Jan van Leeuwen, Richard B. Tan, and Dimitrios M. Thilikos. On interval routing schemes and treewidth. Information and Computation, 139(1):92–109, November 1997.
[BLTV00]
Harry Buhrman, Ming Li, John Tromp, and Paul M.B. Vitányi. Kolmogorov random graphs and the incompressibility method. SIAM Journal on Computing, 29(2):590–599, 2000.
[Blum15]
Norbert Blum. Maximum matching in general graphs without explicit consideration of blossoms revisited. Technical Report 1509.04927v1 [cs.DS], arXiv, September 2015.
[Blum67]
Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322–336, April 1967.
[Blum84]
Norbert Blum. A boolean function requiring 3n network size. Theoretical Computer Science, 28(3):337–345, 1984.
[Blum90]
Norbert Blum. A new approach to maximum matching in general graphs. In Michael S. Paterson, editor, 25th International Colloquium on Automata, Languages and Programming (ICALP), volume 443 of Lecture Notes in Computer Science, pages 586–597. Springer, July 1990.
[Bluskov18]
Iliya Bluskov. New constant weight codes and packing numbers. In 7th International Conference on Algebraic Informatics (CAI), volume 65 of Electronic Notes in Discrete Mathematics, pages 31–36. Elsevier, March 2018.
[BLV97]
Harry Buhrman, Ming Li, and Paul M.B. Vitányi. Kolmogorov random graphs. In IEEE Conference on Compression and Complexity of Sequences, pages 78–96. IEEE Computer Society Press, June 1997.
[BLWN17]
Glencora Borradaile, Hung Le, and Christian Wulff-Nilsen. Minor-free graphs have light spanners. Technical Report 1711.0082v1 [cs.DS], arXiv, November 2017.
[BM01]
Prosenjit Bose and Pat Morin. Competitive online routing in geometric graphs. In 8th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 35–44. Carleton Scientific, June 2001.
[BM04]
John M. Boyer and Wendy J. Myrvold. On the cutting edge: Simplified O(n) planarity by edge addition. Journal of Graph Algorithms and Applications, 8(3):241–273, 2004.
[BM04a]
Prosenjit Bose and Pat Morin. Online routing in triangulations. SIAM Journal on Computing, 33(4):937–951, 2004.
[BM04b]
Prosenjit Bose and Pat Morin. Competitive online routing in geometric graphs. Theoretical Computer Science, 324(2-3):273–288, September 2004.
[BM09]
Kevin Buchin and Wolfgang Mulzer. Delaunay triangulations in O(sort(n)) time and more. In 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 139–148. IEEE Computer Society Press, October 2009.
[BM10]
Nicolas Bonichon and Jean-Francois Marckert. Asymptotic of geometrical navigation on a random set of points of the plane. Technical Report 1009.4679v1 [math.PR], arXiv, September 2010.
[BM12]
Matthew Bauer and Mirela Damian. Some sparse Yao graphs are spanners. In 28th European Workshop on Computational Geometry (EuroCG), pages 229–232, March 2012.
[BM25]
Sujoy Bhore and Lazar Milenković. Light spanners with small hop-diameter. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 32:1–32:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[BM86]
Hans-Jürgen Bandelt and Henry Martyn Mulder. Distance-hereditary graphs. Journal of Combinatorial Theory, Series B, 41(2):182–208, October 1986.
[BM88]
Daniel Bienstock and Clyde L. Monna. On the complexity of covering vertices by faces in a planar graph. SIAM Journal on Computing, 17(1):53–76, 1988.
[BM94]
Andrej Brodnik and J. Ian Munro. Membership in constant time and minimum space. In 2nd Annual European Symposium on Algorithms (ESA), volume 855 of Lecture Notes in Computer Science, pages 72–81. Springer-Verlag, September 1994.
[BM99]
Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627–1640, May 1999.
[BM99a]
John M. Boyer and Wendy J. Myrvold. Stop minding your P's and Q's: a simplified O(n) planar embedding algorithm. In 10th Symposium on Discrete Algorithms (SODA), pages 140–146. ACM-SIAM, 1999.
[BMMV03]
Robert Babilon, Jiří Matoušek, Jana Maxová, and Pavel Valtr. Low-distortion embeddings of trees. Journal of Graph Algorithms and Applications, 7(4):399–409, 2003.
[BMO22]
Prosenjit Bose, Pat Morin, and Saeed Odak. An optimal algorithm for product structure in planar graphs. Technical Report 2202.08870v1 [cs.DS], arXiv, February 2022.
[BMT03]
Vincent Bouchitté, Frédéric Mazoit, and Ioan Todinca. Chordal embeddings of planar graphs. Discrete Mathematics, 273(1-3):85–102, December 2003.
[BMU19]
Sebastian Brandt, Yannic Maus, and Jara Uitto. A sharp threshold phenomenon for the distributed complexity of the Lovász local lemma. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 389–398. ACM Press, July 2019.
[BMvRV15]
Prosenjit Bose, Pat Morin, André van Renssen, and Sander Verdonschot. The θ5-graph is a spanner. Computational Geometry: Theory and Applications, 48(2):108–119, February 2015.
[BMW18]
József Balogh, Tamás Mászáros, and Adam Zsolt Wagner. Two results about the hypercube. Discrete Applied Mathematics, 247:322–326, October 2018.
[BN12]
Djamal Belazzougui and Gonzalo Navarro. New lower and upper bounds for representing sequences. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 181–192. Springer-Verlag, September 2012.
[BNS18]
Julien Baste, Marc Noy, and Ignasi Sau. On the number of labeled graphs of bounded treewidth. European Journal of Combinatorics, 71:12–21, June 2018.
[BNW07]
Olivier Bernardi, Marc Noy, and Dominic J.A. Welsh. On the growth rate of minor-closed classes of graphs. Technical Report 0710.2995v1 [math.CO], arXiv, October 2007.
[BNWN22]
Aaron Bernstein, Danupon Nanongkai, and Christian Wulff-Nilsen. Negative-weight single-source shortest paths in near-linear time. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 600–611. IEEE Computer Society Press, October 2022.
[Boczkowski18]
Lucas Boczkowski. Searching and broadcasting in stochastic environments, a biological perspective. PhD thesis, IRIF, Université Paris 7, November 2018.
[Bod07]
Hans Leo Bodlaender. Treewidth: Structure and algorithms. In 14th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 4474 of Lecture Notes in Computer Science, pages 11–25. Springer, June 2007.
[Bod88]
Hans Leo Bodlaender. NC-algorithms for graphs with small treewidth. In 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 344 of Lecture Notes in Computer Science, pages 1–10. Springer, June 1988.
[Bod89]
Hans Leo Bodlaender. On linear time minor tests with depth first search. In Frank Dehne, Jörg-Rüdiger Sack, and Nicola Santoro, editors, International Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 577–590. Springer, August 1989.
[Bod92]
Hans Leo Bodlaender. A tourist guide through treewidth. Technical Report RUU-CS-92-12, Utrecht University, March 1992. Revised March 1993.
[Bod92a]
Hans Leo Bodlaender. On disjoint cycles. In 17th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 570 of Lecture Notes in Computer Science, pages 230–238. Springer, June 1992.
[Bod93]
Hans Leo Bodlaender. A tourist guide through treewidth. Acta Cybernetica, 11(1-2):1–21, 1993.
[Bod93a]
Hans Leo Bodlaender. On linear time minor tests with depth first search. Journal of Algorithms, 14(1):1–23, January 1993.
[Bod93b]
Hans Leo Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. In 25th Annual ACM Symposium on Theory of Computing (STOC), pages 226–234. ACM Press, 1993.
[Bod94]
Hans Leo Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science, 5(1):59–68, 1994.
[Bod96]
Hans Leo Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Technical Report UU-CS-1996-02, Utrecht University, 1996.
[Bod96a]
Hans Leo Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25(6):1305–1317, 1996.
[Bod98]
Hans Leo Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1–45, December 1998.
[Bodini02]
Olivier Bodini. On the minimum size of a contraction-universal tree. In 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2573 of Lecture Notes in Computer Science, pages 25–34. Springer, June 2002.
[Bodwin17]
Gregory Bodwin. Linear size distance preservers. In 28th Symposium on Discrete Algorithms (SODA), pages 600–615. ACM-SIAM, January 2017.
[Bodwin18]
Gregory Bodwin. On the structure of unique shortest paths in graphs. Technical Report 1804.09745v2 [cs.DS], arXiv, October 2018.
[Bodwin21]
Gregory Bodwin. New results on linear size distance preservers. SIAM Journal on Computing, 50(2):662–673, January 2021.
[Bohr35]
Niels Bohr. Can quantum-mechanical description of physical reality be considered complete?Physical Review, 48(8):696–702, October 1935.
[Bollobas01]
Béla Bollobás. Random graphs, volume 73 of Cambridge Studies in Advanced Mathmatics. Cambridge University Press, 2001.
[Bollobas78]
Béla Bollobás. Extremal graph theory. London Mathematical Society Monographs. Academic Press, New York, 1978.
[Bollobas84]
Béla Bollobás. Lectures on random graphs. In Adrian J. Bondy and U.S.R. Murty, editors, Progress in Graph Theory, pages 3–41. Academic Press, 1984.
[Bollobas85]
Béla Bollobás. Random graphs. Academic Press, New York, 1985.
[Bonamy15]
Marthe Bonamy. Global discharging methods for coloring problems in graphs. PhD thesis, Université de Montpellier 2, France, February 2015.
[Bonichon02]
Nicolas Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. In Formal Power Series & Algebraic Combinatorics (FPSAC), July 2002.
[Bonichon02a]
Nicolas Bonichon. Aspects algorithmiques et combinatoires des réaliseurs des graphes plans maximaux. PhD thesis, Université Bordeaux 1, Talence, France, December 2002.
[Bonichon05]
Nicolas Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths. Discrete Mathematics, 298(1-3):104–114, August 2005.
[Bonsma12]
Paul Bonsma. Surface split decompositions and subgraph isomorphism in graphs on surfaces. In 29th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 14 of LIPIcs, pages 531–542. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2012.
[Borgers90]
Christoph Börgers. Generalized delaunay triangulations of non-convex domains. Computers & Mathematics with Applications, 20(7):45–49, 1990.
[Bose02]
Prosenjit Bose. On embedding an outer-planar graph in a point set. Computational Geometry: Theory and Applications, 23(3):303–312, November 2002.
[Bose38]
Raj Chandra Bose. On the application of the properties of Galois fields to the problem of construction of hyper-græco-latin squares. Sankhyā, The Indian Journal of Statistics, 3(4):323–338, 1938.
[Bouchet88]
André Bouchet. Transforming trees by successive local complementations. Journal of Graph Theory, 12(2):195–207, 1988.
[Bourgain85]
Jean Bourgain. On Lipschitz embeddings of finite metrics spaces in Hilbert spaces. Israel Journal of Mathematics, 52(1-2):46–52, 1985.
[Bousquet02]
Mireille Bousquet-Mélou. Private communication, 2002.
[Boutiche12]
Mohamed-Amine Boutiche. Techniques de décompositions de graphes appliquées au problème de routage. PhD thesis, Université Houari Boumédiène (USTHB), Algérie, September 2012.
[Bouvier14]
Tom Bouvier. Graphes et décompositions. PhD thesis, Université Bordeaux, Talence, France, December 2014.
[Boyer04]
Michel Boyer. On Mermin's n-player games parity game, August 2004.
[BP19]
Gregory Bodwin and Shyamal Patel. A trivial yet optimal solution to vertex fault tolerant spanners. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 541–543. ACM Press, July 2019.
[BP69]
Lowell W. Beineke and R.E. Pippert. The number of labeled k-dimensional trees. Journal of Combinatorial Theory, 6(2):200–205, March 1969.
[BP89]
Jean-Claude Bermond and Claudine Peyrat. de Bruijn and Kautz networks: a competitor for the hypercube?In F. André and J.-P. Verjus, editors, 1st European Workshop on Hypercube and Distributed Computers, pages 279–293. North-Holland, 1989.
[BP94]
Jean R.S. Blair and Barry W. Peyton. On finding minimum-diameter clique trees. Nordic Journal of Computing, 1(2):173–201, 1994.
[BP95]
Jean-Claude Bermond and David Peleg. The power of small coalitions in graphs. In Lefteris M. Kirousis and Evangelos Kranakis, editors, 2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 173–184, 1995.
[BP99]
József Balogh and András Pluhár. A sharp edge bound on the interval number of a graph. Journal of Graph Theory, 32(10):153–159, October 1999.
[BPBB25]
Sebastian Brandhofer, Ilia Polian, Stefanie Barz, and Daniel Bhatti. Hardware-efficient preparation of architecture-specific graph states on near-term quantum computers. Springer Nature / Scientific Reports, 15(2095), January 2025.
[BPTW10]
Julia Böttcher, Klaas P. Pruessmann, Anusch Taraz, and Andreas Würfl. Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. European Journal of Combinatorics, 31(5):1217–1227, July 2010.
[BPW12]
Glencora Borradaile, Seth Pettie, and Christian Wulff-Nilsen. Connectivity oracles for planar graphs. In 13th Scandinavian Workshop on Algorithm Theory (SWAT), volume 7357 of Lecture Notes in Computer Science, pages 316–327. Springer, July 2012.
[BPW12a]
Glencora Borradaile, Seth Pettie, and Christian Wulff-Nilsen. Connectivity oracles for planar graphs. Technical Report 1204.4159v1 [cs.DS], arXiv, April 2012.
[BPW23]
Nicolas Bousquet, Théo Pierron, and Alexandra Wesolek. A note on highly connected K2,ℓ-minor free graphs. Technical Report 2301.02133v1 [cs.DM], arXiv, January 2023.
[BR04]
Béla Bollobás and Oliver Riordan. The diameter of a scale-free random graph. Combinatorica, 24(1):5–34, January 2004.
[BR23]
Grigoriy Blekherman and Annie Raymond. A new proof of the Erdős-Simonovits conjecture on walks. Graphs and Combinatorics, 39(3):53, April 2023.
[Brady05]
Arthur Brady. A compact routing scheme for power-law networks using empirical discoveries in power-law graph topology. Master thesis, Tufts University, May 2005.
[Brand08]
Franz J. Brandenburg. Drawing planar graphs on (8/9)n2 area. In International Conference on Topological & Geometric Graph Theory (TGGT), volume 31 of Electronic Notes in Discrete Mathematics, pages 37–40, August 2008.
[Brand87]
Andreas Brandstädt. The computational complexity of feedback vertex set, hamiltonian circuit, dominating set, Steiner tree, and bandwidth on special perfect graphs. Journal of Information Processing and Cybernetics, 23(8-9):471–477, September 1987.
[Brandenburg24]
Franz J. Brandenburg. Straight-line drawings of 1-planar graphs. Computational Geometry: Theory and Applications, 116:102036, January 2024.
[Brandt19]
Sebastian Brandt. An automatic speedup theorem for distributed problems. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 379–388. ACM Press, July 2019.
[Brauer45]
Alfred Brauer. A problem of additive number theory and its application in electrical engineering. Journal of the Elisha Mitchell Scientific Society, 61(1/2):55–66, August 1945.
[Braume93]
Vinzenz Braume. Theoretische und experimentelle analyse von intervall-routing algorithmen. PhD thesis, Department of Mathematics and Computer Science, University of Paderborn, July 1993.
[Braverman12]
Mark Braverman. Interactive information complexity. In 44th Annual ACM Symposium on Theory of Computing (STOC), page 505. ACM Press, May 2012.
[Brehm00]
Enno Brehm. 3-orientations and Schnyder 3-tree-decompositions. PhD thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
[Breuer66]
Melvin A. Breuer. Coding the vertexes of a graph. IEEE Transactions on Information Theory, 12(2):148–153, April 1966.
[Brodal97]
Gerth Stølting Brodal. Predecessor queries in dynamic integer sets. In Rüdiger Reischuk and Michel Morvan, editors, 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1200 of Lecture Notes in Computer Science, pages 21–32. Springer, February 1997.
[Brouwer79]
Andries E. Brouwer. Optimal packings of k4's into kn. Journal of Combinatorial Theory, Series A, 26(3):278–297, May 1979.
[Brown66]
W.G. Brown. On graphs that do not contain a Thomsen graph. Canadian Mathematical Bulletin, 9(3):281–285, 1966.
[BRR10]
Piotr Berman, Sofya Raskhodnikova, and Ge Ruan. Finding sparser directed spanners. In 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 8 of LIPIcs, pages 424–435. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2010.
[BRRS14]
Sergio Bermudo, José M. Rodríguez, Omar Rosario, and José M. Sigarreta. Graphs with small hyperbolicity constant. In Jornadas de Matemática Discreta y Algorítmica, volume 46 of Electronic Notes in Discrete Mathematics, pages 265–272. Elsevier, September 2014.
[BRST91]
Daniel Bienstock, Neil Robertson, Paul D. Seymour, and Robin Thomas. Quickly excluding a forest. Journal of Combinatorial Theory, Series B, 52(2):274–283, July 1991.
[BRSU93]
Allan Borodin, Prabhakar Raghavan, Baruch Schieber, and Eli Upfal. How much can hardware help routing?In 25th Annual ACM Symposium on Theory of Computing (STOC), pages 573–582. ACM Press, May 1993.
[BS03]
Surender Baswana and Sandeep Sen. A simple linear time algorithm for computing a (2k-1)-spanner of O(n1+1/k) size in weighted graphs. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 384–396. Springer, July 2003.
[BS04]
Surender Baswana and Sandeep Sen. Approximate distance oracles for unweighted graphs in Õ(n2) time. In 15th Symposium on Discrete Algorithms (SODA), pages 271–280. ACM-SIAM, January 2004.
[BS06a]
Surender Baswana and Sandeep Sen. Approximate distance oracles for unweighted graphs in expected O(n2) time. ACM Transactions on Algorithms, 2(4):557–577, October 2006.
[BS07]
Surender Baswana and Sandeep Sen. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms, 30(4):532–563, July 2007.
[BS08]
Surender Baswana and Soumojit Sarkar. Fully dynamic algorithm for graph spanners with poly-logarithmic update time. In 19th Symposium on Discrete Algorithms (SODA), pages 1125–1134. ACM-SIAM, January 2008.
[BS12]
Therese C. Biedl and Martin Vatshelle. The point-set embeddability problem for plane graphs. In 28th Annual ACM Symposium on Computational Geometry (SoCG), pages 41–50. ACM, June 2012.
[BS13]
Alex Bocharov and Krysta M. Svore. From reversible logic gates to universal quantum bases. Bulletin of the EATCS (The Logic in Computer Science Column), 110:52–73, June 2013.
[BS13a]
Prosenjit Bose and Michiel Smid. On plane geometric spanners: A survey and open problems. Computational Geometry: Theory and Applications, 46:818–830, 2013.
[BS17]
Bruce C. Berndt and Armin Straub. Ramanujan's formula for ζ(2n+1), pages 13–34. Springer, 2017.
[BS18]
Ivona Bezáková and Andrew Searns. On counting oracles for path problems. In Seok-Hee Hong, editor, 29th Annual International Symposium on Algorithms and Computation (ISAAC), volume 123 of LIPIcs, pages 56:1–56:12. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2018.
[BS24]
Eli Berger and Paul D. Seymour. Bounded-diameter tree-decompositions. Technical Report 2306.13282v3 [math.CO], arXiv, January 2024.
[BS24a]
Eli Berger and Paul D. Seymour. Bounded-diameter tree-decompositions. Combinatorica, 44:659–674, 2024.
[BS74]
J. Adrian Bondy and Miklós Simonovits. Cycle of even length in graphs. Journal of Combinatorial Theory, Series B, 16(2):97–105, April 1974.
[BS76]
Jon Louis Bentley and Michael Ian Shamos. Divide-and-conquer in multidimensional space. In 8th Annual ACM Symposium on Theory of Computing (STOC), pages 220–230. ACM Press, May 1976.
[BS96]
Itai Benjamini and Oded Schramm. Percolation beyond Zd, many questions and a few answers. Electronic Communications in Probability, 1:71–82, 1996.
[BS99]
Valmir C. Barbosa and Jayme Luiz Szwarcfiter. Generating all the acyclic orientations of an undirected graph. Information Processing Letters, 72(1-2):71–74, October 1999.
[BS99a]
Johannes Blömer and Jean-Pierre Seifert. On the complexity of computing short linearly independent vectors and short bases in a lattice. In 31st Annual ACM Symposium on Theory of Computing (STOC), pages 711–720. ACM Press, May 1999.
[BSH77]
Andries E. Brouwer, Alexander Schrijver, and Haim Hanani. Group divisible designs with block-size four. Discrete Mathematics, 20:1–10, 1977.
[BSS02]
Anne Berry, Alain Sigayret, and Christine Sinoquet. Towards improving phylogeny reconstruction with combinatorial-based constraints on an underlying family of graphs, 2002.
[BSS08]
Itai Benjamini, Oded Schramm, and Asaf Shapira. Every minor-closed property of sparse graphs is testable. In 40th Annual ACM Symposium on Theory of Computing (STOC), pages 393–402. ACM Press, June 2008.
[BSSS90]
Andries E. Brouwer, James B. Shearer, Neil James Alexander Sloane, and Warren D. Smith. A new table of constant weight codes. IEEE Transactions on Information Theory, 36(6):1334–1380, November 1990.
[BSSZ26]
Thomas F. Bloom, Will Sawin, Carl Schildkraut, and Dmitrii Zhelezov. The sum-product conjecture is false for real numbers. Technical Report 2605.28781v1 [math.NT], arXiv, May 2026.
[BSX09]
Prosenjit Bose, Michiel Smid, and Daming Xu. Delaunay and diamond triangulations contain spanners of bounded degree. International Journal of Computational Geometry and Applications, 19(2):119–140, April 2009.
[BT08]
Anne Broadbent and Alain Tapp. Can quantum mechanics help distributed computing?ACM SIGACT News - Distributed Computing Column, 39(3):67–76, September 2008.
[BT13]
Béla BolBollobás and Andrew Thomason. Hereditary and monotone properties of graphs. In Ronald Lewis Graham, Jaroslav Nešetřil, and Steve Butler, editors, The Mathematics of Paul Erdős II, Problem Books in Mathematics, pages 69–80. Springer, 2013.
[BT15]
Nicolas Bousquet and Stéphan Thomassé. VC-dimension and Erdős-Posá property. Discrete Mathematics, 338(12):2302–2317, December 2015.
[BT19]
Anton Bernshteyn and Michael Tait. Improved lower bound for difference bases. Journal of Number Theory, 205:50–58, December 2019.
[BT22]
Sujoy Bhore and Rahul Jain. Euclidean Steiner spanners: Light and sparse. Technical Report 2206.09648v1 [cs.CG], arXiv, June 2022.
[BT97]
Hans Leo Bodlaender and Dimitrios M. Thilikos. Treewidth for graphs with small chordality. Discrete Applied Mathematics, 79(1-3):45–61, November 1997.
[BT97a]
Graham R. Brightwell and William T. Trotter. The order dimension of planar maps. SIAM Journal on Discrete Mathematics, 10(4):515–528, 1997.
[BT99]
Vincent Bouchitté, Dieter Kratsch, Haiko Müller, and Ioan Todinca. Treewith and minimum fill-in: Grouping the minimal separators. Research Report 99-39, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, September 1999.
[BtBB14]
Quirijn W. Bouts, Alex P. ten Brink, and Kevin Buchin. A framework for computing the greedy spanner. In 30th Annual ACM Symposium on Computational Geometry (SoCG), pages 11–19. ACM, June 2014.
[BTV16]
Mikhail Bogdanov, Monique Teillaud, and Gert Vegter. Delaunay triangulations on orientable surfaces of low genus. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 20:1–20:17. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[BTvL90]
Erwin Maria Bakker, Richard B. Tan, and Jan van Leeuwen. Prefix routing schemes in dynamic networks. Technical Report RUU-CS-90-10, Dept. of Computer Science, Utrecht University, 1990.
[Bucatanschi04]
Dan George Bucatanschi. The ant colony system for the freeze-tag problem. In Midstates Conference on Undergraduate Research in Mathematics and Computer, Science (MCURCSM), pages 61–69, 2004.
[Buhrman96]
Harry Buhrman. A short note on Shor's factoring algorithm. ACM SIGACT News, 27(1):89–90, March 1996.
[Buneman71]
Peter Buneman. The recovery of trees from measures of dissimilarity. Mathematics in Archaeological and Historical Sciences, pages 387–395, 1971.
[Buneman74]
Peter Buneman. A characterization of rigid circuit graphs. Discrete Mathematics, 9(3):205–212, September 1974.
[Buneman74a]
Peter Buneman. A note on the metric properties of trees. Journal of Combinatorial Theory, Series B, 14(1):48–50, August 1974.
[Buseman55]
Herbert Buseman. The geometry of geodesies, volume 6 of Pure and Applied Mathematics. Academic Press, New York, 1955.
[Buser82]
Peter Buser. A note on the isoperimetric constant. Annales scientifiques de l'École Normale Supérieure, 15(2):213–230, 1982.
[Bush52]
K.A. Bush. Orthogonal arrays of index unity. The Annals of Mathematical Statistics, 23(3):426–434, September 1952.
[Butler06]
Steve Butler. Induced-universal graphs for graphs with bounded maximum degree. In 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, July 2006. Dedicated to Jarik Nešetřil on the occasion of his 60th birthday.
[Butler09]
Steve Butler. Induced-universal graphs for graphs with bounded maximum degree. Graphs and Combinatorics, 25:461–468, November 2009.
[BV00]
Paolo Boldi and Sebastiano Vigna. Complexity of deciding Sense of Direction. SIAM Journal on Computing, 29(3):779–789, 2000.
[BV00a]
Paolo Boldi and Sebastiano Vigna. Lower bounds for (weak) sense of direction. In 7th International Colloquium on Structural Information & Communication Complexity (SIROCCO). Carleton Scientific, June 2000.
[BV13]
Djamal Belazzougui and Rossano Venturini. Compressed static functions with applications. In 24th Symposium on Discrete Algorithms (SODA), pages 229–240. ACM-SIAM, January 2013.
[BV94]
Omer Berkman and Uzi Vishkin. Finding level-ancestors in trees. Journal of Computer and System Sciences, 48(2):214–230, April 1994.
[BvR08]
Hans Leo Bodlaender and Johan M.M. van Rooij. Design by measure and conquer - A faster exact algorithm for dominating set. In 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1 of LIPIcs, pages 657–668. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2008.
[BVW15]
Gregory Bodwin and Virginia Vassilevska Williams. Very sparse additive spanners and emulators. In 6th Conference on Innovations in Theoretical Computer Science (ITCS), pages 377–382. ACM Press, January 2015.
[BVW16]
Gregory Bodwin and Virginia Vassilevska Williams. Better distance preservers and additive spanners. In 27th Symposium on Discrete Algorithms (SODA), pages 855–872. ACM-SIAM, January 2016.
[BW15]
R. Ryan Williams and Samuel R. Buss. Limits on alternation-trading proofs for time–space lower bounds. Computational Complexity, 24(3):533–600, September 2015.
[BW19]
Josh Brunner and Julian Wellman. An optimal algorithm for online freeze-tag. Technical Report 1902.01609v1 [cs.DS], arXiv, February 2019.
[BW20]
Josh Brunner and Julian Wellman. An optimal algorithm for online freeze-tag. In 10th International Conference Fun with Algorithms (FUN), volume 157 of LIPIcs, pages 8:1–11. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2020.
[BW24]
Bruce W. Brewer and Haitao Wang. An improved algorithm for shortest paths in weighted unit-disk graphs. In 36th Canadian Conference on Computational Geometry (CCCG), pages 57–64, July 2024.
[BYCHS16]
Reuven Bar-Yehuda, Keren Censor-Hillel, and Gregory Schwartzman. A distributed (2+ε)-approximation for vertex cover in O(logΔ / \varepsilonloglogΔ) rounds. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 3–8. ACM Press, July 2016.
[BYCHS17]
Reuven Bar-Yehuda, Keren Censor-Hillel, and Gregory Schwartzman. A distributed (2+ε)-approximation for vertex cover in O(logΔ / \varepsilonloglogΔ) rounds. Journal of the ACM, 64(3):Article No. 23, pp. 1–11, 2017.
[BYCR88]
Ricardo A. Baeza-Yates, Joseph C. Culberson, and Gregory J.E. Rawlins. Searching with uncertainty. In 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of Lecture Notes in Computer Science, pages 176–189. Springer, July 1988.
[BYCR93]
Ricardo A. Baeza-Yates, Joseph C. Culberson, and Gregory J.E. Rawlins. Searching in the plane. Information and Computation, 106(2):234–252, October 1993.
[CA69]
Stephen Arthur Cook and Stål O. Aanderaa. On the minimum computation time of functions. Transactions of the American Mathematical Society, 142:291–314, August 1969.
[Cabello06]
Sergio Cabello. Many distances in planar graphs. In 17th Symposium on Discrete Algorithms (SODA), pages 1213–1220. ACM-SIAM, January 2006.
[Cabello09]
Sergio Cabello. Finding shortest contractible and shortest separating cycles in embedded graphs. In 20th Symposium on Discrete Algorithms (SODA), pages 616–624. ACM-SIAM, January 2009.
[Cabello19]
Sergio Cabello. Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM Transactions on Algorithms, 15(2):Article No. 21, pp. 1–38, May 2019.
[CAD11]
Luca Castelli Aleardi and Olivier Devillers. Explicit array-based compact data structures for triangulations. In 22nd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7074 of Lecture Notes in Computer Science, pages 312–322. Springer, December 2010.
[CADS05a]
Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer. Succinct representation of triangulations with a boundary. In Frank Dehne, Alejandro López-Ortiz, and Jörg-Rüdiger Sack, editors, 9th International Workshop on Algorithms and Data Structures (WADS), volume 3608 of Lecture Notes in Computer Science, page 134. Springer, August 2005.
[CADS05b]
Luca Castelli Aleardi, Olivier Devillers, and Gilles Schaeffer. Dynamic updates of succinct triangulations. In 17th Canadian Conference on Computational Geometry (CCCG), August 2005.
[CADW17]
Vincent Cohen-Addad, Søren Dahlgaard, and Christian Wulff-Nilsen. Fast and compact exact distance oracle for planar graphs. In 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 962–973. IEEE Computer Society Press, October 2017.
[Cai89]
Jin-Yi Cai. Lower bounds for constant depth circuits in the presence of help bits. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 532–537. IEEE Computer Society Press, October 1989.
[Cai98]
Jin-Yi Cai. A relation of primal-dual lattices and the complexity of shortest lattice vector problem. Theoretical Computer Science, 207(1):105–116, October 1998.
[Cai99]
Jin-Yi Cai. Some recent progress on the complexity of lattice problems. In Electronic Colloquium on Computational Complexity (ECCC), TR99-006, March 1999.
[Capalbo02]
Michael R. Capalbo. Small universal graphs for bounded-degree planar graphs. Combinatorica, 22(3):345–359, July 2002.
[Capalbo99]
Michael R. Capalbo. A small universal graph for bounded-degree planar graphs. In 10th Symposium on Discrete Algorithms (SODA), pages 156–160. ACM-SIAM, 1999.
[Carella22]
N.A. Carella. Irrationality measure of pi. Technical Report 1902.08817v10 [math.GM], arXiv, May 2022.
[Carella22a]
N.A. Carella. Irrationality measure of 𝜋2. Technical Report 2201.00651v2 [math.GM], arXiv, January 2022.
[Carella23]
N.A. Carella. The product of e𝜋 is irrational. Technical Report 1706.08394v7 [math.GM], arXiv, January 2023.
[Carmesin24]
Johannes Carmesin. Local 2-separators. Technical Report 2008.03032v2 [math.CO], arXiv, February 2024.
[Carrere09]
Frédérique Carrère. Inductive computations on graphs defined by clique-width expressions. RAIRO-Theoretical Informatics and Applications, 43(3):625–651, 2009.
[Carrere12]
Frédérique Carrère. Tree balancing in linear time, May 2012.
[Castelli06]
Luca Castelli Aleardi. Représentations compactes de structures de données géométriques. PhD thesis, École Polytechnique, Laboratoire d'Informatique (LIX), December 2006.
[CC07]
Sergio Cabello and Erin Wolf Chambers. Multiple source shortest paths in a genus g graph. In 18th Symposium on Discrete Algorithms (SODA), pages 89–97. ACM-SIAM, January 2007.
[CC08]
Timothy M. Chan and Eric Y. Chen. In-place 2-d nearest neighbor search. In 19th Symposium on Discrete Algorithms (SODA), pages 904–911. ACM-SIAM, January 2008.
[CC10]
Paz Carmi and Carmi Chaitman. Bounded degree planar geometric spanners. Technical Report 1003.4963v1 [cs.CG], arXiv, March 2010.
[CC15]
Chandra Chekuri and Julia Chuzhoy. Degree-3 treewidth sparsifiers. In 26th Symposium on Discrete Algorithms (SODA), pages 242–255. ACM-SIAM, January 2015.
[CC16]
Chandra Chekuri and Julia Chuzhoy. Polynomial bounds for the grid-minor theorem. Journal of the ACM, 63(5):Article No. 40, pp. 1–65, December 2016.
[CC25]
Hsien-Chih Chang and Jonathan Conroy. Distance approximating minors for planar and minor-free graphs. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 735–756. IEEE Computer Society Press, December 2025.
[CC95]
Leizhen Cai and Derek G. Corneil. Tree spanners. SIAM Journal on Discrete Mathematics, 8(3):359–387, 1995.
[CC96]
F. Cheah and Derek G. Corneil. On the structure of trapezoid graphs. Discrete Applied Mathematics, 66(2):109–133, April 1996.
[CCGG98]
Moses Charikar, Chandra Chekuri, Ashish Goel, and Sudipto Guha. Rounding via trees: deterministic approximation algorithms for group Steiner trees and k-median. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 114–123. ACM Press, May 1998.
[CCGx25]
Timothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. Truly subquadratic time algorithms for diameter and related problems in graphs of bounded VC-dimension. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 2731–2768. IEEE Computer Society Press, December 2025.
[CCL13]
Nathan Cohen, David Coudert, and Aurélien Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. Research Report RR-8074, hal-00735481-v4, INRIA, HAL, March 2013.
[CCL23]
Nai-Hui Chia, Kai-Min Chung, and Ching-Yi Lai. On the need for large quantum depth. Journal of the ACM, 70(1):Article No. 6, pp. 1–38, 2023.
[CCMcIx22]
Jérémie Chalopin, Victor D. Chepoi, Mc Inerney, Sébastien Batel, and Yann Vaxès. Sample compression schemes for balls in graphs. Technical Report 2206.13254v1 [cs.DM], arXiv, June 2022.
[CCMdM21]
Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, and Arnaud de Mesmay. Almost tight lower bounds for hard cutting problems in embedded graphs. Journal of the ACM, 68(4):30:1–30:26, 2021.
[CCPMx24]
Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, and Stéphan Thomassé. Vertex-minor universal graphs for generating entangled quantum subsystems. Technical Report 2402.06260v3 [quant-ph], arXiv, May 2024.
[CCSSW24]
Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, and Julian Werthmann. Routing schemes for hybrid communication networks. Theoretical Computer Science, 985:114352, 2024.
[CD00]
Victor D. Chepoi and Feodor F. Dragan. A note on distance approximating trees in graphs. European Journal of Combinatorics, 21(6):761–766, August 2000.
[CD07]
Charles J. Colbrun and Jeffrey H. Dinitz. Handbook of combinatorial designs. Discrete Mathematics and its Applications. Chapman and Hall/CRC, 2007.
[CD16]
Bruno Courcelle and Irène Durand. Computation by fly-automata beyond monadic second-order logic. Theoretical Computer Science, 619(14):32–67, March 2016.
[CD85]
L. Paul Chew and Robert L. (Scot) Drysdale III. Voronoi diagrams based on convex distance functions. In 1st Annual ACM Symposium on Computational Geometry (SoCG), pages 235–244. ACM, June 1985.
[CDDM09]
Dan Chen, Luc Devroye, Vida Dujmović, and Pat Morin. Memoryless routing in convex subdivisions: Random walks are optimal. Technical Report 0911.2484v1 [math.PR], arXiv, November 2009.
[CDDM12]
Dan Chen, Luc Devroye, Vida Dujmović, and Pat Morin. Memoryless routing in convex subdivisions: Random walks are optimal. Computational Geometry: Theory and Applications, 45(4):178–185, May 2012.
[CDEHV08]
Victor D. Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, and Yann Vaxès. Diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs. In 24th Annual ACM Symposium on Computational Geometry (SoCG), pages 59–68. ACM, June 2008.
[CDEHV12]
Victor D. Chepoi, Feodor F. Dragan, Bertrand Estellon, Michel Habib, Yann Vaxès, and Yang Xiang. Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica, 62(3-4):713–732, April 2012.
[CDEM08]
Sergio Cabello, Matt DeVos, Jeff Erickson, and Bojan Mohar. Finding one tight cycle. In 19th Symposium on Discrete Algorithms (SODA), pages 527–531. ACM-SIAM, January 2008.
[CDFGx08]
Jerzy Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, and Jorge Urrutia. Local algorithms for dominating and connected dominating sets of unit disk graphs with location aware nodes. In 8th Latin American Symposium on Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 158–169, April 2008.
[CDG06]
Hubert T.-H. Chan, Michael Dinitz, and Anupam Gupta. Spanners with slack. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 196–207. Springer, September 2006.
[CDG20]
Ruoxu Cen, Ran Duan, and Yong Gu. Roundtrip spanners with (2k-1) stretch. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages and Programming (ICALP), volume 168 of LIPIcs, pages 24:1–24:11. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2020.
[CDGHx22]
Rutger Campbell, Marc Diestel, J. Pascal Gollin, Daniel J. Harvey, Kevin Hendrey, Robert Hickingbotham, Bojan Mohar, and David R. Wood. Graphs of linear growth have bounded treewidth. Technical Report 2210.13720v1 [math.CO], arXiv, October 2022.
[CDGHx25]
Micha Christoph, Nemanja Draganic, António Girão, Eoin Hurley, Lukas Michel, and Alp Müyesser. New bounds for linear arboricity and related problems. Technical Report 2507.20500v1 [math.CO], arXiv, July 2025.
[CDKOx05]
Edgar Chavez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Hector Tejeda, and Jorge Urrutia. Half-space proximal: A new local test for extracting a bounded dilation spanner. In 9th International Conference on Principles of Distributed Systems (OPODIS), pages 235–245. Springer, December 2005.
[CdMO18]
Erin Wolf Chambers, Arnaud de Mesmay, and Tim Ophelders. On the complexity of optimal homotopies. In 29th Symposium on Discrete Algorithms (SODA), pages 1121–1134. ACM-SIAM, 2018.
[CDN14]
David Coudert, Guillaume Ducoffe, and Nicolas Nisse. Diameter of minimal separators in graphs. Technical Report RR-8639, INRIA, November 2014.
[CDN15]
David Coudert, Guillaume Ducoffe, and Nicolas Nisse. Structure vs. métrique dans les graphes, April 2015.
[CDN16]
David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To approximate treewidth, use treelength!SIAM Journal on Discrete Mathematics, 30(3):1424–1436, 2016.
[CdS00]
Serafino Cicerone and Gabriele di Stefano. Networks with small stretch number. In 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1928 of Lecture Notes in Computer Science, pages 95–106. Springer, June 2000.
[CdS01]
Serafino Cicerone and Gabriele di Stefano. Graphs with bounded induced distance. Discrete Applied Mathematics, 108(1-2):3–21, February 2001.
[CdS03]
Serafino Cicerone and Gabriele di Stefano. (k,+)-distance-hereditary graphs. Journal of Discrete Algorithms, 1(3-4):281–302, June 2003.
[CdS98]
Serafino Cicerone and Gabriele di Stefano. Graphs with bounded induced distance. In J. Hromkovič and O. Sýkora, editors, 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1517 of Lecture Notes in Computer Science, pages 177–191. Springer, June 1998.
[CdSF98]
Serafino Cicerone, Gabriele di Stefano, and Michele Flammini. Static and dynamic low-congested interval routing schemes. In Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, 25th International Colloquium on Automata, Languages and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 592–603. Springer, July 1998. Appears also in TCS 2002, vol. 276, pp. 315-354.
[CdSFN00]
Serafino Cicerone, Gabriele di Stefano, Daniele Frigioni, and Umberto Nanni. A fully dynamic algorithm for distributed shortest paths. In 4th Latin American Symposium on Theoretical Informatics (LATIN), volume 1776 of Lecture Notes in Computer Science, pages 247–257, April 2000.
[CDV06]
Victor D. Chepoi, Feodor F. Dragan, and Yann Vaxès. Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms, 61(2):60–88, November 2006.
[CDV06a]
Victor D. Chepoi, Feodor F. Dragan, and Yann Vaxès. Addressing, distances and routing in triangular systems with applications in cellular networks. Wireless Networks, 12:671–679, 2006.
[CdV10]
Éric Colin de Verdière. Shortest cut graph of a surface with prescribed vertex set. In 18th Annual European Symposium on Algorithms (ESA), volume 6347 of Lecture Notes in Computer Science, pages 100–111. Springer, September 2010.
[CdV10a]
Éric Colin de Verdière. Algorithmique des graphes plongés sur une surface. In 12es Journées Graphes et Algorithmes, page 5, November 2010.
[CdV21]
Éric Colin de Verdière. Algorithms for embedded graphs, October 2021. Lectures Note.
[CDY03]
Victor D. Chepoi, Feodor F. Dragan, and Chenyu Yan. Additive spanners for k-chordal graphs. In 5th Italian Conference on Algorithms and Complexity (CIAC), volume 2653 of Lecture Notes in Computer Science, pages 96–107. Springer, May 2003.
[CDY05]
Victor D. Chepoi, Feodor F. Dragan, and Chenyu Yan. Additive sparse spanners for graphs with bounded length of largest induced cycle. Theoretical Computer Science, 347(1-2):54–75, November 2005.
[CE05]
Don Coppersmith and Michael Elkin. Sparse source-wise and pair-wise distance preservers. In 16th Symposium on Discrete Algorithms (SODA), pages 660–669. ACM-SIAM, January 2005.
[CE06]
Don Coppersmith and Michael Elkin. Sparse source-wise and pair-wise distance preservers. SIAM Journal on Discrete Mathematics, 20(2):463–501, 2006.
[CE07]
Victor D. Chepoi and Bertrand Estellon. Packing and covering δ-hyperbolic spaces by balls. In 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and 11th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 4627 of Lecture Notes in Computer Science, pages 59–73. Springer, August 2007.
[CE12]
Bruno Courcelle and Joost Engelfriet. Graph structure and monadic second-order logic, volume 138 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, July 2012.
[CE91]
Marek Chrobak and David Eppstein. Planar orientations with low out-degree and compaction of adjacency. Theoretical Computer Science, 86(2):243–266, September 1991.
[CEGL12]
Erin Wolf Chambers, David Eppstein, Michael T. Goodrich, and Maarten Löffler. Drawing graphs in the plane with a prescribed outer face and polynomial area. Journal of Graph Algorithms and Applications, 16(2):243–259, 2012.
[CEHMx19]
Katherine Cordwell, Alyssa Epstein, Anand Hemmady, Steven J. Miller, Eyvindur Palsson, Aaditya Sharma, Stefan Steinerberger, and Yen Nhi Truong Vu. On algorithms to calculate ingeter complexity. Integers, 19(#A12):1–13, 2019.
[CEKMO11]
Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, and Katsuhiro Ota. Toughness of Ka,t-minor-free graphs. The Electronic Journal of Combinatorics, 18(1):#P118, July 2011.
[CEN17]
Victor D. Chepoi, Bertrand Estellon, and Guyslain Naves. Packing and covering with balls on Busemann surfaces. Discrete & Computational Geometry, 57:985–1011, March 2017.
[CER93]
Bruno Courcelle, Joost Engelfriet, and Grzegorz Rozenberg. Handle-rewriting hypergraph grammars. Journal of Computer and System Sciences, 46(2):218–270, April 1993.
[CEV07]
Victor D. Chepoi, Bertrand Estellon, and Yann Vaxès. Covering planar graphs with a fixed number of balls. Discrete & Computational Geometry, 37(2):237–244, February 2007.
[CF05]
Po-Han Chen and Feng Feng. Evacuation in buildings: Path finding for real time evacuation systems. In 22nd International Symposium on Automation and Robotics in Construction (ISARC), September 2005.
[CF05a]
Po-Han Chen and Feng Feng. Path finding in multi-layer 1-IRS topologies for real-time evacuation systems. In 4th International Symposium on New Technologies for Urban Safety of Mega Cities in Asia (USMCA), October 2005.
[CF10]
Maria Chudnovsky and Alexandra Ovetsky Fradkin. An approximate version of Hadwiger's conjecture for claw-free graphs. Journal of Graph Theory, 63(4):259–278, April 2010.
[CF25]
Dibyayan Chakraborty and Florent Foucaud. Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations. Technical Report 2501.10828v1 [math.CO], arXiv, January 2025.
[CFG00]
Johanne Cohen, Pierre Fraigniaud, and Cyril Gavoille. Recognizing Knödel and Fibonacci graphs. Research Report LRI-1238, LRI, Université Paris-Sud, 91405 Orsay cedex, France, January 2000.
[CFG02]
Johanne Cohen, Pierre Fraigniaud, and Cyril Gavoille. Recognizing Knödel graphs. Discrete Mathematics, 250(1-3):41–62, May 2002.
[CFG96]
B. Chalmers, C. Franchetti, and M. Giaquinta. On the self-length of two-dimensional Banach spaces. Bulletin of the Australian Mathematical Society, 53(1):101–107, February 1996.
[CFG99]
Johanne Cohen, Pierre Fraigniaud, and Cyril Gavoille. Recognizing bipartite incident-graphs of circulant digraphs. In Peter Widmayer, Gabriele Neyer, and Stephan Eidenbenz, editors, 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1665 of Lecture Notes in Computer Science, pages 215–227. Springer, June 1999.
[CFGN15]
Guillaume Chapuy, Éric Fusy, Omer Giménez, and Marc Noy. On the diameter of random planar graphs. Combinatorics, Probability and Computing, 24(1):145–178, January 2015. Honouring the Memory of Philippe Flajolet - Part 3.
[CFHKT01]
Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, and William T. Trotter. Spanning trees of bounded degree. The Electronic Journal of Combinatorics, 8(1):#R33, 2001.
[CFHM12]
Wei Chen, Wenjie Fang, Guangda Hu, and Michael W. Mahoney. On the hyperbolicity of small-world and tree-like random graphs. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 278–288. Springer, December 2012.
[CFHYx25]
Xiwang Cao, Keqin Feng, Hexiang Huang, Yulin Yang, and Zihao Zhang. On the quantum chromatic number of hamming and generalized Hadamard graphs. Technical Report 2510.14209v1 [math.CO], arXiv, October 2025.
[CFKLx15]
Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized algorithms. Springer, 2015.
[CFKX05]
Jianer Chen, Henning Fernau, Iyad A. Kanj, and Ge Xia. Parametric duality and kernelization: Lower bounds and upper bounds on kernel size. In 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3404 of Lecture Notes in Computer Science, pages 269–280. Springer, February 2005.
[CFL08]
Luca Castelli Aleardi, Éric Fusy, and Thomas Lewiner. Schnyder woods for higher genus triangulated surfaces. In 24th Annual ACM Symposium on Computational Geometry (SoCG), pages 311–319. ACM, June 2008.
[CFLLP25]
Ruoxu Cen, Henry Fleischmann, George Z. Li, Jason Li, and Debmalya Panigrahi. Fast algorithms for graph arboricity and related problems. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 966–984. IEEE Computer Society Press, December 2025.
[CFM02]
Johanne Cohen, Pierre Fraigniaud, and Margarida Mitjana. Polynomial time algorithms for minimum-time broascast in trees. Theory of Computing Systems, 35(6):641–665, 2002.
[CFP08]
Saverio Caminiti, Irene Finocchi, and Rossella Petreschi. Engineering tree labeling schemes: A case study on least common ancestors. In 16th Annual European Symposium on Algorithms (ESA), volume 5193 of Lecture Notes in Computer Science, pages 234–245. Springer, September 2008.
[CFR04]
Francesc Comellas, Guillaume Fertin, and André Raspaud. Recursive graphs with small-world scale-free properties. Technical Report cond-mat/0402033v2 [cond-mat.stat-mech], arXiv, April 2004.
[CFS02]
Carlton M. Caves, Christopher A. Fuchs, and Rüdiger Schack. Unknown quantum states: The quantum de Finetti representation. Journal of Mathematical Physics, 43(9):4537, September 2001.
[CFS89]
C.R.J. Clapham, A. Flockhart, and J. Sheehan. Graphs without four-cycles. Journal of Graph Theory, 13(1):29–47, 1989.
[CG06]
Hubert T.-H. Chan and Anupam Gupta. Small hop-diameter sparse spanners for doubling metrics. In 17th Symposium on Discrete Algorithms (SODA), pages 70–78. ACM-SIAM, January 2006.
[CG06a]
Minghua Chen and Ayalvadi J. Ganesh. A compact routing protocol for ad hoc networks. In 2nd Workshop on Spatial Stochastic Models for Wireless Networks (SpaSWiN), April 2006.
[CG06b]
Richard Cole and Lee-Ad Gottlieb. Searching dynamic point sets in spaces with bounded doubling dimension. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 574–583. ACM Press, May 2006.
[CG08]
Hubert T.-H. Chan and Anupam Gupta. Approximating TSP on metrics with bounded global growth. In 19th Symposium on Discrete Algorithms (SODA), pages 690–699. ACM-SIAM, January 2008.
[CG78]
Fan R.K. Chung and Ronald Lewis Graham. On graphs which contain all small trees. Journal of Combinatorial Theory, Series B, 24(1):14–23, February 1978.
[CG79]
Fan R.K. Chung and Ronald Lewis Graham. On universal graphs. Annals of the New York Academy of Sciences, 319(1):136–140, May 1979.
[CG83]
Fan R.K. Chung and Ronald Lewis Graham. On universal graphs for spanning trees. Journal of the London Mathematical Society, 27(2):203–211, April 1983.
[CG83a]
John H. Conway and Cameron McA. Gordon. Knots and links in spatial graphs. Journal of Graph Theory, 7(4):445–453, 1983.
[CG94]
Robert Cypher and Luis Gravano. Requirements for deadlock-free, adaptive packet routing. SIAM Journal on Computing, 23(6):1266–1274, December 1994.
[CGA05]
Joseph C. Culberson, Yong Gao, and Cǎlin Anton. Phase transitions of dominating clique problem and their implications to heuristics in satisfiability search. In 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 78–83, 2005.
[CGC81]
Fan R.K. Chung, Ronald Lewis Graham, and Don Coppersmith. On trees containing all small trees. In Gary Chartrand, Yousef Alavi, Donald L. Goldsmith, and Don R. Lick, editors, The Theory of Applications of Graphs, pages 265–272. John Wiley & Sons, 1981.
[CGHKL98]
Richie Chih-Nan Chuang, Ashim Garg, Xin He, Ming-Yang Kao, and Hsueh-I Lu. Compact encodings of planar graphs via canonical orderings and multiple parentheses. In Kim Guldstrand Larsen, Sven Skyum, and Glynn Winskel, editors, 25th International Colloquium on Automata, Languages and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science, pages 118–129. Springer, July 1998.
[CGK08]
Bruno Courcelle, Cyril Gavoille, and Mamadou Moustapha Kanté. Efficient first-order model-checking using short labels. In 2nd International Frontiers of Algorithmics Workshop (FAW), volume 5059 of Lecture Notes in Computer Science, pages 159–170. Springer, June 2008.
[CGK08a]
Bruno Courcelle, Cyril Gavoille, and Mamadou Moustapha Kanté. Compact labelings for efficient first-order model-checking. Technical Report hal-00342668, HAL, November 2008.
[CGK11]
Bruno Courcelle, Cyril Gavoille, and Mamadou Moustapha Kanté. Compact labelings for efficient first-order model-checking. Journal of Combinatorial Optimization, 21(1):19–46, January 2011.
[CGK13]
Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha. On pairwise spanners. Technical Report 1301.1999v1 [cs.DS], arXiv, January 2013.
[CGK14]
Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. A new perspective on vertex connectivity. In 25th Symposium on Discrete Algorithms (SODA), pages 546–561. ACM-SIAM, January 2014.
[CGK14a]
Keren Censor-Hillel, Mohsen Ghaffari, and Fabian Kuhn. Distributed connectivity decomposition. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 156–165. ACM Press, July 2014.
[CGK88]
Israel Cidon, Inder Gopal, and Shay Kutten. New models and algorithms for future networks. In 7th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 79–89. ACM Press, August 1988.
[CGKK19]
Jurek Czyzowicz, Leszek Gąsieniec, Ryan Killick, and Evangelos Kranakis. Symmetry breaking in the plane: Rendezvous by robots with unknown attributes. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 4–13. ACM Press, July 2019.
[CGKPW05]
Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, and Bing Wei. Graph minors and linkages. Journal of Graph Theory, 49(1):75–91, 2005.
[CGKT02]
Timothy M. Chan, Michael T. Goodrich, S. Rao Kosaraju, and Roberto Tamassia. Optimizing area and aspect ration in straight-line orthogonal tree drawings. Computational Geometry: Theory and Applications, 23(2):153–162, September 2002.
[CGKT07]
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, and David Andrew Twigg. Forbidden-set labeling on graphs. In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), August 2007. Co-located with PODC 2007.
[CGKT08]
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, and David Andrew Twigg. Connectivity check in 3-connected planar graphs with obstacles. In International Conference on Topological & Geometric Graph Theory (TGGT), volume 31 of Electronic Notes in Discrete Mathematics, pages 151–155, August 2008.
[CGKT09]
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha Kanté, and David Andrew Twigg. Optimal labelling for connectivity checking in planar networks with obstacles. Technical Report hal-00367746, HAL, March 2009.
[CGKVV13]
Josef Cibulka, Pu Gao, Marek Krčál, Tomáš Valla, and Pavel Valtr. Polynomial bounds on geometric Ramsey numbers of ladder graphs. In Jaroslav Nešetřil and Marco Pellegrini, editors, 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 16 of CRM, pages 171–176. Edizioni della Normale, September 2013.
[CGL99]
Richard Cleve, Daniel Gottesman, and Hoi-Kwong Lo. How to share a quantum secret. Physical Review Letters, 83(3):648–651, July 1999.
[CGM08]
Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. Local terminations and distributed computability in anonymous networks. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 47–62. Springer, September 2008.
[CGM12]
Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. Election in partially anonymous networks with arbitrary knowledge in message passing systems. Distributed Computing, 25:297–311, 2012.
[CGMF03]
Richard Castanet, Cyril Gavoille, Mohamed Mosbah, and Frédéric Ferchaud. Gestion de flux du traffic aérien en intra et inter réseaux : un modèle de graphes évolutifs. Rapport de contrat (final) marché C20135E/DM/02 - EUROCONTROL, LaBRI, Université Bordeaux 1 - ENSEIRB, November 2003.
[CGMF04]
Richard Castanet, Cyril Gavoille, Mohamed Mosbah, and Frédéric Ferchaud. Utilisation des zones d'absorption pour améliorer la gestion de flux du trafic aérien. Rapport de contrat (intermédiaire) marché C/1.291/CE/NB/03/ - EUROCONTROL - ADERA, LaBRI, Université Bordeaux 1 - ENSEIRB, January 2004.
[CGMS23]
Marcelo Campos, Simon Griffiths, Robert Morris, and Julian Sahasrabudhe. An exponential improvement for diagonal Ramsey. Technical Report 2303.09521 [math.CO], arXiv, March 2023.
[CGMW18]
Hsien-Chih Chang, Paweł Gawrychowski, Shay Mozes, and Oren Weimann. Near-optimal distance emulator for planar graphs. In 26th Annual European Symposium on Algorithms (ESA), volume 112 of LIPIcs, pages 16:1–16:17. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2018.
[CGMW19]
Panagiotis Charalampopoulos, Paweł Gawrychowski, Shay Mozes, and Oren Weimann. Almost optimal distance oracles for planar graphs. In 51st Annual ACM Symposium on Theory of Computing (STOC), pages 138–151. ACM Press, June 2019.
[CGMZ05]
Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. On hierarchical routing in doubling metrics. In 16th Symposium on Discrete Algorithms (SODA), pages 762–771. ACM-SIAM, January 2005.
[CGO07]
Jérémie Chalopin, Daniel Goncalves, and Pascal Ochem. Planar graphs are in 1-STRING. In 18th Symposium on Discrete Algorithms (SODA), pages 609–617. ACM-SIAM, January 2007.
[CGO10]
Jérémie Chalopin, Daniel Goncalves, and Pascal Ochem. Planar graphs have 1-string representations. Discrete & Computational Geometry, 43(3):626–647, April 2010.
[CGP12]
Shiri Chechik, Quentin Godfroy, and David Peleg. Multipath spanners via fault-tolerant spanners. In Design and Analysis of Algorithms - 1st Mediterranean Conference on Algorithms (MEDALG), volume 7659 of Lecture Notes in Computer Science, pages 108–119. Springer, December 2012.
[CGP76]
Fan R.K. Chung, Ronald Lewis Graham, and Nicholas Pippenger. On graphs which contain all small trees II. In Colloquia Mathematica Societatis János Bolyai, 18 Combinatorics, pages 213–223, 1976.
[CGR14]
Elad Cohen, Martin Charles Golumbic, and Bernard Ries. Characterizations of cographs as intersection graphs of paths on a grid. Discrete Applied Mathematics, 178:46–57, December 2014.
[CGR16]
Massimo Cairo, Roberto Grossi, and Romeo Rizzi. New bounds for approximating extremal distances in undirected graphs. In 27th Symposium on Discrete Algorithms (SODA), pages 363–376. ACM-SIAM, January 2016.
[CGS81]
Fan R.K. Chung, Ronald Lewis Graham, and James B. Shearer. Note: Universal caterpillars. Journal of Combinatorial Theory, Series B, 31(3):348–355, December 1981.
[CGT08]
Hubert T.-H. Chan, Anupam Gupta, and Kunal Talwar. Ultra-low-dimensional embeddings for doubling metrics. In 19th Symposium on Discrete Algorithms (SODA), pages 333–342. ACM-SIAM, January 2008.
[CGV98]
Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems on circulant graphs. Linear Algebra and its Applications, 285(1-3):123–142, 1998.
[CH05]
Richard Cole and Ramesh Hariharan. Dynamic LCA queries on trees. SIAM Journal on Computing, 34(4):894–923, 2005.
[CH06]
Andrzej Czygrinow, Michał Hańćkowiak, and Edyta Szymańska. Distributed almost exact approximations for minor-closed families. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 244–255. Springer, September 2006.
[CH67]
Gary Chartrand and Frank Harary. Planar permutation graphs. Annales de l'Institut Henri Poincaré Probabilité et Statistiques, B3(4):433–438, 1967.
[Chak93]
Sreejit Chakravarty. A characterization of binary decision diagrams. IEEE Transactions on Computers, 42(2):129–137, February 1993.
[Chan05]
Timothy M. Chan. All-pairs shortest paths with real weights in O(n3/logn) time. In 9th International Workshop on Algorithms and Data Structures (WADS), volume 3608 of Lecture Notes in Computer Science, page 318. Springer, August 2005.
[Chan06]
Timothy M. Chan. All-pairs shortest paths for unweighted undirected graphs in o(mn) time. In 17th Symposium on Discrete Algorithms (SODA), pages 514–523. ACM-SIAM, January 2006.
[Chan07]
Timothy M. Chan. More algorithms for all-pairs shortest paths in weighted graphs. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 590–598. ACM Press, June 2007.
[Chan18]
Timothy M. Chan. Tree drawings revisited. In Bettina Speckmann and Csaba D. Tóth, editors, 34th International Symposium on Computational Geometry (SoCG), volume 99 of LIPIcs, pages 23:1–23:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2018.
[Chan18a]
Timothy M. Chan. More logarithmic-factor speedups for 3SUM, (median,+)-convolution, and some geometric 3SUM-hard problems. In 29th Symposium on Discrete Algorithms (SODA), pages 881–897. ACM-SIAM, 2018.
[Chan21]
Timothy M. Chan. (near-)linear-time randomized algorithms for row minima in Monge partial matrices and related problems. In 32nd Symposium on Discrete Algorithms (SODA), pages 1465–1482. ACM-SIAM, January 2021.
[Chan97]
Timothy M. Chan. Approximate nearest neighbor queries revisited. In 13th Annual ACM Symposium on Computational Geometry (SoCG), pages 352–358. ACM, June 1997.
[Chandoo18]
Maurice Chandoo. A complexity theory for labeling schemes. Technical Report 1802.02819v1 [cs.CC], arXiv, February 2018.
[Chang23]
Yi-Jun Chang. Ortho-radial drawing in near-linear time. Technical Report 2305.00425v1 [cs.CG], arXiv, April 2023.
[Chang23a]
Yi-Jun Chang. Efficient distributed decomposition and routing algorithms in minor-free networks and their applications. Technical Report 2304.04699v1 [cs.DS], arXiv, April 2023.
[Chang23b]
Yi-Jun Chang. The distributed complexity of locally checkable labeling problems beyond paths and trees. Technical Report 2311.06726v1 [cs.DC], arXiv, November 2023.
[Chang98]
Maw-Shang Chang. Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM Journal on Computing, 27(6):1671–1694, 1998.
[Chapelle11]
Mathieu Chapelle. Décomposition de graphes: quelques limites et obstructions. PhD thesis, Université d'Orléans, Orléans, France, December 2011.
[Chazelle00]
Bernard Chazelle. A minimum spanning tree algorithm with inverse-Ackermann type complexity. Journal of the ACM, 46(6):1028–1047, November 2000.
[Chazelle97]
Bernard Chazelle. A faster deterministic algorithm for minimum spanning trees. In 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 22–31. IEEE Computer Society Press, October 1997.
[Chechik11]
Shiri Chechik. Fault-tolerant compact routing schemes for general graphs. In 38th International Colloquium on Automata, Languages and Programming (ICALP), volume 6756 of Lecture Notes in Computer Science (ARCoSS), pages 101–112. Springer, July 2011.
[Chechik12]
Shiri Chechik. Improved distance oracles and spanners for vertex-labeled graphs. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 325–336. Springer-Verlag, September 2012.
[Chechik13]
Shiri Chechik. New additive spanners. In 24th Symposium on Discrete Algorithms (SODA), pages 498–512. ACM-SIAM, January 2013.
[Chechik13a]
Shiri Chechik. Compact routing schemes with improved stretch. In 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 33–41. ACM Press, July 2013.
[Chechik14]
Shiri Chechik. Approximate distance oracles with constant query time. In 46th Annual ACM Symposium on Theory of Computing (STOC), pages 654–663. ACM Press, May 2014.
[Chen03]
Chiuyuan Chen. Any maximal planar graph with only one separating triangle is hamiltonian. Journal of Combinatorial Optimization, 7:79–86, March 2003.
[Chen07]
Yangjun Chen. Decomposing DAGs into disjoint chains. In 18th International Conference on Database and Expert Systems Applications (DEXA), volume 4653 of Lecture Notes in Computer Science, pages 243–253. Springer-Verlag, September 2007.
[Chew86]
L. Paul Chew. There is a planar graph almost as good as the complete graph. In 2nd Annual ACM Symposium on Computational Geometry (SoCG), pages 169–177. ACM, August 1986.
[Chew89]
L. Paul Chew. There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences, 39(2):205–219, October 1989.
[Cheze18]
Guillaume Chèze. Decathlon rules: an axiomatic approach. Technical Report hal-01878066v2 [math/math.GM], HAL, November 2018.
[CHFGx21]
Keren Censor-Hillel, Pierre Fraigniaud, Cyril Gavoille, Seth Gilbert, Andrzej Pelc, and David Peleg. 2021 Edsger W. Dijkstra prize in distributed computing. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, 40th Annual ACM Symposium on Principles of Distributed Computing (PODC), page 1. ACM Press, July 2021.
[Chini08]
Ehsan Chiniforooshan. A better bound for the cop number of general graphs. Journal of Graph Theory, 58(1):45–48, 2008.
[CHK15]
Jean Cardinal, Michael Hoffmann, and Vincent Kusters. On universal point sets for planar graphs. Journal of Graph Algorithms and Applications, 19(1):529–547, 2015.
[CHKMW21]
Sunil Chebolu, Andrew Hatfield, Riley Klette, Christopher Moore, and Elizabeth Warden. Trigonometric functions in the p-norm. Technical Report 2109.14036v1 [math.CA], arXiv, September 2021.
[CHKPY16]
Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, and Amir Yehudayoff. Distributed construction of purely additive spanners. In 30th International Symposium on Distributed Computing (DISC), volume 9888 of Lecture Notes in Computer Science (ARCoSS), pages 129–142. Springer, September 2016.
[CHKR06]
Moses Charikar, MohammadTaghi Hajiaghayi, Howard J. Karloff, and Satish B. Rao. ℓ22 spreading metrics for vertex ordering problems. In 17th Symposium on Discrete Algorithms (SODA), pages 1018–1027. ACM-SIAM, January 2006.
[CHKZ02]
Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In 13th Symposium on Discrete Algorithms (SODA), pages 937–946. ACM-SIAM, January 2002.
[CHKZ03]
Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. SIAM Journal on Computing, 32(5):1338–1355, 2003.
[CHL23]
Yi-Jun Chang, Oren Hecht, and Dean Leitersdorf. Universally optimal deterministic broadcasting in the HYBRID distributed model. Technical Report 2304.06317v1 [cs.DS], arXiv, April 2023.
[Chlebikova07]
Janka Chlebíková. A characterization of some graph classes using excluded minors. Periodica Mathematica Hungarica, 55(1):1–9, September 2007.
[CHLPU18]
Yi-Jun Chang, Qizheng He, Wenzheng Li, Seth Pettie, and Jara Uitto. The complexity of distributed edge coloring with small palettes. In 29th Symposium on Discrete Algorithms (SODA), pages 2633–2652. ACM-SIAM, January 2018.
[CHLRR00]
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, and Udi Rotics. Polynomial time recognition algorithm of clique-width ≤ 3 graphs. In 4th Latin American Symposium on Theoretical Informatics (LATIN), volume 1776 of Lecture Notes in Computer Science, pages 126–134, April 2000.
[CHLV22]
Keren Censor-Hillel, Dean Leitersdorf, and David Vulakh. Deterministic near-optimal distributed listing of cliques. In Alessia Milani and Philipp Woelfel, editors, 41st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 271–280. ACM Press, February 2022.
[CHLV24]
Keren Censor-Hillel, Dean Leitersdorf, and David Vulakh. Deterministic near-optimal distributed listing of cliques. Distributed Computing, 37:363–385, 2024.
[CHMNx99]
Jin-Yi Cai, George Havas, Bernard Mans, Ajay Nerurkar, Jean-Pierre Seifert, and Igor Shparlinski. On routing in circulant graphs. In 5th Annual International Computing & Combinatorics Conference (COCOON), volume 1627 of Lecture Notes in Computer Science, pages 360–369. Springer, July 1999.
[CHNR99]
Yves Caseau, Michel Habib, Lhouari Nourine, and Olivier Raynaud. Encoding of multiple inheritance hierarchies and partial orders. Computational Intelligence, 15(1):50–62, 1999.
[CHPKK13]
Otfried Cheong, Sariel Har-Peled, Heuna Kim, and Hyo-Sil Kim. On the number of edges of fan-crossing free graphs. Technical Report 1311.1976v1 [cs.CG], arXiv, November 2013.
[Christofides76]
Nicos Christofides. Worst-case analysis of a new heuristic for the travelling salesman problem. Management Science Research Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, February 1976.
[CHS06]
Andrzej Czygrinow, Michał Hańćkowiak, and Edyta Szymanska. Distributed approximation algorithms for planar graphs. In 6th Italian Conference on Algorithms and Complexity (CIAC), volume 3998 of Lecture Notes in Computer Science, pages 296–307. Springer, May 2006.
[CHS07]
David Coudert, Florian Huc, and Jean-Sébastien Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, 55(1):27–41, May 2007.
[CHSH69]
John F. Clauser, Michael A. Horne, Abner Shimony, and Richard A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23:880–883, October 1969.
[Chudnovsky14]
Maria Chudnovsky. The Erdős-Hajnal Conjecture -- A survey. Journal of Graph Theory, 75(2):178–190, February 2014.
[Chudnovsky82]
Gregory V. Chudnovsky. Hermite-Padé approximations to exponential functions and elementary estimates of the measure of irrationality of 𝜋. In David V. Chudnovsky and Gregory V. Chudnovsky, editors, The Riemann Problem, Complete Integrability and Arithmetic Applications, volume 5218 of Lecture Notes in Mathematics, pages 299–322. Springer, 1982.
[Chung90]
Fan R.K. Chung. Universal graphs and induced-universal graphs. Journal of Graph Theory, 14(4):443–454, September 1990.
[Chvatal79]
Vašek Chvátal. A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4(3):233–235, August 1979.
[Chvatal83]
Vašek Chvátal. Linear programming. W.H. Freeman, 1983.
[Chvatal83a]
Vašek Chvátal. Mastermind. Combinatorica, 25(3-4):325–329, 1983.
[CHW08]
Andrzej Czygrinow, Michał Hańćkowiak, and Wojciech Wawrzyniak. Distributed packing in planar graphs. In 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 55–61. ACM Press, June 2008.
[CHW08a]
Andrzej Czygrinow, Michał Hańćkowiak, and Wojciech Wawrzyniak. Fast distributed approximations in planar graphs. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 78–92. Springer, September 2008.
[CHW18]
Andrzej Czygrinow, Michał Hańćkowiak, and Wojciech Wawrzyniak. Distributed approximation algorithms for the minimum dominating set in Kh-minor-free graphs. In 29th International Symposium on Algorithms and Computation (ISAAC), volume 123 of LIPIcs, pages 22:1–22:12. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2018.
[CHWW19]
Andrzej Czygrinow, Michał Hańćkowiak, Wojciech Wawrzyniak, and Marcin Witkowski. Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. Theoretical Computer Science, 757:1–10, January 2019.
[CHWWx13]
James Cheng, Silu Huang, Huanhuan Wu, and Ada Wai-Chee Fu. TF-label: a topological-folding labeling scheme for reachability querying in a large graph. In ACM International Conference on Management of Data (SIGMOD), pages 193–204. ACM Press, June 2013.
[Cieslik01]
Dietmar Cieslik. The Steiner ratio, volume 10 of Combinatorial Optimization. Kluwer Academic Publishers, 2001.
[Cieslik12]
Dietmar Cieslik. The Steiner ratio of metric spaces. Technical report, University of Greifswald, 2012.
[CIQC02]
Krishnendu Chakrabarty, S. Sitharama Iyengar, Hairong Qi, and Eungchun Cho. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers, 51(12):1448–1453, December 2002.
[Cirelson80]
B.S. Cirel'son. Quantum generalizations of Bell's inequality. Letters in Mathematical Physics, 4(2):93–100, March 1980.
[CIW14]
Danny Ziyi Chen, Rajasekhar Inkulu, and Haitao Wang. Two-point L1 shortest path queries in the plane. In 30th Annual ACM Symposium on Computational Geometry (SoCG), pages 406–415. ACM, June 2014.
[CJMM24]
Debsoumya Chakraborti, Oliver Janzer, Abhishek Methuku, and Richard Montgomery. Regular subgraphs at every density. Technical Report 2411.11785v1 [math.CO], arXiv, November 2024.
[CK01]
Punit Chandra and Ajay Kshemkalyani. Compact routing in directed networks with stretch factor of two. In 8th International Conference on High Performance Computing (HiPC), pages 24–35. Springer, December 2001.
[CK06]
John H. Conway and Simon Kochen. The free will theorem. Foundations of Physics, 36(10):1441–1473, 2006.
[CK10]
Bob Coecke and Aleks Kissinger. The compositional structure of multipartite quantum entanglement. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6199 of Lecture Notes in Computer Science (ARCoSS), pages 297–308. Springer, July 2010.
[CK10a]
Alejandro Cornejo and Fabian Kuhn. Deploying wireless networks with beeps. In 24th International Symposium on Distributed Computing (DISC), volume 6343 of Lecture Notes in Computer Science, pages 148–162. Springer, September 2010.
[CK69]
Gary Chartrand and S.F. Kapoor. The cube of every connected graph is 1-Hamiltonian. Journal of Research of the National Bureau of Standards -- B. Mathematical Sciences, 73B:48, March 1969.
[CK89]
Marek Chrobak and Howard J. Karloff. A lower bound on the size of universal sets for planar graphs. ACM SIGACT News, 20(4):83–86, November 1989.
[CK99]
Michael R. Capalbo and S. Rao Kosaraju. Small universal graphs. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 741–749. ACM Press, 1999.
[CKLLW17]
Steven Chaplick, Myroslav Kryven, Giuseppe Liotta, Andre Löffler, and Alexander Wolff. Beyond outerplanarity. In Frati Fabrizio and Ma Kwan-Liu, editors, 25th International Symposium on Graph Drawing and Network Visualization (GD), volume 10692 of Lecture Notes in Computer Science, pages 546–559. Springer, September 2017.
[CKLPx22]
Li Chen, Rasmus Kyng, Yang P. Liu, Richard Peng, Maximilian Probst Gutenberg, and Sushant Sachdeva. Maximum flow and minimum-cost flow in almost-linear time. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 612–623. IEEE Computer Society Press, October 2022.
[CKM02]
Edith Cohen, Haim Kaplan, and Tova Milo. Labeling dynamic XML trees. In 21st ACM Symposium on Principles of Database Systems (PODS), pages 271–281. ACM-SIAM, 2002.
[CKM79]
Joel E. Cohen, Janós Komlós, and Thomas Mueller. The probability of an interval graph and why it matters. In D.K. Ray-Chaudhuri, editor, Proceedings Symposia in Pure Mathematics, volume 34 of Relations Combinatorics and Other Parts of Mathematics, pages 97–115. American Mathematical Society, 1979.
[CKMP90]
Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Greedy packet scheduling. In G. Goos, J. Hartmauis, Jan van Leeuwen, and Nicola Santoro, editors, 4th International Workshop on Distributed Algorithms (WDAG), volume 486 of Lecture Notes in Computer Science, pages 169–184, September 1990.
[CKMP95]
Israel Cidon, Shay Kutten, Yishay Mansour, and David Peleg. Greedy packet scheduling. SIAM Journal on Computing, 24(1):148–157, February 1995.
[CKNOS95]
Derek G. Corneil, Hiryoung Kim, Sridhar Natarajan, Stephan Olariu, and Alan P. Sprague. Simple linear time algorithm of unit interval graphs. Information Processing Letters, 55(2):99–104, July 1995.
[CKP16]
Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. An exponential separation between randomized and deterministic complexity in the LOCAL model. In 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 615–624. IEEE Computer Society Press, October 2016.
[CKS03]
L. Sunil Chandran, Telikepalli Kavitha, and C.R. Subramanian. Isoperimetric inequalities and the width parameters of graphs. In 9th Annual International Computing & Combinatorics Conference (COCOON), volume 2697 of Lecture Notes in Computer Science, pages 385–393. Springer, July 2003.
[CKS09]
Bogdan Chlebus, Dariusz R. Kowalski, and Michał Strojnowski. Fast scalable deterministic consensus for crash failures. In 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 111–120. ACM Press, August 2009.
[CKT99]
Barun Chandra, Howard J. Karloff, and Craig A. Tovey. New results on the old k-Opt algorithm for the traveling salesman problem. SIAM Journal on Computing, 28(6):1998–2029, 1999.
[CKX06]
Jianer Chen, Iyad A. Kanj, and Ge Xia. Improved parameterized upper bounds for Vertex Cover. In Rastislav Královič and Paweł Urzyczyn, editors, 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 4162 of Lecture Notes in Computer Science, pages 238–249. Springer, August 2006.
[CKX09]
Shiliang Cui, Iyad A. Kanj, and Ge Xia. On the dilation of Delaunay triangulations of points in convex position. In 21st Canadian Conference on Computational Geometry (CCCG), pages 161–164, August 2009.
[CKX10]
Jianer Chen, Iyad A. Kanj, and Ge Xia. Improved upper bounds for vertex cover. Theoretical Computer Science, 411(40-42):3736–3756, September 2010.
[CKZ05]
Colin Cooper, Ralf Klasing, and Michele Zito. Lower bounds and algorithms for dominating sets in web graphs. Internet Mathematics, 15(3), 2005.
[CL02]
Éric Colin de Verdière and Francis Lazarus. Optimal systems of loops on an orientable surface. In 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 627–636. IEEE Computer Society Press, November 2002.
[CL02a]
Fan R.K. Chung and Linyuan Lu. The average distances in random graphs with given expected degrees. Internet Mathematics, 1:91–114, 2002.
[CL05]
Éric Colin de Verdière and Francis Lazarus. Optimal systems of loops on an orientable surface. Discrete & Computational Geometry, 33(3):507–534, 2005.
[CL20]
Corinna Coupette and Christoph Lenzen. A breezing proof of the KMW bound. Technical Report 2002.06005v4 [cs.DC], arXiv, October 2020.
[CL21]
Yung-Chung Chiu and Hsueh-I Lu. Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths. Technical Report 2109.15268v1 [cs.DS], arXiv, September 2021.
[CL21a]
Shiri Chechik and Gur Lifshitz. Optimal girth approximation for dense directed graphs. In 32nd Symposium on Discrete Algorithms (SODA), pages 290–300. ACM-SIAM, January 2021.
[CL21b]
Corinna Coupette and Christoph Lenzen. A breezing proof of the KMW bound. In Symposium on Simplicity in Algorithms (SOSA), pages 184–195. ACM-SIAM, January 2021.
[CL22]
Hou-Teng Cheong and Hsueh-I Lu. Finding a shortest even hole in polynomial time. Journal of Graph Theory, 99(3):425–434, March 2022.
[Clarkson06]
Kenneth L. Clarkson. Nearest-neighbor searching and metric space dimensions. In G. Shakhnarovich, T. Darrell, and P. Indyk, editors, Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, chapter 2, pages 15–59. MIT Press, Cambridge, 2006.
[CLL01]
Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu. Orderly spanning trees with applications to graph encoding and graph drawing. In 12th Symposium on Discrete Algorithms (SODA), pages 506–515. ACM-SIAM, January 2001.
[CLL05]
Yi-Ting Chiang, Ching-Chi Lin, and Hsueh-I Lu. Orderly spanning trees with applications. SIAM Journal on Computing, 34(4):924–945, 2005.
[CLP17]
Yi-Jun Chang, Wenzheng Li, and Seth Pettie. An optimal distributed (δ+1)-coloring algorithm?Technical Report 1711.01361 [cs.DC], arXiv, November 2017.
[CLP18]
Yi-Jun Chang, Wenzheng Li, and Seth Pettie. An optimal distributed (δ+1)-coloring algorithm?In 50th Annual ACM Symposium on Theory of Computing (STOC), pages 445–456. ACM Press, June 2018.
[CLP20]
Yi-Jun Chang, Wenzheng Li, and Seth Pettie. Distributed (δ+1)-coloring via ultrafast graph shattering. SIAM Journal on Computing, 49(3):497–539, 2020.
[CLPR09]
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. Fault-tolerant spanners for general graphs. In 41st Annual ACM Symposium on Theory of Computing (STOC), pages 435–444. ACM Press, May 2009.
[CLPR10]
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. f-Sensitivity distance oracles and routing schemes. In 18th Annual European Symposium on Algorithms (ESA), volume 6347 of Lecture Notes in Computer Science, pages 84–96. Springer, September 2010.
[CLPR10a]
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. Fault tolerant spanners for general graphs. SIAM Journal on Computing, 39(7):3403–3423, 2010.
[CLPR12]
Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. f-Sensitivity distance oracles and routing schemes. Algorithmica, 63(4):861–882, August 2012.
[CLR18]
Victor D. Chepoi, Arnaud Labourel, and Sébastien Ratel. Distance and routing labeling schemes for cube-free median graphs. Technical Report 1809.10508 [cs.DM], arXiv, September 2018.
[CLR19]
Victor D. Chepoi, Arnaud Labourel, and Sébastien Ratel. Distance labeling schemes for cube-free median graphs. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 138 of LIPIcs, pages 15:1–15:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2019.
[CLR22]
Victor D. Chepoi, Arnaud Labourel, and Sébastien Ratel. Distance labeling schemes for K4-free bridged graphs. Information and Computation, 289(Part A):104959, November 2022.
[CLR87]
Fan R.K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. Embedding graph in books: A layout problem with applications to VLSI design. SIAM Journal on Algebraic and Discrete Methods, 8(1):33–58, January 1987.
[CLRS01]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to algorithms. The MIT Press, 2001.
[CLRS01fr]
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction à l'algorithmique (2e édition). DUNOD, 2001.
[CLRSx14]
Shiri Chechik, Daniel H. Larkin, Liam Roditty, Grant Schoenebeck, Robert Endre Tarjan, and Virginia Vassilevska Williams. Better approximation algorithms for the graph diameter. In 25th Symposium on Discrete Algorithms (SODA), pages 1041–1052. ACM-SIAM, January 2014.
[CLS05]
L. Sunil Chandran, Vadim V. Lozin, and C.R. Subramanian. Graphs of low chordality. Discrete Mathematics & Theoretical Computer Science, 7(1):25–36, January 2005.
[CLS12]
José R. Correa, Omar Larré, and José A. Soto. TSP tours in cubic graphs: Beyond 4/3. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 790–801. Springer-Verlag, September 2012.
[CLSS98]
Danny Ziyi Chen, Der-Tsai Lee, R. Sridhar, and Chandra N. Sekharan. Solving the all-pair shortest path query problem on interval and circular-arc graphs. Networks, 31(4):249–257, July 1998.
[CLT20]
Armando Castañeda, Jonas Lefèvre, and Amitabh Trehan. Fully compact routing schemes in low memory self-healing trees. In 21st International Conference on Distributed Computing and Networking (ICDCN), pages 21:1–21:10. ACM, January 2020.
[CM07]
Sergio Cabello and Bojan Mohar. Finding shortest non-separating and non-contractible cycles for topologically embedded graphs. Discrete & Computational Geometry, 37(2):213–235, 2007.
[CM13]
Richard Cleve and Rajat Mittal. Characterization of binary constraint system games. Technical Report 1209.2729v3 [quant-ph], arXiv, October 2013.
[CM18]
Shiri Chechik and Doron Mukhtar. Optimal distributed coloring algorithms for planar graphs in the LOCAL model. Technical Report 1804.00137v1 [cs.DS], arXiv, March 2018.
[CM19]
Chandra Chekuri and Zihan Tan. Optimal distributed coloring algorithms for planar graphs in the LOCAL model. In 30th Symposium on Discrete Algorithms (SODA), pages 787–804. ACM Press, January 2019.
[CM22]
Mónika Csikós and Nabil H. Mustafa. Algorithms for discrepancy, matchings and approximations: Fast, simple, and practical. Technical Report 2209.01147v1 [cs.DS], arXiv, September 2022.
[CM93]
Bruno Courcelle and Mohamed Mosbah. Monadic second-order evaluations on tree-decomposable graphs. Theoretical Computer Science, 109(1-2):49–82, March 1993.
[CM94]
Bruno Courcelle and Yves Métivier. Coverings and minors: Application to local computations in graphs. European Journal of Combinatorics, 15(2):127–138, March 1994.
[CM96]
David R. Clark and J. Ian Munro. Efficient suffix trees on secondary storage. In 7th Symposium on Discrete Algorithms (SODA), pages 383–391. ACM-SIAM, 1996.
[CM99]
Yi-Jen Chiang and Joseph S.B. Mitchell. Two-point Euclidean shortest path queries in the plane. In 10th Symposium on Discrete Algorithms (SODA), pages 215–224. ACM-SIAM, 1999. Appears also in 14th European Workshop on Computational Geometry 1998.
[CMGLB25]
Tristan Cam, Simon Martiel, Cyril Gavoille, and Yvan Le Borgne. Universal graph theory operations for graph state preparation. In Robert Glück and Robin Kaarsgaard, editors, 17th International Conference on Reversible Computation (RC), volume 15716 of Lecture Notes in Computer Science, pages 54–70. Springer, July 2025.
[CMGLB25a]
Tristan Cam, Simon Martiel, Cyril Gavoille, and Yvan Le Borgne. Universal graph theory operations for graph state preparation. Technical Report hal-05133697, HAL, June 2025.
[CMGLB26a]
Tristan Cam, Simon Martiel, Cyril Gavoille, and Yvan Le Borgne. Entanglement from expansion: High rank-width in deterministic graphs. Technical Report 2606.07110v1 [cs.DM], arXiv, June 2026.
[CMK19]
Mónika Csikós, Nabil H. Mustafa, and Andrey Kupavskii. Tight lower bounds on the VC-dimension of geometric set systems. Journal of Machine Learning Research, 20:1–8, March 2021.
[CMM07]
Moses Charikar, Konstantin Makarychev, and Yury Makarychev. Local global tradeoffs in metric embeddings. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 713–723. IEEE Computer Society Press, October 2007.
[CMNSW07]
Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severin, and Andreas Winter. On the quantum chromatic number of a graph. The Electronic Journal of Combinatorics, 14:#R81, 2007.
[CMRZ19]
Arnaud Casteigts, Yves Métivier, John Michael Robson, and Akka Zemmari. Deterministic leader election takes θ(d + logn) bit rounds. Algorithmica, 81(5):1901–1920, May 2018.
[CMWZZ94]
Boliong Chen, Makoto Matsumoto, Jian Fang Wang, Zhong Fu Zhang, and Jian Xun Zhang. A short proof of Nash-Williams' theorem for arboricity of a graph. Graphs and Combinatorics, 10(1):27–28, 1994.
[CNAO85]
Norishige Chiba, Takao Nishizeki, Shigenobu Abe, and Takao Ozawa. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 30(1):54–76, February 1985.
[CNST24]
Maria Chudnovsky, Sergey Norin, Paul D. Seymour, and Jérémie Turcotte. Cops and robbers on P5-free graphs. SIAM Journal on Discrete Mathematics, 38(1):845–856, 2024.
[CNV14]
Márcia R. Ceriolia, Hugo Nobrega, and Petrucio Viana. Decomposition by maxclique separators. Discrete Mathematics, 337(28):119–126, December 2014.
[CO00]
Bruno Courcelle and Stephan Olariu. Upper bounds to the clique-width of graphs. Discrete Applied Mathematics, 101(1-3):77–114, April 2000.
[CO07]
Maria Chudnovsky and Alexandra Ovetsky. Coloring quasi-line graphs. Journal of Graph Theory, 54(1):41–50, January 2007.
[CO20]
Hsien-Chih Chang and Tim Ophelders. Planar emulators for Monge matrices. In 32nd Canadian Conference on Computational Geometry (CCCG), pages 141–147, August 2020.
[Cohen13]
Jérémy Cohen. Quantum chromatic number and communication. Master thesis (tfe), Écol Centrale de Lyon - The University of Tokyo, September 2013.
[Cohen14]
Edith Cohen. All-distances sketches, revisited: HIP estimators for massive graphs analysis. In 33rd ACM Symposium on Principles of Database Systems (PODS), pages 88–89. ACM-SIAM, June 2014.
[Cohen21]
Gil Cohen. Two-source dispersers for polylogarithmic entropy and improved Ramsey graphs. SIAM Journal on Computing, 50(3):30–67, January 2021.
[Cohen63]
Paul J. Cohen. The independence of the continuum hypothesis. Proceedings of the National Academy of Sciences of the USA (PNAS), 50(6):1143–1148, December 1963.
[Cohen64]
Paul J. Cohen. The independence of the continuum hypothesis, II. Proceedings of the National Academy of Sciences of the USA (PNAS), 51(1):105–110, January 1964.
[Cohen82]
Joel E. Cohen. The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph. Discrete Mathematics, 40(1):21–24, 1982.
[Cohen93]
Henri Cohen. A course in computational algebraic number theory, volume 138 of Graduate Texts in Mathematics. Springer, 1993.
[Cohen98]
Edith Cohen. Fast algorithms for constructing t-spanners and paths with stretch t. SIAM Journal on Computing, 28(1):210–236, 1998.
[Collins17]
Andrew Collins. Graph parameters and the speed of hereditary properties. PhD thesis, University of Warwick, July 2017.
[Combinatorics13]
Spring'13 Combinatorics. Combinatorics for the Spring 2013 semester, 2013.
[Cook11]
William J. Cook. In pursuit of the traveling salesman: Mathematics at the limits of computation. Princeton University Press, 2011.
[Cook19]
William J. Cook. Computing in combinatorial optimization. In Bernhard Steffen and Gerhard Woeginger, editors, Computing and Software Science: State of the Art and Perspectives, volume 10000 of Lecture Notes in Computer Science, pages 27–47. Springer, Cham, 2019.
[Cook71]
Stephen Arthur Cook. The complexity of theorem proving procedures. In 3rd Annual ACM Symposium on Theory of Computing (STOC), pages 151–158. ACM Press, May 1971.
[COS97]
Derek G. Corneil, Stephan Olariu, and Lorna Stewart. Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics, 10(3):399–430, August 1997.
[Coudert01]
David Coudert. Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications. In 3es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 47–53. INRIA, May 2001.
[Courcelle90]
Bruno Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85(1):12–75, March 1990.
[Courcelle92]
Bruno Courcelle. The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues. Informatique théorique et applications, 26(3):257–286, 1992.
[Couturier12]
Jean-Francois Couturier. Algorithmes exacts et exponentiels sur les graphes : énumération, comptage et optimisation. PhD thesis, Université de Lorraine, Metz, France, December 2012.
[Cowen01]
Lenore Jennifer Cowen. Compact routing with minimum stretch. Journal of Algorithms, 38(1):170–183, January 2001.
[Cowen93]
Lenore Jennifer Cowen. On local representations of graphs and networks. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, May 1993.
[Cowen99]
Lenore Jennifer Cowen. Compact routing with minimum stretch. In 10th Symposium on Discrete Algorithms (SODA), pages 255–260. ACM-SIAM, 1999.
[Cowen99a]
Lenore Jennifer Cowen. The compact routing problem: Finding landmarks in graphs. Graph Theory Notes of New York, 37:32–36, 1999.
[CP07]
Timothy M. Chan and Mihai Pǎtrascu. Voronoi diagrams in n · 2O(√lglgn) time. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 31–39. ACM Press, June 2007.
[CP09]
Timothy M. Chan and Mihai Pǎtrascu. Transdichotomous results in computational geometry, I: Point location in sublogarithmic time. SIAM Journal on Computing, 39(2):703–729, June 2009.
[CP10]
Hagai Cohen and Ely Porat. On the hardness of distance oracle for sparse graphs. Technical Report 1006.1117v1 [cs.DS], arXiv, June 2010.
[CP10a]
Timothy M. Chan and Mihai Pǎtrascu. Transdichotomous results in computational geometry, II: Offline search. Technical Report 1010.1948v1 [cs.DS], arXiv, October 2010.
[CP17]
Yi-Jun Chang and Seth Pettie. A time hierarchy theorem for the LOCAL model. In 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 156–167. IEEE Computer Society Press, October 2017.
[CP19]
Yi-Jun Chang and Seth Pettie. A time hierarchy theorem for the LOCAL model. SIAM Journal on Computing, 48(1):33–69, 2019.
[CP25]
Nathan Claudet and Simon Perdrix. Local equivalence of stabilizer states: A graphical characterisation. In Olaf Beyersdorff, Michał Pilipczuk, Elaine Pimentel, and Nguyễn Kim Th&ăacute;ng, editors, 42nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 327 of LIPIcs, pages 27:1–27:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2025.
[CP84]
Dragoš Cvetković and Milenko Petrić. A table of connected graphs on six vertices. Discrete Mathematics, 50:37–49, 1984.
[CP89]
Marek Chrobak and Thomas H. Payne. A linear-time algorithm for drawing a planar graph on a grid. Technical Report UCR-CS-89-1, Dept. of Mathematics and Computer Science, University of California at Riverside, 1989.
[CP95]
Marek Chrobak and Thomas H. Payne. A linear-time algorithm for drawing a planar graph on a grid. Information Processing Letters, 54(4):241–246, May 1995.
[CPGW15]
Toby S. Cubitt, David Perez-Garcia, and Michael M. Wolf. Undecidability of the spectral gap. Nature, 528:207–211, December 2015.
[CPGW20]
Toby S. Cubitt, David Perez-Garcia, and Michael M. Wolf. Undecidability of the spectral gap. Technical Report 1502.04573v4 [quant-ph], arXiv, June 2020.
[CPS14]
Kai-Min Chung, Seth Pettie, and Hsin-Hao Su. Distributed algorithms for the Lovász local lemma and graph coloring. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 134–143. ACM Press, July 2014.
[CPSTY12]
Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, and Carl Yerger. Five-coloring graphs on the Klein bottle. Technical Report 1201.5361v1 [math.CO], arXiv, January 2012.
[CPVGx15]
Łukasz Czekaj, Marcin Pawłowski, Tamas Vértesi, Andrzej Grudka, Michał Horodecki, and Ryszard Horodecki. Quantum advantage for distributed computing without communication. Physical Review A, 92(3):032122, September 2015.
[CR00]
Victor D. Chepoi and Alexis Rollin. Interval routing in some planar networks. Manuscript, 2000.
[CR01]
Victor D. Chepoi and Alexis Rollin. Interval routing in some planar quadrangulations. In 8th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 89–104. Carleton Scientific, June 2001.
[CR85]
Yair Caro and Yehuda Roditty. On the vertex-independence number and star decomposition of graphs. Ars Combinatoria, 20:167–180, 1985.
[CRdGx24]
Xavier Coiteux-Roy, Francesco d'Amore, Rishkesh Gajjala, Fabian Kuhn, Francois Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela. No distributed quantum advantage for approximate graph coloring. In 56th Annual ACM Symposium on Theory of Computing (STOC), pages 1901–1910. ACM Press, June 2024.
[CRS08]
Maria Chudnovsky, Bruce A. Reed, and Paul D. Seymour. The densest graphs with no K2,t minor. In Graph Theory Workshop (Carsten Thomassen's 60th birthday), August 2008.
[CRS11]
Maria Chudnovsky, Bruce A. Reed, and Paul D. Seymour. The edge-density for K2,t minors. Journal of Combinatorial Theory, Series B, 101(1):18–46, January 2011.
[CRS20]
Arnaud Casteigts, Mathieu Raffinot, and Jason Schoeters. VectorTSP: A traveling salesperson problem with racetrack-like acceleration constraints. Technical Report 2006.03666v2 [cs.DS], arXiv, August 2020.
[CRS25]
Arnaud Casteigts, Mathieu Raffinot, and Jason Schoeters. VectorTSP: A traveling salesperson problem with racetrack-like acceleration constraints. Discrete Applied Mathematics, 368:135–152, June 2025.
[CRWR21]
Xavier Coiteux, Elie Wolfe, and Marc-Olivier Renou. No bipartite-nonlocal causal theory can explain Nature's correlations. Technical Report 2105.09381v2 [quant-ph], arXiv, November 2021.
[CS06]
L. Sunil Chandran and Naveen Sivadasan. Geometric representation of graphs in low dimension. In 12th Annual International Computing & Combinatorics Conference (COCOON), volume 4112 of Lecture Notes in Computer Science, pages 398–407. Springer, August 2006.
[CS07]
Gregory Cherlin and Saharon Shelah. Universal graphs with a forbidden subtree. Journal of Combinatorial Theory, Series B, 97(3):293–333, May 2007.
[CS13]
Chandra Chekuri and Anastasios Sidiropoulos. Approximation algorithms for Euler genus and related problems. Technical Report 1304.2416v2 [cs.DS], arXiv, November 2013.
[CS19]
Timothy M. Chan and Dimitrios Skrepetos. Approximate shortest paths and distance oracles in weighted unit-disk graphs. Journal of Computational Geometry, 10(2), 2019.
[CS21]
Julia Chuzhoy and Thatchaphol Saranurak. Deterministic algorithms for decremental shortest paths via layered core decomposition. In 32nd Symposium on Discrete Algorithms (SODA), pages 2478–2496. ACM-SIAM, January 2021.
[CS24]
Giorgos Christodoulou and Alkmini Sgouritsa. An improved upper bound for the universal TSP on the grid. SIAM Journal on Computing, 53(5):838–846, 2024.
[CSS20]
Maria Chudnovsky, Alex Scott, and Paul D. Seymour. Finding a shortest odd hole. Technical Report 2004.11874v1 [math.CO], arXiv, April 2020.
[CSS21]
Yi-Jun Chang, Jan Studeny, and Jukka Suomela. Distributed graph problems through an automata-theoretic lens. In 24th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 12810 of Lecture Notes in Computer Science, pages 31–49. Springer, Cham, June 2021.
[CSSZ07]
Jianer Chen, Songjian Lu, Sing-Hoi Sze, and Fenghui Zhang. Improved algorithms for path, matching, and packing problems. In 18th Symposium on Discrete Algorithms (SODA), pages 298–307. ACM-SIAM, January 2007.
[CST91]
Fan R.K. Chung, Endre Szemerédi, and William T. Trotter. The number of different distances determined by a set of points in the Euclidean plane. Discrete & Computational Geometry, 7(1):1–11, December 1991.
[CSTW09]
Wei Chen, Christian Sommer, Shang-Hua Teng, and Yajun Wang. Compact routing in power-law graphs. In 23rd International Symposium on Distributed Computing (DISC), volume 5805 of Lecture Notes in Computer Science, pages 379–391. Springer, September 2008.
[CSTW12]
Wei Chen, Christian Sommer, Shang-Hua Teng, and Yajun Wang. A compact routing scheme and approximate distance oracle for power-law graphs. ACM Transactions on Algorithms, 9(1):Article No. 4, pp. 1–26, December 2012.
[CT06]
Thomas M. Cover and Joy A. Thomas. Elements of information theory. John Wiley & Sons, 2006.
[CT07]
Bruno Courcelle and David Andrew Twigg. Compact forbidden-set routing. In 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 4393 of Lecture Notes in Computer Science, pages 37–48. Springer, February 2007.
[CT07b]
Thomas M. Cover and Joy A. Thomas. Elements of information theory, August 2007.
[CT09]
Bruno Courcelle and David Andrew Twigg. Constrained-path labellings on graphs of bounded clique-width. Theory of Computing Systems, February 2009.
[CT19]
Chandra Chekuri and Zihan Tan. Towards tight(er) bounds for the excluded grid theorem. In 30th Symposium on Discrete Algorithms (SODA), pages 1445–1464. ACM Press, January 2019.
[CT19a]
Fan R.K. Chung and Robin Thomas. Excluding subdivisions of bounded degree graphs. Journal of Combinatorial Theory, Series B, 134:1–35, January 2019.
[CT21]
Chandra Chekuri and Zihan Tan. Towards tight(er) bounds for the excluded grid theorem. Journal of Combinatorial Theory, Series B, 146:219–265, January 2021.
[CTILO18]
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, and Aurélien Ooms. Subquadratic encodings for point configurations. Technical Report 1801.01767v1 [cs.CG], arXiv, January 2018.
[Cunningham82]
Williams H. Cunningham. Decomposition of directed graphs. SIAM Journal on Algebraic and Discrete Methods, 3(2):214–228, June 1982.
[CV02]
Victor D. Chepoi and Yann Vaxès. Augmenting trees to meet connectivity and diameter constraints. Algorithmica, 33(2):243–262, June 2002.
[CV03]
Bruno Courcelle and Rémi Vanicat. Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics, 131:129–150, September 2003.
[CV03a]
Victor D. Chepoi and Yann Vaxès. On covering bridged plane triangulations with balls. Journal of Graph Theory, 44(1):65–80, 2003.
[CV15]
Karthekeyan Chandrasekaran and Ameya Velingker. Towards constructing Ramanujan graphs using shift lifts. Technical Report 1502.07410v2 [math.CO], arXiv, March 2015.
[CV86]
Richard Cole and Uzi Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32–53, July 1986.
[CV86a]
Richard Cole and Uzi Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In 18th Annual ACM Symposium on Theory of Computing (STOC), pages 206–219. ACM Press, 1986.
[CW00]
Lenore Jennifer Cowen and Christopher Wagner. Compact roundtrip routing in directed networks. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 51–59. ACM Press, July 2000.
[CW01]
Chiuyuan Chen and Kaiping Wu. Disproving a conjecture on planar visibility graphs. Theoretical Computer Science, 255(1-2):659–665, March 2001.
[CW04]
Lenore Jennifer Cowen and Christopher Wagner. Compact roundtrip routing in directed networks. Journal of Algorithms, 50(1):79–95, January 2004.
[CW13]
Timothy M. Chan and Bryan T. Wilkinson. Adaptive and approximate orthogonal range counting. In 24th Symposium on Discrete Algorithms (SODA), pages 241–251. ACM-SIAM, January 2013.
[CW16]
Shiri Chechik and Christian Wulff-Nilsen. Near-optimal light spanners. In 27th Symposium on Discrete Algorithms (SODA), pages 883–892. ACM-SIAM, January 2016.
[CW16a]
Timothy M. Chan and R. Ryan Williams. Deterministic APSP, orthogonal vectors, and more: Quickly derandomizing Razborov-Smolensky. In 27th Symposium on Discrete Algorithms (SODA), pages 1246–1255. ACM-SIAM, January 2016.
[CW77]
J. Lawrence Carter and Mark N. Wegman. Universal hash functions. In 9th Annual ACM Symposium on Theory of Computing (STOC), pages 106–112. ACM Press, May 1977.
[CW79]
J. Lawrence Carter and Mark N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143–154, April 1979.
[CW89]
Bernard Chazelle and Emo Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete & Computational Geometry, 4(5):467–489, October 1989.
[CW90]
Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation, 9(3):251–280, March 1990.
[CWWC10]
An-Chiang Chu, Bang Ye Wu, Hung-Lung Wang, and Kun-Mao Chao. A tight bound on the min-ratio edge-partitioning problem of a tree. Discrete Applied Mathematics, 158(14):1471–1478, July 2010.
[CX00]
Danny Ziyi Chen and Jinhui Xu. Shortest path queries in planar graphs. In 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 469–478. ACM Press, May 2000.
[CXD12]
Chenyu Yan, Yang Xiang, and Feodor F. Dragan. Compact and low delay routing labeling scheme for unit disk graphs. Computational Geometry: Theory and Applications, 45(7), 2012.
[CZ00]
Shiva Chaudhuri and Christos D. Zaroliagis. Shortest paths in digraphs of small treewidth. Part I: Sequential algorithms. Algorithmica, 27(3):212–226, January 2000.
[CZ01]
Edith Cohen and Uri Zwick. All-pairs small-stretch paths. Journal of Algorithms, 38(2):335–353, February 2001.
[CZ04]
Artur Czumaj and Hairong Zhao. Fault-tolerant geometric spanners. Discrete & Computational Geometry, 32(2):207–230, July 2004.
[CZ21]
Shiri Chechik and Tianyi Zhang. Incremental single source shortest paths in sparse digraphs. In 32nd Symposium on Discrete Algorithms (SODA), pages 2463–2477. ACM-SIAM, January 2021.
[CZ23]
Yi-Jun Chang and Zeyong Li. The complexity of distributed approximation of packing and covering integer linear programs. Technical Report 2305.01324v1 [cs.DS], arXiv, May 2023.
[Dah94]
Elias Dahlhaus. Efficient parallel and linear time sequential split decomposition. In 14th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 880 of Lecture Notes in Computer Science, pages 171–180. Springer, December 1994.
[Damaschke91]
Peter Damaschke. Induced subraph isomorphism for cographs is NP-complete. In Rolf H. Möhring, editor, 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 484 of Lecture Notes in Computer Science, pages 72–78. Springer, 1991.
[dAmore25]
Francesco d'Amore. On the limits of distributed quantum computing. Bulletin of the EATCS (The Distributed Computing Column), 145:52–91, February 2025.
[Das19]
Shantanu Das. Graph explorations with mobile agents. In Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro, editors, Distributed Computing by Mobile Entities, volume 11340 of Lecture Notes in Computer Science, chapter 16, pages 403–422. Springer, Cham, 2019.
[Davidson19]
Aharon Davidson. From planck area to graph theory: Topologically distinct black hole microstates. Technical Report 1907.03090v2 [gr-qc], arXiv, September 2019.
[Davidson19a]
Aharon Davison. From planck area to graph theory: Topologically distinct black hole microstates. Physical Review D, 100(8), October 2019.
[DB16]
Thibault Damour and Mathieu Burniat. Le mystère du monde quantique. DARGAUD, 2016.
[DBBDx25]
Karin Dassas, Cyrille Bonamy, Bruno Bzeznik, Romaric David, Emmanuelle Frenoux, Gaël Guennebaud, Anne-Laure Ligozat, Didier Mallarino, and Anne-Cécile Orgerie. Estimer l'impact carbone des activités numériques de l'observatoire de paris. Technical Report hal-00961390, HAL, May 2014.
[dBBKBx18]
Mark T. de Berg, Hans Leo Bodlaender, Sándor Kisfaludi-Bak, and Sudeshna Kolay. An ETH-tight exact algorithm for euclidean TSP. In 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 450–461. IEEE Computer Society Press, October 2018.
[dBBKBx23]
Mark T. de Berg, Hans Leo Bodlaender, Sándor Kisfaludi-Bak, and Sudeshna Kolay. An ETH-tight exact algorithm for euclidean TSP. SIAM Journal on Computing, 52(3):740–760, 2023.
[dBBKMx18]
Mark T. de Berg, Hans Leo Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. In 50th Annual ACM Symposium on Theory of Computing (STOC), pages 574–586. ACM Press, June 2018.
[dBBKMx18a]
Mark T. de Berg, Hans Leo Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. Technical Report 1803.10633v2 [cs.CG], arXiv, April 2018.
[dBBKMx20]
Mark T. de Berg, Hans Leo Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs. SIAM Journal on Computing, 49(6):1041–1427, 2020.
[dBCvKO08]
Mark T. de Berg, Otfried Cheong, Marc J. van Kreveld, and Mark Overmars. Computational geometry. Algorithms and Applications. Springer, 2008.
[dBETT99]
Giuseppe di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph drawing: Algorithms for the visualization of graphs. Prentice Hall, 1999.
[dBF05]
Giuseppe di Battista and Fabrizio Frati. Small area drawings of outerplanar graphs. In 13th International Symposium on Graph Drawing (GD), volume 3843 of Lecture Notes in Computer Science, pages 89–100. Springer, 2005.
[dBF13]
Giuseppe di Battista and Fabrizio Frati. Drawing trees, outerplanar graphs, series-parallel graphs, and planar graphs in a small area. In János Pach, editor, Thirty Essays on Geometric Graph Theory, pages 121–165. Springer, 2013.
[dBF14]
Giuseppe di Battista and Fabrizio Frati. A survey on small-area planar graph drawing. Technical Report 1410.1006v1 [cs.CG], arXiv, October 2014.
[dBKR72]
Nicolaas Govert de Bruijn, Donald Ervin Knuth, and Stephen Oswald Rice. The average height of planted trees, pages 15–22. Academic Press, New-York and London, 1972.
[dBLV98]
Giuseppe di Battista, Giuseppe Liotta, and Francesco Vargiu. Spirality and optimal orthogonal drawings. SIAM Journal on Computing, 27(6):1764–1811, December 1998.
[DBPDx22]
Lucia Draque Penso, Felix Bock, Mitre Dourado, Johannes Pardey, and Dieter Rautenbach. Hardness of relating dissociation, independence, and matchings. In 11th International Colloquium on Graph Theory (ICGT), page Paper No. 34, July 2022.
[DBR21]
Ramkrishma M. Dhaigude, J. Yogesh Bagul, and Vinay M. Raut. Generalized bounds for hyperbolic sine and hyperbolic cosine functions. Tbilisi Mathematical Journal, 14(1):41–47, March 2021.
[DBRT16]
Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Eva Rotenberg, and Mikkel Thorup. The power of two choices with simple tabulation. In 27th Symposium on Discrete Algorithms (SODA), pages 1631–1642. ACM-SIAM, January 2016.
[dBT96]
Giuseppe di Battista and Roberto Tamassia. On-line planarity testing. SIAM Journal on Computing, 25(5):956–997, October 1996.
[dBTT92]
Giuseppe di Battista, Roberto Tamassia, and Ioannis G. Tollis. Area requirementand symmetry display of planar upward drawings. Discrete & Computational Geometry, 7:381–401, April 1992.
[dBvNx10]
Mark T. de Berg, Fred van Nijnatten, René Sitters, Gerhard J. Woeginger, and Alexander Wolff. The traveling salesman problem under squared euclidean distances. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 239–250. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2010.
[DCdS95]
Pallab Dasgupta, Partha Pratim Chakrabarti, and S.C. DeSarkar. A near optimal algorithm for the extended cow-path problem in the presence of relative errors. In 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 1026 of Lecture Notes in Computer Science, pages 22–36. Springer-Verlag, 1995.
[DD14]
Stephane Durocher and Debajyoti Mondal. Drawing planar graphs with reduced height. In 22nd International Symposium on Graph Drawing (GD), volume 8871 of Lecture Notes in Computer Science, pages 392–403. Springer, September 2014.
[DDELW11]
Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, and Andrew Winslow. Algorithms for solving Rubik's cubes. Technical Report 1106.5736v1 [cs.DS], arXiv, June 2011.
[DDGY07]
Yon Dourisboure, Feodor F. Dragan, Cyril Gavoille, and Chenyu Yan. Spanners for bounded tree-length graphs. Theoretical Computer Science, 383(1):34–44, September 2007.
[DDNN23]
Thomas Dissaux, Guillaume Ducoffe, Nicolas Nisse, and Simon Nivelle. Treelength of series-parallel graphs. Discrete Applied Mathematics, 341:16–30, June 2023.
[DDOSx04]
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel Preston Sanders, Bruce A. Reed, Paul D. Seymour, and Dirk Vertigan. Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory, Series B, 91(1):25–41, May 2004.
[DDP12]
Atish Das Sarma, Michael Dinitz, and Gopal Pandurangan. Efficient computation of distance sketches in distributed networks. In 24th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 318–326. ACM Press, June 2012.
[DDUUU10]
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara, Takeaki Uno, and Yushi Uno. UNO is hard, even for a single player. In 5th International Conference Fun with Algorithms (FUN), volume 6099 of Lecture Notes in Computer Science, pages 133–144. Springer, June 2010.
[DdW11]
Andrew Drucker and Ronald de Wolf. Quantum proofs for classical theorems. Number 2 in Graduate Surveys. Theory of Computing Library, March 2011.
[DEGJx20]
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, and Pat Morin. Adjacency labelling for planar graphs (and beyond). In 61st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 577–588. IEEE Computer Society Press, November 2020.
[DEGJx20a]
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, and Pat Morin. Adjacency labelling for planar graphs (and beyond). Technical Report 2003.04280v1 [cs.DS], arXiv, March 2020.
[DEGJx21]
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, and Pat Morin. Adjacency labelling for planar graphs (and beyond). Journal of the ACM, 68(6):Article No. 42, pp. 1–33, December 2021.
[DEGKN12]
Christian A. Duncan, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, and Martin Nöllenburg. Lombardi drawings of graphs. Journal of Graph Algorithms and Applications, 16(1):37–83, 2012.
[DEGKR07]
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, and Günter Rote. On the geometric dilation of closed curves, graphs, and point sets. Computational Geometry: Theory and Applications, 36(1):16–38, January 2007.
[DEJMW20]
Vida Dujmović, David Eppstein, Gwenaël Joret, Pat Morin, and David R. Wood. Minor-closed graph classes with bounded layered pathwidth. SIAM Journal on Discrete Mathematics, 34(3):1693–1709, 2020.
[DEJWW19]
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, and David R. Wood. Planar graphs have bounded nonrepetitive chromatic number. Technical Report 1904.05269v1 [math.CO], arXiv, April 2019.
[DEJWW20]
Vida Dujmović, Louis Esperet, Gwenaël Joret, Bartosz Walczak, and David R. Wood. Planar graphs have bounded nonrepetitive chromatic number. Advances in Combinatorics, 5, 2020.
[Delfosse12]
Nicolas Delfosse. Constructions et performances de codes LDPC quantiques. PhD thesis, Université Bordeaux, Talence, France, December 2012.
[DeMesmay14]
Arnaud de Mesmay. Topics in low-dimensional computational topology. PhD thesis, École Normale Supérieure, Paris, France, July 2014.
[deMontgolfier03]
Fabien de Montgolfier. Décomposition modulaire des graphes. Théorie, extensions et algorithmes. PhD thesis, Université Montpellier II, Montpellier, France, December 2003.
[DEMWW21]
Vida Dujmović, Louis Esperet, Pat Morin, Bartosz Walczak, and David R. Wood. Clustered 3-colouring graphs of bounded degree. Combinatorics, Probability and Computing, pages 1–13, June 2021.
[DEMZ97]
Yefim Dinitz, Tamar Eilam, Shlomo Moran, and Shmuel Zaks. On the totalk-diameter of connection networks. Technical Report CS0895, Technion -- Computer Science Department, Israel, February 1997.
[Depres24]
Hugues Déprés. Twin-width: lower bounds and approximation algorithms. PhD thesis, École Normale Supérieure, Paris, France, June 2024.
[DER18]
Erik D. Demaine, Sarah Eisenstat, and Mikhail Rudoy. Solving the Rubik's cube optimally is NP-complete. In 34th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 96 of LIPIcs, pages 24:1–24:13. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2018.
[Derbel06]
Bilel Derbel. Local aspects in distributed algorithms. PhD thesis, Université Bordeaux 1, Talence, France, December 2006.
[DES08]
Yefim Dinitz, Michael Elkin, and Shay Solomon. Shallow-low-light trees, and tight lower bounds for Euclidean spanners. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 519–528. IEEE Computer Society Press, October 2008.
[Deutsch85]
David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London, A400:97–117, 1985.
[DEW15]
Vida Dujmović, David Eppstein, and David R. Wood. Genus, treewidth, and local crossing number. In 23rd International Symposium on Graph Drawing and Network Visualization (GD), volume 9411 of Lecture Notes in Computer Science, pages 87–98. Springer, September 2015.
[DF05]
Geir Dahl and Truis Flatberg. A remark concerning graphical sequences. Discrete Mathematics, 304(1-3):62–64, November 2005.
[DF13]
Rodney G. Downey and Michael R. Fellows. Fundamentals of parameterized complexity. Springer, 2013.
[DF86]
Martin E. Dyer and Alan M. Frieze. Planar 3DM is NP-complete. Journal of Algorithms, 7(2):174–184, June 1986.
[DF99]
Rodney G. Downey and Michael R. Fellows. Parameterized complexity. Monographs in Computer Science. Springer, 1999.
[DFG06]
Erik D. Demaine, Sándor P. Fekete, and Shmuel Gal. Online searching with turn cost. Theoretical Computer Science, 361(2-3):342–355, September 2006.
[DFGM04]
Vu Duong, Frédéric Ferchaud, Cyril Gavoille, and Mohamed Mosbah. A new slot allocation for ATFM. In 7th IEEE International Conference on Intelligent Transportation Systems (ITSC), pages 1075–1079, October 2004.
[DFHT04]
Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and h-minor-free graphs. In 15th Symposium on Discrete Algorithms (SODA), pages 823–832. ACM-SIAM, January 2004.
[DFHT05]
Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM, 52(6):866–893, November 2005.
[DFHT05a]
Erik D. Demaine, Fedor V. Fomin, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms, 1(1):33–47, July 2005.
[DFKP04]
Krzysztof Diks, Pierre Fraigniaud, Evangelos Kranakis, and Andrzej Pelc. Tree exploration with little memory. Journal of Algorithms, 51(1):38–64, April 2004.
[DFL93]
Frédéric Desprez, Eric Fleury, and Michel Loi. T9000 et C104 : La nouvelle génération de transputers. Research Report 93-01, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, February 1993.
[DFLRS10]
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, and Saket Saurabh. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 251–262. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2010.
[dFOR94]
Hubert de Fraysseix, Patrice Ossona de Mendez, and Pierre Rosenstiehl. On triangle contact graphs. Combinatorics, Probability and Computing, 3(2):233–246, June 1994.
[dFPP88]
Hubert de Fraysseix, János Pach, and Richard Pollack. Small sets supporting fáry embeddings of planar graphs. In 20th Annual ACM Symposium on Theory of Computing (STOC), pages 426–433. ACM Press, 1988.
[dFPP90]
Hubert de Fraysseix, János Pach, and Richard Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41–51, March 1990.
[DFS87]
David P. Dobkin, Steven J. Friedman, and Kenneth J. Supowit. Delaunay graphs are almost as good as complete graphs. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 20–26. IEEE Computer Society Press, October 1987.
[DFS90]
David P. Dobkin, Steven J. Friedman, and Kenneth J. Supowit. Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry, 5(1):399–407, December 1990.
[DFT07]
Frederic Dorn, Fedor V. Fomin, and Dimitrios M. Thilikos. Subexponential parameterized algorithms. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 15–27. Springer, July 2007.
[DFT08]
Frederic Dorn, Fedor V. Fomin, and Dimitrios M. Thilikos. Catalan structures and dynamic programming in H-minor-free graphs. In 19th Symposium on Discrete Algorithms (SODA), pages 631–640. ACM-SIAM, January 2008.
[DFT12]
Frederic Dorn, Fedor V. Fomin, and Dimitrios M. Thilikos. Catalan structures and dynamic programming in H-minor-free graphs. Journal of Computer and System Sciences, 78(5):1606–1622, September 2012.
[DG01]
Yon Dourisboure and Cyril Gavoille. Interval routing for generalized Hypercube-like graphs. In 3es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 61–68. INRIA, May 2001.
[DG02]
Yon Dourisboure and Cyril Gavoille. Improved compact routing scheme for chordal graphs. In 16th International Symposium on Distributed Computing (DISC), volume 2508 of Lecture Notes in Computer Science, pages 252–264. Springer, October 2002.
[DG02a]
Yon Dourisboure and Cyril Gavoille. Improved compact routing scheme for chordal graphs. Research Report RR-1274-02, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, May 2002.
[DG03]
Yon Dourisboure and Cyril Gavoille. Tree-decomposition of graphs with small diameter bags. In Jiří Fiala, editor, 2nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), pages 100–104, September 2003.
[DG04]
Yon Dourisboure and Cyril Gavoille. Sparse additive spanners for bounded tree-length graphs. In 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 3104 of Lecture Notes in Computer Science, pages 123–137. Springer, June 2004.
[DG04a]
Yon Dourisboure and Cyril Gavoille. Sparse additive spanners for bounded tree-length graphs. Research Report RR-1316-04, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2004.
[DG04b]
Yon Dourisboure and Cyril Gavoille. Small diameter bag tree-decompositions. Research Report RR-1326-04, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, May 2004.
[DG05a]
Moez Draief and Ayalvadi J. Ganesh. Routing in Poisson small-world networks. Technical Report 0508410v1 [math-PR], arXiv, August 2005.
[DG06]
Bilel Derbel and Cyril Gavoille. Fast deterministic distributed algorithms for sparse spanners. In 13th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 4056 of Lecture Notes in Computer Science, pages 100–114. Springer, July 2006.
[DG06a]
Bilel Derbel and Cyril Gavoille. Fast deterministic distributed algorithms for sparse spanners. Research Report RR-1388-06, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2006.
[DG07]
Yon Dourisboure and Cyril Gavoille. Tree-decompositions with bags of small diameter. Discrete Mathematics, 307(16):2008–2029, 2007.
[DG07a]
Youssou Dieng and Cyril Gavoille. Routage dans les graphes cellulaires. In 9es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 91–94, May 2007.
[DG08]
Bilel Derbel and Cyril Gavoille. Fast deterministic distributed algorithms for sparse spanners. Theoretical Computer Science, 399(1-2):83–100, February 2008.
[DG08a]
Youssou Dieng and Cyril Gavoille. La structure des graphes sans mineur K2,4. In 10es Journées Graphes et Algorithmes, November 2008.
[DG09]
Youssou Dieng and Cyril Gavoille. Routage dans les réseaux (k,r)-cellulaires. In 10es Journées Doctorales en Informatique et Réseaux (JDIR), pages 7–12, February 2009.
[DG09a]
Émilie Diot and Cyril Gavoille. On the path separability of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 34 of Electronic Notes in Discrete Mathematics, pages 549–552. Elsevier, September 2009.
[DG09b]
Youssou Dieng and Cyril Gavoille. On the tree-width of planar graphs. In European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 34 of Electronic Notes in Discrete Mathematics, pages 593–596. Elsevier, September 2009.
[DG10]
Émilie Diot and Cyril Gavoille. Path separability of graphs. In 4th International Frontiers of Algorithmics Workshop (FAW), volume 6213 of Lecture Notes in Computer Science, pages 262–273. Springer, August 2010.
[DG10a]
Émilie Diot and Cyril Gavoille. Path separability of graphs. Technical Report hal-00507833, HAL, September 2010.
[DG10b]
Émilie Diot and Cyril Gavoille. La hiérarchie des graphes k-chemin séparables. In 12es Journées Graphes et Algorithmes, page 7, November 2010.
[DG11]
Youssou Dieng and Cyril Gavoille. Routage compact optimal dans les (k,r)-constellations. Technique et Science Informatiques, 30(5):485–513, May 2011.
[DG16]
Adrian Dumitrescu and Anirban Ghosh. Lower bounds on the dilation of plane spanners. Technical Report 1509.07181v4 [cs.CG], arXiv, April 2016.
[DG16a]
Adrian Dumitrescu and Anirban Ghosh. Lower bounds on the dilation of plane spanners. In 2nd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), volume 9602 of Lecture Notes in Computer Science, pages 139–151. Springer-Verlag, February 2016.
[DG16b]
Adrian Dumitrescu and Anirban Ghosh. Lattice spanners of low degree. In 2nd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), volume 9602 of Lecture Notes in Computer Science, pages 152–163. Springer-Verlag, February 2016.
[DG16c]
Adrian Dumitrescu and Anirban Ghosh. Lower bounds on the dilation of plane spanners. International Journal of Computational Geometry and Applications, 26(2):89–110, 2016.
[DG20]
Youssou Dieng and Cyril Gavoille. On the treewidth of planar minor free graphs. In Jessica P.R. Thorn, Assane Gueye, and Adam P. Hejnowicz, editors, 4th EAI International Conference on Innovations and Interdisciplinary Solutions for Underserved Areas (InterSol), volume 321 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, pages 238–250. Springer, Cham, March 2020.
[DG95]
Gautam Das and Michael T. Goodrich. On the complexity of approximating and illuminating three-dimensional convex polyhedra. In 4th International Workshop on Algorithms and Data Structures (WADS), volume 955 of Lecture Notes in Computer Science, pages 74–85. Springer, August 1995.
[dGDLW03]
Emilio di Giacomo, Walter Didimo, and Stephen K. Wismath. Drawing planar graphs on a curve. In 29th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2880 of Lecture Notes in Computer Science, pages 192–204. Springer-Verlag, June 2003.
[DGGLW93]
Ding-Zhu Du, Biao Gao, Ronald Lewis Graham, Zi-Cheng Liu, and Peng-Jun Wan. Minimum Steiner trees in normed planes. Discrete & Computational Geometry, 9:351–370, April 1993.
[DGI22]
Michal Dory, Mohsen Ghaffari, and Saeed Ilchi. Near-optimal distributed dominating set in bounded arboricity graphs. In 41st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 292–300. ACM Press, July 2022.
[DGJ20]
Maciej Duleba, Paweł Gawrychowski, and Wojciech Janczewski. Efficient labeling for reachability in digraphs. In 31st Annual International Symposium on Algorithms and Computation (ISAAC), volume 181 of LIPIcs, pages 27:1–27:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[DGJMx26]
Vida Dujmović, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin, and David R. Wood. Adjacency labelling for proper minor-closed graph classes. Technical Report 2605.06616v3 [cs.DM], arXiv, July 2026.
[DGJP93]
Frédéric Desprez, Cyril Gavoille, Bruno Jargot, and Makan Pourzandi. Tests des performances des communications de la machine Volvox IS-860. Technical Report 93-02, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, March 1993.
[DGJP93a]
Frédéric Desprez, Cyril Gavoille, Bruno Jargot, and Makan Pourzandi. Tests des performances des communications de la machine Volvox IS-860. La lettre du Transputer et des Calculateurs Parallèles, 19:11–35, October 1993.
[DGK07]
Anuj Dawar, Martin Grohe, and Stephan Kreutzer. Locally excluding a minor. In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press, July 2007.
[DGK10]
Christian A. Duncan, Michael T. Goodrich, and Stephen G. Kobourov. Planar drawings of higher-genus graphs. In 18th International Symposium on Graph Drawing (GD), volume 5849 of Lecture Notes in Computer Science, pages 45–56. Springer, September 2010.
[DGKS06]
Anuj Dawar, Martin Grohe, Stephan Kreutzer, and Nicole Schweikardt. Approximation schemes for first-order definable optimisation problems. In 21st Annual IEEE Symposium on Logic in Computer Science (LICS), pages 411–420. IEEE Computer Society Press, August 2006.
[dGLM19]
Emilio di Giacomo, Giuseppe Liotta, and Fabrizio Montecchiani. Sketched representations and orthogonal planarity of bounded treewidth graphs. In 27th International Symposium on Graph Drawing and Network Visualization (GD), volume 11904 of Lecture Notes in Computer Science, pages 379–392. Springer, September 2019.
[DGM09]
Luc Devroye, Joachim Gudmundsson, and Pat Morin. On the expected maximum degree of Gabriel and Yao graphs. Technical Report 0905.3584v1 [cs.CG], arXiv, May 2009.
[DGMSx06]
Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, and Alan Tucker. Polynomial time recognition of unit circular-arc graphs. Journal of Algorithms, 58(1):67–78, January 2006.
[DGO11]
Émilie Diot, Cyril Gavoille, and Pascal Ochem. Sur la difficulté de séparer un graphe par des plus courts chemins. In 13es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume inria-00588312, pages 65–72. HAL, May 2011.
[DGP07]
Bilel Derbel, Cyril Gavoille, and David Peleg. Deterministic distributed construction of linear stretch spanners in polylogarithmic time. In 21st International Symposium on Distributed Computing (DISC), volume 4731 of Lecture Notes in Computer Science, pages 179–192. Springer, September 2007.
[DGP25]
Jiangqi Dai, Mohsen Ghaffari, and Julian Portmann. Constant approximation of arboricity in near-optimal sublinear time. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 552–564. IEEE Computer Society Press, December 2025.
[DGPV08]
Bilel Derbel, Cyril Gavoille, David Peleg, and Laurent Viennot. On the locality of distributed sparse spanner construction. Research Report RR-1441-08, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2008.
[DGPV08a]
Bilel Derbel, Cyril Gavoille, David Peleg, and Laurent Viennot. Construction locale de sous-graphes couvrants peu denses. In 10es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 105–108, May 2008.
[DGPV08b]
Bilel Derbel, Cyril Gavoille, David Peleg, and Laurent Viennot. On the locality of distributed sparse spanner construction. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 273–282. ACM Press, August 2008.
[DGPV09]
Bilel Derbel, Cyril Gavoille, David Peleg, and Laurent Viennot. Local computation of nearly additive spanners. In 23rd International Symposium on Distributed Computing (DISC), volume 5805 of Lecture Notes in Computer Science, pages 176–190. Springer, September 2009.
[DGR06]
Kedar Dhamdhere, Anupam Gupta, and Harald Räcke. Improved embeddings of graph metrics into random trees. In 17th Symposium on Discrete Algorithms (SODA), pages 61–69. ACM-SIAM, January 2006.
[DGR21]
Ran Duan, Yong Gu, and Hanlin Ren. Approximate distance oracles subject to multiple vertex failures. In 32nd Symposium on Discrete Algorithms (SODA), pages 2497–2516. ACM-SIAM, January 2021.
[DGSW14]
Daniel Delling, Andrew V. Goldberg, Ruslan Savchenko, and Renato Foncesa Werneck. Hub labels: Theory and practice. In 13th International Symposium on Experimental Algorithms (SEA), volume 8504 of Lecture Notes in Computer Science, pages 259–270. Springer, June 2014.
[DGT20]
Adrian Dumitrescu, Anirban Ghosh, and Csaba D. Tóth. Sparse hop spanners for unit disk graphs. Technical Report 2002.07840v2 [cs.CG], arXiv, October 2020.
[DGW16]
Daniel Delling, Andrew V. Goldberg, and Renato Foncesa Werneck. Hub labeling (2-hop labeling), pages 1–8. Springer, 2016.
[DH04]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Equivalence of local treewidth and linear local treewidth and its algorithmic applications. In 14th Symposium on Discrete Algorithms (SODA), pages 840–849. ACM-SIAM, January 2004.
[DH04b]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Diameter and treewidth in minor-closed graph families, revisted. Algorithmica, 40(3):211–215, August 2004.
[DH05]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Bidimensionality, map graphs, and grid minors, February 2005.
[DH05a]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In 16th Symposium on Discrete Algorithms (SODA), pages 682–689. ACM-SIAM, January 2005.
[DH07]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Quickly deciding minor-closed parameters in general graphs. European Journal of Combinatorics, 28(1):311–314, January 2007.
[DH08]
Erik D. Demaine and MohammadTaghi Hajiaghayi. Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica, 28(1):19–36, January 2008.
[DH90]
Ding-Zhu Du and Frank K. Hwang. The Steiner ratio conjecture of Gilbert and Pollak is true. Proceedings of the National Academy of Sciences of the USA (PNAS), 87(23):9464–9466, December 1990.
[DH92]
Ding-Zhu Du and Frank K. Hwang. A proof of the Gilbert-Pollak conjecture on the Steiner ratio. Algorithmica, 7(1-6):121–135, 1992.
[DH93]
Gautam Das and Paul J. Heffernan. Constructing degree-3 spanners with other sparseness properties. In 4th Annual International Symposium on Algorithms and Computation (ISAAC), volume 762 of Lecture Notes in Computer Science, pages 11–20. Springer, December 1993.
[DH93a]
Ding-Zhu Du and Frank K. Hwang. Reducing the Steiner problem in a normed space. SIAM Journal on Computing, 21(6):1001–1007, 1993.
[Dhandapani08]
Raghavan Dhandapani. Greedy drawings of triangulations. In 19th Symposium on Discrete Algorithms (SODA), pages 102–111. ACM-SIAM, January 2008.
[Dhandapani10]
Raghavan Dhandapani. Greedy drawings of triangulations. Discrete & Computational Geometry, 43(2):375–392, March 2010.
[DHFRx20]
Edmund Dable-Heath, Christopher J. Fewster, Kasia Rejzner, and Nick Woods. Algebraic classical and quantum field theory on causal sets. Technical Report 1908.01973v3 [math-ph], arXiv, February 2020.
[DHHJx23]
Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, and David R. Wood. The grid-minor theorem revisited. Technical Report 2307.02816v1 [math.CO], arXiv, July 2023.
[DHJ13]
Persi Diaconis, S. Holmes, and Svante Janson. Interval graph limits. Annals of Combinatorics, 17(1):27–52, March 2013.
[DHJLW20]
Zdeněk Dvořák, Tony Huynh, Gwenaël Joret, Chun-Hung Liu, and David R. Wood. Notes on graph product structure theory. Technical Report 2001.08860v1 [math.CO], arXiv, January 2020.
[DHK05]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic Graph Minor Theory: Decomposition, approximation, and coloring. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 637–646. IEEE Computer Society Press, October 2005.
[DHK06]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic Graph Minor Theory: Improved grid minor bounds and Wagner's contraction. In 17th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4288 of Lecture Notes in Computer Science, pages 3–15. Springer, December 2006.
[DHK09]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Approximation algorithms via structural results for apex-minor-free graphs. In 36th International Colloquium on Automata, Languages and Programming (ICALP), volume 5555 of Lecture Notes in Computer Science, pages 316–327. Springer, July 2009.
[DHK09a]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Algorithmic Graph Minor Theory: Improved grid minor bounds and Wagner's contraction. Algorithmica, 54(2):142–180, June 2009.
[DHK11]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Ken-ichi Kawarabayashi. Contraction decomposition in H-minor-free graphs and algorithmic applications. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 441–450. ACM Press, November 2011.
[DHKKx11]
Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. Distributed verification and hardness of distributed approximation. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 363–372. ACM Press, November 2011.
[DHKWY24]
Marc Distel, Kevin Hendrey, Nikolai Karol, David R. Wood, and Jung Hon Yip. Treewidth 2 in the planar graph product structure theorem. Technical Report 2411.00343v1 [math.CO], arXiv, November 2024.
[DHLS04]
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, and Nicolas Schabanel. Could any graph be turned into a small-world?Research Report 2004-62, LIP, École Normale Supérieure de Lyon, December 2004.
[DHLS05]
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, and Nicolas Schabanel. Brief announcement: Could any graph be turned into a small-world?In 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 511–513. Springer, September 2005.
[DHLS06]
Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, and Nicolas Schabanel. Could any graph be turned into a small-world?Theoretical Computer Science, 355(1):96–103, April 2006.
[DHM07]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Bojan Mohar. Approximation algorithms via contraction decomposition. In 18th Symposium on Discrete Algorithms (SODA), pages 278–287. ACM-SIAM, January 2007.
[DHMS15]
Paul Dorbec, Michael A. Henning, Mickael Montassier, and Justin Southey. Independent domination in cubic graphs. Journal of Graph Theory, 80(4):329–349, December 2015.
[DHNRT04]
Erik D. Demaine, MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 69(2):166–195, September 2004.
[DHOW04]
Vladimir G. Deĭneko, Michael Hoffmann, Yoshio Okamoto, and Gerhard J. Woeginger. The traveling salesman problem with few inner points. In 10th Annual International Computing & Combinatorics Conference (COCOON), volume 3106 of Lecture Notes in Computer Science, pages 268–277. Springer, August 2004.
[dHP06]
Ellie D'Hondt and Prakash Panangaden. The computational power of the W and GHZ states. Quantum Information and Computation, 6(2):173–183, March 2006.
[DHPR12]
Anne Driemel, Sariel Har-Peled, and Benjamin Raichel. On the expected complexity of Voronoi diagrams on terrains. In 28th Annual ACM Symposium on Computational Geometry (SoCG), pages 101–110. ACM, June 2012.
[DHT02]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. 1.5-approximation for treewidth of graphs excluding a graph with one crossing as a minor. In 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 2462 of Lecture Notes in Computer Science, pages 67–80. Springer, September 2002.
[DHT05]
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dimitrios M. Thilikos. Exponential speedup in fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors. Algorithmica, 41(4):245–267, February 2005.
[DHV19]
Guillaume Ducoffe, Michel Habib, and Laurent Viennot. Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. Technical Report 1907.04385v2 [cs.DS], arXiv, October 2019.
[DHV20]
Guillaume Ducoffe, Michel Habib, and Laurent Viennot. Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 1905–1922. ACM-SIAM, January 2020.
[DHZ00]
Dorit Dor, Shay Halperin, and Uri Zwick. All-pairs almost shortest paths. SIAM Journal on Computing, 29(5):1740–1759, 2000.
[DI06]
Camil Demetrescu and Giuseppe Francesco Italiano. Experimental analysis of dynamic all pairs shortest path algorithms. ACM Transactions on Algorithms, 2(4):578–601, October 2006.
[Diananda55]
P.H. Diananda. The central limit theorem for m-dependent variables. Mathematical Proceedings of the Cambridge Philosophical Society, 51(1):92–95, January 1955.
[Dieng09]
Youssou Dieng. Décomposition arborescente des graphes planaires et routage compact. PhD thesis, Université Bordeaux 1, Talence, France, October 2009.
[Diestel00]
Reinhard Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, February 2000.
[Diestel05]
Reinhard Diestel. Graph theory, volume 173 of Graduate Texts in Mathematics. Springer, May 2005.
[Dietz96]
Martin Dietzfelbinger. Universal hashing and k-wise independent random variables via integer arithmetic without primes. In Claude Puech and Rüdiger Reischuk, editors, 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1046 of Lecture Notes in Computer Science, pages 567–580. Springer-Verlag, February 1996.
[Dieudonne80]
Jean Dieudonné. Calcul infinitésimal. Méthodes. Hermann, 1980.
[dIF95]
Miriam di Ianni and Michele Flammini. Deadlock-free interval routing schemes, 1995.
[Dijkstra59]
Edsger Wybe Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.
[Dillencourt90]
Michael B. Dillencourt. Toughness and Delaunay triangulations. Discrete & Computational Geometry, 5(1):575–601, December 1990.
[Dillencourt90a]
Michael B. Dillencourt. Realizability of Delaunay triangulations. Information Processing Letters, 33(6):283–287, February 1990.
[Ding17]
Guoli Ding. Graphs without large K2,n-minors. Technical Report 1702.01355v1 [math.CO], arXiv, February 2017.
[Dinitz07]
Michael Dinitz. Compact routing with slack. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 81–88. ACM Press, August 2007.
[Dinitz08]
Michael Dinitz. Online, dynamic, and distributed embeddings of approximate ultrametrics. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 155–162. Springer, September 2008.
[Dinneen97]
Michael J. Dinneen. Practical enumeration methods for graphs of bounded pathwidth and treewidth. CDMTCS Research Report Series CDMTCS-055, Department of Computer Science, University of Auckland, September 1997.
[Diot11]
Émilie Diot. Étude structurelle et algorithmique des graphes pouvant être découpés par des plus courts chemins. PhD thesis, Université Bordeaux 1, Talence, France, December 2011.
[Dirac52]
G.A. Dirac. Some theorems on abstract graphs. Proceedings of the London Mathematical Society, 2(1):69–81, 1952.
[Dissaux23]
Thomas Dissaux. Décomposition de graphes: longueur arborescente et jeux de poursuite. PhD thesis, Université Côte d'Azur, Nice, France, September 2023.
[DJ08]
Persi Diaconis and Svante Janson. Graph limits and exchangeable random graphs. Rendiconti di Matematica e delle sue Applicazioni, Serie VII, 28:33–61, 2008.
[DJGT99]
Reinhard Diestel, Tommy R. Jensen, Konstantin Yu. Gorbunov, and Carsten Thomassen. Highly connected sets and the excluded grid theorem. Journal of Combinatorial Theory, Series B, 75(1):61–73, January 1999.
[Djidjev00]
Hristo N. Djidjev. Computing the girth of a planar graph. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 821–831. Springer, July 2000.
[Djidjev10]
Hristo N. Djidjev. A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Transactions on Algorithms, 7(1):Article No. 3, pp. 1–16, November 2010.
[Djidjev96]
Hristo N. Djidjev. Efficient algorithms for shortest path queries in planar digraphs. In 22nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1197 of Lecture Notes in Computer Science, pages 151–165. Springer, June 1996.
[DJMMW24]
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, and David R. Wood. Planar graphs in blowups of fans. Technical Report 2407.05936v1 [math.CO], arXiv, July 2024.
[DJMMW25]
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, and David R. Wood. Planar graphs in blowups of fans. In 36th Symposium on Discrete Algorithms (SODA), pages 3382–3391. ACM-SIAM, January 2025.
[DJMMx19]
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. Technical Report 1904.04791v2 [cs.DM], arXiv, May 2019.
[DJMMx19a]
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. In 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 862–875. IEEE Computer Society Press, November 2019.
[DJMMx20]
Vida Dujmović, Gwenaël Joret, Piotr Micek, Pat Morin, Torsten Ueckerdt, and David R. Wood. Planar graphs have bounded queue-number. Journal of the ACM, 67(4):Article No. 22, pp. 1–38, 2020.
[DJS05]
Matt DeVos, Thor Johnson, and Paul D. Seymour. Cut coloring and circuit covering, 2005. Preprint.
[DK05]
Reinhard Diestel and Daniela Kühn. Graph minor hiearchies. Discrete Applied Mathematics, 145:167–182, January 2005.
[DK06]
Domingos Dellamonica Jr. and Yoshiharu Kohayakawa. An algorithmic Friedman-Pippenger theorem on tree embeddings and applications to routing. In 17th Symposium on Discrete Algorithms (SODA), pages 1038–1044. ACM-SIAM, January 2006.
[DK07]
Alex P. Dow and Richard E. Korf. Best-first search for treewidth. In 22nd National Conference on Artificial Intelligence (AAAI), volume 2, pages 1146–1151. AAAI Press, July 2007.
[DK11]
Michael Dinitz and Robert Krauthgamer. Fault-tolerant spanners: Better and simpler. Technical Report 1101.5753v1 [cs.DS], arXiv, January 2011.
[DK11a]
Michael Dinitz and Robert Krauthgamer. Fault-tolerant spanners: better and simpler. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 169–178. ACM Press, June 2011.
[DK11b]
Michael Dinitz and Robert Krauthgamer. Directed spanners via flow-based linear programs. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 323–332. ACM Press, June 2011.
[DK99]
Yevgeniy Dodis and Sanjeev Khanna. Designing networks with bounded pairwise distance. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 750–759. ACM Press, 1999.
[DK99a]
Reinhard Diestel and Daniela Kühn. A universal planar graph under the minor relation. Journal of Graph Theory, 32(2):191–206, October 1999.
[DKK13]
Stefan Dobrev, Rastislav Královič, and Richard Královič. Computing with advice: when knowledge helps. Bulletin of the EATCS (The Distributed Computing Column), 110:36–51, June 2013.
[DKKP95]
Shlomi Dolev, Evangelos Kranakis, Danny Krizanc, and David Peleg. Bubbles: Adaptive routing scheme for high-speed dynamic networks. In 27th Annual ACM Symposium on Theory of Computing (STOC), pages 528–537. ACM Press, May 1995.
[DKKP99]
Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, and Andrzej Pelc. The impact of knowledge on broadcasting time in radio networks. In Jaroslav Nešetřil, editor, 7th Annual European Symposium on Algorithms (ESA), volume 1643 of Lecture Notes in Computer Science, pages 41–52. Springer, July 1999.
[DKM18]
Andre Droschinsky, Nils M. Kriege, and Petra Mutzel. Largest weight common subtree embeddings with distance penalties. In Igor Potapov, Paul Spirakis, and James Worrell, editors, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 117 of LIPIcs, pages 54:1–54:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2018.
[DKM19]
Janosch Deurer, Fabian Kuhn, and Yannic Maus. Deterministic distributed dominating set approximation in the CONGEST model. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 94–103. ACM Press, July 2019.
[DKMMx88]
Martin Dietzfelbinger, Anna R. Karlin, Martin Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert Endre Tarjan. Dynamic perfect hashing: upper and lower bounds. In 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 524–531. IEEE Computer Society Press, October 1988.
[DKMMx94]
Martin Dietzfelbinger, Anna R. Karlin, Martin Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert Endre Tarjan. Dynamic perfect hashing: upper and lower bounds. SIAM Journal on Computing, 23(4):738–761, 1994.
[DKMPP22]
Fabien Dufoulon, Shay Kutten, William K. Moses Jr., Gopal Pandurangan, and David Peleg. An almost singularly optimal asynchronous distributed MST algorithm. In Christian Scheideler, editor, 38th International Symposium on Distributed Computing (DISC), volume 246 of LIPIcs, pages 19:1–19:24. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2022.
[DKMW12]
Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, and Paul Wollan. On the excluded minor structure theorem for graphs of large tree-width. Journal of Combinatorial Theory, Series B, 102(6):1189–1210, November 2012.
[DKO14]
Andrew Drucker, Fabian Kuhn, and Rotem Oshman. On the power of the congested clique model. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 367–376. ACM Press, July 2014.
[DKRR08]
Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtěch Rödl, and Andrzej Ruciński. Universality of random graphs. In 19th Symposium on Discrete Algorithms (SODA), pages 782–788. ACM-SIAM, January 2008.
[DKT09]
Zdeněk Dvořák, Daniel Král', and Robin Thomas. Coloring triangle-free graphs on surfaces. In 20th Symposium on Discrete Algorithms (SODA), pages 120–129. ACM-SIAM, January 2009.
[DKT10]
Zdeněk Dvořák, Daniel Král', and Robin Thomas. Deciding first-order properties for sparse graphs. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 133–142. IEEE Computer Society Press, October 2010.
[DKTTZ25]
Dani Dorfman, Haim Kaplan, Robert Endre Tarjan, Mikkel Thorup, and Uri Zwick. Faster all-pairs optimal electric car routing. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 71:1–71:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[DKTZ23]
Dani Dorfman, Haim Kaplan, Robert Endre Tarjan, and Uri Zwick. Optimal energetic paths for electric cars. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 42:1–42:17. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[DKTZ24]
Dani Dorfman, Haim Kaplan, Robert Endre Tarjan, and Uri Zwick. Optimal energetic paths for electric cars. Technical Report 2403.16936v1 [cs.DS], arXiv, March 2024.
[DL02]
Feodor F. Dragan and Irina Lomonosov. New routing schemes for interval graphs, circular-arc graphs, and permutation graphs. In 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), pages 78–83, November 2002.
[DL04]
Feodor F. Dragan and Irina Lomonosov. On compact and efficient routing in certain graph classes. In 15th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3341 of Lecture Notes in Computer Science, pages 402–414. Springer, December 2004.
[DL07]
Feodor F. Dragan and Irina Lomonosov. On compact and efficient routing in certain graph classes. Discrete Applied Mathematics, 155(11):1458–1470, June 2007.
[DL12]
Guoli Ding and Cheng Liu. Excluding a small minor. Discrete Applied Mathematics, 161(3):355–368, February 2012.
[DL17]
Feodor F. Dragan, Ekkehard Köhler, and Arne Leitert. Line-distortion, bandwidth and path-length of a graph. Algorithmica, 77(3):686–713, March 2017.
[DL19]
Guillaume Ducoffe and Arne Leitert. Note: Equivalence between pathbreadth and strong pathbreadth. Discrete Applied Mathematics, 262:185–188, June 2019.
[DL95]
Karol Doliwka and Marek Lassak. On relatively short and long sides of convex pentagons. Geometriae Dedicata, 56:221–224, July 1995.
[DLN20]
Guillaume Ducoffe, Sylvain Legay, and Nicolas Nisse. On the complexity of computing treebreadth. Algorithmica, 82(6):1574–1600, June 2020.
[DLOP20]
Walter Didimo, Giuseppe Liotta, Giacomo Ortali, and Maurizio Patrignani. Optimal orthogonal drawings of planar 3-graphs in linear time. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 806–825. ACM-SIAM, January 2020.
[DLPSW86]
Danny Dolev, Nancy A. Lynch, Shlomit S. Pinter, Eugene W. Stark, and William E. Weihl. Reaching approximate agreement in the presence of faults. Journal of the ACM, 33(3):499–516, July 1986.
[DLR92]
Peter G. Doyle, Jeffrey C. Lagarias, and Dana Randall. Self-packing of centrally symmetric convex bodies in ℝ2. Discrete & Computational Geometry, 8:171–189, 1992.
[DLT94]
Danny Dolev, Frank Thomson Leighton, and Howard W. Trickey. Planar embedding of planar graphs, volume 2, pages 147–161. JAI Press Inc., 1994.
[dlTNP98]
Pilar de la Torre, Lata Narayanan, and David Peleg. Thy neighbor's interval is greener: A proposal for exploiting interval routing schemes. In Luisa Gargano and David Peleg, editors, 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 214–228. Carleton Scientific, June 1998.
[DM08]
Feodor F. Dragan and Martín Matamala. Navigating in a graph by aid of its spanning tree. In 19th Annual International Symposium on Algorithms and Computation (ISAAC), volume 5369 of Lecture Notes in Computer Science, pages 788–799. Springer, December 2008.
[DM15]
Lino Demasi and Bojan Mohar. Four terminal planar Delta-Wye reducibility via rooted K2,4 minors. In 26th Symposium on Discrete Algorithms (SODA), pages 1728–1748. ACM-SIAM, January 2015.
[DM17]
Adrian Dumitrescu and Joseph S.B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. Technical Report 1703.01640v1 [cs.CG], arXiv, March 2017.
[DM41]
B. Dushnik and E.W. Miller. Partially ordered sets. American Journal of Mathematics, 63(3):600–610, July 1941.
[DMN21]
Zdeněk Dvořák, Rose McCarty, and Sergey Norin. Sublinear separators in intersection graphs of convex shapes. SIAM Journal on Discrete Mathematics, 35(2):1149–1164, 2021.
[DMP09]
Mirela Damian, Nawar Molla, and Val Pincu. Spanner properties of 𝜋/2-angle Yao graphs. In 25th European Workshop on Computational Geometry (EuroCG), pages 21–24, March 2009.
[DMP19]
Francois Dross, Mickael Montassier, and Alexandre Pinlou. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discrete Mathematics, 342(4):943–950, April 2019.
[DMPRS03]
Devdatt Dubhashi, Alessandro Mai, Alessandro Panconesi, Jaikumar Radhakrishnan, and Aravind Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In 14th Symposium on Discrete Algorithms (SODA), pages 717–724. ACM-SIAM, January 2003.
[DMPRS05]
Devdatt Dubhashi, Alessandro Mai, Alessandro Panconesi, Jaikumar Radhakrishnan, and Aravind Srinivasan. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. Journal of Computer and System Sciences, 71(4):467–479, November 2005.
[DMS07]
Stefan Dantchev, Dantchev Martin, and Stefan Szeider. Parameterized proof complexity. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 183–193. IEEE Computer Society Press, October 2007.
[DMS97]
Andreas W.M. Dress, Vincent Moulton, and Michael A. Steel. Trees, taxonomy, and strongly compatible multi-state characters. Advances in Applied Mathematics, 19(1):1–30, July 1997.
[DMT96]
Andreas W.M. Dress, Vincent Moulton, and Werner Terhalle. T-theory: An Overview. European Journal of Combinatorics, 17(2-3):161–175, February 1996.
[DMW05]
Vida Dujmović and David R. Wood. Layout of graphs with bounded tree-width. SIAM Journal on Computing, 34(3):553–579, 2005.
[DMW17]
Vida Dujmović, Pat Morin, and David R. Wood. Layered separators in minor-closed families with applications. Journal of Combinatorial Theory, Series B, 127:111–147, November 2017.
[DMW19a]
Vida Dujmović, Pat Morin, and David R. Wood. The structure of k-planar graphs. Technical Report 1907.05168v1 [math.CO], arXiv, July 2019.
[DMZ05]
Bilel Derbel, Mohamed Mosbah, and Akka Zemmari. Fast distributed graph partition and application. Research Report RR-1369-05, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, October 2005.
[DMZ06]
Bilel Derbel, Mohamed Mosbah, and Akka Zemmari. Fast distributed graph partition and application. In 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE Computer Society Press, April 2006.
[DN06]
Christopher M. Dawson and Michael A. Nielsen. The Solovay-Kitaev algorithm. Quantum Information and Computation, 6(1):81–95, March 2006.
[DN14]
Zdeněk Dvořák and Sergey Norin. Treewidth of graphs with balanced separations. Technical Report 1408.3869v1 [math.CO], arXiv, August 2014.
[DN19]
Zdeněk Dvořák and Sergey Norin. Treewidth of graphs with balanced separations. Journal of Combinatorial Theory, Series B, 137:137–144, July 2019.
[DN21]
Zdeněk Dvořák and Sergey Norin. Weak diameter coloring of graphs on surfaces. Technical Report 2111.07147v1 [math.CO], arXiv, November 2021.
[DN22]
Thomas Dissaux and Nicolas Nisse. Pathlength of outerplanar graphs. In 11th International Colloquium on Graph Theory (ICGT), page Paper No. 16, July 2022.
[DN25]
Zdeněk Dvořák and Sergey Norin. Asymptotic dimension of intersection graphs. European Journal of Combinatorics, 123:103631, January 2025.
[DNPT13]
Atish Das Sarma, Danupon Nanongkai, Gopal Pandurangan, and Prasad Tetali. Distributed random walks. Journal of the ACM, 60(1):Article No. 2, pp. 1–31, February 2013.
[Dom07]
Michael Dom. Compact routing. In Algorithms for Sensor and Ad Hoc Networks, volume 4621 of Lecture Notes in Computer Science, chapter 10, pages 187–202. Springer, 2007.
[Dorn06]
Frederic Dorn. Dynamic programming and fast matrix multiplication. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 280–291. Springer, 2006.
[Dorn07]
Frederic Dorn. How to use planarity efficiently: new tree-decomposition based algorithms. In 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 4769 of Lecture Notes in Computer Science, pages 280–291. Springer, 2007.
[Dorn10]
Frederic Dorn. Planar subgraph isomorphism revisited. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 263–274. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2010.
[Dorn10a]
Frederic Dorn. Dynamic programming and planarity: Improved tree-decomposition based algorithms. Discrete Applied Mathematics, 158(7):800–808, April 2010.
[dOSilva23]
Lucas de Oliveira Silva. Freeze-tag is NP-hard in 3D with L1 distance. Technical Report 2301.07757v1 [cs.CG], arXiv, January 2023.
[DOSV00]
Guoli Ding, Bogdan Oporowski, Daniel Preston Sanders, and Dirk Vertigan. Surfaces, tree-width, clique-minors, and partitions. Journal of Combinatorial Theory, Series B, 79(2):221–246, July 2000.
[DOSV98]
Guoli Ding, Bogdan Oporowski, Daniel Preston Sanders, and Dirk Vertigan. Partitioning graphs of bounded tree-width. Combinatorica, 18(1):1–12, January 1998.
[Dourisboure02]
Yon Dourisboure. An additive stretched routing scheme for chordal graphs. In 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2573 of Lecture Notes in Computer Science, pages 150–163. Springer, June 2002.
[Dourisboure03]
Yon Dourisboure. Routage compact et longueur arborescente. PhD thesis, Université Bordeaux 1, Talence, France, December 2003.
[Dourisboure04]
Yon Dourisboure. Compact routing schemes for bounded tree-length graphs and for k-chordal graphs. In 18th International Symposium on Distributed Computing (DISC), volume 3274 of Lecture Notes in Computer Science, pages 365–378. Springer, October 2004.
[Dourisboure05]
Yon Dourisboure. Compact routing schemes for generalised chordal graphs. Journal of Graph Algorithms and Applications, 9(2):277–297, 2005.
[Downey89]
Rodney G. Downey. On ramsey-type theorems and their applications. Mathematical Medley, 17(2):58–78, 1989.
[DP08]
Ran Duan and Seth Pettie. Bounded-leg distance and reachability oracles. In 19th Symposium on Discrete Algorithms (SODA), pages 436–445. ACM-SIAM, January 2008.
[DP08a]
Vasil S. Denchev and Gopal Pandurangan. Distributed quantum computing: A new frontier in distributed systems or science fiction?ACM SIGACT News - Distributed Computing Column, 39(3):77–95, September 2008.
[DP09]
Ran Duan and Seth Pettie. Dual-failure distance and connectivity oracles. In 20th Symposium on Discrete Algorithms (SODA), pages 506–515. ACM-SIAM, January 2009.
[DP09a]
Ross Duncan and Simon Perdrix. Graph states and the necessity of Euler decomposition. In Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe (CiE), volume 5635 of Lecture Notes in Computer Science, pages 167–177. Springer, July 2009.
[DP10]
Ran Duan and Seth Pettie. Connectivity oracles for failure prone graphs. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 465–474. ACM Press, June 2010.
[DP17]
Ran Duan and Seth Pettie. Connectivity oracles for graphs subject to vertex failures. In 28th Symposium on Discrete Algorithms (SODA), pages 490–509. ACM-SIAM, January 2017.
[DP19]
James Davies and Florian Pfender. Edge-maximal graphs on orientable and some non-orientable surfaces. Technical Report 1911.02666v1 [math.CO], arXiv, November 2019.
[DP22]
Michelle Delcourt and Luke Postle. Reducing linear Hadwiger's conjecture to coloring small graphs. Technical Report 2108.01633v3 [math.CO], arXiv, May 2022.
[DP85]
Rina Dechter and Judea Pearl. Generalized best-first search strategies and the optimality of A*. Journal of the ACM, 32(3):505–536, July 1985.
[DPP06]
Mirela Damian, Saurav Pandit, and Sriram V. Pemmaraju. Distributed spanner construction in doubling metric spaces. In 10th International Conference on Principles of Distributed Systems (OPODIS), volume 4305 of Lecture Notes in Computer Science, pages 157–171. Springer, December 2006.
[DPPS01]
Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna. Approximating layout problems on random geometric graphs. Journal of Algorithms, 39(1):78–116, April 2001.
[DPPS99]
Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna. Linear orderings of random geometric graphs. In P. Widmayer and G. Neyer, editors, 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1665 of Lecture Notes in Computer Science, pages 291–302. Springer, June 1999.
[DPPS99a]
Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna. Convergence theorems for some layout measures on random lattice and random geometric graphs, March 1999.
[DPS00]
Josep Díaz, Jordi Petit, and María Serna. A survey on graph layout problems, October 2000.
[DPS02]
Josep Díaz, Jordi Petit, and María Serna. Random scaled sector graphs. Technical Report LSI-02-47-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, June 2002.
[DPS98]
Josep Díaz, Jordi Petit, and María Serna. Random geometric problems on [0,1]2. In Michael Luby, José D.P. Rolim, and María Serna, editors, Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 294–306. Springer, October 1998.
[DPT10]
Yevgeniy Dodis, Mihai Pǎtrascu, and Mikkel Thorup. Changing base without losing space. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 593–602. ACM Press, June 2010.
[DPT20]
Michael Dennis, Ljubomir Perković, and Duru Türkoğlu. The stretch factor of hexagon-Delaunay triangulations. In Sergio Cabello and Danny Z. Chen, editors, 36th International Symposium on Computational Geometry (SoCG), volume 164 of LIPIcs, pages 34:1–34:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2020.
[DPT21]
Michael Dennis, Ljubomir Perković, and Duru Türkoğlu. The stretch factor of hexagon-Delaunay triangulations. Journal of Computational Geometry, 12(2):86–125, 2021.
[DPV06]
Sanjoy Dasgupta, Christos H. Papadimitriou, and Umesh V. Vazirani. Algorithms. McGraw-Hill, 2006.
[DR05]
Reinhard Diestel and Christof Rempel. Dense minors in graphs of large girth. Combinatorica, 25(1):111–116, 2005.
[DR10]
Mirela Damian and Kristin Raudonis. Yao graphs span Theta graphs. In Combinatorial Optimization and Applications (COCOA), volume 6509 of Lecture Notes in Computer Science, pages 181–194. Springer, 2010.
[DR12]
Mirela Damian and Kristin Raudonis. Yao graphs span Theta graphs. Discrete Mathematics, Algorithms and Applications, 4(2):1250024, 2012.
[DR17]
Erik D. Demaine and Mikhail Rudoy. Freeze tag is hard in 3D. In 27th Annual Fall Workshop on Computational Geometry (FWCG), November 2017.
[DR96]
Marc Deléglise and Joël Rivat. Computing 𝜋(x): The Meissel, Lehmer, Lagarias, Miller, Odlyzko method. Mathematics of Computation, 65(213):235–245, January 1996.
[Dragan01]
Feodor F. Dragan. Estimating all pairs shortest paths in restricted graph families: A unified approach. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2204 of Lecture Notes in Computer Science, pages 103–116. Springer, June 2001.
[Dragan05]
Feodor F. Dragan. Estimating all pairs shortest paths in restricted graph families: A unified approach. Journal of Algorithms, 57(1):1–21, September 2005.
[DRP12]
Atish Das Sarma, Anisur Rahaman Molla, and Gopal Pandurangan. Fast distributed computation in dynamic networks via random walks. In 26th International Symposium on Distributed Computing (DISC), volume 7611 of Lecture Notes in Computer Science, pages 136–150. Springer, October 2012.
[DRS07]
Hang Dinh, Alexander Russell, and Yuan Su. On the value of good advice: the complexity of A* search with accurate heuristics. In 22nd National Conference on Artificial Intelligence (AAAI), volume 2, pages 1140–1145. AAAI Press, July 2007.
[DS02]
Charles Delorme and Jinlong Shu. Upper bounds on the length of the longest induced cycle in graphs. Research Report LRI-1321, LRI, Université Paris-Sud, 91405 Orsay cedex, France, 2002.
[DS07]
Krzysztof Diks and Piotr Sankowski. Dynamic plane transitive closure. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 594–604. Springer, October 2007.
[DS11]
Hristo N. Djidjev and Christian Sommer. Approximate distance queries for weighted polyhedral surfaces. In 19th Annual European Symposium on Algorithms (ESA), volume 6942 of Lecture Notes in Computer Science, pages 579–590. Springer-Verlag, September 2011.
[DS14]
Irit Dinur and David Steurer. Analytical approach to parallel repetition. In 46th Annual ACM Symposium on Theory of Computing (STOC), pages 624–633. ACM Press, May 2013.
[DS24]
Sameep Dahal and Jukka Suomela. Distributed half-integral matching and beyond. Theoretical Computer Science, 982:114278, January 2024.
[DS25]
Sahar Diskin and Wojciech Samotij. Isoperimetry in product graphs. The Electronic Journal of Combinatorics, 32(3):#P3.12, 2025.
[DS79]
David P. Dobkin and Lawrence Snyder. On general method for maximizing and minimizing among certain geometric problems. In 20th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 9–17. IEEE Computer Society Press, October 1979.
[DS86]
William J. Dally and Charles L. Seitz. The torus routing chip. Distributed Computing, 1(4):187–196, 1986.
[DS87]
William J. Dally and Charles L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers, C-36(5):547–553, May 1987.
[DS97]
Markus Denny and Christian Sohler. Encoding a triangulation as a permutation of its point set. In 9th Canadian Conference on Computational Geometry (CCCG), pages 39–43, 1997.
[DSMP15]
Atish Das Sarma, Anisur Rahaman Molla, and Gopal Pandurangan. Distributed computation of sparse cuts via random walks. In 16th International Conference on Distributed Computing and Networking (ICDCN), page Article No. 6. ACM, January 2015.
[DT02]
Camil Demetrescu and Mikkel Thorup. Oracles for distances avoiding a link-failure. In 13th Symposium on Discrete Algorithms (SODA), pages 838–843. ACM-SIAM, January 2002.
[DT12]
Adrian Dumitrescu and Csaba Tóth. Covering paths for planar point sets. In Walter Didimo and Maurizio Patrignani, editors, 20th International Symposium on Graph Drawing (GD), volume 7704 of Lecture Notes in Computer Science, pages 303–314. Springer, September 2012.
[DT16]
Zdeněk Dvořák and Robin Thomas. List-coloring apex-minor-free graphs. Technical Report 1401.1399v2 [cs.DM], arXiv, December 2016.
[DT81]
Danny Dolev and Howard W. Trickey. On linear area embedding of planar graphs. Technical Report CS-81-876, Department of Computer Science, Stanford University, September 1981.
[DT99]
Reinhard Diestel and Robin Thomas. Excluding a countable clique. Journal of Combinatorial Theory, Series B, 76(1):41–67, May 1999.
[DTCR08]
Camil Demetrescu, Mikkel Thorup, Rezaul Alam Chowdhury, and Vijaya Ramachandran. Oracles for distances avoiding a failed node or link. SIAM Journal on Computing, 37(5):1299–1318, 2008.
[Duan10]
Ran Duan. New data structures for subgraph connectivity. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 201–212. Springer, July 2010.
[Ducoffe16]
Guillaume Ducoffe. Propriéteés meétriques des grands graphes. PhD thesis, Université Côte d'Azur, December 2016.
[Ducoffe18]
Guillaume Ducoffe. A short note on the complexity of computing strong pathbreadth. Information Processing Letters, 133:56–58, May 2018.
[Duffin65]
Richard James Duffin. Topology of series parallel graphs. Journal of Mathematical Analysis and Applications, 10(2):303–318, 1965.
[Duke72]
Richard A. Duke. On the genus and connectivity of Hamiltonian graphs. Discrete Mathematics, 2(3):199–206, June 1972.
[Dumer07]
Ilya Dumer. Covering spheres with spheres. Discrete & Computational Geometry, 38(4):665–679, December 2005.
[Dumitrescu99]
Adrian Dumitrescu. On two lower bound constructions. In 11th Canadian Conference on Computational Geometry (CCCG), 1999.
[DV12]
Hristo N. Djidjev and Imrich Vrt'o. Planar crossing numbers of graphs of bounded genus. Discrete & Computational Geometry, 48:393–415, September 2012.
[DV16]
Christoph Dürr and Jill-Jênn Vie. Programmation efficace. Ellipses, 2016.
[DV95]
Hristo N. Djidjev and Shankar M. Venkatesan. Planarization of graphs embedded on surfaces. In 21st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1017 of Lecture Notes in Computer Science, pages 62–72. Springer, June 1995.
[DV97]
Hristo N. Djidjev and Shankar M. Venkatesan. Reduced constants for simple cycle graph separation. Acta Informatica, 34(3):231–243, 1997.
[DVV22]
Mina Dalirrooyfard and Virginia Vassilevska Williams. Induced cycles and paths are harder than you think. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 531–542. IEEE Computer Society Press, October 2022.
[DVW16]
Erik D. Demaine, Giovanni Viglietta, and Aaron Williams. Super mario bros. is harder/easier than we thought. In 8th International Conference Fun with Algorithms (FUN), volume 49 of LIPIcs, pages 13:1–13–14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[DVW96]
Alain Denise, Marcio Vasconcellos, and Dominic J.A. Welsh. The random planar graph. Congressus Numerantium, 113:61–79, 1996.
[DW04]
Vida Dujmović and David R. Wood. On linear layouts of graphs. Discrete Mathematics & Theoretical Computer Science, 6(2):339–358, January 2004.
[DW07]
Vida Dujmović and David R. Wood. Graph treewidth and geometric thickness parameters. Discrete & Computational Geometry, 37(4):641–670, 2007. Appears also in GD '05.
[DW14]
Martin Dietzfelbinger and Philipp Woelfel. Tight lower bounds for greedy routing in higher-dimensional small-world grids. In 25th Symposium on Discrete Algorithms (SODA), pages 816–829. ACM-SIAM, January 2014.
[DY05]
Feodor F. Dragan and Chenyu Yan. Collective tree spanners in graphs with bounded genus, chordality, tree-width, or clique-width. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 583–592. Springer, December 2005.
[DY06]
Feodor F. Dragan and Chenyu Yan. Network flow spanners. In 7th Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pages 410–422. Springer, March 2006.
[DY10]
Feodor F. Dragan and Chenyu Yan. Collective tree spanners in graphs with bounded parameters. Algorithmica, 57(1):22–43, May 2010.
[DY24]
James Davies and Yelena Yuditsky. Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity. Technical Report 2407.16882v1 [math.CO], arXiv, July 2022.
[DYC04]
Feodor F. Dragan, Chenyu Yan, and Derek G. Corneil. Collective tree spanners and routing in AT-free related graphs. In 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 3353 of Lecture Notes in Computer Science, pages 68–80. Springer, June 2004.
[DYL04]
Feodor F. Dragan, Chenyu Yan, and Irina Lomonosov. Collective tree spanners of graphs. In Torben Hagerup and Jyrki Katajainen, editors, 9th Scandinavian Workshop on Algorithm Theory (SWAT), volume 3111 of Lecture Notes in Computer Science, pages 64–76. Springer, July 2004.
[DYL06]
Feodor F. Dragan, Chenyu Yan, and Irina Lomonosov. Collective tree spanners of graphs. SIAM Journal on Discrete Mathematics, 20(1):240–260, 2006.
[DYX08]
Feodor F. Dragan, Chenyu Yan, and Yang Xiang. Collective additive tree spanners of homogeneously orderable graphs. In 8th Latin American Symposium on Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 555–567, April 2008.
[DZ00]
W. Duckworth and Michele Zito. Note: Sparse hypercube 3-spanners. Discrete Mathematics, 103(1-3):289–295, July 2000.
[DZ17]
Ran Duan and Tianyi Zhang. Improved distance sensitivity oracles via tree partitioning. In 10th International Workshop on Algorithms and Data Structures (WADS), volume 10389 of Lecture Notes in Computer Science, pages 349–360. Springer, July 2017.
[Dziobiak11]
Stanislaw Dziobiak. Excluded-minor characterization of apex-outerplanar graphs. PhD thesis, Faculty of the Louisiana State University, August 2011.
[DZMXx13]
Andy Diwen Zhu, Hui Ma, Xiaokui Xiao, Siqiang Luo, Youze Tang, and Shuigeng Zhou. Shortest path and distance queries on road networks: Towards bridging theory and practice. In ACM International Conference on Management of Data (SIGMOD), pages 857–868. ACM Press, June 2013.
[DZMXx13a]
Andy Diwen Zhu, Hui Ma, Xiaokui Xiao, Siqiang Luo, Youze Tang, and Shuigeng Zhou. Shortest path and distance queries on road networks: Towards bridging theory and practice. Technical Report 1304.2576v2 [cs.DS], arXiv, April 2013.
[EBGK06]
Annette Ebbers-Baumann, Ansgar Grüne, and Rolf Klein. The geometric dilation of finite point sets. Algorithmica, 44(2):137–149, February 2006.
[EC88]
Ehab S. Elmallah and Charles J. Colbourn. Partitioning the edges of a planar graph into two partial k-trees. Congressus Numerantium, 66:69–80, 1988.
[EDB20]
Lionel Eyraud-Dubois and Cristiana Bentes. Independent tasks on 2 resources with co-scheduling effects. Technical Report hal-02431897, HAL, January 2020.
[Edmonds65]
Jack Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.
[EDS98]
Keyhan Erciyes, Pinar Dündar, and Akile Sahin. A distributed dynamic routing protocol for arbitrary networks, 1998.
[EELW10]
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, and Stephen K. Wismath. Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discrete & Computational Geometry, 43(2):272–288, March 2010.
[EEST05]
Michael Elkin, Yuval Emek, Daniel A. Spielman, and Shang-Hua Teng. Lower-stretch spanning trees. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 494–503. ACM Press, May 2005.
[EFFGx17]
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, and Ioan Todinca. Three notes on distributed property testing. In 31st International Symposium on Distributed Computing (DISC), volume 91 of LIPIcs, pages 5:1–15:30. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2017.
[EFFKO19]
Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. Sublinear-time distributed algorithms for detecting small cliques and even cycles. In Jukka Suomela, editor, 33rd International Symposium on Distributed Computing (DISC), volume 146 of LIPIcs, pages 15:1–15:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2019.
[EFFKO22]
Talya Eden, Nimrod Fiat, Orr Fischer, Fabian Kuhn, and Rotem Oshman. Sublinear-time distributed algorithms for detecting small cliques and even cycles. Distributed Computing, 35(3):207–234, 2022.
[EFK01]
Markus Eiglsperger, Sándor P. Fekete, and Gunnar W. Klau. Orthogonal graph drawing. In Michael Kaufmann and Dorothea Wagner, editors, Drawing Graphs: Methods and Models, volume 2025 of Lecture Notes in Computer Science, chapter 4, pages 121–171. Springer, 2001.
[EG05]
Friedrich Eisenbrand and Fabrizio Grandoni. On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science, 326(1-3):57–67, October 2005.
[EG08]
David Eppstein and Michael T. Goodrich. Succinct greedy graph drawing in the hyperbolic plane. Technical Report 0806.0341v1 [cs.CG], arXiv, June 2008.
[EG19]
Mark N. Ellingham and Zachary J. Gaslowitz. The structure of 4-connected K2,t-minor-free graphs. In Sergio Cabello and Bojan Mohar, editors, 9th Slovenian International Conference on Graph Theory (SICGT), pages 99–100. Institute of Mathematics, Physics and Mechanics (IMFM), June 2019.
[EG22]
Ronen Eldan and Renan Gross. Concentration on the Boolean hypercube via pathwise stochastic analysis. Inventiones mathematicae, 230(3):935–994, 2022.
[EG48]
Paul Erdős and István Sándor Gál. On the representation of 1, 2, ..., N by differences. In Koninklijke Nederlandsche Akademie van Wetenschappen, number 9 in LI, 1948.
[EG81]
Shimon Even and Oded Goldreich. The minimum-length generator sequence problem is NP-hard. Journal of Algorithms, 2(3):311–313, September 1981.
[EGG21]
Louis Esperet, Cyril Gavoille, and Carla Groenland. Isometric universal graphs. Technical Report 2103.08570v1 [math.CO], arXiv, March 2021.
[EGG21a]
Louis Esperet, Cyril Gavoille, and Carla Groenland. Isometric universal graphs. SIAM Journal on Discrete Mathematics, 5(2):1224–1237, 2021.
[EGH89]
Paul Erdős, Peter M. Cruber, and Joseph Hammer. Lattice points. Longman Scientific & Technical, 1989.
[EGIN97]
David Eppstein, Zvi Galil, Giuseppe Francesco Italiano, and Amnon Nissenzweig. Sparsification -- A technique for speeding up dynamic graph algorithms. Journal of the ACM, 44(5):669–696, September 1997.
[EGIS96]
David Eppstein, Zvi Galil, Giuseppe Francesco Italiano, and Thomas H. Spencer. Separator based sparsification I: planarity testing and minimum spanning trees. Journal of Computer and System Sciences, 52(1):3–27, February 1996.
[EGIS98]
David Eppstein, Zvi Galil, Giuseppe Francesco Italiano, and Thomas H. Spencer. Separator-based sparsification II: Edge and vertex connectivity. SIAM Journal on Computing, 28(1):341–381, 1998.
[EGKKx05]
Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, and Andrzej Lingas. Embedding point sets into plane graphs of small dilation. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 5–16. Springer, December 2005.
[EGM70]
Paul Erdős, László Gerencsér, and A. Máté. Problems of graph theory concerning optimal design. In Paul Erdős, Alfréd Rényi, and Vera T. Sós, editors, Colloquia Mathematica Societatis János Bolyai 4: Combinatorial theory and its applications, volume 1, pages 317–325. North-Holland, 1970.
[EGP03]
Tamar Eilam, Cyril Gavoille, and David Peleg. Compact routing schemes with low stretch factor. Journal of Algorithms, 46(2):97–114, February 2003.
[EGP07]
Tamar Eilam, Cyril Gavoille, and David Peleg. Average stretch analysis of compact routing schemes. Discrete Applied Mathematics, 155(5):598–610, January 2007.
[EGP98]
Tamar Eilam, Cyril Gavoille, and David Peleg. Compact routing schemes with low stretch factor. Research Report RR-1195-98, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, January 1998.
[EGP98a]
Tamar Eilam, Cyril Gavoille, and David Peleg. Compact routing schemes with low stretch factor. In 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11–20. ACM Press, August 1998.
[EH63]
Paul Erdős and H. Hanani. On a limit theorem in combinatorial analysis. Publicationes Mathematicae Debrecen, 10:10–13, 1963.
[EH89]
Paul Erdős and András Hajnal. Ramsey-type theorems. Discrete Applied Mathematics, 25(1-2):37–52, October 1989.
[EHK22]
Louis Esperet, Nathaniel Harms, and Andrey Kupavskii. Sketching distances in monotone graph classes. Technical Report 2202.09253v1 [cs.DS], arXiv, November 2022.
[EHP04]
Jeff Erickson and Sariel Har-Peled. Optimally cutting a surface into a disk. Discrete & Computational Geometry, 31(1):37–59, 2004.
[Einstein05]
Albert Einstein. Zur Elektrodynamik bewegter Körper. Annalen der Physik, 322(10):891–921, June 1905.
[Einstein05t]
Albert Einstein. On the electrodynamics of moving bodies. Annalen der Physik, 322(10):891–921, June 1905.
[EITTx92]
David Eppstein, Giuseppe Francesco Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, and Moti Yung. Maintenance of a minimum spanning forest in a dynamic planar graph. Journal of Algorithms, 13(1):33–54, March 1992.
[EJdM21]
Louis Esperet, Sébastien Julliot, and Arnaud de Mesmay. Distributed coloring and the local structure of unit-disk graphs. In Leszek Gąsieniec, Ralf Klasing, and Tomasz Radzik, editors, 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), volume 12961 of Lecture Notes in Computer Science, pages 61–75. Springer, September 2021.
[EJM12]
Khaled Elbassioni, Slobodan Jelić, and Domagoj Matijevicć. The relation of connected set cover and group Steiner tree. Theoretical Computer Science, 438:96–101, June 2012.
[EJM21]
Louis Esperet, Gwenaël Joret, and Pat Morin. Sparse universal graphs for planarity. Technical Report 2010.05779v2 [math.CO], arXiv, February 2021.
[EJM23]
Louis Esperet, Gwenaël Joret, and Pat Morin. Sparse universal graphs for planarity. Journal of the London Mathematical Society, 108(4):1333–1357, October 2023.
[EJT10]
Michael Elberfeld, Andreas Jakoby, and Till Tantau. Logspace versions of the theorems of bodlaender and courcelle. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 143–152. IEEE Computer Society Press, October 2010.
[EK02]
Michael Elkin and Guy Kortsarz. Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem. In 34th Annual ACM Symposium on Theory of Computing (STOC), pages 438–447. ACM Press, May 2002.
[EK03]
Michael Elkin and Guy Kortsarz. Sublogarithmic approximation for telephone multicast: Path out of jungle. In 14th Symposium on Discrete Algorithms (SODA), pages 76–85. ACM-SIAM, January 2003.
[EK06]
Michael Elkin and Guy Kortsarz. Sublogarithmic approximation for telephone multicast. Journal of Computer and System Sciences, 72(4):648–659, June 2006.
[EKL19]
David Ellis, Nathan Keller, and Noam Lifshitz. On a biased edge isoperimetric inequality for the discrete cube. Journal of Combinatorial Theory, Series A, 163:118–162, April 2019.
[EKNP14]
Michael Elkin, Hartmut Klauck, Danupon Nanongkai, and Gopal Pandurangan. Can quantum quantum communication speed up distributed computation?In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 166–175. ACM Press, July 2014.
[Ekstein14]
Jan Ekstein. Hamiltonian cycles in the square of a graph. Technical Report 1206.4846v1 [math.CO], arXiv, January 2014.
[EL41]
Paul Erdős and Joseph Lehner. The distribution of the number of summands in the partitions of a positive integer. Duke Mathematical Journal, 8(2):335–345, 1941.
[Elias75]
Peter Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21(2):194–203, March 1975.
[Elkin01]
Michael Elkin. Computing almost shortest paths. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 53–62. ACM Press, 2001.
[Elkin04]
Michael Elkin. Distributed approximation - a survey. ACM SIGACT News - Distributed Computing Column, 35(4):3–20, December 2004.
[Elkin04a]
Michael Elkin. A faster distributed protocol for constructing a minimum spanning tree. In 15th Symposium on Discrete Algorithms (SODA), pages 359–368. ACM-SIAM, January 2004.
[Elkin04b]
Michael Elkin. Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problems. In 36th Annual ACM Symposium on Theory of Computing (STOC), pages 331–340. ACM Press, May 2004.
[Elkin05]
Michael Elkin. Computing almost shortest paths. ACM Transactions on Algorithms, 1(2):283–323, October 2005.
[Elkin06]
Michael Elkin. A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners. Technical Report 0611001v1 [cs.DS], arXiv, November 2006.
[Elkin06a]
Michael Elkin. A faster distributed protocol for constructing a minimum spanning tree. Journal of Computer and System Sciences, 72(8):1282–1308, December 2006.
[Elkin07]
Michael Elkin. A near-optimal fully dynamic distributed algorithm for maintaining sparse spanners. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 195–204. ACM Press, August 2007.
[Elkin17]
Michael Elkin. Distributed exact shortest paths in sublinear time. In 49th Annual ACM Symposium on Theory of Computing (STOC), pages 757–770. ACM Press, June 2017.
[Elkin17a]
Michael Elkin. A simple deterministic distributed MST algorithm, with near-optimal time and message complexities. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 157–163. ACM Press, July 2017.
[Ellis11]
David Ellis. Almost isoperimetric subsets of the discrete cube. Combinatorics, Probability and Computing, 20(3):363–380, May 2011.
[ELO08]
Louis Esperet, Arnaud Labourel, and Pascal Ochem. On induced-universal graphs for the class of bounded-degree graphs. Information Processing Letters, 108(5):255–260, November 2008.
[ELS14]
Javier Esparza, Michael Luttenberger, and Maximilian Schlund. A brief history of strahler numbers. In 8th International Conference on Language and Automata Theory and Applications (LATA), volume 8370 of Lecture Notes in Computer Science, pages 1–13. Springer, March 2014.
[ELVW23]
David Eppstein and Virginia Vassilevska Williams. Quasipolynomiality of the smallest missing induced subgraph. Journal of Graph Algorithms and Applications, 27(5):329–339, 2023.
[ELW06]
Leah Epstein, Asaf Levin, and Gerhard J. Woeginger. Graph coloring with rejection. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 364–375. Springer, September 2006.
[EM19]
Michael Elkin and Shaked Matar. Near-additive spanners in low polynomial deterministic CONGEST time. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 531–540. ACM Press, July 2019.
[EM22]
Louis Esperet and Sergey Morin. Testability and local certification of monotone properties in minor-closed classes. In 48th International Colloquium on Automata, Languages, and Programming (ICALP), volume 198 of LIPIcs, pages 58:1–58:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2022.
[EMM13]
Joanna A. Ellis-Monaghan and Iain Moffatt. Graphs on surfaces. Springer Briefs in Mathematics. Springer, 2013.
[EMOT16]
Mark N. Ellingham, Emily A. Marshall, Kenta Ozeki, and Shoichi Tsuchiya. A characterization of K2,4-minor-free graphs. SIAM Journal on Discrete Mathematics, 30(2):955–975, 2016.
[EMR15]
Guy Even, Moti Medina, and Dana Ron. Distributed maximum matching in bounded degree graphs. In 16th International Conference on Distributed Computing and Networking (ICDCN), page Article No. 18. ACM, January 2015.
[EMY07]
Robert B. Ellis, Jeremy L. Martin, and Catherine Yan. Random geometric graph diameter in the unit ball. Algorithmica, 47(4):421–438, April 2007.
[EMZ96]
Tamar Eilam, Shlomo Moran, and Shmuel Zaks. A lower bound for linear interval routing. In özalp Babaoğlu and Keith Marzullo, editors, 10th International Workshop on Distributed Algorithms (WDAG), volume 1151 of Lecture Notes in Computer Science, pages 191–205. Springer-Verlag, October 1996.
[EMZ97a]
Tamar Eilam, Shlomo Moran, and Shmuel Zaks. The complexity of the characterization of networks supporting shortest-path interval routing. In Danny Krizanc and Peter Widmayer, editors, 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 99–111. Carleton Scientific, July 1997.
[EMZ97b]
Tamar Eilam, Shlomo Moran, and Shmuel Zaks. A simple DFS-based algorithm for linear interval routing. In Marios Mavronicolas and Philippas Tsigas, editors, 11th International Workshop on Distributed Algorithms (WDAG), volume 1320 of Lecture Notes in Computer Science, pages 37–51. Springer, September 1997.
[EMZ99]
Tamar Eilam, Shlomo Moran, and Shmuel Zaks. Lower bounds for linear interval routing. Networks, 34(1):37–46, August 1999.
[EN16]
Michael Elkin and Ofer Neiman. On efficient distributed construction of near optimal routing schemes. Technical Report 1602.02293v1 [cs.DC], arXiv, February 2016.
[EN16a]
Michael Elkin and Ofer Neiman. Hopsets with constant hopbound, and applications to approximate shortest paths. Technical Report 1605.04538v1 [cs.DS], arXiv, May 2016.
[EN16b]
Michael Elkin and Ofer Neiman. On efficient distributed construction of near optimal routing schemes: Extended abstract. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 235–244. ACM Press, July 2016.
[EN16c]
Michael Elkin and Ofer Neiman. Distributed strong diameter network decomposition: Extended abstract. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 211–216. ACM Press, July 2016.
[EN17]
Michael Elkin and Ofer Neiman. Linear-size hopsets with small hopbound, and distributed routing with low memory. Technical Report 1704.08468v1 [cs.DS], arXiv, April 2017.
[EN17a]
Michael Elkin and Ofer Neiman. Efficient algorithms for constructing very sparse spanners and emulators. In 28th Symposium on Discrete Algorithms (SODA), pages 652–669. ACM-SIAM, January 2017.
[EN18]
Michael Elkin and Ofer Neiman. Near-optimal distributed routing with low memory. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 207–216. ACM Press, July 2018.
[EN18b]
Michael Elkin and Ofer Neiman. On efficient distributed construction of near optimal routing schemes. Distributed Computing, 31(2):119–137, April 2018.
[EN22]
Michael Elkin and Ofer Neiman. Distributed strong diameter network decomposition. Theoretical Computer Science, 922:150–157, June 2022.
[EP00a]
Michael Elkin and David Peleg. The hardness of approximating spanner problems. In 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1770 of Lecture Notes in Computer Science, pages 370–381. Springer, February 2000.
[EP00b]
Michael Elkin and David Peleg. Strong inapproximability of the basic k-spanner problem. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 636–647. Springer, July 2000.
[EP01]
Michael Elkin and David Peleg. (1+ε,β)-spanner constructions for general graphs. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 173–182. ACM Press, July 2001.
[EP04]
Michael Elkin and David Peleg. (1+ε,β)-spanner constructions for general graphs. SIAM Journal on Computing, 33(3):608–631, 2004.
[EP05]
Michael Elkin and David Peleg. Approximating k-spanner problem for k > 2. Theoretical Computer Science, 337(1-3):249–277, June 2005.
[EP06]
Yuval Emek and David Peleg. Tight bounds on probabilistic embedding of series-perallel graphs. In 17th Symposium on Discrete Algorithms (SODA), pages 1045–1053. ACM-SIAM, January 2006.
[EP07]
Michael Elkin and David Peleg. The hardness of approximating spanner problems. Theory of Computing Systems, 41(4):691–729, December 2007.
[Eppstein00]
David Eppstein. Diameter and treewidth in minor-closed graph families. Algorithmica, 27(3):275–291, January 2000.
[Eppstein03]
David Eppstein. Dynamic generators of topologically embedded graphs. In 14th Symposium on Discrete Algorithms (SODA), pages 599–608. ACM-SIAM, January 2003.
[Eppstein03a]
David Eppstein. Hyperbolic geometry, Möbius transformations, and geometric optimization, 2003. Invited talk at MSRI Introductory Workshop on Discrete & Computational Geometry, Berkeley, CA.
[Eppstein06]
David Eppstein. Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. Technical Report 0604034v1 [cs.CG], arXiv, April 2006.
[Eppstein07]
David Eppstein. Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition. In 18th Symposium on Discrete Algorithms (SODA), pages 29–38. ACM-SIAM, January 2007.
[Eppstein08]
David Eppstein. Recognizing partial cubes in quadratic time. In 19th Symposium on Discrete Algorithms (SODA), pages 1258–1266. ACM-SIAM, January 2008.
[Eppstein09]
David Eppstein. Finding large clique minors is hard. Journal of Graph Algorithms and Applications, 13(2):197–204, 2009.
[Eppstein13]
David Eppstein. Grid minors in damaged grids. Technical Report 1303.1136v2 [cs.DM], arXiv, November 2013.
[Eppstein14]
David Eppstein. A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing. Discrete & Computational Geometry, 52(3):515–550, 2014.
[Eppstein17]
David Eppstein. The effect of planarization on width. In Frati Fabrizio and Ma Kwan-Liu, editors, 25th International Symposium on Graph Drawing and Network Visualization (GD), volume 10692 of Lecture Notes in Computer Science, pages 560–572. Springer, September 2017.
[Eppstein17a]
David Eppstein. Triangle-free penny graphs: Degeneracy, choosability, and edge count. In Frati Fabrizio and Ma Kwan-Liu, editors, 25th International Symposium on Graph Drawing and Network Visualization (GD), volume 10692 of Lecture Notes in Computer Science, pages 506–513. Springer, September 2017.
[Eppstein19]
David Eppstein. Cubic planar graphs that cannot be drawn on few lines. In Gill Barequet and Yusu Wang, editors, 35th International Symposium on Computational Geometry (SoCG), volume 129 of LIPIcs, pages 32:1–32:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2019.
[Eppstein94]
David Eppstein. Arboricity and bipartite subgraph listing algorithms. Information Processing Letters, 51(4):207–211, August 1994.
[Eppstein99]
David Eppstein. Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications, 3(3):1–27, 1999.
[EPR35]
Albert Einstein, Boris Podolski, and Nathan Rosen. Can quantum-mechanical description of physical reality be considered complete?Physical Review, 47(10):777–780, May 1935.
[EPSW14]
Yuval Emek, Christoph Pfister, Jochen Seidel, and Roger Wattenhofer. Anonymous networks: randomization = 2-hop coloring. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 96–105. ACM Press, July 2014.
[EPTZ97]
Tamar Eilam, David Peleg, Richard B. Tan, and Shmuel Zaks. Broadcast in linear messages in IRS representing all shortest paths. Manuscript, 1997.
[Erdos47]
Paul Erdős. Some remarks on the theory of graphs. Bulletin of the American Mathematical Society, 53:292–294, 1947.
[Erdos59]
Paul Erdős. Graph theory and probability. Canadian Journal of Mathematics, 11:34–38, 1959.
[Erdos64]
Paul Erdős. Extremal problems in graph theory. In Public House Cszechoslovak Academy of Sciences, Prague, pages 29–36, 1964.
[Erickson19]
Jeff Erickson. Algorithms. Creative Commons, 2019.
[ERS66]
Paul Erdős, Alfréd Rényi, and Vera T. Sós. On a problem of graph theory. Studia Scientiarum Mathematicarum Hungarica, 1:215–235, 1966.
[ERV07]
Matthias Englert, Heiko Röglin, and Berthold Vöcking. Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. In 18th Symposium on Discrete Algorithms (SODA), pages 1295–1304. ACM-SIAM, January 2007.
[ES07]
Mark N. Ellingham and Christopher D. Stephens. The nonorientable genus of joins of complete graphs with large edgeless graphs. Journal of Combinatorial Theory, Series B, 97(5):827–845, September 2007.
[ES09]
Mark N. Ellingham and Christopher D. Stephens. The orientable genus of some joins of complete graphs with large, edgeless graphs. Discrete Mathematics, 309(5):1190–1198, March 2009.
[ES13]
Michael Elkin and Shay Solomon. Fast constructions of light-weight spanners for general graphs. In 24th Symposium on Discrete Algorithms (SODA), pages 513–525. ACM-SIAM, January 2013.
[ES13a]
Michael Elkin and Shay Solomon. Optimal euclidean spanners: Really short, thin and lanky. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 645–654. ACM Press, June 2013.
[ES23]
Eunjin Oh and Seunghyeok Oh. Algorithms for computing maximum cliques in hyperbolic random graphs. In Inge Li Gørtz, Martin Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 85:1–85:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[ES35]
Paul Erdős and Győrgy Szekeres. A combinatorial problem in geometry. Composito Mathematica, 2:464–470, 1935.
[ES82]
Paul Erdős and Miklós Simonovits. Compactness results in extremal graph theory. Combinatorica, 2(3):275–288, September 1982.
[ES88]
Omer Egecioglu and Liang-Ping Shen. A bijective proof for the number of labeled q-trees. Ars Combinatoria, 25B:3–30, 1988.
[ES93]
E.M. Eschen and Jeremy P. Spinrad. A O(n2) algorithm for circular-arc graph recognition. In 4th Symposium on Discrete Algorithms (SODA), pages 128–137. ACM-SIAM, 1993.
[ES94]
Peter Epstein and Jörg-Rüdiger Sack. Generating triangulations at random. ACM Transactions on Modeling and Computer Simulation, 4(3):267–278, July 1994.
[ES99]
Russell Euler and Jawad Sadek. The 𝜋s go full circle. Mathematics Magazine, 72(1):59–63, February 1999.
[ESW00]
Peter Eades, Antonios Symvonis, and Sue Hays Whitesides. Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics, 103(1-3):55–87, July 2000.
[ESW10]
John Estes, William Staton, and Bing Wei. A bound on the values of independence polynomials at -1/k for k-degenerate graphs. Discrete Mathematics, 313(18):1793–1798, September 2010.
[ESZ06]
Mark N. Ellingham, Christopher D. Stephens, and Xiaoya Zha. The norientable genus of complete tripartite graphs. Journal of Combinatorial Theory, Series B, 96(4):529–559, July 2006.
[ET75]
Shimon Even and Robert Endre Tarjan. Network flow and testing graph connectivity. SIAM Journal on Computing, 4(4):507–518, December 1975.
[EV19]
Michael Engen and Vincent Vatter. Containing all permutations. The American Mathematical Monthly, 128(1):4–24, 2019.
[EV93]
Avshalom C. Elitzur and Lev Vaidman. Quantum mechanical interaction-free measurements. Foundations of Physics, 23(7):987–997, July 1993.
[EW04]
David Eppstein and Joseph Wang. Fast approximation of centrality. Journal of Graph Algorithms and Applications, 8(1):39–45, 2004.
[EW05]
Jeff Erickson and Kim Whittlesey. Greedy optimal homotopy and homology generators. In 16th Symposium on Discrete Algorithms (SODA), pages 1038–1046. ACM-SIAM, January 2005.
[EW18]
Friedrich Eisenbrand and Robert Weismantel. Proximity results and faster algorithms for integer programming using the Steinitz lemma. In 29th Symposium on Discrete Algorithms (SODA), pages 808–816. ACM-SIAM, 2018.
[Ewell04]
John A. Ewell. Recurrences for the partition function and its relatives. Rocky Mountains Journal of Mathematics, 34(2):619–627, 2004.
[EWG08]
Mihaela Enachescu, Mei Wang, and Ashish Goel. Reducing maximum stretch in compact routing. In 27th Annual IEEE Conference on Computer Communications (INFOCOM), pages 336–340, April 2008.
[EZ04]
Michael Elkin and Jian Zhang. Efficient algorithms for constructing (1+ε,β)-spanners in the distributed and streaming models. In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 160–168. ACM Press, July 2004.
[EZ06]
Michael Elkin and Jian Zhang. Efficient algorithms for constructing (1+ε,β)-spanners in the distributed and streaming models. Distributed Computing, 18(5):375–385, April 2006.
[Fan05]
Genghua Fan. Path decomposition and Gallai's conjecture. Journal of Combinatorial Theory, Series B, 93(2):117–125, March 2005.
[Farley79]
Arthur M. Farley. Minimal broadcast networks. Networks, 9(4):313–332, 1979.
[Farley80]
Arthur M. Farley. Minimum-time broadcast networks. Networks, 10(1):59–70, 1980.
[Fary48]
István Fáry. On straight line representation of planar graphs. Acta Scientiarum Mathematicarum, 11(4):229–233, 1948.
[FB01]
Fedor V. Fomin and Hans Leo Bodlaender. Approximation of pathwidth of outerplanar graphs. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2204 of Lecture Notes in Computer Science, pages 166–176. Springer, June 2001.
[FCKK24]
Martín Farach-Colton, Andrew Krapivin, and William Kuszmaul. Optimal bounds for open addressing without reordering. In 65th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 594–605. IEEE Computer Society Press, October 2024.
[FDGM04]
Frédéric Ferchaud, Vu Duong, Cyril Gavoille, and Mohamed Mosbah. Reducing disturbances by using absorption areas. In 1st International Conference on Research in Air Transportation (ICRAT), pages 111–115, November 2004.
[FDGM04a]
Frédéric Ferchaud, Vu Duong, Cyril Gavoille, and Mohamed Mosbah. Using absorption areas to improve ATFM. In 23rd IEEE International Digital Avionics Systems Conference (DASC), volume 1, pages 2.A.3–1–2.A.3–6, October 2004.
[FdV24]
Laurent Feuilloley and Tijn de Vos. The environmental cost of our conferences: The CO2 emissions due to travel at PODC and DISC. ACM SIGACT News - Distributed Computing Column, 54(4):94–107, January 2024.
[Feige98]
Uriel Feige. A threshold of lnn for approximating set cover. Journal of the ACM, 45(4):634–652, 1998.
[Felsner04]
Stefan Felsner. Geometric graphs: Turán problems. In Stefan Felsner, editor, Geometric Graphs and Arrangements, chapter 1, pages 1–16. Springer, 2004.
[Felsner13]
Stefan Felsner. Rectangle and square representations of planar graphs. In János Pach, editor, Thirty Essays on Geometric Graph Theory, pages 213–248. Springer, 2013.
[Feng06]
Feng Feng. Path finding and flow control for virtual reality augmented evacuation system for large indoor areas. Master thesis, Nanyang Technological University, Singapore, July 2006.
[Ferchaud06]
Frédéric Ferchaud. Étude des zones d'absorption dans la gestion du flux du trafic aérien. PhD thesis, Université Bordeaux 1, Talence, France, December 2006.
[Feuilloley23]
Laurent Feuilloley. Bibliography of distributed approximation beyond bounded degree. Technical Report 2001.08510v4 [cs.CG], arXiv, November 2023.
[Few55]
L. Few. The shortest path and the shortest road through n points. Mathematika, 2(2):141–144, 1955.
[FF06]
Ulrich Faigle and Gereon Frahling. A combinatorial algorithm for weighted stable sets in bipartite graphs. Discrete Applied Mathematics, 154(9):1380–1391, June 2006.
[FF11]
Stefan Felsner and Mathew C. Francis. Contact representations of planar graphs with cubes. In 27th Annual ACM Symposium on Computational Geometry (SoCG), pages 315–320. ACM, June 2011.
[FF11a]
Arash Farzan and Johannes Fischer. Compact representation of posets. In 22nd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7074 of Lecture Notes in Computer Science, pages 302–311. Springer, December 2010.
[FF56]
Lester Randolph Ford and Delbert Ray Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8(3):399–404, 1956.
[FFFV14]
Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, and Rossano Venturini. Bicriteria data compression. In 25th Symposium on Discrete Algorithms (SODA), pages 1582–1595. ACM-SIAM, January 2014.
[FFIKx24]
Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, and Ziena Zeif. Optimal padded decomposition for bounded treewidth graphs. Technical Report 2407.12230v2 [cs.DS], arXiv, November 2024.
[FFMMM07]
Angelo Fanelli, Michele Flammini, Giovanna Melideo, Domenico Mango, and Luca Moscardelli. An experimental evaluation of algorithms for IP tables minimization. In Camil Demetrescu, editor, 6th International Workshop on Experimental Algorithms (WEA), volume 4525 of Lecture Notes in Computer Science, pages 324–337. Springer, June 2007.
[FFP02]
Khalid Fath, Paola Flocchini, and Samuel Pierre. Compact routing in chordal grids and other networks. Information Systems and Operational Research, 40(2):119–130, May 2002.
[FFRRx20]
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Éric Rémila, Pedro Montealegre, and Ioan Todinca. Compact distributed certification of planar graphs. In 39th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 319–328. ACM Press, August 2020.
[FFRRx20a]
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Éric Rémila, Pedro Montealegre, and Ioan Todinca. Compact distributed certification of planar graphs. Technical Report 2005.05863v1 [cs.DC], arXiv, May 2020.
[FG01]
Pierre Fraigniaud and Cyril Gavoille. Routing in trees. Research Report RR-1252-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, January 2001.
[FG01a]
Pierre Fraigniaud and Cyril Gavoille. Routing in trees. In Fernando Orejas, Paul G. Spirakis, and Jan van Leeuwen, editors, 28th International Colloquium on Automata, Languages and Programming (ICALP), volume 2076 of Lecture Notes in Computer Science, pages 757–772. Springer, July 2001.
[FG01b]
Pierre Fraigniaud and Cyril Gavoille. Comment router dans un arbre ?In 3es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 85–88. INRIA, May 2001.
[FG01c]
Pierre Fraigniaud and Cyril Gavoille. A space lower bound for routing in trees. Research Report RR-1262-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, September 2001.
[FG02]
Pierre Fraigniaud and Cyril Gavoille. A space lower bound for routing in trees. In 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of Lecture Notes in Computer Science, pages 65–75. Springer, March 2002.
[FG03]
Pierre Fraigniaud and Cyril Gavoille. Lower bounds for oblivious single-packet end-to-end communication. In 17th International Symposium on Distributed Computing (DISC), volume 2848 of Lecture Notes in Computer Science, pages 211–223. Springer, October 2003.
[FG03a]
Pierre Fraigniaud and Cyril Gavoille. Lower bounds for oblivious single-message end-to-end communication. Research Report RR-1289-03, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2003.
[FG06]
Pierre Fraigniaud and Cyril Gavoille. Header-size lower bounds for end-to-end communication in memoryless networks. Computer Networks, 50(10):1630–1638, July 2006.
[FG06a]
Jörg Flum and Martin Grohe. Parameterized complexity theory. Springer, 2006.
[FG08]
Pierre Fraigniaud and Cyril Gavoille. Polylogarithmic network navigability using compact metrics with small stretch. In 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 62–69. ACM Press, June 2008.
[FG09]
Mohammad Farshi and Joachim Gudmundsson. Experimental study of geometric t-spanners. Journal of Experimental Algorithmics, 14:Article No. 3, November 2009.
[FG09a]
Pierre Fraigniaud and George Giakkoupis. The effect of power-law degrees on the navigability of small worlds. In 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 240–249. ACM Press, August 2009.
[FG10]
Pierre Fraigniaud and George Giakkoupis. On the searchability of small-world networks with arbitrary underlying structure. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 389–398. ACM Press, June 2010.
[FG11]
Pierre Fraigniaud and Cyril Gavoille. Proceedings of the 30th annual acm symposium on principles of distributed computing (podc). ACM Press, June 2011.
[FG65]
Delbert Ray Fulkerson and O.A. Gross. Incidence matrices and interval graphs. Pacific Journal of Mathematics, 15:835–855, 1965.
[FG94]
Pierre Fraigniaud and Cyril Gavoille. Interval routing schemes. Research Report 94-04, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, January 1994.
[FG94a]
Pierre Fraigniaud and Cyril Gavoille. Optimal interval routing. In Bruno Buchberger and Jens Volkert, editors, Parallel Processing: CONPAR '94 - VAPP VI, volume 854 of Lecture Notes in Computer Science, pages 785–796. Springer-Verlag, September 1994.
[FG94c]
Pierre Fraigniaud and Cyril Gavoille. A characterization of networks supporting linear interval routing. In 13th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 216–224. ACM Press, August 1994.
[FG95]
Pierre Fraigniaud and Cyril Gavoille. Memory requirement for universal routing schemes. Research Report 95-05, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, March 1995.
[FG95a]
Pierre Fraigniaud and Cyril Gavoille. Memory requirement for universal routing schemes. In 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 223–230. ACM Press, August 1995.
[FG96]
Pierre Fraigniaud and Cyril Gavoille. Local memory requirement of universal routing schemes. Research Report 96-01, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, January 1996.
[FG96a]
Pierre Fraigniaud and Cyril Gavoille. Local memory requirement of universal routing schemes. In 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 183–188. ACM Press, June 1996.
[FG97]
Pierre Fraigniaud and Cyril Gavoille. Universal routing schemes. Distributed Computing, 10:65–78, 1997.
[FG98a]
Pierre Fraigniaud and Cyril Gavoille. Interval routing schemes. Algorithmica, 21(2):155–182, June 1998.
[FG98b]
Pierre Fraigniaud and Cyril Gavoille. A theoretical model for routing complexity. In Luisa Gargano and David Peleg, editors, 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 98–113. Carleton Scientific, July 1998.
[FGambosi97]
Michele Flammini and Giorgio Gambosi. On devising boolean routing schemes. Theoretical Computer Science, 186(1-2):171–198, October 1997.
[FGG08]
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann. A quantum algorithm for the Hamiltonian NAND tree. Theory of Computing, 4(Article 8):169–190, December 2008.
[FGGKR23]
Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhon. Local distributed rounding: Generalized to MIS, matching, set cover, and beyond. In 34th Symposium on Discrete Algorithms (SODA), pages 4409–4447. ACM-SIAM, January 2023.
[FGHK16]
Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, and Alexander S. Kulikov. A better-than-3n lower bound for the circuit complexity of an explicit function. In 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 89–98. IEEE Computer Society Press, October 2016.
[FGIP07]
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, and Andrzej Pelc. Distributed computing with advice: Information sensitivity of graph coloring. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 231–242. Springer, July 2007.
[FGIP09]
Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, and Andrzej Pelc. Distributed computing with advice: Information sensitivity of graph coloring. Distributed Computing, 21(6):395–403, March 2009.
[FGK05]
Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. Measure and conquer: Domination - A case study. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 192–203. Springer, August 2005.
[FGK07]
Fabrizio Frati, Markus Geyer, and Michael Kaufmann. Packing and squeezing subgraphs into planar graphs. Technical Report RT-DIA-114-2007, Università delgi Studi di Roma Tre, dipartimento di Informatica e Automazione, April 2007.
[FGK09]
Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch. A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM, 56(5):Article No. 25, pp. 1–32, August 2009.
[FGK17]
Manuela Fischer, Mohsen Ghaffari, and Fabian Kuhn. Deterministic distributed edge-coloring via hypergraph maximal matching. In 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 180–191. IEEE Computer Society Press, October 2017.
[FGKLL07]
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, and Zvi Lotker. Universal augmentation schemes for network navigability: Overcoming the √n-barrier. In 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1–7. ACM Press, June 2007.
[FGKLL07a]
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, and Zvi Lotker. A propos des schémas d'augmentation universels pour la navigation dans les réseaux. In 9es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 23–26, May 2007.
[FGKLL09]
Pierre Fraigniaud, Cyril Gavoille, Adrian Kosowski, Emmanuelle Lebhar, and Zvi Lotker. Universal augmentation schemes for network navigability: Overcoming the √n-barrier. Theoretical Computer Science, 410(21-23):1970–1981, May 2009.
[FGKMT18]
Kevin Ford, Ben Green, Sergei Konyagin, James Maynard, and Terence Tao. Long gaps between primes. Journal of the American Mathematical Society, 31(1):65–105, January 2018.
[FGKO18]
Orr Fischer, Tzlil Gonen, Fabian Kuhn, and Rotem Oshman. Possibilities and impossibilities for distributed subgraph detection. In 30th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 153–162. ACM Press, July 2018.
[FGKS13]
Pierre Fraigniaud, Mika Göös, Amos Korman, and Jukka Suomela. What can be decided locally without identifiers?In 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 157–165. ACM Press, July 2013.
[FGKT16]
Kevin Ford, Ben Green, Sergei Konyagin, and Terence Tao. Large gaps between consecutive prime numbers. Annals of Mathematics, 183(3):935–974, May 2016.
[FGLMx20]
Fedor V. Fomin, Petr A. Golovach, William Lochet, Pranabendu Misra, Saket Saurabh, and Roohani Sharma. Parameterized complexity of directed spanner problems. In 15th International Symposium on Parameterized and Exact Computation (IPEC), volume 180 of LIPIcs, pages 12:1–12:11. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[FGM00]
Pierre Fraigniaud, Cyril Gavoille, and Bernard Mans. Interval routing schemes allow broadcasting with linear message-complexity. Research Report LRI-1241, LRI, Université Paris-Sud, 91405 Orsay cedex, France, January 2000.
[FGM00a]
Pierre Fraigniaud, Cyril Gavoille, and Bernard Mans. Interval routing schemes allow broadcasting with linear message-complexity. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 11–20. ACM Press, July 2000.
[FGM01]
Pierre Fraigniaud, Cyril Gavoille, and Bernard Mans. Interval routing schemes allow broadcasting with linear message-complexity. Distributed Computing, 14(4):217–229, July 2001.
[FGM03]
Frédéric Ferchaud, Cyril Gavoille, and Mohamed Mosbah. Using absorption areas to improve ATFM. In ERC Innovative Research Workshop, December 2003.
[FGNT01]
Michele Flammini, Giorgio Gambosi, Umberto Nanni, and Richard B. Tan. Characterization results of all shortest paths interval routing schemes. Networks, 37(4):225–232, July 2001.
[FGNT95]
Michele Flammini, Giorgio Gambosi, Umberto Nanni, and Richard B. Tan. Multi-dimensional interval routing schemes. In 9th International Workshop on Distributed Algorithms (WDAG), volume 972 of Lecture Notes in Computer Science, pages 131–144. Springer-Verlag, September 1995.
[FGNT98]
Michele Flammini, Giorgio Gambosi, Umberto Nanni, and Richard B. Tan. Characterization results of all shortest paths interval routing schemes. In Luisa Gargano and David Peleg, editors, 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 201–213. Carleton Scientific, July 1998.
[FGNT98a]
Michele Flammini, Giorgio Gambosi, Umberto Nanni, and Richard B. Tan. Multidimensional interval routing schemes. Theoretical Computer Science, 205(1-2):115–133, September 1998.
[FGNW17]
Ofer Freedman, Paweł Gawrychowski, Patrick K. Nicholson, and Oren Weimann. Optimal distance labeling schemes for trees. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 185–194. ACM Press, July 2017.
[FGP03]
Pierre Fraigniaud, Cyril Gavoille, and Christophe Paul. Eclecticism shrinks the world. Research Report LRI-1376, LRI, Université Paris-Sud, 91405 Orsay cedex, France, October 2003.
[FGP04]
Pierre Fraigniaud, Cyril Gavoille, and Christophe Paul. Eclecticism shrinks even small worlds. In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 169–178. ACM Press, July 2004.
[FGP04a]
Pierre Fraigniaud, Cyril Gavoille, and Christophe Paul. Eclectisme dans les petits mondes. In 6es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2004.
[FGP06]
Pierre Fraigniaud, Cyril Gavoille, and Christophe Paul. Eclecticism shrinks even small worlds. Distributed Computing, 18(4):279–291, March 2006.
[FGPSx12]
Joan Feigenbaum, Philip Brighten Godfrey, Aurojit Panda, Michael Schapira, Scott Shenker, and Ankit Singla. Brief announcement: on the resilience of routing tables. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 237–238. ACM Press, July 2012.
[FGS93]
Michele Flammini, Giorgio Gambosi, and Sandro Salomone. Boolean routing. In 7th International Workshop on Distributed Algorithms (WDAG), volume 725 of Lecture Notes in Computer Science, pages 219–233. Springer-Verlag, September 1993.
[FGS94a]
Michele Flammini, Giorgio Gambosi, and Sandro Salomone. Interval labeling schemes for chordal rings. In Paola Flocchini, Bernard Mans, and Nicola Santoro, editors, 1st International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 111–124. Carleton University Press, May 1994.
[FGS95]
Michele Flammini, Giorgio Gambosi, and Sandro Salomone. Interval routing schemes. In Ernst W. Mayr and Claude Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 900 of Lecture Notes in Computer Science, pages 279–290. Springer-Verlag, March 1995.
[FGS95a]
Michele Flammini, Giorgio Gambosi, and Sandro Salomone. On devising boolean routing schemes, 1995.
[FGS96]
Michele Flammini, Giorgio Gambosi, and Sandro Salomone. Interval routing schemes. Algorithmica, 16(6):549–568, December 1996.
[FGSS22]
Fedor V. Fomin, Petr A. Golovach, Danil Sagunov, and Kirill Simonov. Algorithmic extensions of Dirac's theorem. In 33rd Symposium on Discrete Algorithms (SODA), pages 406–416. ACM-SIAM, January 2022.
[FGZKx19]
Yaakov Y. Fein, Philipp Geyer, Patrick Zwick, Filip Kiałka, Sebastian Pedalino, Marcel Mayor, Stefan Gerlich, and Markus Arndt. Quantum superposition of molecules beyond 25 kDa. Nature Physics, 15:1242–1245, December 2019.
[FH01]
Xiushan Feng and Chengde Han. A fault-tolerant routing scheme in dynamic networks. Journal of Computer Science and Technology, 16(4):371–380, July 2001.
[FH06]
Fedor V. Fomin and Kjartan Høie. Pathwidth of cubic graphs and exact algorithms. Information Processing Letters, 97(5):191–196, March 2006.
[FHdM22]
Niloufar Fuladi, Alfredo Hubard, and Arnaud de Mesmay. Short topological decompositions of non-orientable surfaces,. In 38th International Symposium on Computational Geometry (SoCG), volume 224 of LIPIcs, pages 41:1–41:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2022.
[FHdM22a]
Niloufar Fuladi, Alfredo Hubard, and Arnaud de Mesmay. Short topological decompositions of non-orientable surfaces. Technical Report 2203.06659v1 [cs.CG], arXiv, March 2022.
[FHdM24]
Niloufar Fuladi, Alfredo Hubard, and Arnaud de Mesmay. Short topological decompositions of non-orientable surfaces. Discrete & Computational Geometry, 72(2):783–830, 2024.
[FHK15]
Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. Local conflict coloring. Technical Report 1511.01287v1 [cs.DS], arXiv, November 2015.
[FHK16]
Pierre Fraigniaud, Marc Heinrich, and Adrian Kosowski. Local conflict coloring. In 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 625–634. IEEE Computer Society Press, October 2016.
[FHL05]
Uriel Feige, MohammadTaghi Hajiaghayi, and James R. Lee. Improved approximation algorithms for minimum-weight vertex separators. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 563–572. ACM Press, May 2005.
[FHL08]
Uriel Feige, MohammadTaghi Hajiaghayi, and James R. Lee. Improved approximation algorithms for minimum-weight vertex separators. SIAM Journal on Computing, 38(2):629–657, May 2008.
[FHM23]
Manuela Fischer, Magnús M. Halldórsson, and Yannic Maus. Fast distributed Brooks' theorem. In 34th Symposium on Discrete Algorithms (SODA), pages 2567–2588. ACM-SIAM, January 2023.
[FHMMM94]
Rainer Feldmann, Juraj Hromkovič, Seshu Madhavapeddy, Burkhard Monien, and Peter Mysliwietz. Optimal algorithms for dissemination of information in generalized communication modes. Discrete Applied Mathematics, 53(1-3):55–78, September 1994.
[FHRR95]
J.R. Fiedler, John Philip Huneke, R. Bruce Richter, and Neil Robertson. Computing the orientable genus of projective graphs. Journal of Graph Theory, 20(3):297–308, November 1994.
[FHS15]
Pierre Fraigniaud, Juho Hirvonen, and Jukka Suomela. Node labels in local decision. In 22nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 9439 of Lecture Notes in Computer Science, pages 31–45. Springer, July 2015.
[FHT23]
Fabrizio Frati, Michael Hoffmann, and Csaba D. Tóth. Universal geometric graphs. Combinatorics, Probability and Computing, 32(5):742–761, September 2023.
[FHY26]
Noah Fleming, Max Hopkins, and Yuichi Yoshida. Non-signaling locality lower bounds for dominating set. Technical Report 2604.02582v1 [cs.CG], arXiv, March 2022.
[FI25]
Ying Feng and Piotr Indyk. Even faster algorithm for the Chamfer distance. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 75:1–75:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[FIKKx16]
Stefan Felsner, Alexander Igamberdiev, Philipp Kindermann, Boris Klemz, Tamara Mchedlidze, and Manfred Scheucher. Strongly monotone drawings of planar graphs. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 37:1–37:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[Filtser19]
Arnold Filtser. On strong diameter padded decompositions. In Dimitris Achlioptas and László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), volume 145 of LIPIcs, pages 6:1–6:21. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2019.
[Filtser20]
Arnold Filtser. Scattering and sparse partitions, and their applications. Technical Report 2001.04447 [cs.DS], arXiv, January 2020.
[Filtser24]
Arnold Filtser. On sparse covers of minor free graphs, low dimensional metric embeddings, and other applications. Technical Report 2401.14060v1 [cs.DS], arXiv, January 2024.
[FIP06]
Pierre Fraigniaud, David Ilcinkas, and Andrzej Pelc. Oracle size: a new measure of difficulty for communication tasks. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 179–187. ACM Press, July 2006.
[FIS05]
Katalin Friedl, Gábor Ivanyos, and Miklos Santha. Efficient testing of groups. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 157–166. ACM Press, May 2005.
[Fischer09]
Johannes Fischer. Short labels for lowest common ancestors in trees. In Amos Fiat and Peter Sanders, editors, 17th Annual European Symposium on Algorithms (ESA), volume 5757 of Lecture Notes in Computer Science, pages 752–763. Springer, September 2009.
[Fischer10]
Johannes Fischer. Optimal succinctness for range minimum queries. In 11th Latin American Symposium on Theoretical Informatics (LATIN), volume 6034 of Lecture Notes in Computer Science, pages 158–169, 2010.
[FitzGerald74]
Carl H. FitzGerald. Optimal indexing of the vertices of graphs. Mathematics of Computation, 28(127):825–831, 1974.
[FJ00]
Faith Ellen Fich and Andreas Jakoby. Short headers suffice for communication in a DAG with link failures. In 14th International Symposium on Distributed Computing (DISC), volume 1914 of Lecture Notes in Computer Science, pages 360–373. Springer, 2000.
[FJ86]
Greg N. Frederickson and Ravi Janardan. Separator-based strategies for efficient message routing. In 27th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 428–437. IEEE Computer Society Press, October 1986.
[FJ86a]
Greg N. Frederickson and Ravi Janardan. Optimal message routing without complete routing tables. In 5th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 88–97. ACM Press, August 1986.
[FJ88]
Greg N. Frederickson and Ravi Janardan. Designing networks with compact routing tables. Algorithmica, 3(1):171–190, August 1988.
[FJ88a]
Greg N. Frederickson and Ravi Janardan. Space-efficient and fault-tolerant message routing in outerplanar networks. IEEE Transactions on Computers, 37(12):1529–1540, December 1988.
[FJ89]
Greg N. Frederickson and Ravi Janardan. Efficient message routing in planar networks. SIAM Journal on Computing, 18(4):843–857, August 1989.
[FJ90]
Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM Journal on Computing, 19(1):164–181, February 1990.
[FK01]
Sándor P. Fekete and Jana Kremer. Tree spanners in planar graphs. Discrete Applied Mathematics, 108(1-2):85–103, February 2001.
[FK07]
Martin Fürer and Shiva Prasad Kasiviswanathan. Spanners for geometric intersection graphs. In 10th International Workshop on Algorithms and Data Structures (WADS), volume 4619 of Lecture Notes in Computer Science, pages 312–324. Springer, August 2007.
[FK08]
Stefan Felsner and Sarah Kappes. Orthogonal surfaces and their CP-orders. Order, 25(1):19–47, February 2008.
[FK09]
Pierre Fraigniaud and Amos Korman. On randomized representations of graphs using short labels. In 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). ACM Press, August 2009.
[FK10]
Pierre Fraigniaud and Amos Korman. An optimal ancestry scheme and small universal posets. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 611–620. ACM Press, June 2010.
[FK10a]
Fedor V. Fomin and Dieter Kratsch. Exact exponential algorithms. Springer, 2010.
[FK10b]
Pierre Fraigniaud and Amos Korman. Compact ancestry labeling schemes for XML trees. In 21st Symposium on Discrete Algorithms (SODA), pages 458–466. ACM-SIAM, January 2010.
[FK12]
Ofer Feinerman and Amos Korman. Memory lower bounds for randomized collaborative search and implications for biology. In 26th International Symposium on Distributed Computing (DISC), volume 7611 of Lecture Notes in Computer Science, pages 61–75. Springer, October 2012.
[FK13]
Ofer Feinerman and Amos Korman. Theoretical distributed computing meets biology: A review. In 9th International Conference on Distributed Computing and Internet Technology (ICDCIT), volume 7753 of Lecture Notes in Computer Science, pages 1–18. Springer, February 2013.
[FK97]
Zoltán Füredi and Péter Komjáth. Nonexistence of universal graphs without some trees. Combinatorica, 17(2):163–171, June 1997.
[FKK96]
Urich Fößmeier, Goos Kan, and Michael Kaufmann. 2-visibility drawings of planar graphs. In 4th International Symposium on Graph Drawing (GD), volume 1190 of Lecture Notes in Computer Science, pages 155–168. Springer, September 1996.
[FKKLT08]
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, and Gerhard Trippen. Competitive online approximation of the optimal search ratio. SIAM Journal on Computing, 38(3):881–898, 2009.
[FKL07]
Pierre Fraigniaud, Amos Korman, and Emmanuelle Lebhar. Local MST computation with short advice. In 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 154–160. ACM Press, June 2007.
[FKLS12]
Ofer Feinerman, Amos Korman, Zvi Lotker, and Jean-Sébastien Sereni. Collaborative search on the plane without communication. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 77–86. ACM Press, July 2012.
[FKMS04]
Stefan Funke, Alex Kesselman, Ulrich Meyer, and Michael Segal. A simple improved distributed algorithm for minimum CDS in unit disk graphs, October 2004. Draft.
[FKO09]
Nikoloas Fountoulakis, Daniela Kühn, and Deryk Osthus. Minors in random regular graphs. Random Structures and Algorithms, 35(4):393–522, December 2009.
[FKP13]
Pierre Fraigniaud, Amos Korman, and David Peleg. Towards a complexity theory for local distributed computing. Journal of the ACM, 60(5):Article No. 35, pp. 1–26, October 2013.
[FKPP12]
Pierre Fraigniaud, Amos Korman, Merav Parter, and David Peleg. Randomized distributed decision. In 26th International Symposium on Distributed Computing (DISC), volume 7611 of Lecture Notes in Computer Science, pages 371–385. Springer, October 2012.
[FKPR05]
Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, and Radhika Ramamurthi. Graph minors and reliable single message transmission. SIAM Journal on Discrete Mathematics, 19(4):815–847, 2005.
[FKS84]
Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538–544, July 1984.
[FKTV08]
Fedor V. Fomin, Ioan Todinca, Dieter Kratsch, and Yngve Villanger. Exact algorithms for treewidth and minimum fill-in. SIAM Journal on Computing, 38(3):1058–1079, 2008.
[FL03]
Paola Flocchini and Flaminia L. Luccio. A new compact routing technique on series parallel networks. Theory of Computing Systems, 36(2):137–157, 2003.
[FL07]
Stefan Funke and Söeren Laue. Bounded-hop energy-efficient broadcast in low-dimensional metrics via coresets. In 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 4393 of Lecture Notes in Computer Science, pages 272–283. Springer, February 2007.
[FL22]
Arnold Filtser and Hung Le. Low treewidth embeddings of planar and minor-free metrics. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1081–1092. IEEE Computer Society Press, October 2022.
[FL87]
Michael R. Fellows and Michael A. Langston. Nonconstructive advances in polynomial-time complexity. Information Processing Letters, 26(3):157–162, November 1987.
[FL88]
Michael R. Fellows and Michael A. Langston. Nonconstructive tools for proving polynomial-time decidability. Journal of the ACM, 35(3):727–739, July 1988.
[FL89]
Michael R. Fellows and Michael A. Langston. On search, decision and the efficiency of polynomial-time algorithms. In 21st Annual ACM Symposium on Theory of Computing (STOC), pages 501–512. ACM Press, May 1989.
[FL94]
Pierre Fraigniaud and Emmanuel Lazard. Methods and problems of communication in usual networks. Discrete Applied Mathematics, 53(1-3):79–133, September 1994.
[FL96]
Paola Flocchini and Flaminia L. Luccio. Distance routing on series parallel networks. In 16th IEEE International Conference on Distributed Computing Systems (ICDCS), pages 352–359. IEEE Computer Society Press, March 1996.
[Flam94]
Michele Flammini. Private communication in New-York, June 1994.
[Flammini97]
Michele Flammini. Deadlock-free interval routing schemes. In Rüdiger Reischuk and Michel Morvan, editors, 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1200 of Lecture Notes in Computer Science, pages 351–362. Springer, February 1997.
[Flammini97a]
Michele Flammini. On the hardness of devising interval routing schemes. Parallel Processing Letters, 7(1):39–47, March 1997.
[Flammini99]
Michele Flammini. Deadlock-free interval routing schemes. Networks, 34(1):47–60, August 1999.
[Fleischner74]
Herbert Fleischner. The square of every two-connected graph is Hamiltonian. Journal of Combinatorial Theory, Series B, 16(1):29–34, February 1974.
[FLL06]
Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. A doubling dimension threshold Θ(loglogn) for augmented graph navigability. Research Report 2006-09, LIP, École Normale Supérieure de Lyon, February 2006.
[FLL06a]
Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. A doubling dimension threshold Θ(loglogn) for augmented graph navigability. In 8es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2006.
[FLL06b]
Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. A doubling dimension threshold Θ(loglogn) for augmented graph navigability. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 376–386. Springer, September 2006.
[FLLY07]
Jia-Hao Fan, Chun-Cheng Lin, Hsueh-I Lu, and Hsu-Chun Yen. Width-optimal visibility representations of plane graphs. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 160–171. Springer, December 2007.
[FLMM05]
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini, and S. Muthu Muthukrishman. Structuring labeled trees for optimal succinctness, and beyond. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 184–193. IEEE Computer Society Press, October 2005.
[FLMT24]
Pierre Fraigniaud, Maël Luce, Frédéric Magniez, and Ioan Todinca. Even-cycle detection in the randomized and quantum CONGEST model. Technical Report 2402.12018v1 [cs.DC], arXiv, February 2024.
[Floyd62]
Robert W. Floyd. Algorithm 97: Shortest path. Communications of the ACM, 5(6):345, June 1962.
[FLP85]
Michael J. Fischer, Nancy A. Lynch, and Mike Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.
[FLS93]
Pierre Fraigniaud, Arthur L. Liestman, and Dominique Sotteau. Open problems. Parallel Processing Letters, 3(4):507–524, September 1993.
[FLSPW18]
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Michał Pilipczuk, and Marcin Wrochna. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms, 14(3):Article No. 34, pp. 1–45, July 2018.
[FLSZ19]
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Kernelization. Cambridge University Press, January 2019.
[FLV08]
Pierre Fraigniaud, Emmanuelle Lebhar, and Laurent Viennot. The inframetric model for the internet. In 27th Annual IEEE Conference on Computer Communications (INFOCOM), pages 1085–1093, April 2008.
[FLW01]
Stefan Felsner, Giuseppe Liotta, and Stephen K. Wismath. Straight-line drawings on restricted integer grids in two and three dimensions. In 9th International Symposium on Graph Drawing (GD), volume 2265 of Lecture Notes in Computer Science, pages 328–342. Springer, 2001.
[FLW03]
Stefan Felsner, Giuseppe Liotta, and Stephen K. Wismath. Straight-line drawings on restricted integer grids in two and three dimensions. Journal of Graph Algorithms and Applications, 7(4):363–398, 2003.
[FLZ07]
Pierre Fraigniaud, Emmanuelle Lebhar, and Zvi Lotker. Détecter les liens dans les graphes augmentés. Technical Report 6197, INRIA, Thème COM, May 2007.
[FLZ98]
Matthias Fischer, Tamás Lukovszki, and Martin Ziegler. Geometric searching in walkthrough animations with weak spanners in real time. In 6th Annual European Symposium on Algorithms (ESA), volume 1461 of Lecture Notes in Computer Science, pages 163–174. Springer, 1998.
[FM05]
Paolo Ferragina and Giovanni Manzini. Indexing compressed text. Journal of the ACM, 52(4):552–581, July 2005.
[FM05a]
Massimo Franceschetti and Ronald Meester. Navigation in small world networks, a scale-free continuum model, 2005. Under revision.
[FM06]
Uriel Feige and Mohammad Mahdian. Finding small balanced separators. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 375–384. ACM Press, May 2006.
[FM06a]
Gianni Franceschini and J. Ian Munro. Implicit dictionaries with o(1) modifications per update and fast search. In 17th Symposium on Discrete Algorithms (SODA), pages 404–413. ACM-SIAM, January 2006.
[FMMN07]
Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, and Gonzalo Navarro. Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms, 3(2):A20, May 2007.
[FMNP05]
Michele Flammini, Luca Moscardelli, Alfredo Navarra, and Stéphane Pérennès. Asymptotically optimal solutions for small world graphs. In 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 414–428. Springer, September 2005.
[FMNP08]
Michele Flammini, Luca Moscardelli, Alfredo Navarra, and Stéphane Pérennès. Asymptotically optimal solutions for small world graphs. Theory of Computing Systems, 42(4):632–650, 2008.
[FMP08]
Nicola Fusco, Francesco Maggi, and Aldo Pratelli. The sharp quantitative isoperimetric inequality. Annals of Mathematics, 168(3):941–980, 2008.
[FMPPS06]
Paola Flocchini, Mesa Mesa Enriques, Linda Pagli, Giuseppe Prencipe, and Nicola Santoro. Point-of-failure swap rerouting: Computing the optimal swaps distributively. IEICE Transactions on Information and Systems, E89-D(2), 2006.
[FMPRx15]
Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, and Ronald de Wolf. Exponential lower bounds for polytopes in combinatorial optimization. Journal of the ACM, 62(2):1–23, May 2015.
[FMRT21]
Pierre Fraigniaud, Piedro Montealegre Barba, Ivan Rapaport, and Ioan Todinca. A meta-theorem for distributed certification. Technical Report 2112.03195v1 [cs.DS], arXiv, December 2021.
[FMS94]
Paola Flocchini, Bernard Mans, and Nicola Santoro. Sense of direction: Formal definitions and properties. In Paola Flocchini, Bernard Mans, and Nicola Santoro, editors, 1st International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 9–34. Carleton University Press, May 1994.
[FMS97]
Paola Flocchini, Bernard Mans, and Nicola Santoro. On the impact of sense of direction on communication complexity. Information Processing Letters, 63(1):23–31, July 1997.
[FMS98]
Paola Flocchini, Bernard Mans, and Nicola Santoro. Sense of direction: Definitions, properties and classes. Networks, 32(3):165–180, October 1998.
[FMS98a]
Paola Flocchini, Bernard Mans, and Nicola Santoro. Sense of direction in distributed computing. In Shay Kutten, editor, 12th International Symposium on Distributed Computing (DISC), volume 1499 of Lecture Notes in Computer Science, pages 1–15. Springer, September 1998.
[FMTT22]
Majid Farhadi, Jai Moondra, Prasad Tetali, and Alejandro Toriello. Multi purpose optimal routing: New perspectives and algorithms. Technical Report 2208.04410v1 [cs.DS], arXiv, August 2022.
[FMY10]
Jun Fujisawa, Hajime Matsumura, and Tomoki Yamashita. Degree bounded spanning trees. Graphs and Combinatorics, 26:695–720, 2010.
[FMZ07]
Laurent Flindt Muller and Martin Zachariasen. Fast and compact oracles for approximate distances in planar graphs. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 657–668. Springer, October 2007.
[FN06]
Pierre Fraigniaud and Nicolas Nisse. Connected treewidth and connected graph searching. In 7th Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pages 479–490, March 2006.
[FN89]
Amos Fiat and Moni Noar. Implicit O(1) probe search. In 21st Annual ACM Symposium on Theory of Computing (STOC), pages 336–344. ACM Press, May 1989.
[FN96]
Michele Flammini and Enrico Nardelli. On the path length in interval routing schemes. Manuscript, 1996.
[FNV06]
Zoltán Füredi, Assaf Naor, and Jacques Verstraëte. On the Turán number for the hexagon. Advances in Mathematics, 203(2):476–496, 2006.
[FNV07]
Paolo Ferragina, Igor Nitto, and Rossano Venturini. Succinct oracles for exact distances in undirected unweighted graphs. Technical Report TR-07-11, Università di Pisa -- Dipartimento di Informatica, May 2007.
[FNV10]
Paolo Ferragina, Igor Nitto, and Rossano Venturini. On compact representations of all-pairs-shortest-path-distance matrices. Theoretical Computer Science, 411(34-36):3293–3300, July 2010.
[Formella24]
Arno Formella. Quasi-linear time heuristic to solve the Euclidean traveling salesman problem with low gap. Journal of Computational Science, 82(102424), October 2024.
[FOS21]
Orr Fischer, Rotem Oshman, and Dana Shamir. Explicit space-time tradeoffs for proof labeling schemes in graphs with small separators. In 25th International Conference on Principles of Distributed Systems (OPODIS), volume 217 of LIPIcs, pages 21:1–21:22. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2021.
[FOT10]
Fedor V. Fomin, Sang-il Oum, and Dimitrios M. Thilikos. Rank-width and tree-width of H-minor-free graphs. European Journal of Combinatorics, 31(7):1617–1628, October 2010.
[Fox14]
Jacob Fox. The graph regularity method: variants, applications, and alternative methods. In International Congress of Mathematicians (ICM), volume IV, pages 329–353, August 2014.
[FOY09]
Masanobu Furuse, Yota Otachi, and Koichi Yamazaki. Reformulation of the scheme for computing tree-width and minimum fill-in. In 21st Japan Conference on Computational Geometry and Graphs (JCCGG), pages 1–2, November 2009.
[FOZ20]
Orr Fischer, Rotem Oshman, and Uri Zwick. Public vs. private randomness in simultaneous multi-party communication complexity. Theoretical Computer Science, 810:72–81, March 2020.
[FP94]
Eric Fleury and Marc Picquendar. Massivelly parallel machine based on T9000 and C104. Research Report 94-14, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, May 1994. (short version in Transputers'94).
[FPR20]
Fabrizio Frati, Maurizio Patrignani, and Vincenzo Roselli. LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. Journal of Computer and System Sciences, 107:28–53, February 2020.
[FPRU90]
Uriel Feige, Prabhakar Raghavan, and Eli Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447–460, 1990.
[FPS02]
Irene Finocchi, Alessandro Panconesi, and Riccardo Silvestri. An experimental analysis of simple, distributed vertex coloring algorithms. In 13th Symposium on Discrete Algorithms (SODA), pages 606–615. ACM-SIAM, January 2002.
[FPS05]
Éric Fusy, Dominique Poulalhon, and Gilles Schaeffer. Dissections and trees: applications to optimal mesh encoding and random sampling. In 16th Symposium on Discrete Algorithms (SODA), pages 690–699. ACM-SIAM, January 2005.
[FPS11]
Philippe Flajolet, Maryse Pelletier, and Michèle Soria. On buffon machines and numbers. In 22nd Symposium on Discrete Algorithms (SODA), pages 172–183. ACM-SIAM, January 2011.
[FPST18]
Grzegorz Fabiański, Michał Pilipczuk, Sebastian Siebertz, and Szymon Toruńczyk. Progressive algorithms for domination and independence. Technical Report 1811.06799v1 [cs.LO], arXiv, November 2018.
[FPZW04]
Arthur M. Farley, Andrzej Proskurowski, Daniel Zappala, and Kurt Windisch. Spanners and message distribution in networks. Discrete Applied Mathematics, 137(2):159–171, March 2004.
[FR01]
Jittat Fakcharoenphol and Satish B. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 232–241. IEEE Computer Society Press, October 2001.
[FR06]
Jittat Fakcharoenphol and Satish B. Rao. Planar graphs, negative weight edges, shortest paths, and near linear time. Journal of Computer and System Sciences, 72(5):868–889, August 2006.
[FR07]
Daniel Fernholz and Vijaya Ramachandran. The diameter of sparse random graphs. Random Structures and Algorithms, 31(4):482–516, October 2007.
[FR94]
Martin Fürer and B. Raghavachari. Approximating the minimum degree Steiner tree to within one of optimal. Journal of Algorithms, 17(3):409–423, November 1994.
[Fraigniaud00]
Pierre Fraigniaud. Approximation algorithms for collective communications with limited link and node-contention. Research Report LRI-1264, LRI, Université Paris-Sud, 91405 Orsay cedex, France, 2000.
[Fraigniaud01]
Pierre Fraigniaud. Approximation algorithms for minimum-time broadcast under the vertex-disjoint paths mode. In 9th Annual European Symposium on Algorithms (ESA), volume 2161 of Lecture Notes in Computer Science, pages 440–451. Springer, August 2001.
[Fraigniaud05]
Pierre Fraigniaud. A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs. In 13th Annual European Symposium on Algorithms (ESA), volume 3669 of Lecture Notes in Computer Science, pages 791–802. Springer, February 2005.
[Fraigniaud05a]
Pierre Fraigniaud. A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs. Research Report LRI-1397, LRI, Université Paris-Sud, 91405 Orsay cedex, France, February 2005.
[Fraigniaud06]
Pierre Fraigniaud. Search grames and cop-and-robber games, November 2006. Workshop in Bertinoro.
[Fraigniaud07]
Pierre Fraigniaud. Small worlds as navigable augmented networks: Model, analysis, and validation. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 2–11. Springer, October 2007.
[Frankl87]
Peter Frankl. Cops and robbers in graphs with large girth and cayley graphs. Discrete Applied Mathematics, 17(3):301–305, June 1987.
[Frati07]
Fabrizio Frati. On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs. In 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 4769 of Lecture Notes in Computer Science, pages 133–144. Springer, 2007.
[Frati08]
Fabrizio Frati. A lower bound on the area requirements of series-parallel graphs. In H. Broersma, T. Erlebach, T. Friedetzky, and D. Paulusma, editors, 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 5344 of Lecture Notes in Computer Science, pages 159–170. Springer, June 2008.
[Frati10]
Fabrizio Frati. Improved lower bounds on the area requirements of series-parallel graphs. In U. Brandes and S. Cornelsen, editors, 18th International Symposium on Graph Drawing (GD), volume 6502 of Lecture Notes in Computer Science, pages 220–225. Springer, September 2010.
[Frati12]
Fabrizio Frati. Straight-line drawings of outerplanar graphs in O(dnlogn) area. Computational Geometry: Theory and Applications, 45(9):524–533, November 2012.
[Fred87]
Greg N. Frederickson. A new approach to all pairs shortest paths in planar graphs. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 19–28. ACM Press, May 1987.
[Fred89]
Greg N. Frederickson. Using cellular graph embedding in solving all pairs shortest paths problems. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 448–453. IEEE Computer Society Press, October 1989.
[Fred91]
Greg N. Frederickson. Planar graph decomposition and all pairs shortest paths. Journal of the ACM, 38(1):162–204, January 1991.
[Fred93]
Greg N. Frederickson. Searching among intervals and compact routing tables. In Andrzej Lingas, Rolf Karisson, and Svante Carlsson, editors, 20th International Colloquium on Automata, Languages and Programming (ICALP), volume 700 of Lecture Notes in Computer Science, pages 28–39. Springer-Verlag, July 1993.
[Fred95]
Greg N. Frederickson. Using cellular graph embedding in solving all pairs shortest paths problems. Journal of Algorithms, 19(1):45–85, July 1995.
[Fred96]
Greg N. Frederickson. Searching among intervals and compact routing tables. Algorithmica, 15(5):448–466, May 1996.
[Fredman75]
Michael L. Fredman. Two applications of a probabilistic search technique: Sorting x + y and building balanced search trees. In 7th Annual ACM Symposium on Theory of Computing (STOC), pages 240–244. ACM Press, May 1975.
[Fredman79]
Michael L. Fredman. A near optimal data structure for a type of range query problem. In 11th Annual ACM Symposium on Theory of Computing (STOC), pages 62–66. ACM Press, April 1979.
[Fredman81]
Michael L. Fredman. Lower bounds on the complexity of some optimal data structures. SIAM Journal on Computing, 10(1):1–10, 1981.
[Fredman81a]
Michael L. Fredman. A lower bound on the complexity of orthogonal range queries. Journal of the ACM, 28(4):696–705, October 1981.
[Fredman82]
Michael L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250–260, January 1982.
[Frick04]
Markus Frick. Generalized model-checking over locally tree-decomposable classes. Theory of Computing Systems, 37:157–191, 2004.
[FRRS05]
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, and Stefan Szeider. Proving NP-hardness for clique-width II: non-approximabilit of clique-width. In Electronic Colloquium on Computational Complexity (ECCC), TR05-081 (revision 1), August 2005.
[FRRS06]
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, and Stefan Szeider. Clique-width minimization is NP-hard. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 354–362. ACM Press, May 2006.
[FRS96]
Paola Flocchini, Alessandro Roncato, and Nicola Santoro. Complete symmetries and minimal sense of direction in labeled graphs. In 27th SE Conference on Combinatorics, Graph Theory and Computing, volume 121 of Congressus Numerantium, pages 3–18, 1996.
[FRS98]
Paola Flocchini, Alessandro Roncato, and Nicola Santoro. Symmetries and sense of direction in labeled graphs. Discrete Applied Mathematics, 87(1-3):99–115, October 1998.
[FRT03]
Jittat Fakcharoenphol, Satish B. Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In 35th Annual ACM Symposium on Theory of Computing (STOC), pages 448–455. ACM Press, 2003. To appear in JCSS.
[FRT04]
Jittat Fakcharoenphol, Satish B. Rao, and Kunal Talwar. Approximating metrics by tree metrics (survey). ACM SIGACT News - Algorithms Column, 35(2):60–70, June 2004.
[FS08]
Jacob Fox and Benny Sudakov. Induced Ramsey-type theorems. Advances in Mathematics, 219(6):1771–1800, December 2008.
[FS13]
Zoltán Füredi and Miklós Simonovits. The history of degenerate (bipartite) extremal graph problems. In László Lovász, Imre Z. Ruzsa, and Vera T. Sós, editors, Erdős Centennial, volume 25 of Bolyai Society Mathematical Studies, pages 169–264. János Bolyai Mathematical Society and Springer-Verlag, 2013.
[FS89]
Michael L. Fredman and Michael E. Saks. The cell probe complexity of dynamic data structures. In 21st Annual ACM Symposium on Theory of Computing (STOC), pages 345–354. ACM Press, May 1989.
[FS99]
Roger Fischlin and Jean-Pierre Seifert. Tensor-based trapdoors for CVP and their application to public key cryptography. In 7th IMA International Conference (Cryptography and Coding), volume 1746 of Lecture Notes in Computer Science, pages 240–257. Springer, December 1999.
[FSSS23]
Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, and Raphael Steiner. Linear size universal point sets for classes of planar graphs. In Erin W. Chambers and Joachim Gudmundsson, editors, 39th International Symposium on Computational Geometry (SoCG), volume 258 of LIPIcs, pages 31:1–31:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2023.
[FT03]
Fedor V. Fomin and Dimitrios M. Thilikos. Dominating sets and local treewidth. In Giuseppe di Battista and Uri Zwick, editors, 11th Annual European Symposium on Algorithms (ESA), volume 2832 of Lecture Notes in Computer Science, pages 221–229. Springer, September 2003.
[FT03a]
Jittat Fakcharoenphol and Kunal Talwar. An improved decomposition theorem for graphs excluding a fixed minor. In 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), and 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), volume 2764 of Lecture Notes in Computer Science, pages 36–46. Springer, August 2003.
[FT06]
Fedor V. Fomin and Dimitrios M. Thilikos. Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM Journal on Computing, 36(2):281–306, 2006.
[FTV15]
Fedor V. Fomin, , Ioan Todinca, and Yngve Villanger. Large induced sub-graphs via triangulations and CMSO. SIAM Journal on Computing, 44(1):54–87, 2015.
[Fu05]
Bin Fu. Theory and application of width bounded geometric separator. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 2005.
[Fu06]
Bin Fu. Theory and application of width bounded geometric separator. In 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3884 of Lecture Notes in Computer Science, pages 277–288. Springer, February 2006.
[Fuladi23]
Niloufar Fuladi. Embedded graphs: Crossings and decompositions. PhD thesis, Université Gustave Eiffel, Champs-sur-Marne, France, December 2023.
[Fuladi23p]
Niloufar Fuladi. Private communication, May 2023.
[Furedi91]
Zoltán Füredi. On a Turán type problem of Erdős. Combinatorica, 11:75–79, March 1991.
[Furedi96]
Zoltán Füredi. New asymptotics for bipartite Turán numbers. Journal of Combinatorial Theory, Series A, 75(1):141–144, July 1996.
[Furer06]
Martin Fürer. A faster algorithm for finding maximum independent sets in sparse graphs. In 7th Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pages 491–501, March 2006.
[Furer09]
Martin Fürer. Faster multiplication algorithm. SIAM Journal on Computing, 39(3):979–1005, 2009.
[Fusy06]
Éric Fusy. Straight-line drawing of quadrangulations. In 14th International Symposium on Graph Drawing (GD), volume 4372 of Lecture Notes in Computer Science, pages 234–239. Springer, 2006.
[FV07]
Paolo Ferragina and Rossano Venturini. Note: A simple storage scheme for strings achieving entropy bounds. Theoretical Computer Science, 372(1):115–121, March 2007.
[FV81]
Michael L. Fredman and Dennis J. Volper. Query time versus redundancy trade-offs for range queries. Journal of Computer and System Sciences, 23(3):355–365, December 1981.
[FvLS94]
Michele Flammini, Jan van Leeuwen, and Alberto Marchetti-Spaccamela. Lower bounds on interval routing. Technical Report 69, Università di L'Aquila, Dipartimento di matematica Pura ed Applicata, October 1994.
[FvLS95]
Michele Flammini, Jan van Leeuwen, and Alberto Marchetti-Spaccamela. The complexity of interval routing on random graphs. Technical Report UU-CS-1995-16, Utrecht University, Department of Computer Science, Padualaan 14, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands, May 1995.
[FvLS95a]
Michele Flammini, Jan van Leeuwen, and Alberto Marchetti-Spaccamela. The complexity of interval routing on random graphs. In Jiří Wiederman and Petr Hájek, editors, 20th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 969 of Lecture Notes in Computer Science, pages 37–49. Springer-Verlag, August 1995.
[FvLS98]
Michele Flammini, Jan van Leeuwen, and Alberto Marchetti-Spaccamela. The complexity of interval routing on random graphs. The Computer Journal, 41(1):16–25, 1998.
[FW07]
Roland Flury and Roger Wattenhofer. Routing, anycast, and multicast for mesh and sensor networks. In 26th Annual IEEE Conference on Computer Communications (INFOCOM), pages 946–954, May 2007.
[FW08]
Roland Flury and Roger Wattenhofer. Randomized 3D geographic routing. In 27th Annual IEEE Conference on Computer Communications (INFOCOM), pages 834–842, April 2008.
[FW90]
Michael L. Fredman and Dan E. Willard. BLASTING through the information theoretic barrier with FUSION TREES. In 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 1–7. ACM Press, May 1990.
[FW93]
Michael L. Fredman and Dan E. Willard. Surpassing the information theoretic bound with fusion trees. Journal of Computer and System Sciences, 47(3):424–436, December 1993.
[FW94]
Michael L. Fredman and Dan E. Willard. Trans-dichotomous algorithms for minimum spanning trees and shortest paths. Journal of Computer and System Sciences, 48(3):533–551, June 1994.
[FZ08]
Stefan Felsner and Florian Zickfeld. Schnyder woods and orthogonal surfaces. Discrete & Computational Geometry, 40(1):103–126, July 2008.
[GA83]
Hana Galperin and Avi Wigderson. Succinct representations of graphs. Information and Control, 56(3):183–198, March 1983.
[Gabow95]
Harold N. Gabow. Algorithms for graphic polymatroids and parametric s-sets. In 6th Symposium on Discrete Algorithms (SODA), pages 88–97. ACM-SIAM, January 1995.
[Gallager82]
Robert G. Gallager. Distributed minimum hop algorithms. Technical Report LIDS-P-1175, M.I.T., Cambridge, MA, January 1982.
[Gallian18]
Joseph A. Gallian. A dynamic survey of graph labeling. The Electronic Journal of Combinatorics, Dynamic Survey(#DS6), December 2018.
[GAM24]
Annisa Kesy Garside, Robiah Ahmad, and Mohd Nabil Bin Muhtazaruddina. A recent review of solution approaches for green vehicle routing problem and its variants. Operations Research Perspectives, 22:100303, June 2024.
[Ganjali01]
Yashar Ganjali. Characterizing networks supporting multi-dimensional linear interval routing schemes. In 8th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 163–178. Carleton Scientific, June 2001.
[Ganjali01a]
Yashar Ganjali. Multi-dimensional interval routing schemes. Master of mathematics in computer science thesis, University of Waterloo, Ontario, Canada, May 2001.
[Ganjali03]
Yashar Ganjali. Optimum multi-dimensional interval routing schemes on networks with dynamic cost links. Computing and Informatics, 22(1):1–17, 2003.
[Gao01]
Ji Gao. Normal structure and the arc length in Banach spaces. Taiwanese Journal of Mathematics, 5(2):353–366, June 2001.
[Gao06]
Yong Gao. On the threshold of having a linear treewidth in random graphs. In 12th Annual International Computing & Combinatorics Conference (COCOON), volume 4112 of Lecture Notes in Computer Science, pages 226–234. Springer, August 2006.
[Gardner02]
Richard J. Gardner. The Brunn-Minkowski inequality. Bulletin of the American Mathematical Society (New Series), 39(3):355–405, April 2002.
[Gav00]
Cyril Gavoille. A survey on interval routing. Theoretical Computer Science, 245(2):217–253, August 2000.
[Gav00a]
Cyril Gavoille. On the dilation of interval routing. The Computer Journal, 43(1):243–249, 2000.
[Gav00b]
Cyril Gavoille. Structures de données compactes et distribuées, December 2000. Thèse d'habilitation à diriger les recherches, Université de Bordeaux.
[Gav01]
Cyril Gavoille. Routing in distributed networks: Overview and open problems. ACM SIGACT News - Distributed Computing Column, 32(1):36–52, March 2001.
[Gav01a]
Cyril Gavoille. A note on implicit representation of graphs. Research Report RR-1268-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, December 2001.
[Gav09]
Cyril Gavoille. Spanner et routage compact : similarités et différences. In 11es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume inria-00383276. HAL, June 2009.
[Gav92]
Cyril Gavoille. Evaluation of the MasPar MP-1 performances. Technical Report 92-01, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, February 1992.
[Gav93]
Cyril Gavoille. Routage par intervalles. Stage de DEA, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, June 1993.
[Gav94]
Cyril Gavoille. Routages efficaces et compacts. In Luc Bougé, Michel Cosnard, and Pierre Fraigniaud, editors, 6es Rencontres Francophones du Parallélisme (RenPar), page 298, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, June 1994.
[Gav96b]
Cyril Gavoille. Lower bounds for interval routing on bounded degree networks. Research Report RR-1144-96, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, October 1996.
[Gav96c]
Cyril Gavoille. On dilation of interval routing. Research Report RR-1145-96, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, November 1996.
[Gav96phd]
Cyril Gavoille. Complexité mémoire du routage dans les réseaux distribués. PhD thesis, École Normale Supérieure de Lyon, 46, allée d'Italie, January 1996.
[Gav97]
Cyril Gavoille. On the dilation of interval routing. In Igor Prívara and Peter Ružička, editors, 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1300 of Lecture Notes in Computer Science, pages 259–268. Springer, August 1997.
[Gav97a]
Cyril Gavoille. A survey on interval routing scheme. Research Report RR-1182-97, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, October 1997.
[Gavril02]
Fǎnicǎ Gavril. Algorithms for maximum weight induced paths. Information Processing Letters, 81(4):203–208, February 2002.
[Gavril74]
Fǎnicǎ Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. Journal of Combinatorial Theory, Series B, 16(1):47–56, February 1974.
[GBL08]
Timothy Gowers, June Barrow-Green, and Imre Leader. The Princeton companion to mathematics. Princeton University Press, Princeton and Oxford, 2008.
[GBR99]
Cyril Gavoille, Jean-Claude Bermond, and André Raspaud. Proceedings of the 6th international colloquium on structural information & communication complexity, sirocco 6. Carleton Scientific, July 1999.
[GCLMR23]
Natalia García-Colín, Dimitri Leemans, Mia Müßig, and Érika Roldán. There is no perfect Mondrian partition for squares of side lengths less than 1001. Technical Report 2311.02385v1 [math.CO], arXiv, November 2023.
[GdBM23]
Timothée Goubault de Brugière and Simon Martiel. Shallower CNOT circuits on realistic quantum hardware. Technical Report 2303.07302v1 [quant-ph], arXiv, March 2023.
[GdLH90]
Étienne Ghys and Pierre de la Harpe. Sur les groupes hyperboliques d'après mikhael gromov, volume 83 of Progress in Mathematics. Birkhäuser, 1990.
[Georga09]
Agelos Georgakopoulos. A short proof of Fleischner's theorem. Discrete Mathematics, 309(23-24):6632–6634, December 2009.
[Georga22]
Agelos Georgakopoulos. On graph classes with minor-universal elements. Technical Report 2212.054998v1 [math.CO], arXiv, December 2022.
[Georgiadis10]
Loukas Georgiadis. Testing 2-vertex connectivity and computing pairs of vertex-disjoint s-t paths in digraphs. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 738–749. Springer, July 2010.
[Gerbner21]
Dániel Gerbner. Generalized Turán problems for K2,t. Technical Report 2107.10610v1 [math.CO], arXiv, July 2021.
[GG01]
Cyril Gavoille and Marc Gengler. Space-efficiency of routing schemes of stretch factor three. Journal of Parallel and Distributed Computing, 61(5):679–687, 2001.
[GG23]
Mohsen Ghaffari and Christoph Grunau. Faster deterministic distributed MIS and approximate matching. In 55th Annual ACM Symposium on Theory of Computing (STOC), pages 1777–1790. ACM Press, June 2023.
[GG24]
Mohsen Ghaffari and Christoph Gruneau. Near-optimal deterministic network decomposition and ruling set, and improved MIS. Technical Report 2410.1951v1 [cs.DS], arXiv, October 2024.
[GG95]
Cyril Gavoille and Eric Guévremont. Worst case bounds for shortest path interval routing. Research Report 95-02, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, January 1995.
[GG95a]
Cyril Gavoille and Eric Guévremont. On the compactness of bounded degree graphs for shortest path interval routing. In Lefteris M. Kirousis and Evangelos Kranakis, editors, 2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 113–121. Carleton University Press, June 1995.
[GG97]
Cyril Gavoille and Marc Gengler. Space-efficiency of routing schemes of stretch factor three. In Danny Krizanc and Peter Widmayer, editors, 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 162–175. Carleton Scientific, July 1997.
[GG97a]
Cyril Gavoille and Marc Gengler. Space-efficiency of routing schemes of stretch factor three. Research Report RR-1181-97, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, October 1997.
[GG98]
Cyril Gavoille and Eric Guévremont. Worst case bounds for shortest path interval routing. Journal of Algorithms, 27(1):1–25, April 1998.
[GGGRR07]
Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, and Satti Srivivasa Rao. On the size of succinct indices. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 371–382. Springer, October 2007.
[GGHI13]
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, and David Ilcinkas. On the communication complexity of distributed name-independent routing schemes. In 27th International Symposium on Distributed Computing (DISC), volume 8205 of Lecture Notes in Computer Science, pages 418–432. Springer, October 2013.
[GGHI13a]
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, and David Ilcinkas. Algorithme distribué de routage compact en temps optimal. In 15es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume hal-00818445, pages 117–120. HAL, May 2013.
[GGHI15]
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, and David Ilcinkas. Brief announcement: Routing the Internet with very few entries. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 33–35. ACM Press, July 2015.
[GGHI15a]
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, and David Ilcinkas. Router dans internet avec quinze entrées. In 17es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume hal-01149335. HAL, May 2015.
[GGK21]
Alirio Gómez Gómez and Pedro L. Kaufmann. On the Vapnik-Chervonenkis dimension of products of intervals in ℝd. Technical Report 2104.07136v1 [math.MG], arXiv, April 2021.
[GGNW08]
Stefanie Gerke, Omer Giménez, Marc Noy, and Andreas Weißl. The number of graphs not containing K3,3 as a minor. The Electronic Journal of Combinatorics, 15(R114), 2008.
[GGR21]
Mohsen Ghaffari, Christoph Grunau, and Václav Rozhon. Improved deterministic network decomposition. In 32nd Symposium on Discrete Algorithms (SODA), pages 2904–2923. ACM-SIAM, January 2021.
[GGT95]
Ashim Garg, Michael T. Goodrich, and Roberto Tamassia. Planar upward tree drawings with optimal area, February 1995. Full version of SoCG '93.
[GGV10]
Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Multipath spanners. In 17th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 6058 of Lecture Notes in Computer Science, pages 211–223. Springer, June 2010.
[GGV10a]
Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Graphes de recouvrement multichemins. In 12es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume inria-00475970. HAL, June 2010.
[GGV10b]
Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Spanners additifs de taille sous-quadratique pour les graphes orientés. In 12es Journées Graphes et Algorithmes, page 9, November 2010.
[GGV11]
Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Node-disjoint multipath spanners and their relationship with fault-tolerant spanners. In 15th International Conference on Principles of Distributed Systems (OPODIS), volume 7109 of Lecture Notes in Computer Science, pages 143–158. Springer, December 2011.
[GGV11a]
Cyril Gavoille, Quentin Godfroy, and Laurent Viennot. Node-disjoint multipath spanners and their relationship with fault-tolerant spanners. Technical Report hal-00622915, HAL, September 2011.
[GH04]
Yashar Ganjali and MohammadTaghi Hajiaghayi. Characterizing networks supporting multi-dimensional linear interval routing schemes. Theoretical Computer Science, 326(1-3):103–116, October 2004.
[GH07]
George George Giakkoupis and Vassos Hadzilacos. On the complexity of greedy routing in ring-based peer-to-peer networks. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 99–108. ACM Press, August 2007.
[GH08]
Cyril Gavoille and Nicolas Hanusse. On compact encoding of pagenumber k graphs. Discrete Mathematics & Theoretical Computer Science, 10(3):23–34, January 2008.
[GH12]
Cyril Gavoille and Pierre Halftermeyer. Connexité dans l'urgence. In 14es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume hal-00690561, pages 75–78. HAL, May 2012.
[GH12a]
Cyril Gavoille and Pierre Halftermeyer. Connectivity labeling scheme for graphs on surface. In Bordeaux Graph Workshop (BGW), pages 69–70, November 2012.
[GH13]
Wayne Goddard and Michael A. Henning. Independent domination in graphs: A survey and recent results. Discrete Mathematics, 313(7):839–854, April 2013.
[GH13a]
Hayk Grigoryan and Hovhannes A. Harutyunyan. Tight bound on the diameter of the knödel graph. In Thierry Lecroq and Laurent Mouchard, editors, 24th International Workshop on Combinatorial Algorithms (IWOCA), volume 8288 of Lecture Notes in Computer Science, pages 206–215. Springer, July 2013.
[GH16a]
Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks I: Planar embedding. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 29–38. ACM Press, July 2016.
[GH16b]
Mohsen Ghaffari and Bernhard Haeupler. Distributed algorithms for planar networks II: Low-congestion shortcuts, MST, and Min-Cut. In 27th Symposium on Discrete Algorithms (SODA), pages 202–219. ACM-SIAM, January 2016.
[GH20]
Cyril Gavoille and Claire Hilaire. Dessin et mineur de graphe. In 22es Journées Graphes et Algorithmes, page 47, November 2020.
[GH21]
Cyril Gavoille and Claire Hilaire. Grilles majeures de graphes dessinés. In 23es Journées Graphes et Algorithmes, November 2021.
[GH21a]
Mohsen Ghaffari and Bernhard Haeupler. Low-congestion shortcuts for graphs excluding dense minors. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, 40th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 213–221. ACM Press, July 2021.
[GH21b]
Mohsen Ghaffari and Bernhard Haeupler. A time-optimal randomized parallel algorithm for MIS. In 32nd Symposium on Discrete Algorithms (SODA), pages 2892–2903. ACM-SIAM, January 2021.
[GH23]
Cyril Gavoille and Claire Hilaire. Minor-universal graph for graphs on surfaces. Technical Report hal-04090935, HAL, May 2023.
[GH23b]
Cyril Gavoille and Claire Hilaire. Graphes mineur-universels pour les graphes plongés sur des surfaces. In 25es Journées Graphes et Algorithmes, page 23, November 2023.
[GH64]
Paul C. Gilmore and Alan J. Hoffman. A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics, 16:539–548, 1964.
[GH99]
Cyril Gavoille and Nicolas Hanusse. Compact routing tables for graphs of bounded genus. In Jiří Wiedermann, Peter van Emde Boas, and Mogens Nielsen, editors, 26th International Colloquium on Automata, Languages and Programming (ICALP), volume 1644 of Lecture Notes in Computer Science, pages 351–360. Springer, July 1999.
[GH99a]
Cyril Gavoille and Nicolas Hanusse. Compact routing tables for graphs of bounded genus. Research Report RR-1213-99, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 1999.
[GH99b]
Cyril Gavoille and Nicolas Hanusse. Routage compact dans les réseaux de genre borné. In 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), pages 1–5. INRIA, May 1999.
[Ghaffari14]
Mohsen Ghaffari. Near-optimal distributed approximation of minimum-weight connected dominating set. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, 41st International Colloquium on Automata, Languages and Programming (ICALP), volume 8573 of Lecture Notes in Computer Science (ARCoSS), pages 483–494. Springer, July 2014.
[Ghaffari16]
Mohsen Ghaffari. An improved distributed algorithm for maximal independent set. In 27th Symposium on Discrete Algorithms (SODA), pages 270–277. ACM-SIAM, January 2016.
[Ghaffari17]
Mohsen Ghaffari. Distributed MIS via all-to-all communication. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 141–149. ACM Press, July 2017.
[Ghaffari17a]
Mohsen Ghaffari. Improved distributed algorithms for fundamental graph problems. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, February 2017.
[Ghaffari22]
Mohsen Ghaffari. Local computation of maximal independent set. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 438–449. IEEE Computer Society Press, October 2022.
[GHHST09]
A. Garcí, Ferran Hurtado, Clemens Huemer, Jens M. Schmidt, and J. Tejel. On triconnected and cubic plane graphs on given point sets. Computational Geometry: Theory and Applications, 42(9):913–922, November 2009.
[GHK18]
Mohsen Ghaffari, David G. Harris, and Fabian Kuhn. On derandomizing local distributed algorithms. In 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 662–673. IEEE Computer Society Press, October 2018.
[GHK94]
Miltos D. Grammatikakis, D. Frank Hsu, and Miro Kraetzl. Multicomputer routing. Manuscript, March 1994.
[GHKKT16]
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, and Csaba D. Tóth. The planar tree packing theorem. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 41:1–41:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[GHKM18]
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, and Yannic Maus. Improved distributed delta-coloring. In 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 427–436. ACM Press, July 2018.
[GHL07]
Irina Gribkovskaia, Øyvind Halskau Sr., and Gilbert Laporte. The bridges of königsberg - A historical perspective. Networks, 47(3):199–203, May 2007.
[GHLBM25]
Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, and Taïssir Marcé. Distributed freeze tag: a sustainable solution to discover and wake-up a robot swarm. Technical Report 2503.22521v1 [cs.DS], arXiv, March 2025.
[GHLBM25a]
Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, and Taïssir Marcé. Réveil de robots distribué optimal. In 27es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume hal-05029176. HAL, June 2025.
[GHLBM25b]
Cyril Gavoille, Nicolas Hanusse, Gabriel Le Bouder, and Taïssir Marcé. Distributed freeze tag: a sustainable solution to discover and wake-up a robot swarm. In 44th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 383–393. ACM Press, June 2025.
[GHOOx13]
Jakub Gajarský, Petr Hliněný, Jan Obdržálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, and Somnath Sikdar. Kernelization using structural parameters on sparse graph classes. In Hans L. Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 529–540. Springer, September 2013.
[GHS09]
Mohsen Ghaffari, Behnoosh Hariri, and Shervin Shirmohammadi. On the necessary and sufficient condition of greedy routing supporting geographical data networks. Technical Report 0903.5208v1 [cs.CG], arXiv, March 2009.
[GHS12]
Mika Göös, Juho Hirvonen, and Jukka Suomela. Lower bounds for local approximation. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 175–184. ACM Press, July 2012.
[GHS13]
Mika Göös, Juho Hirvonen, and Jukka Suomela. Lower bounds for local approximation. Journal of the ACM, 60(5):Article No. 39, pp. 1–23, October 2013.
[GHS14]
Mika Göös, Juho Hirvonen, and Jukka Suomela. Linear-in-δ lower bounds in the LOCAL model. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 86–95. ACM Press, July 2014.
[GHS83]
Robert G. Gallager, Pierre A. Humblet, and Philip M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5(1):66–77, January 1983.
[GHSV07]
Ankur Gupta, Wing-Kai Hon, Rahul Shah, and Jeffrey Scott Vitter. A framework for dynamizing succinct data structures. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 521–532. Springer, July 2007.
[GHT84]
John R. Gilbert, Joan P. Hutchinson, and Robert Endre Tarjan. A separation theorem for graphs of bounded genus. Journal of Algorithms, 5(3):391–407, September 1984.
[GHW79]
Henry H. Glover, John Philip Huneke, and Chin San Wang. 103 graphs that are irreducible for the projective plane. Journal of Combinatorial Theory, Series B, 27(3):332–370, December 1979.
[Ghys05]
Étienne Ghys. Poincaré et son disque, 2005.
[GHZ89]
Daniel M. Greenberger, Michael A. Horne, and Anton Zeilinger. Going beyond Bell's Theorem. In Bell's Theorem, Quantum Theory, and Conceptions of the Universe, pages 69–72. Kluwer, 1989.
[GI16]
Cyril Gavoille and David Ilcinkas. Proceedings of the 30th international symposium on distributed computing, disc 2016, paris, france, september 27-29, 2016, volume 9888 of Lecture Notes in Computer Science (ARCoSS). Springer, September 2016.
[Gimenez14]
Omer Giménez. Random planar graphs and beyond. In International Congress of Mathematicians (ICM), volume IV, pages 407–430, August 2014.
[GIP18]
Daniel Goncalves, Lucas Isenmann, and Claire Pennarun. Planar graphs as L-intersection or L-contact graphs. In 29th Symposium on Discrete Algorithms (SODA), pages 172–184. ACM-SIAM, 2018.
[Gisin12]
Nicolas Gisin. Non-localité quantique et relativité, December 2012. Expoé au collège de physique et de philosophie.
[Giulietti07]
Massimo Giulietti. On small dense sets in Galois planes. The Electronic Journal of Combinatorics, 14:#R75, 2007.
[GJ22]
Paweł Gawrychowski and Wojciech Janczewski. Simpler adjacency labeling for planar graphs with B-trees. In 25th Symposium on Simplicity in Algorithms (SOSA), pages 24–36. ACM-SIAM, January 2022.
[GJ22a]
Cyril Gavoille and Amaury Jacques. Graphes universels pour de petites familles de graphes. In 24es Journées Graphes et Algorithmes, November 2022.
[GJ24]
Cyril Gavoille and Amaury Jacques. Graphe universel pour les graphes sans mineur. In 26es Journées Graphes et Algorithmes, November 2024.
[GJ25]
Cyril Gavoille and Amaury Jacques. Lower bounds for induced-universal graphs. In Luciano N. Grippo and Martín D. Safe, editors, 13rd Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 273, pages 62–69. Procedia Computer Science, November 2025.
[GJ25a]
Cyril Gavoille and Amaury Jacques. Lower bounds for induced-universal graphs. Technical Report 2508.11585v1 [math.CO], arXiv, August 2025.
[GJ25c]
Paweł Gawrychowski and Wojciech Janczewski. Optimal distance labeling for permutation graphs. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 86:1–86:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[GJ79]
Michael R. Garey and David S. Johnson. Computers and intractability - a guide to the theory of NP-completeness. W.H. Freeman, 1979.
[GJ83]
Ian P. Goulden and David M. Jackson. Combinatorial enumeration. John Wiley & Sons, 1983.
[GJL21]
Paweł Gawrychowski, Wojciech Janczewski, and Jakub Łopuszański. Shorter labels for routing in trees. In 32nd Symposium on Discrete Algorithms (SODA), pages 2174–2193. ACM-SIAM, January 2021.
[GJNW21]
Carla Groenland, Gwenaël Joret, Wojciech Nadara, and Bartosz Walczak. Approximating pathwidth for graphs of small treewidth. In 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 1965–1976. ACM Press, January 2021.
[GJS76]
Michael R. Garey, David S. Johnson, and H.C. So. An application of graph coloring to printed circuit testing. IEEE Transactions on Circuits and Systems, CAS-23(10):591–599, October 1976.
[GJT76]
Michael R. Garey, David S. Johnson, and Robert Endre Tarjan. The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing, 5(4):704–714, 1976.
[GK13]
Mohsen Ghaffari and Fabian Kuhn. Distributed minimum cut approximation. In 27th International Symposium on Distributed Computing (DISC), volume 8205 of Lecture Notes in Computer Science, pages 1–15. Springer, October 2013.
[GK19]
Mohsen Ghaffari and Fabian Kuhn. On the use of randomness in local distributed graph algorithms. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 290–299. ACM Press, July 2019.
[GK22]
Mohsen Ghaffari and Fabian Kuhn. Deterministic distributed vertex coloring: Simpler, faster, and without network decomposition. In 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1009–1020. IEEE Computer Society Press, February 2022.
[GK25]
Alexandr Grebennikov and Matthew Kwan. Edge-statistics beyond 1/e. Technical Report 2510.24691v1 [math.CO], arXiv, October 2025.
[GK98]
Sudipto Guha and Samir Khuller. Approximation algorithms for connected dominating sets. Algorithmica, 20(4):374–387, April 1998.
[GKKK20]
Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, and O-Joung Kwon. The directed flat wall theorem. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 239–258. ACM-SIAM, January 2020.
[GKKKN07]
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner, and Alfredo Navarra. On the complexity of distributed graph coloring with local minimality constraints. Research Report 6399, INRIA, December 2007.
[GKKKN07b]
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner, and Alfredo Navarra. On the complexity of distributed graph coloring with local minimality constraints. Research Report RR-1440-07, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, December 2007.
[GKKKN09]
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, Łukasz Kuszner, and Alfredo Navarra. On the complexity of distributed graph coloring with local minimality constraints. Networks, 54(1):12–19, August 2009.
[GKKN07]
Cyril Gavoille, Ralf Klasing, Adrian Kosowski, and Alfredo Navarra. Brief announcement: On the complexity of distributed greedy coloring. In 21st International Symposium on Distributed Computing (DISC), volume 4731 of Lecture Notes in Computer Science, pages 482–484. Springer, September 2007.
[GKKPP00]
Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. Research Report RR-1250-00, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, December 2000.
[GKKPP01]
Cyril Gavoille, Michal Katz, Nir A. Katz, Christophe Paul, and David Peleg. Approximate distance labeling schemes. In Friedhelm Meyer auf der Heide, editor, 9th Annual European Symposium on Algorithms (ESA), volume 2161 of Lecture Notes in Computer Science, pages 476–487. Springer, August 2001.
[GKL03]
Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 534–543. IEEE Computer Society Press, October 2003.
[GKL24]
Leonid Gurvits, Nathan Klein, and Jonathan Leake. From trees to polynomials and back again: New capacity bounds with applications to TSP. In 51st International Colloquium on Automata, Languages, and Programming (ICALP), volume 297 of LIPIcs, pages 79:1–79:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2024.
[GKLO23]
Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus. The existence of designs via iterative absorption: Hypergraph F-designs for arbitrary F. Memoirs of the American Mathematical Society, 284(1406), April 2023.
[GKLPS18]
Paweł Gawrychowski, Fabian Kuhn, Jakub Łopuszański, Konstantinos Panagiotou, and Pascal Su. Labeling schemes for nearest common ancestors through minor-universal trees. In 29th Symposium on Discrete Algorithms (SODA), pages 2604–2619. ACM-SIAM, 2018.
[GKM09]
Cyril Gavoille, Adrian Kosowski, and Marcin Markiewicz. What can be observed locally? Round-based models for quantum distributed computing. In 23rd International Symposium on Distributed Computing (DISC), volume 5805 of Lecture Notes in Computer Science, pages 243–257. Springer, September 2009.
[GKM09a]
Cyril Gavoille, Adrian Kosowski, and Marcin Markiewicz. What can be observed locally? Round-based models for quantum distributed computing. Technical Report 0903.1133v1 [quant-ph], arXiv, March 2009.
[GKM16]
Mohsen Ghaffari, Fabian Kuhn, and Yannic Maus. On the complexity of local distributed graph problems. Technical Report 1611.02663v1 [cs.DS], arXiv, November 2016.
[GKM17]
Mohsen Ghaffari, Fabian Kuhn, and Yannic Maus. On the complexity of local distributed graph problems. In 49th Annual ACM Symposium on Theory of Computing (STOC), pages 784–797. ACM Press, June 2017.
[GKMSW18]
Paweł Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, and Oren Weimann. Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. In 29th Symposium on Discrete Algorithms (SODA), pages 495–514. ACM-SIAM, 2018.
[GKMSW21]
Paweł Gawrychowski, Haim Kaplan, Shay Mozes, Micha Sharir, and Oren Weimann. Voronoi diagrams on planar graphs, and computing the diameter in deterministic Õ(n5/3) time. SIAM Journal on Computing, 50(2):509–554, 2021.
[GKMW11]
Martin Grohe, Ken-ichi Kawarabayashi, Dániel Marx, and Paul Wollan. Finding topological subgraphs is fixed-parameter tractable. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 479–488. ACM Press, June 2011.
[GKP11]
Sylvain Gravier, Matjaž Kovše, and Aline Parreau. Generalized sierpiński graphs. In European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume poster, August 2011.
[GKP94]
Ronald Lewis Graham, Donald Ervin Knuth, and Oren Patashnik. Concrete mathematics: a foundation for computer science. Addison-Wesley, 1994.
[GKP95]
Michelangelo Grigni, Elias Koutsoupias, and Christos H. Papadimitriou. An approximation scheme for planar graph TSP. In 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 640–645. IEEE Computer Society Press, 1995.
[GKP98]
Juan A. Garay, Shay Kutten, and David Peleg. A sublinear time distributed algorithm for minimum-weight spanning trees. SIAM Journal on Computing, 27(1):302–316, February 1998.
[GKR03]
Anupam Gupta, Amit Kumar, and Rajeev Rastogi. Exploring the trade-off between label size and stack depth in MPLS routing. In 22nd Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 1, pages 544–554, June 2003.
[GKR05]
Anupam Gupta, Amit Kumar, and Rajeev Rastogi. Traveling with a pez dispenser (or, routing issues in MPLS). SIAM Journal on Computing, 34(2):453–474, 2005.
[GKR13]
Martin Grohe, Ken-ichi Kawarabayashi, and Bruce A. Reed. A simple algorithm for the graph minor decomposition -- Logic meets structural graph theory --. In 24th Symposium on Discrete Algorithms (SODA), pages 414–431. ACM-SIAM, January 2013.
[GKRT19]
Archontia C. Giannopoulou, O-Joung Kwon, Jean-Florent Raymond, and Dimitrios M. Thilikos. Lean tree-cut decompositions: Obstructions and algorithms. In Rolf Niedermeier and Christophe Paul, editors, 36th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 126 of LIPIcs, pages 32:1–32:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2019.
[GKRU21]
Guillaume Guégan, Kolja Knauer, Jonathan Rollin, and Torsten Ueckerdt. The interval number of a planar graph is at most three. Journal of Combinatorial Theory, Series B, 146:61–67, January 2021.
[GKS17]
Mohsen Ghaffari, Fabian Kuhn, and Hsin-Hao Su. Distributed MST and routing in almost mixing time. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 131–140. ACM Press, July 2017.
[GKS86]
Zvi Galil, Ravindran Kannan, and Endre Szemerédi. On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines. In 18th Annual ACM Symposium on Theory of Computing (STOC), pages 39–49. ACM Press, May 1986.
[GKU15]
Paweł Gawrychowski, Adrian Kosowski, and Przemysław Uznański. Even simpler distance labeling for (sparse) graphs. Technical Report 1507.06240v1 [cs.DS], arXiv, July 2015.
[GKU16]
Paweł Gawrychowski, Adrian Kosowski, and Przemysław Uznański. Sublinear-space distance labeling using hubs. In 30th International Symposium on Distributed Computing (DISC), volume 9888 of Lecture Notes in Computer Science (ARCoSS), pages 230–242. Springer, September 2016.
[GKZ19]
Cyril Gavoille, Ghazal Kachigar, and Gilles Zémor. Localisation-resistant random words with small alphabets. In R. Mercas and D. Reidenbach, editors, 12th International Conference on Combinatorics on Words (WORDS), volume 11682 of Lecture Notes in Computer Science, pages 193–206. Springer, September 2019.
[GL05]
Cyril Gavoille and Olivier Ly. Distance labeling in hyperbolic graphs. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 1071–1079. Springer, December 2005.
[GL06]
Magdalene Grantson and Christos Levcopoulos. Covering a set of points with a minimum number of lines. In 6th Italian Conference on Algorithms and Complexity (CIAC), volume 3998 of Lecture Notes in Computer Science, pages 6–17. Springer, May 2006.
[GL07]
Cyril Gavoille and Arnaud Labourel. Shorter implicit representation for planar graphs and bounded treewidth graphs. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 582–593. Springer, October 2007.
[GL07a]
Cyril Gavoille and Arnaud Labourel. Brief annoucement: On local representation of distances in trees. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 246–247. ACM Press, August 2007.
[GL07b]
Cyril Gavoille and Arnaud Labourel. Distributed relationship schemes for trees. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 728–738. Springer, December 2007.
[GL07c]
Cyril Gavoille and Arnaud Labourel. Schéma relationnel distribué pour les arbres. In 9es Journées Graphes et Algorithmes, page 19, November 2007.
[GL20]
Peter Gartland and Daniel Lokshtanov. Independent set on Pk-free graphs in quasi-polynomial time. Technical Report 2005.00690v2 [cs.DS], arXiv, June 2020.
[GL22]
Cyril Gavoille and Arnaud Labourel. Smaller universal graphs for caterpillars and graphs of bounded path-width. In 11th International Colloquium on Graph Theory (ICGT), page Paper No. 54, July 2022.
[GL68]
M.K. Gol'dberg and É.M. Livshits. On minimal universal trees. Mathematical notes of the Academy of Sciences of the USSR, 4(3):713–717, September 1968.
[GL90]
Ji Gao and Ka-Sing Lau. On the geometry of spheres in normed linear spaces. Journal of the Australian Mathematical Society (Series A), 48(1):101–112, February 1990.
[GL95]
Jerrold R. Griggs and Yan-Chyuan Lin. Planar graphs with few vertices of small degree. Discrete Mathematics, 143(1-3):47–70, August 1995.
[GL96]
Craig Gotsman and M. Lindenbaum. On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing, 5(5):794–797, May 1996.
[GL98]
Roberto Grossi and Elena Lodi. Simple planar graph partition into three forests. Discrete Applied Mathematics, 84(1-3):121–132, May 1998.
[Glacet13]
Christian Glacet. Algorithmes de routage : de la réduction des coûts de communication á la dynamique. PhD thesis, Université Bordeaux, Talence, France, December 2013.
[GLLW09]
Andrei Gagarin, Gilbert Labelle, Pierre Leroux, and Timothy R. Walsh. Structure and enumeration of two-connected graphs with prescribed three-connected components. Advances in Applied Mathematics, 43(1):46–74, July 2009.
[GLM06]
Jesús García-Falseta, Enrique Llorens-Fustera, and Eva M. Mazcuñan-Navarro. Uniformly nonsquare Banach spaces have the fixed point property for nonexpansive mappings. Journal of Functional Analysis, 233:494–514, 2006.
[GLMS07]
Francesco Giordano, Giuseppe Liotta, Teimuraz Mchedlidze, and Antonios Symvonis. Computing upward topological book embeddings of upward planar digraphs. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 172–183. Springer, December 2007.
[GLN02]
Joachim Gudmundsson, Christos Levcopoulos, and Giri Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM Journal on Computing, 31(5):1479–1500, 2002.
[GLNS02]
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, and Michiel Smid. Approximate distance oracles revisited. In 13th Annual International Symposium on Algorithms and Computation (ISAAC), volume 2518 of Lecture Notes in Computer Science, pages 357–368. Springer, 2002.
[GLNS02a]
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, and Michiel Smid. Approximate distance oracles for geometric graphs. In 13th Symposium on Discrete Algorithms (SODA), pages 828–837. ACM-SIAM, January 2002.
[GLNS08]
Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, and Michiel Smid. Approximate distance oracles for geometric spanners. ACM Transactions on Algorithms, 4(1):Article No. 10, pp. 1–34, March 2008.
[GLST23]
Ervin Győri, Binlong Li, Nika Salia, and Casey Tompkins. A note on universal graphs for spanning trees. Technical Report 2311.01488v2 [math.CO], arXiv, November 2023.
[GLV02]
Jean-Loup Guillaume, Matthieu Latapy, and Laurent Viennot. Efficient and simple encodings for the web graph, 2002.
[GM12]
Martin Grohe and Dániel Marx. Structure theorem and isomorphism test for graphs with excluded topological subgraphs. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 173–192. ACM Press, May 2012.
[GM16]
Chris Godsil and Karen Meagher. Erdős-Ko-Rado theorems: Algebraic approaches, volume 149 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2016.
[GM19]
Mostafa Ghandehari and Horst Martini. On self-circumferences in Minkowski planes. Extracta Mathematicae, 34(1):19–28, 2019.
[GM59]
Edgar Nelson Gilbert and Edward Forrest Moore. Variable-length binary encodings. The Bell System Technical Journal, 38(4):933–967, July 1959.
[GM84]
Michel Gondran and Michel Minoux. Graphs and algorithms. John Wiley & Sons, 1984.
[GMC09]
Andrei Gagarin, Wendy J. Myrvold, and John Chambers. The obstructions for toroidal graphs with no K3,3's. Discrete Mathematics, 309:3625–3631, 2009.
[GMcD04]
Stefanie Gerke and Colin J.H. McDiarmid. On the number of edges in random planar graphs. Combinatorics, Probability and Computing, 13(2):165–183, March 2004.
[GMcDSW05]
Stefanie Gerke, Colin J.H. McDiarmid, Angelika Steger, and Andreas Weißl. Random planar graphs with n nodes and a fixed number of edges. In 16th Symposium on Discrete Algorithms (SODA), pages 999–1007. ACM-SIAM, January 2005.
[GMM04]
Emmanuel Godard, Yves Métivier, and Anca Muscholl. Characterizations of classes of graphs recognizable by local computations. Theory of Computing Systems, 37(2):249–293, 2004.
[GMP04]
Antonio Suárez Granero, José Pedro Moreno, and Robert R. Phelps. Convex sets which are intersections of closed balls. Advances in Mathematics, 183(1):183–208, March 2004.
[GMR06]
Alexander Golynski, J. Ian Munro, and Satti Srivivasa Rao. Rank/select operations on large alphabets: a tool for text indexing. In 17th Symposium on Discrete Algorithms (SODA), pages 368–373. ACM-SIAM, January 2006.
[GMT02]
Jens Gustedt, Ole A. Mæhle, and Jan Arne Telle. The treewidth of java programs. In 4th International Workshop on Algorithm Engineering and Experiments (ALENEX), volume 2409 of Lecture Notes in Computer Science, pages 86–97. Springer, January 2002.
[GMT06]
Emmanuel Godard, Yves Métivier, and Gérard Tel. Termination detection of distributed tasks. Research Report RR-1418-06, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, November 2006.
[GMZ04]
Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. On hierarchical routing in doubling metrics. Technical Report CMU-PDL-04-106, Carnegie Mellon University, December 2004.
[GN03]
Cyril Gavoille and Martin Nehéz. Interval routing in reliability networks. In 9th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 149–164. Carleton University Press, June 2003.
[GN03a]
Cyril Gavoille and Martin Nehéz. Interval routing in reliability networks. Research Report RR-1294-03, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, March 2003.
[GN03b]
Cyril Gavoille and Martin Nehéz. On interval routing in random meshes. In Jiří Fiala, editor, 2nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), pages 147–150, September 2003.
[GN04b]
Omer Giménez and Marc Noy. Estimating the growth constant of labelled planar graphs. In 3rd Colloquium on Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities, pages 133–140. Birkhäuser, September 2004.
[GN05]
Cyril Gavoille and Martin Nehéz. Interval routing in reliability networks. Theoretical Computer Science, 333(3):415–432, March 2005.
[GN05a]
Omer Giménez and Marc Noy. Asymptotic enumeration and limit laws of planar graphs. Technical Report 0501269v1 [math.CO], arXiv, January 2005.
[GN08]
Rodrigo González and Gonzalo Navarro. Improved dynamic rank-select entropy-bound structures. In 8th Latin American Symposium on Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 374–386, April 2008.
[GN09]
Omer Giménez and Marc Noy. Asymptotic enumeration and limit laws of planar graphs. Journal of the American Mathematical Society, 22(2):309–329, 2009.
[GN09a]
Omer Giménez and Marc Noy. Counting planar graphs and related families of graphs. In Surveys in Combinatorics, volume 365 of London Mathematical Society Lecture Note Series, pages 169–210. Cambridge University Press, July 2009.
[GN98]
Arvind Gupta and Naomi Nishimura. Finding largest subtrees and smallest supertrees. Algorithmica, 21(2):183–210, June 1998.
[GNNW24]
Parth Gupta, Ndiamé Ndiaye, Sergey Norin, and Louis Wei. Optimizing the CGMS upper bound on Ramsey numbers. Technical Report 2407.19026v1 [math.CO], arXiv, July 2024.
[GNRS04]
Anupam Gupta, Ilan Newman, Yuri Rabinovich, and Alistair Sinclair. Cuts, trees, and ℓ1-embeddings of graphs. Combinatorica, 24(2):233–269, April 2004.
[GNS03]
Joachim Gudmundsson, Giri Narasimhan, and Michiel Smid. Distance-preserving approximations of polygonal paths. In 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 2914 of Lecture Notes in Computer Science, pages 217–228. Springer-Verlag, 2003.
[GNS05]
Joachim Gudmundsson, Giri Narasimhan, and Michiel Smid. Fast pruning of geometric spanners. In 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3404 of Lecture Notes in Computer Science, pages 508–520. Springer, February 2005.
[GNS07]
Joachim Gudmundsson, Giri Narasimhan, and Michiel Smid. Distance-preserving approximations of polygonal paths. Computational Geometry: Theory and Applications, 36(3):183–196, April 2007.
[GO17]
Tzlil Gonen and Rotem Oshman. Lower bounds for subgraph detection in the CONGEST model. In 21st International Conference on Principles of Distributed Systems (OPODIS), volume 95 of LIPIcs, pages 6:1–6:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2017.
[Godel31]
Kurt Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173–198, December 1931.
[Godfroy12]
Quentin Godfroy. From spanners to multipath spanners. PhD thesis, Université Bordeaux, Talence, France, November 2012.
[Golab32]
Sanisław Gołab. Zagadnienia metryczne geometrii Minkowskiego. Prace Akademii Górniczej w Krakowie, 6:1–79, 1932.
[Golay72]
Marcel J.E. Golay. Notes on the representation of 1,2, ......, N by differences. Journal of the London Mathematical Society, 4(4):729–734, May 1972.
[Goldreich97]
Oded Goldreich. Probabilistic proof systems - a survey. In Rüdiger Reischuk and Michel Morvan, editors, 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1200 of Lecture Notes in Computer Science, pages 595–611. Springer, February 1997.
[Golumbic80]
Martin Charles Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, Harcourt Brace Jovanovich, 1980.
[Golynski06]
Alexander Golynski. Optimal lower bounds for rank and select indexes. In 33rd International Colloquium on Automata, Languages and Programming (ICALP), volume 4051 of Lecture Notes in Computer Science, pages 370–381, 2006.
[Golynski09]
Alexander Golynski. Cell probe lower bounds for succinct data structures. In 20th Symposium on Discrete Algorithms (SODA), pages 625–634. ACM-SIAM, January 2009.
[Goncalves05]
Daniel Goncalves. Edge partition of planar graphs into two outerplanar graphs. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 504–512. ACM Press, May 2005.
[Goncalves06]
Daniel Goncalves. Étude de différents problèmes de partition de graphes. PhD thesis, Université Bordeaux 1, Talence, France, December 2006.
[Goncalves06a]
Daniel Goncalves. Covering planar graphs with 3 forests, one being of maximum degree 4. Preprint submited, 2006.
[Gonzalo14]
Gonzalo Navarro. Spaces, trees, and colors: The algorithmic landscape of document retrieval on sequences. ACM Computing Surveys, 46(4):A52, March 2014.
[Goodrich95]
Michael T. Goodrich. Planar separators and parallel polygon triangulation. Journal of Computer and System Sciences, 51(3):374–389, December 1995.
[GOR10]
Roberto Grossi, Alessio Orlandi, and Rajeev Raman. Optimal trade-offs for succinct string indexes. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 678–689. Springer, July 2010.
[Gotsman03]
Craig Gotsman. On the optimality of valence-based connectivity coding. Computer Graphics Forum, 22(1):99–102, 2003.
[GP00]
Cyril Gavoille and Christophe Paul. Approximate distance labeling schemes. In 6th International Colloquium on Graph Theory (ICGT), volume 5 of Electronic Notes in Discrete Mathematics, pages 134–137. Elsevier, July 2000.
[GP01]
Cyril Gavoille and David Peleg. The compactness of interval routing for almost all graphs. SIAM Journal on Computing, 31(3):706–721, 2001.
[GP01a]
Cyril Gavoille and Christophe Paul. Split decomposition and distance labelling: An optimal scheme for distance hereditary graphs. In Jaroslav Nešetřil, Marc Noy, and Oriol Serra, editors, European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 10 of Electronic Notes in Discrete Mathematics, pages 117–120, November 2001.
[GP01b]
Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Research Report RR-1261-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, August 2001.
[GP01c]
Cyril Gavoille and Christophe Paul. Distance labeling scheme and split decomposition. Research Report RR-1263-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, November 2001.
[GP03]
Cyril Gavoille and Christophe Paul. Optimal distance labeling schemes for interval and circular-arc graphs. In Giuseppe di Battista and Uri Zwick, editors, 11th Annual European Symposium on Algorithms (ESA), volume 2832 of Lecture Notes in Computer Science, pages 254–265. Springer, September 2003.
[GP03a]
Cyril Gavoille and Christophe Paul. Small universal distance matrices. Research Report RR-1290-03, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2003.
[GP03b]
Cyril Gavoille and Christophe Paul. Distance labeling scheme and split decomposition. Discrete Mathematics, 273(1-3):115–130, December 2003.
[GP03c]
Cyril Gavoille and David Peleg. Compact and localized distributed data structures. Distributed Computing, 16(2-3):111–120, September 2003. PODC 20-Year Special Issue.
[GP08]
Cyril Gavoille and Christophe Paul. Optimal distance labeling for interval graphs and related graphs families. SIAM Journal on Discrete Mathematics, 22(3):1239–1258, July 2008.
[GP16]
Emmanuel Godard and Éloi Perdereau. k-set agreement in communication networks with omission faults. In 20th International Conference on Principles of Distributed Systems (OPODIS), volume 70 of LIPIcs, pages 8:1–8:17. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2016.
[GP25]
Agelos Georgakopoulos and Panos Papasoglu. Graph minors and metric spaces. Combinatorica, 45(33), 2025.
[GP72]
Ronald Lewis Graham and Henry O. Pollak. On embedding graphs in squashed cubes. In Y. Alavi, D.R. Lick, and A.T. White, editors, Graph Theory and Applications, volume 303 of Lecture Notes in Mathematics, pages 99–110. Springer, 1972.
[GP79]
William H. Gates and Christos H. Papadimitriou. Bounds for sorting by prefix reversals. Discrete Mathematics, 27(1):47–57, 1979.
[GP87]
Andrew V. Goldberg and Serge A. Plotkin. Parallel (δ+1)-coloring of constant-degree graphs. Information Processing Letters, 25(4):241–245, June 1987.
[GP91]
Michelangelo Grigni and David Peleg. Thight bounds on minimum broadcast networks. SIAM Journal on Discrete Mathematics, 4(2):207–222, May 1991.
[GP95]
Cyril Gavoille and Stéphane Pérennès. Routing memory requirement for distributed networks. Research Report 95-37, I3S, Université de Nice-Sophia Antipolis, 06903 Sophia Antipolis, France, August 1995.
[GP95a]
Cyril Gavoille and Stéphane Pérennès. Memory requirement for routing in distributed networks. Research Report 95-46, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, December 1995.
[GP96]
Cyril Gavoille and Stéphane Pérennès. Lower bounds for interval routing on 3-regular networks. In Nicola Santoro and Paul G. Spirakis, editors, 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 88–103. Carleton University Press, June 1996.
[GP96a]
Cyril Gavoille and Stéphane Pérennès. Lower bounds for shortest path interval routing. Research Report 96-08, LIP, École Normale Supérieure de Lyon, 69364 Lyon Cedex 07, France, April 1996.
[GP96b]
Cyril Gavoille and Stéphane Pérennès. Memory requirement for routing in distributed networks. In 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 125–133. ACM Press, May 1996.
[GP97]
Cyril Gavoille and David Peleg. The compactness of interval routing. Research Report RR-1176-97, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, September 1997.
[GP98]
Cyril Gavoille and David Peleg. The compactness of interval routing for almost all graphs. Research Report RR-1202-98, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, April 1998.
[GP98a]
Cyril Gavoille and David Peleg. The compactness of interval routing for almost all graphs. In Shay Kutten, editor, 12th International Symposium on Distributed Computing (DISC), volume 1499 of Lecture Notes in Computer Science, pages 161–174. Springer, September 1998.
[GP99]
Cyril Gavoille and David Peleg. The compactness of interval routing. SIAM Journal on Discrete Mathematics, 12(4):459–473, October 1999.
[GPPR00]
Cyril Gavoille, David Peleg, Stéphane Pérennès, and Ran Raz. Distance labeling in graphs. Research Report RR-1239-00, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, April 2000.
[GPPR01]
Cyril Gavoille, David Peleg, Stéphane Pérennès, and Ran Raz. Distance labeling in graphs. In 12th Symposium on Discrete Algorithms (SODA), pages 210–219. ACM-SIAM, January 2001.
[GPPR04]
Cyril Gavoille, David Peleg, Stéphane Pérennès, and Ran Raz. Distance labeling in graphs. Journal of Algorithms, 53(1):85–112, October 2004.
[GPRS01]
Cyril Gavoille, David Peleg, André Raspaud, and Eric Sopena. Small k-dominating sets in planar graphs with applications. In 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2204 of Lecture Notes in Computer Science, pages 201–216. Springer, June 2001.
[GPRS01a]
Cyril Gavoille, David Peleg, André Raspaud, and Eric Sopena. Small k-dominating sets in planar graphs with applications. Research Report RR-1258-01, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, May 2001.
[GPS12]
William I. Gasarch, Andy Parrish, and Sandow Sinai. Three proofs of the hypergraph Ramsey theorem (an exposition), 2012.
[GPS87]
Andrew V. Goldberg, Serge A. Plotkin, and Gregory E. Shannon. Parallel symmetry-breaking in sparse graphs. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 315–324. ACM Press, May 1987.
[GPS88]
Andrew V. Goldberg, Serge A. Plotkin, and Gregory E. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics, 1(4):434–446, 1988.
[GPSS10]
Cyril Gavoille, Boaz Patt-Shamir, and Christian Scheideler. Special issue: Parallelism on Algorithms and Architectures (SPAA). Theory of Computing Systems, 47(4):809–962, November 2010.
[GPW26]
Maximilian Gorsky, Evangelos Protopapas, and Sebastian Wiederrecht. Quickly excluding an annotated planar graph. Technical Report 2602.06516v2 [math.CO], arXiv, February 2026.
[GPX07]
Leszek Gąsieniec, David Peleg, and Qin Xin. Faster communication in known topology radio networks. Distributed Computing, 19(4):289–300, 2007.
[GR03]
Ashim Garg and Adrian Rusu. Area-efficient drawings of outerplanar graphs. In 11th International Symposium on Graph Drawing (GD), volume 2912 of Lecture Notes in Computer Science, pages 129–134. Springer, 2003.
[GR03a]
Ashim Garg and Adrian Rusu. Straight-line drawings of general trees with linear area and arbitrary aspect ratio. In International Conference on Computational Science and Its Applications (ICCSA), volume 2669 of Lecture Notes in Computer Science, pages 876–885. Springer, May 2003.
[GR08]
Lee-Ad Gottlieb and Liam Roditty. Improved algorithms for fully dynamic geometric spanners and geometric routing. In 19th Symposium on Discrete Algorithms (SODA), pages 591–600. ACM-SIAM, January 2008.
[GR15]
Izrail' Solomonovich Gradshteyn and Iosif Moiseevich Ryzhik. Table of integrals, series, and products. Academic Press, 2015.
[GR98]
Andrew V. Goldberg and Satish B. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45(5):783–797, September 1998.
[GR99]
Hillel Gazit and John H. Reif. A randomized parallel algorithm for planar graph isomorphism, 1999.
[Gray78]
Jim N. Gray. Notes on data base operating systems. In Operating Systems, volume 60 of Lecture Notes in Computer Science, pages 393–481. Springer, January 1978.
[GRE84]
John R. Gilbert, Donald J. Rose, and A. Edenbrandt. A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods, 5(3):306–313, September 1984.
[Grigni00]
Michelangelo Grigni. Approximate TSP in graphs with forbidden minors. In 27th International Colloquium on Automata, Languages and Programming (ICALP), volume 1853 of Lecture Notes in Computer Science, pages 869–877. Springer, July 2000.
[Grigoriev11]
Alexander Grigoriev. Tree-width and large grid minors in planar graphs. Discrete Mathematics & Theoretical Computer Science, 13(1):13–20, February 2011.
[Grimmett99]
Geoffrey R. Grimmett. Percolation. Springer, May 1999.
[Grohe03]
Martin Grohe. Local tree-width, excluded minors, and approximation algorithms. Combinatorica, 23(4):613–632, December 2003.
[Grohe07]
Martin Grohe. Logic, graphs, and algorithms. In Electronic Colloquium on Computational Complexity (ECCC), TR07-091, September 2007.
[Gromov87]
Mikhael Gromov. Hyperbolic groups. In S.M. Gersten, editor, Essays in Group Theory, volume 8 of Mathematical Sciences Research Institute Publications, pages 75–263. Springer, 1987.
[Gromov91]
Mikhael Gromov. Asymptotic invariants of infinite groups. In Graham A. Niblo and Martin A. Roller, editors, International Symposium on Geometric Group Theory (Volume 2), volume 182 of London Mathematical Society Lecture Note Series, pages 1–295. Cambridge University Press, July 1991.
[GRR04]
Richard F. Geary, Rajeev Raman, and Venkatesh Raman. Succinct ordinal trees with level-ancestor queries. In 15th Symposium on Discrete Algorithms (SODA), pages 1–10. ACM-SIAM, January 2004.
[GRRR04]
Richard F. Geary, Naila Rahman, Rajeev Raman, and Venkatesh Raman. A simple optimal representation for balanced parentheses. In 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 3109 of Lecture Notes in Computer Science, pages 159–172. Springer, July 2004.
[GRS14]
Edinah K. Gnang, Maksym Radziwiłł, and Carlo Sanna. Counting arithmetic formulas. European Journal of Combinatorics, 47:40–53, July 2014.
[Gruneau25]
Christoph Gruneau. Sampling with certainty in distributed and parallel computations. PhD thesis, ETH Zürich, Switzerland, 2025.
[GRV09]
Navin Goyal, Luis Rademacher, and Santosh Vempala. Expanders via random spanning trees. In 20th Symposium on Discrete Algorithms (SODA), pages 576–585. ACM-SIAM, January 2009.
[GS02]
Michelangelo Grigni and Papa Amar Sissokho. Light spanners and approximate TSP in weighted graphs with forbidden minors. In 13th Symposium on Discrete Algorithms (SODA), pages 852–857. ACM-SIAM, January 2002.
[GS06]
Joachim Gudmundsson and Michiel Smid. On spanners of geometric graphs. In 10th Scandinavian Workshop on Algorithm Theory (SWAT), volume 4059 of Lecture Notes in Computer Science, pages 388–399. Springer, 2006.
[GS11]
Cyril Gavoille and Christian Sommer. Sparse spanners vs. compact routing. In 23rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 225–234. ACM Press, June 2011.
[GS11a]
Mika Göös and Jukka Suomela. Locally checkable proofs. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 159–168. ACM Press, June 2011.
[GS12]
Mika Göös and Jukka Suomela. No sublogarithmic-time approximation scheme for bipartite vertex cover. In 26th International Symposium on Distributed Computing (DISC), volume 7611 of Lecture Notes in Computer Science, pages 181–194. Springer, October 2012.
[GS14]
Lee-Ad Gottlieb and Shay Solomon. Light spanners for snowflake metrics. In 30th Annual ACM Symposium on Computational Geometry (SoCG), pages 387–395. ACM, June 2014.
[GS80]
Ronald Lewis Graham and Neil James Alexander Sloane. On additive bases and harmonious graphs. SIAM Journal on Algebraic and Discrete Methods, 1(4):382–404, 1980.
[GSST08]
Angelika Steger, Dirk Schlatter, Angelika Steger, and Anusch Taraz. The random planar graph process. Random Structures and Algorithms, 32(2):236–261, August 2008.
[GSW25]
Maximilian Gorsky, Michał T. Seweryn, and Sebastian Wiederrecht. Polynomial bounds for the graph minor structure theorem. Technical Report 2504.02532v1 [math.CO], arXiv, April 2025.
[GSW25a]
Maximilian Gorsky, Michał T. Seweryn, and Sebastian Wiederrecht. Polynomial bounds for the graph minor structure theorem. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1961–1978. IEEE Computer Society Press, December 2025.
[GT05]
Qian-Ping Gu and Hisao Tamaki. Optimal branch-decomposition of planar graphs in O(n3) time. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 373–384, 2005.
[GT08]
Anupam Gupta and Kunal Talwar. How to complete a doubling metric. In 8th Latin American Symposium on Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 36–47, April 2008.
[GT10]
Qian-Ping Gu and Hisao Tamaki. Improved bounds on the planar branchwidth with respect to the largest grid minor size. In 21st Annual International Symposium on Algorithms and Computation (ISAAC), volume 6507 of Lecture Notes in Computer Science, pages 85–96. Springer, December 2010.
[GT11]
Qian-Ping Gu and Hisao Tamaki. Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n1+ε) time. Theoretical Computer Science, 412(32):4100–4109, July 2011.
[GT12]
Qian-Ping Gu and Hisao Tamaki. Improved bounds on the planar branchwidth with respect to the largest grid minor size. Algorithmica, 64(3):416–453, November 2012.
[GT15]
Loukas Georgiadis and Robert Endre Tarjan. A note on fault tolerant reachability for directed graphs. Technical Report 1511.07741v1 [cs.DS], arXiv, November 2015.
[GT88]
Zvi Galil and Éva Tardos. An O(n2(m+nlogn)logn) min-cost flow algorithm. Journal of the ACM, 35(2):374–386, April 1988.
[GU15]
Mohsen Ghaffari and Rajan Udwani. Brief announcement: Distributed single-source reachability. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 163–165. ACM Press, July 2015.
[GU16]
Paweł Gawrychowski and Przemysław Uznański. A note on distance labeling in planar graphs. Technical Report 1611.06529v1 [cs.DS], arXiv, November 2016.
[GU21]
Paweł Gawrychowski and Przemysław Uznański. Better distance labeling for unweighted planar graphs. In 17th International Workshop on Distributed Algorithms (WDAG), volume 12808 of Lecture Notes in Computer Science, pages 428–441. Springer, Cham, August 2021.
[GU23]
Paweł Gawrychowski and Przemysław Uznański. Better distance labeling for unweighted planar graphs. Algorithmica, 85:1805–1805, May 2023.
[GUM09]
Alexander Grigoriev, Natalya Usotskaya, and Bert Marchal. On planar graphs with large tree-width and small grid minors. Electronic Notes in Discrete Mathematics, 32:35–42, March 2010.
[Gumhold05]
Stefan Gumhold. Optimizing markov models with applications to triangular connectivity coding. In 16th Symposium on Discrete Algorithms (SODA), pages 331–338. ACM-SIAM, January 2005.
[Gupta25]
Manoj Gupta. Improved 2-approximate shortest paths for close vertex pairs. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1250–1263. IEEE Computer Society Press, December 2025.
[Guy88]
Richard K. Guy. The strong law of small numbers. The American Mathematical Monthly, 95(8):697–712, October 1988.
[Guy90]
Richard K. Guy. The second strong law of small numbers. Mathematics Magazine, 63(1):3–20, 1990.
[GV07]
Beat Gfeller and Elias Vicari. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 53–60. ACM Press, August 2007.
[GV96]
Giorgio Gambosi and Paola Vocca. Topological routing schemes. In özalp Babaoğlu and Keith Marzullo, editors, 10th International Workshop on Distributed Algorithms (WDAG), volume 1151 of Lecture Notes in Computer Science, pages 206–219. Springer-Verlag, October 1996.
[GVSM24]
Kapil Goswami, Gagan Anekonda Veereshi, Peter Schmelcher, and Rick Mukherjee. Solving the Travelling Salesman Problem using a single qubit. Technical Report 2407.17207v2 [quant-ph], arXiv, December 2024.
[GW04]
Martin Grohe and Stefan Wöhrle. An existential locality theorem. Annals of Pure and Applied Logic, 129(1-3):131–148, October 2004.
[GW09]
Stéphane Grumbach and Zhilin Wu. Logical locality entails frugal distributed computation over graphs. In 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 5911 of Lecture Notes in Computer Science (ARCoSS), pages 154–165. Springer, June 2009.
[GW24]
Mohammad Ghomi and James Wenk. Shortest closed curve to contain a sphere in its convex hull. Technical Report 2209.05988v2 [math.DG], arXiv, March 2024.
[GW92]
Harold N. Gabow and Herbert H. Westermann. Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica, 7(1):465–497, June 1992.
[GW98]
Martin Charles Golumbic and Amir Wassermann. Complexity and algorithms for graph and hypergraph sandwich problems. Graphs and Combinatorics, 14(3):223–239, 1998.
[GX13]
Jean Gallier and Dianna Xu. A guide to the classification theorem for compact surfaces, volume 9 of Geometry and Computing. Springer, 2013.
[GX19]
Qian-Ping Gu and Gengchun Xu. Constant query time (1+ε)-approximate distance oracle for planar graphs. Theoretical Computer Science, 761:78–88, February 2019.
[Gyori76]
E. Györi. A division of graphs to connected subgraphs. In Combinatorics, volume 18 of Colloquia Mathematica Societatis János Bolyai, pages 485–494. North-Holland, 1976.
[GYZ02]
Gregory Gutin, Anders Yeo, and Alexey Zverovich. Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics, 117(1-3):81–86, March 2002.
[GZ00]
Cyril Gavoille and Akka Zemmari. The compactness of adaptive routing tables. Research Report RR-1233-00, LaBRI, University of Bordeaux 1, 351, cours de la Libération, 33405 Talence Cedex, France, February 2000.
[GZ00a]
Cyril Gavoille and Akka Zemmari. The compactness of adaptive routing tables. In Michele Flammini, Enrico Nardelli, Guido Proietti, and Paul G. Spirakis, editors, 7th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 127–140. Carleton Scientific, June 2000.
[GZ03]
Cyril Gavoille and Akka Zemmari. The compactness of adaptive routing tables. Journal of Discrete Algorithms, 1(2):237–254, April 2003.
[GZ17]
Jan Goedgebeur and Carol T. Zamfirescu. Improved bounds for hypohamiltonian graphs. Ars Mathematica Contemporanea, 13(2):235–257, 2017.
[HABDx17]
Thomas Hales, Mark Adams, Gertrud Bauer, Tat Dat Dang, John Harrison, Le Truong Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Tat Thang Nguyen, Quang Truong Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason Rute, Alexey Solovyev, Thi Hoai An Ta, Nam Trung Tran, Thi Diep Trieu, Josef Urban, Ky Vu, and Roland Zumkeller. A formal proof of the Kepler conjecture. Forum of Mathematics, Pi, 5(e2):1–29, 2017.
[Hajiaghayi01]
MohammadTaghi Hajiaghayi. Algorithms for graphs of (locally) bounded treewidth. Master of mathematics in computer science thesis, University of Waterloo, Ontario, Canada, September 2001.
[Hakimi62]
S. Louis Hakimi. On realizability of a set of integers as degrees of the vertices of a linear graph. I. Journal of the Society for Industrial and Applied Mathematics, 10(3):496–506, 1962.
[Hakimi63]
S. Louis Hakimi. On realizability of a set of integers as degrees of the vertices of a linear graph II. Uniqueness. Journal of the Society for Industrial and Applied Mathematics, 11(1):135–147, 1963.
[Haldar93]
S. Haldar. An 'all pairs shortest paths' distributed algorithm using 2n2 messages. In 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 790 of Lecture Notes in Computer Science, pages 350–363. Springer, June 1993.
[Haldar97]
S. Haldar. An 'all pairs shortest paths' distributed algorithm using 2n2 messages. Journal of Algorithms, 24(1):20–36, July 1997.
[Halftermeyer14]
Pierre Halftermeyer. Connexité dans les réseaux et schémas d'étiquetage compact dans l'urgence. PhD thesis, Université de Bordeaux, Talence, France, September 2014. tel-01110316.
[Halin76]
Rudolf Halin. S-function for graphs. Journal of Geometry, 8(1-2):171–186, March 1976.
[Hall35]
Philip Hall. On representations of subsets. Journal of the London Mathematical Society, 10(1):26–30, January 1935.
[Hall86]
Marshall Jr. Hall. Combinatorial theory. Discrete Mathematics. Wiley-Interscience, 1986.
[Halseth16]
Johan Torås Halseth. A 43k kernel for planar dominating set using computer-aided reduction rule discovery. Master thesis, University of Bergen, February 2016.
[Han01]
Yijie Han. Improved fast integer sorting in linear space. Information and Computation, 170(1):81–94, October 2001.
[Han04]
Yijie Han. Deterministic sorting in O(nloglogn) time and linear space. Journal of Algorithms, 50(1):96–10, January 2004. Also appears in STOC '02.
[Han06]
Yijie Han. An o(n3 (loglogn/logn)^5/4) time algorithm for all pairs shortest paths. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 411–417. Springer, September 2006.
[Hanlon82]
Phil Hanlon. Counting interval graphs. Transactions of the American Mathematical Society, 272(2):383–426, August 1982.
[Hanusse09]
Nicolas Hanusse. Navigation dans les grands graphes, November 2009. Thèse d'habilitation à diriger les recherches, Université de Bordeaux.
[Harary69]
Frank Harary. Graph theory. Addison-Wesley, 1969.
[Harms19]
Nathaniel Harms. Universal communication, universal graphs, and graph labeling. Technical Report 1911.03757v1 [cs.CC], arXiv, November 2019.
[Harms20]
Nathaniel Harms. Universal communication, universal graphs, and graph labeling. In 11th Conference on Innovations in Theoretical Computer Science (ITCS), volume 151 of LIPIcs, pages 33:1–33:27. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, January 2020.
[Harper66]
Lawrence Hueston Harper. Optimal numberings and isoperimetric problems on graphs. Journal of Combinatorial Theory, 1(3):385–393, 1966.
[Harrison73]
Michael A. Harrison. On the number of classes of binary matrices. IEEE Transactions on Computers, C-22(12):1048–1051, December 1973.
[Hart76]
Sergiu Hart. A note on the edges of the n-cube. Discrete Mathematics, 14:157–163, 1976.
[Hastad98]
Johan Håstad. The shrinkage exponent of De Morgan formulae is 2. SIAM Journal on Computing, 27(1):48–64, February 1998.
[Haussler95]
David Haussler. Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69(2):217–232, February 1995.
[Havil03]
Julian Havil. Gamma: Exploring the Euler's constant. Princeton University Press, 2003.
[HBD17]
Harald Andrés Helfgott, Jitendra Bajpai, and Daniele Dona. Graph isomorphisms in quasi-polynomial time. Technical Report 1710.04574v1 [math.GR], arXiv, October 2017. Translation from the French original (with additions: solutions, further problems) of arXiv:1701.04372 (Séminaire BOURBAKI).
[HBDRx15]
Bas Hensen, Hannes Bernien, Anaïs E. Dréau, Andreas Reiserer, Norbert Kalb, Machiel S. Blok, J. Ruitenberg, R.F.L. Vermeulen, Raymond N. Schouten, Carlos Abellán, Waldimar Amaya, Valerio Pruneri, Morgan W. Mitchell, Matthew Markham, Daniel J. Twitchen, David Elkouss, Stephanie Wehner, Tim H. Taminiau, and Ronald Hanson. Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres. Nature, 526:682–686, October 2015.
[HBJH90]
Pavol Hell, Jørgen Bang-Jensen, and Jing Huang. Local tournaments and proper circular arc graphs. In Algorithms, International Symposium SIGAL, volume 450 of Lecture Notes in Computer Science, pages 101–108, August 1990.
[HBL06]
Hacène Aït Haddadène, Mohamed-Amine Boutiche, and Hoai An Le Thi. Tree length of some graph classes and application to the routing problem. In Colloque sur l'Optimisation et les Systèmes d'Information (COSI), July 2006.
[HBL07]
Hacène Aït Haddadène, Mohamed-Amine Boutiche, and Hoai An Le Thi. Tree length of classes of graph, 2007. Version améliorée d'une version rejectée á AlgoTel07.
[HC06]
Xiuzhen Huang and Jianer Chen. On QTAS for planar graph problems. In Gonzalo Navarro, Leopoldo Bertossi, and Yoshiharu Kohayakawa, editors, 4th IFIP International Conference on Theoretical Computer Science, volume 209, pages 299–313. Springer, 2006.
[HDERx06]
Marc Hein, Wolfgang Dür, Jens Eisert, Robert Raussendorf, Maarten van den Nest, and Hans Jürgen Briegel. Entanglement in graph states and its applications. Technical Report 0602096v1 [quant-ph], arXiv, February 2006.
[Helfgott14]
Harald Andrés Helfgott. Major arcs for Goldbach's problem. Technical Report 1305.2897v4 [math.NT], arXiv, April 2014.
[Helm08]
Louis Helm. Brief announcement: Quantum distributed consensus. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 445–445. ACM Press, August 2008.
[Helsgaun00]
Keld Helsgaun. An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1):106–130, October 2000.
[Helsgaun18]
Keld Helsgaun. Using POPMUSIC for candidate set generation in the Lin-Kernighan-Helsgaun TSP solver. Technical report, Roskilde Universitet, July 2018.
[Hey91]
Marie-Claude Heydemann. Réseaux modélisés par des graphes de Cayley, 1991. notes de cours de DEA d'informatique 1991-1992.
[HG02]
MohammadTaghi Hajiaghayi and Yashar Ganjali. A note on consecutive ones submatrix problem. Information Processing Letters, 83(3):163–166, August 2002.
[HG23]
Claire Hilaire and Cyril Gavoille. Minor-universal graph for graphs on surfaces (poster), August 2023. European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB).
[HH22]
Hamed Hatami and Pooya Hatami. The implicit graph conjecture is false. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1134–1137. IEEE Computer Society Press, October 2022.
[HH99]
Deborah Heicklen and Christopher Hoffman. Return probabilities of a simple random walk on percolation clusters, 1999.
[HHKP17]
Shang-En Huang, Dawei Huang, Tsvi Kopelowitz, and Seth Pettie. Fully dynamic connectivity in O(logn(loglogn)2) amortized expected time. In 28th Symposium on Discrete Algorithms (SODA), pages 510–520. ACM-SIAM, January 2017.
[HHL16]
David Harvey, Joris van der Hoeven, and Grégoire Lecerf. Even faster integer multiplication. Journal of Complexity, 36:1–30, 2016.
[HHL18]
Alexander E. Holroyd, Tom Hutchcroft, and Avi Levy. Finitely dependent cycle coloring. Electronic Communications in Probability, 23(64):1–8, 2018.
[HHMW06]
Theo Härder, Michael Haustein, Christian Mathis, and Markus Wagner. Node labeling schemes for dynamic XML documents reconsidered. Data & Knowledge Engineering, 2006.
[HI87]
Lenwood Scott Heath and Sorin Istrail. The pagenumber of genus g graphs is O(g). In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 388–397. ACM Press, May 1987.
[Hilaire23]
Claire Hilaire. Structure of graphs: Minors and induced trees. PhD thesis, Université Bordeaux, Talence, France, July 2023.
[HIZ16]
Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. Low-congestion shortcuts without embedding. In 36th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 451–460. ACM Press, July 2016.
[HIZ16a]
Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. Near-optimal low-congestion shortcuts on bounded parameter graphs. In 30th International Symposium on Distributed Computing (DISC), volume 9888 of Lecture Notes in Computer Science (ARCoSS), pages 158–172. Springer, September 2016.
[HJKLx12]
Lauri Hella, Matti Järvisalo, Antti Kuusisto, Juhana Laurinharju, Tuomo Lempiäinen, Kerkko Luosto, Jukka Suomela, and Jonni Virtema. Weak models of distributed computing, with connections to modal logic. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 185–194. ACM Press, July 2012.
[HJL09]
Zhantao Huang, Yinglie Jin, and Ke Liang. On the isoperimetric number of a k-degree Cayley graph. Applied Mathematics Letters, 22(9):1451–1457, September 2009.
[HJMPx23]
Meike Hatzel, Gwenaël Joret, Piotr Micek, Marcin Pilipczuk, Torsten Ueckerdt, and Bartosz Walczak. Tight bound on treedepth in terms of pathwidth and longest path. Technical Report 2302.02995v3 [math.CO], arXiv, November 2023.
[HJW21]
Tony Huynh, Gwenaël Joret, and David R. Wood. Subgraph densities in a surface. Technical Report 2003.13777v4 [math.CO], arXiv, December 2021.
[HK12]
Bernhard Haeupler and Fabian Kuhn. Lower bounds on information dissemination in dynamics networks. In 26th International Symposium on Distributed Computing (DISC), volume 7611 of Lecture Notes in Computer Science, pages 166–180. Springer, October 2012.
[HK62]
Michael Held and Richard M. Karp. A dynamic programming approach to sequencing problems. Journal of the Society for Industrial and Applied Mathematics, 10(1):196–210, March 1962.
[HK73]
John E. Hopcroft and Richard M. Karp. An n5/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 2(4):225–231, 1973.
[HKdMT16]
Alfredo Hubard, Vojtech Kaluža, Arnaud de Mesmay, and Martin Tancer. Shortest path embeddings of graphs on surfaces. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 43:1–43:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[HKH12]
Michael Hemmer, Michal Kleinbort, and Dan Halperin. Improved implementation of point location in general two-dimensional subdivisions. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 611–623. Springer-Verlag, September 2012.
[HKL00]
Xin He, Ming-Yang Kao, and Hsueh-I Lu. A fast general methodology for information-theoretically optimal encodings of graphs. SIAM Journal on Computing, 30(3):838–846, 2000.
[HKL06]
MohammadTaghi Hajiaghayi, Robert D. Kleinberg, and Frank Thomson Leighton. Improved lower and upper bounds for universal TSP in planar metrics. In 17th Symposium on Discrete Algorithms (SODA), pages 649–658. ACM-SIAM, January 2006.
[HKL99]
Xin He, Ming-Yang Kao, and Hsueh-I Lu. A fast general methodology for information-theoretically optimal encodings of graphs. In Jaroslav Nešetřil, editor, 7th Annual European Symposium on Algorithms (ESA), volume 1643 of Lecture Notes in Computer Science, pages 540–549. Springer, July 1999.
[HKL99a]
Xin He, Ming-Yang Kao, and Hsueh-I Lu. Linear-time succinct encodings of planar graphs via canonical. SIAM Journal on Discrete Mathematics, 12(3):317–325, 1999.
[HKLR07]
MohammadTaghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, and Harald Räcke. Oblivious routing on node-capacitated and directed graphs. ACM Transactions on Algorithms, 3(4):Article No. 51, pp. 1–13, November 2007. Appears in SODA '05 pp. 782-790.
[HKMR04]
Kirsten Hildrum, John Kubiatowicz, Sean Ma, and Satish B. Rao. A note on the nearest neighbor in growth-restricted metrics. In 15th Symposium on Discrete Algorithms (SODA), pages 560–561. ACM-SIAM, January 2004.
[HKMS16]
Dan Hefetz, Fabian Kuhn, Yannic Maus, and Angelika Steger. Polynomial lower bound for distributed graph coloring in a weak LOCAL model. In 30th International Symposium on Distributed Computing (DISC), volume 9888 of Lecture Notes in Computer Science (ARCoSS), pages 99–113. Springer, September 2016.
[HKMT21]
Magnús M. Halldórsson, Fabian Kuhn, Yannic Maus, and Tigran Tonoyan. Efficient randomized distributed coloring in CONGEST. In 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 1180–1193. ACM Press, June 2021.
[HKN14]
Monika Rauch Henzinger, Sebastian Krinninger, and Danupon Nanongkai. A subquadratic-time algorithm for decremental single-source shortest paths. In 25th Symposium on Discrete Algorithms (SODA), pages 1053–1072. ACM-SIAM, January 2014.
[HKNT22]
Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin, and Tigran Tonoyan. Near-optimal distributed degree+1 coloring. In 54th Annual ACM Symposium on Theory of Computing (STOC), pages 450–463. ACM Press, June 2022.
[HKOSV25]
Ozan Heydt, Simeon Kublenz, Patrice Ossona de Mendez, Sebastian Siebertz, and Alexandre Vigny. Distributed domination on sparse graph classes. European Journal of Combinatorics, 123:103773, January 2025.
[HKP18]
Andreas M. Hinz, Sandi Klavžar, and Ciril Petr. The tower of Hanoi -- Myths and maths. Birkhäuser, 2018.
[HKR03]
Kirsten Hildrum, John Kubiatowicz, and Satish B. Rao. Another way to find the nearest neighbor in growth-restricted metrics. Technical Report UCB/CSD-03-1267, Computer Science Division (EECS), University of California, Berkeley, California, USA, August 2003.
[HKR91]
H. Hofestädt, A. Klein, and Erwin Reyzl. Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks. In Arndt Bode, editor, 2nd European Distributed Memory Computing Conference (EDMCC), volume 487 of Lecture Notes in Computer Science, pages 193–202. Springer-Verlag, April 1991.
[HKRS97]
Philip N. Klein, Satish B. Rao, Monika Rauch Henzinger, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences, 55(1):3–23, August 1997.
[HKU14]
Daniel Heldt, Kolja Knauer, and Torsten Ueckerdt. On the bend-number of planar and outerplanar graphs. Discrete Applied Mathematics, 179:109–119, December 2014.
[HKW25]
Kevin Hendrey, Nikolai Karol, and David R. Wood. Structure of k-matching-planar graphs. Technical Report 2507.22395v2 [math.CO], arXiv, October 2025.
[HL09]
Tai-Hsin Hsu and Hsueh-I Lu. An optimal labeling for node connectivity. In 20th Annual International Symposium on Algorithms and Computation (ISAAC), volume 5878 of Lecture Notes in Computer Science, pages 303–310. Springer, December 2009.
[HL14]
Mihály Hujter and Zsolt Lángi. On the multiple Borsuk numbers of sets. Israel Journal of Mathematics, 199:219–239, 2014.
[HL15]
Alexander E. Holroyd and Thomas M. Liggett. Symmetric 1-dependent colorings of the integers. Electronic Communications in Probability, 20(31):1–8, 2015.
[HL16]
Alexander E. Holroyd and Thomas M. Liggett. Finitely dependent coloring. Forum of Mathematics, Pi, 4(e3):1–43, 2016.
[HL57]
C. Brian Haselgrove and John Leech. Note on restricted difference bases. Journal of the London Mathematical Society, 32(2):228–231, April 1957.
[HLS14]
Miikka Hilke, Christoph Lenzen, and Jukka Suomela. Brief announcement: local approximability of minimum dominating set on planar graphs. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 344–346. ACM Press, July 2014.
[HLS99]
Yahya Ould Hamidoune, Anna S. Lladó, and Oriol Serra. An isoperimetric problem in Cayley graphs. Theory of Computing Systems, 32:507–516, October 1999.
[HLW94]
David Haussler, Nick Littlestone, and Manfred K. Warmuth. Predicting {0,1}-functions on randomly drawn points. Information and Computation, 115(2):248–292, December 1994.
[HLWY11]
Danny Hermelin, Avivit Levy, Oren Weimann, and Raphael Yuster. Distance oracles for vertex-labeled graphs. In 38th International Colloquium on Automata, Languages and Programming (ICALP), volume 6756 of Lecture Notes in Computer Science (ARCoSS), pages 490–501. Springer, July 2011.
[HLZ17]
Bernhard Haeupler, Jason Li, and Goran Zuzic. Shortcuts in excluded minor graphs, August 2017. Sumitted SODA'17.
[HLZ17b]
Bernhard Haeupler, Jason Li, and Goran Zuzic. Shortcuts in excluded minor graphs, November 2017. Sumitted STOC'17.
[HM20]
Heidi Howard and Richard Mortier. Paxos vs Raft: Have we reached consensus on distributed consensus?Technical Report 2004.05074v2 [cs.DC], arXiv, April 2020.
[HM90]
Peter L. Hammer and Frédéric Maffray. Completely separable graphs. Discrete Applied Mathematics, 27(1-2):85–99, May 1990.
[HMcK88]
Derek A. Holton and Brendan D. McKay. The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices. Journal of Combinatorial Theory, Series B, 45(3):305–319, December 1988.
[HMcR11]
Mahdieh Hasheminezhad, Brendan D. McKay, and Tristan Reeves. Recursive generation of simple planar 5-regular graphs and pentangulations. Journal of Graph Algorithms and Applications, 15(3):417–436, 2011.
[HMM98]
George Havas, Bohdan S. Majewski, and Keith R. Matthews. Extended GCD and Hermite normal form algorithms via lattice reduction. Experimental Mathematics, 7(2):125–136, 1998.
[HMMP23]
Joseph Hyde, Natasha Morrison, Alp Müyesser, and Matías Pavez-Signé. Construction de graphes universels via des réseaux de tri. In 25es Journées Graphes et Algorithmes, page 24, November 2023.
[HMNWW20]
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, and Kaiyu Wu. Distance oracles for interval graphs via breadth-first rank/select in succinct trees. Technical Report 2005.07644v2 [cs.DS], arXiv, September 2020.
[HMNWW20a]
Meng He, J. Ian Munro, Yakov Nekrich, Sebastian Wild, and Kaiyu Wu. Distance oracles for interval graphs via breadth-first rank/select in succinct trees. In 31st Annual International Symposium on Algorithms and Computation (ISAAC), volume 181 of LIPIcs, pages 25:1–25:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[HMP01]
Marie-Claude Heydemann, Nausica Marlin, and Stéphane Pérennès. Complete rotations in Cayley graphs. European Journal of Combinatorics, 22(2):179–196, February 2001.
[HMP95]
Celina M. Herrera de Figueiredo, João Meidanis, and Célia Picinin de Mello. A linear-time algorithm for proper interval recognition. Information Processing Letters, 56(3):179–184, November 1995.
[HMP97]
Marie-Claude Heydemann, Nausica Marlin, and Stéphane Pérennès. Cayley graphs with complete rotations. Research Report 1155, LRI, Bât. 490, Université Paris-Sud, 91405 Orsay cedex, France, 1997.
[HMR07]
Meng He, J. Ian Munro, and Satti Srivivasa Rao. Succinct ordinal trees based on tree covering. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 509–520. Springer, July 2007.
[HMR83]
Jia-Wei Hong, Kurt Mehlhorn, and Arnold L. Rosenberg. Cost trade-offs in graph embeddings, with applications. Journal of the ACM, 30(4):709–728, October 2001.
[HMS00]
Tetsuya Hiroshima, Yuichiro Miyamoto, and Kokichi Sugihara. Another proof of polynomial-time recognizability of Delaunay graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E83-A(4):627–638, April 2000.
[HMS89]
Marie-Claude Heydemann, J.C. Meyer, and Dominique Sotteau. On forwarding indices of networks. Discrete Applied Mathematics, 23(2):103–123, May 1989.
[HMSTW21]
Tony Huynh, Bojan Mohar, Robert Šámal, Carsten Thomassen, and David R. Wood. Universality in minor-closed graph classes. Technical Report 2109.00327v1 [math.CO], arXiv, September 2021.
[HMT88]
András Hajnal, Wolfgang Maas, and György Turán. On the communication complexity of graph properties. In 20th Annual ACM Symposium on Theory of Computing (STOC), pages 186–191. ACM Press, May 1988.
[HMZ11]
Meng He, J. Ian Munro, and Gelin Zhou. Path queries in weighted trees. In 22nd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7074 of Lecture Notes in Computer Science, pages 140–149. Springer, December 2010.
[HMZ12]
Meng He, J. Ian Munro, and Gelin Zhou. Succinct data structures for path queries. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 575–586. Springer-Verlag, September 2012.
[HMZ12a]
Meng He, J. Ian Munro, and Gelin Zhou. A framework for succinct labeled ordinal trees over large alphabets. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 537–547. Springer, December 2012.
[HN10]
Seok-Hee Hong and Hiroshi Nagamochi. An algorithm for constructing star-shaped drawings of plane graphs. Computational Geometry: Theory and Applications, 43(2):191–206, February 2010.
[HN24]
David G. Harris and N.S. Narayanaswamy. A faster algorithm for vertex cover parameterized by solution size. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov, editors, 41st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 289 of LIPIcs, pages 40:1–40:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2024.
[HN24a]
David G. Harris and N.S. Narayanaswamy. A faster algorithm for vertex cover parameterized by solution size. Technical Report 2205.08022v6 [cs.DS], arXiv, January 2024.
[HNP06]
Mikael Hammar, Bengt J. Nilsson, and Mia Persson. The online freeze-tag problem. In 7th Latin American Symposium on Theoretical Informatics (LATIN), volume 3887 of Lecture Notes in Computer Science, pages 569–579. Springer, March 2006.
[HNRT01]
MohammadTaghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Fast approximation schemes for K3,3-minor-free or K5-minor-free graphs. Electronic Notes in Discrete Mathematics, 10:137–142, November 2001.
[HNT21]
Magnús M. Halldórsson, Alexandre Nolin, and Tigran Tonoyan. Ultrafast distributed coloring of high degree graphs. Technical Report 2105.04700v1 [cs.DC], arXiv, May 2021.
[HNT22]
Magnús M. Halldórsson, Alexandre Nolin, and Tigran Tonoyan. Overcoming congestion in distributed coloring. In 41st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 26–36. ACM Press, July 2022.
[HNZ12]
Meng He, Patrick K. Nicholson, and Norbert Zeh. A space-efficient framework for dynamic point location. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 548–557. Springer, December 2012.
[HO07]
Petr Hliněný and Sang-il Oum. Finding branch-decompositions and rank-decompositions, 2007.
[Hobbs73]
Arthur M. Hobbs. Some Hamiltonian results in powers of graphs. Journal of Research of the National Bureau of Standards -- B. Mathematical Sciences, 77B(1-2):1–10, 1973.
[Hocquart22]
Hervé Hocquart. On various problems related to edge-colorings, January 2013. Thèse d'habilitation à diriger les recherches, Université de Bordeaux.
[Hohberg92]
Walter Hohberg. The decomposition of graphs into k-connected components. Discrete Mathematics, 109(1-3):133–145, November 1992.
[Hosono90]
Kiyoshi Hosono. Induced forests in trees and outerplanar graphs. Proceedings of the Faculty of Science of Tokai University, 25:27–29, March 1990.
[Howorka79]
Edward Howorka. On metric properties of certain clique graphs. Journal of Combinatorial Theory, Series B, 27(1):67–74, August 1979.
[HP00]
Yehuda Hassin and David Peleg. Sparse communication networks and efficient routing in the plane. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41–59. ACM Press, July 2000.
[HP01]
Yehuda Hassin and David Peleg. Sparse communication networks and efficient routing in the plane. Distributed Computing, 14(4):205–215, 2001.
[HP03]
Cary W. Huffman and Vera Pless. Error-correcting codes. Cambridge University Press, 2003.
[HP09]
Sariel Har-Peled. Approximating spanning trees with low crossing. Technical Report 0907.1131v1 [cs.CG], arXiv, July 2009.
[HP73]
Frank Harary and Edgar M. Palmer. Graphical enumeration. Academic Press, 1973.
[HPIS13]
Sariel Har-Peled, Piotr Indyk, and Anastasios Sidiropoulos. Euclidean spanners in high dimensions. In 24th Symposium on Discrete Algorithms (SODA), pages 804–809. ACM-SIAM, January 2013.
[HPR13]
Sariel Har-Peled and Benjamin Raichel. Net and prune: A linear time algorithm for euclidean distance problems. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 605–614. ACM Press, June 2013.
[HPS92]
Georges Hansel, Dominique Perrin, and Imre Simon. Compression and entropy. In 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 577 of Lecture Notes in Computer Science, pages 515–528. Springer, February 1992.
[HPS96]
Marie-Claude Heydemann, Joseph G. Peters, and Dominique Sotteau. Spanners of hypercube-derived networks. SIAM Journal on Discrete Mathematics, 9(1):37–54, 1996.
[HPTV07]
Pinar Heggernes, Christophe Paul, Jan Arne Telle, and Yngve Villanger. Interval completion with few edges. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 374–381. ACM Press, June 2007.
[HPV98]
Michel Habib, Christophe Paul, and Laurent Viennot. A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata. In 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1373 of Lecture Notes in Computer Science, pages 25–38. Springer-Verlag, 1998.
[HR14]
Albrecht Heeffer and Benoit Rittaud. The pigeonhole principle, two centuries before Dirichlet. The Mathematical Intelligencer, 36(2):27–29, June 2014.
[HR18]
Godfrey Harold Hardy and Srinivâsa Aiyangâr Râmânujan. Asymptotic formulæ in combinatory analysis. Proceedings of the London Mathematical Society, 17(1):75–115, 1918.
[HR48]
Wassily Hoeffding and Herbert Robbins. The central limit theorem for dependent variables. Duke Mathematical Journal, 15(3):773–780, 1948.
[HR90]
Torben Hagerup and Christine Rüb. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305–308, February 1990.
[HRS75]
Frank Harary, Robert W. Robinson, and Allen J. Schwenk. Twenty-step algorithm for determining the asymptotic number of trees of various speces. Journal of the Australian Mathematical Society (Series A), 20(4):483–503, November 1975.
[HRS92]
Craig D. Hodgson, Igor Rivin, and Warren D. Smith. A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere. Bulletin of the American Mathematical Society, 27(2):256–251, October 1992.
[HRT15]
Jacob Holm, Eva Rotenberg, and Mikkel Thorup. Planar reachability in linear space and constant time. In 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 370–389. IEEE Computer Society Press, October 2015.
[HRT17]
Jacob Holm, Eva Rotenberg, and Mikkel Thorup. Dynamic bridge-finding in Õ(log2n) amortized time. Technical Report 1411.1263v1 [cs.DS], arXiv, July 2017.
[HS01]
Ibrahima Sakho and M. Boukhalfa Hadim. The multi-level communication: Efficient routing for interconnection networks. The Journal of Supercomputing, 18(2):137–177, 2001.
[HS07]
Petr Hliněný and Gelasio Salazar. Approximating the crossing number of toroidal graphs. In 18th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4835 of Lecture Notes in Computer Science, pages 148–159. Springer, December 2007.
[HS20]
Oussama Hanguir and Clifford Stein. Distributed algorithms for matching in hypergraphs. In Christos Kaklamanis and Asaf Levin, editors, 8th International Workshop on Approximation and Online Algorithms (WAOA), volume 12806 of Lecture Notes in Computer Science, pages 30–46. Springer, Cham, September 2020.
[HS70]
András Hajnal and Endre Szemerédi. Proof of a conjecture of p. Erdős. In Paul Erdős, Alfréd Rényi, and Vera T. Sós, editors, Combinatorial Theory and Its Applications, II, Proc. Colloq., Balatonfüred (Hungary), 1969, pages 601–623. North-Holland, 1970.
[HS71]
Frank Harary and Allen J. Schwenk. Trees with Hamiltonian square. Mathematika, 18(1):138–140, 1971.
[HS73]
Frank Harary and Allen J. Schwenk. The number of caterpillars. Discrete Mathematics, 6(4):359–365, 1973.
[HS99]
George Havas and Jean-Pierre Seifert. The complexity of the extended GCD problem. In 24th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1672 of Lecture Notes in Computer Science, pages 103–113. Springer, September 1999.
[HSKJx24]
SarahRose Hall, Oliver N. Schipper, Jonathan R.M. Kaplan, A. Holly Johnson, Tyler A. Gonzalez, and Ettore Vulcano. Outcomes after percutaneous Zadek osteotomy for insertion Achilles tendinopathy. Journal of the American Orthopaedic Foot & Ankle Society, 45(9):931–939, 2024.
[HSS07]
Kevin R. Hutson, Terri L. Schlosser, and Douglas R. Shier. On the distributed Bellman-Ford algorithm and the looping problem. INFORMS Journal on Computing, 19(4):542–551, 2007.
[HSS16]
David G. Harris, Johannes Schneider, and Hsin-Hao Su. Distributed (Δ+1)-coloring in sublogarithmic rounds. In 48th Annual ACM Symposium on Theory of Computing (STOC), pages 465–478. ACM Press, June 2016.
[HSTV11]
Eivind Magnus Hvidevold, Sadia Sharmin, Jan Arne Telle, and Martin Vatshelle. Finding good decompositions for dynamic programming on dense graphs. In 6th International Symposium on Parameterized and Exact Computation (IPEC), volume 7112 of Lecture Notes in Computer Science, pages 219–231. Springer, September 2011.
[HSW17]
Alexander E. Holroyd, Oded Schramm, and David B. Wilson. Finitary coloring. The Annals of Probability, 45(5):2867–2898, 2017.
[HSW25]
Gary Hoppenworth, Thatchaphol Saranurak, and Benyu Wang. Near-optimal fault-tolerant strong connectivity preservers. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1613–1641. IEEE Computer Society Press, December 2025.
[HT02]
Yijie Han and Mikkel Thorup. Integer sorting in O(n√loglogn\,) expected time and linear space. In 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 135–144. IEEE Computer Society Press, November 2002.
[HT14]
Magnús M. Halldórsson and Tigran Tonoyan. How well can graphs represent wireless interference?Technical Report 1411.1263v1 [cs.NI], arXiv, November 2014.
[HT20]
Walter Hussak and Amitabh Trehan. On the termination of flooding. In Christophe Paul and Markus Bläser, editors, 37th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 154 of LIPIcs, pages 17:1–17:13. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2020.
[HT24]
Chính T. Hoàng and Nicolas Trotignon. A class of graphs with large rankwidth. Discrete Mathematics, 347(1):113699, January 2024.
[HT73]
John E. Hopcroft and Robert Endre Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing, 2(3):135–158, 1973.
[HT74]
John E. Hopcroft and Robert Endre Tarjan. Efficient planarity testing. Journal of the ACM, 21(4):549–568, 1974.
[HT74a]
John E. Hopcroft and Robert Endre Tarjan. Dividing a graph into triconnected components. Technical Report TR 72-140 (new revision), Computer Science Departement, Cornell University, February 1974.
[HT84]
Dov Harel and Robert Endre Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13(2):338–355, May 1984.
[HT86]
Refael Hassin and Arie Tamir. Efficient algorithms for optimization and selection on series-parallel graphs. SIAM Journal on Algebraic and Discrete Methods, 7(3):379–389, July 1986.
[Hunt19]
John Hunt. Advanced guide to python 3 programming. Undergraduate Topics in Computer Science (UTiCS). Springer, 2019.
[Hutchinson88]
Joan P. Hutchinson. On short noncontractible cycles in embedded graphs. SIAM Journal on Discrete Mathematics, 1(2):185–192, 1988.
[HvdH19]
David Harvey and Joris van der Hoeven. Integer multiplication in time O(nlogn). Technical Report hal-02070778, HAL, March 2019.
[HvdH21]
David Harvey and Joris van der Hoeven. Integer multiplication in time O(nlogn). Annals of Mathematics, 193(2):563–617, March 2021.
[HvHM13]
Pinar Heggernes, Pim van't Hof, and Martin Milanič. Induced subtrees in interval graphs. In Thierry Lecroq and Laurent Mouchard, editors, 24th International Workshop on Combinatorial Algorithms (IWOCA), volume 8288 of Lecture Notes in Computer Science, pages 230–243. Springer, July 2013.
[HW07]
Johan Håstad and Avi Wigderson. The randomized communication complexity of set disjointness. Theory of Computing, 3(Article 11):211–219, October 2007.
[HW12]
Stephan Holzer and Roger Wattenhofer. Optimal distributed all pairs shortest paths and applications. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 355–364. ACM Press, July 2012.
[HW15]
Stefan Hougardy and Mirko Wilde. On the nearest neighbor rule for the metric traveling salesman problem. Discrete Mathematics, 195:101–103, November 2015.
[HW16]
Daniel J. Harveyn and David R. Wood. Parameters tied to treewidth. Technical Report 1312.3401v2 [math.CO], arXiv, January 2016.
[HW17]
Daniel J. Harveyn and David R. Wood. Parameters tied to treewidth. Journal of Graph Theory, 84(4):364–385, April 2017.
[HW24]
Meng He and Kaiyu Wu. Closing the gap: Minimum space optimal time distance labeling scheme for interval graphs. In Shunsuke Inenaga and Simon J. Puglisi, editors, 35th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 296 of LIPIcs, pages 17:1–17:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2024.
[HW24a]
Robert Hickingbotham and David R. Wood. Shallow minors, graph products, and beyond-planar graphs. SIAM Journal on Discrete Mathematics, 38(1):1057–1089, 2024.
[HWY10]
Pavel Hrubeš, Avi Wigderson, and Amir Yehudayoff. Relationless completeness and separations. In 25th Annual IEEE Conference on Computational Complexity (CCC), pages 280–290. IEEE Computer Society, June 2010.
[HWZ21]
Nathaniel Harms, Sebastian Wild, and Viktor Zamaraev. Randomized communication and the implicit graph conjecture. Technical Report 2111.03639v1 [cs.DS], arXiv, November 2021.
[HWZ22]
Nathaniel Harms, Sebastian Wild, and Viktor Zamaraev. Randomized communication and the implicit graph conjecture. In 54th Annual ACM Symposium on Theory of Computing (STOC), pages 1220–1233. ACM Press, June 2022.
[HZ06]
Xin He and Huaming Zhang. Nearly optimal visibility representations of plane graphs. In 33rd International Colloquium on Automata, Languages and Programming (ICALP), volume 4051 of Lecture Notes in Computer Science, pages 407–418, 2006.
[i:Gav00c]
Cyril Gavoille. Implicit representation and distance labeling of graphs. In Workshop on Structured Families of Graphs, May 2000.
[i:Gav01]
Cyril Gavoille. Compact and distributed data structures (invited lecture). In IWIN-SIROCCO '01 joint conference, June 2001.
[i:Gav05]
Cyril Gavoille. Distributed data structures: A survey (invited talk). In 12th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 3499 of Lecture Notes in Computer Science, page 2. Springer, May 2005.
[i:Gav05b]
Cyril Gavoille. Distributed data structures: A survey I & II. In 8th Seminar on Optimization and Decision Aid (SODA), France Télécom R&D Division, June 2005.
[i:Gav05c]
Cyril Gavoille. Étiquetage des graphes. In École Jeunes Chercheurs en Algorithmique et Calcul Formel - École thématique CNRS 05 13 051, April 2005.
[i:Gav06]
Cyril Gavoille. Distributed data structures: A survey on informative labeling schemes (invited talk). In Rastislav Královič and Paweł Urzyczyn, editors, 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 4162 of Lecture Notes in Computer Science, page 38. Springer, August 2006.
[i:Gav06a]
Cyril Gavoille. An overview on compact routing. In 2nd Research Workshop on Flexible Network Design, October 2006.
[i:Gav07]
Cyril Gavoille. An overview on compact routing. In Workshop on Peer-to-Peer, Routing in Complex Graphs, and Network Coding, March 2007.
[i:Gav07a]
Cyril Gavoille. Localized data structures (keynote talk). In 2nd Workshop on Locality Preserving Distributed Computing Methods (LOCALITY), August 2007. Co-located with PODC 2007.
[i:Gav09]
Cyril Gavoille. Routing in distributed systems (3 invited lectures). In 1st Workshop on New Challenges in Distributed Systems, April 2009.
[i:Gav11]
Cyril Gavoille. Oracles pour les arbres et les graphes. In 10 ans du séminaire MaMux - Mathématiques, musique et relations avec d'autres disciplines, May 2011.
[i:Gav11b]
Cyril Gavoille. Dynamic algorithms via forbidden-set labeling. In First International Workshop on Dynamic Systems (DYNAM), December 2011.
[i:Gav12]
Cyril Gavoille. Progress and challenges for labeling schemes. In First International Workshop on Advances in Distributed Graph Algorithms (ADGA), October 2012.
[i:Gav13]
Cyril Gavoille. Labeling schemes with forbidden-sets. In 20th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 8179 of Lecture Notes in Computer Science. Springer, July 2013.
[i:Gav14]
Cyril Gavoille. Data structures for emergency planning. In 8th Foundations of Information and Knowledge Systems (FoIKS), volume 8367 of Lecture Notes in Computer Science (ARCoSS). Springer, March 2014.
[i:Gav15]
Cyril Gavoille. An overview on compact routing (in discrete domains). In CMO-BIRS Workshop on Searching and Routing in Discrete and Continuous Domains, October 2015.
[i:Gav17a]
Cyril Gavoille. Compact and distributed data structures. In 44e École de Printemps en Informatique Théorique (EPIT) -- Distributed Computing, May 2017.
[i:Gav17b]
Cyril Gavoille. Beyond classical local models in distributed computing. In 44e École de Printemps en Informatique Théorique (EPIT) -- Distributed Computing, May 2017.
[i:Gav19a]
Cyril Gavoille. Distributed computing with quantum resources and beyond. In Complexity, Algorithms, Automata and Logic Meet (CAALM), January 2019.
[i:Gav19b]
Cyril Gavoille. Shorter implicit representation for planar graphs. In Sergio Cabello and Bojan Mohar, editors, 9th Slovenian International Conference on Graph Theory (SICGT), page 63. Institute of Mathematics, Physics and Mechanics (IMFM), June 2019.
[i:Gav20]
Cyril Gavoille. Consequences for adjacency labelling schemes. In Journées Combinatoire Rhône-Alples, Auvergne, Littoral Méditerranéen et Athlantique (JCRAALMA), May 2020.
[i:Gav21]
Cyril Gavoille. Universal graphs. In Journées de Combinatoire de Bordeaux, February 2021.
[i:Gav22]
Cyril Gavoille. Smaller universal graphs for caterpillars and graphs of bounded path-width. In 2nd Workshop on Complexity and Algorithms (CoA), September 2022.
[i:Gav22a]
Cyril Gavoille. A succinct story of compact stuff. In FRAIGNIAUD Workshop, November 2022.
[i:Gav97]
Cyril Gavoille. Compact routing: Lower bounds techniques (invited lecture). In International Research School on "Sense of Direction and Compact Routing", June 1997.
[ICK17]
Ittai Abraham, Shiri Chechik, and Sebastian Krinninger. Fully dynamic all-pairs shortest paths with worst-case update-time revisited. In 28th Symposium on Discrete Algorithms (SODA), pages 440–452. ACM-SIAM, January 2017.
[IIOY05]
Hiro Ito, Kazuo Iwama, Yasuo Okabe, and Takuya Yoshihiro. Single backup table schemes for shortest-path routing. Theoretical Computer Science, 333(3):347–353, March 2005.
[IK00]
Kazuo Iwama and Akinori Kawachi. Compact routing for with stretch factor less than three. In 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), page 337. ACM Press, July 2000.
[IK05]
Kazuo Iwama and Akinori Kawachi. Compact routing for with stretch factor less than three. IEICE Transactions on Information and Systems, E88-D(1):47–52, January 2005.
[IKMMx26]
Yuta Inoue, Ken-ichi Kawarabayashi, Atsuyuki Miyashita, Bojan Mohar, Carsten Thomassen, and Mikkel Thorup. The four color theorem with linearly many reducible configurations and near-linear time coloring. Technical Report 2603.24880v1 [math.CO], arXiv, March 2026.
[IKP21]
Giuseppe F. Italiano, Adam Karczmarz, and Nikos Parotsidis. Planar reachability under single vertex or edge failures. In 32nd Symposium on Discrete Algorithms (SODA), pages 2739–2758. ACM-SIAM, January 2021.
[ILG19]
Taisuke Izumi and Francois Le Gall. Quantum distributed algorithm for the all-pairs shortest path problem in the CONGEST-CLIQUE model. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 84–93. ACM Press, July 2019.
[IM02]
Kazuo Iwama and Hiroki Morizumi. An explicit lower bound of 5n-o(n) for boolean circuits. In 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 2420 of Lecture Notes in Computer Science, pages 353–364. Springer-Verlag, 2002.
[IM98]
Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 604–613. ACM Press, May 1998.
[Indyk01]
Piotr Indyk. Algorithmic applications of low-distortion geometric embeddings. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 10–33. IEEE Computer Society Press, October 2001.
[Inmos91]
Corp. Inmos. The T9000 Transputer Products Overview Manual, 1991.
[IO03]
Kazuo Iwama and Masaki Okita. Compact routing for flat networks. In 17th International Symposium on Distributed Computing (DISC), volume 2848 of Lecture Notes in Computer Science, pages 196–210. Springer, October 2003.
[IPS82]
Alon Itai, Christos H. Papadimitriou, and Jayme Luiz Szwarcfiter. Hamilton paths in grid graphs. SIAM Journal on Computing, 11(4):676–686, 1982.
[IS07]
Piotr Indyk and Anastasios Sidiropoulos. Probabilistic embeddings of bounded genus graphs into planar graphs. In 23rd Annual ACM Symposium on Computational Geometry (SoCG), pages 204–209. ACM, June 2007.
[Islak13]
Ümit Islak. Asymptotic normality of random sums of m-dependent random variables. Technical Report 1303.2386 [math.PR], arXiv, March 2013.
[Islak16]
Ümit Islak. Asymptotic normality of random sums of m-dependent random variables. Statistics and Probability Letters, 109:22–29, February 2016.
[ISW22]
Freddie Illingworth, Alex Scott, and David R. Wood. Product structure of graphs with an excluded minor. Technical Report 2104.06627v6 [math.CO], arXiv, October 2021.
[IW05]
Piotr Indyk and David P. Woodruff. Optimal approximations of the frequency moments of data streams. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 202–208. ACM Press, May 2005.
[IW17]
Piotr Indyk and Tal Wagner. Near-optimal (Euclidean) metric compression. In 28th Symposium on Discrete Algorithms (SODA), pages 710–723. ACM-SIAM, January 2017.
[JA14]
Jeff Jones and Andrew Adamatzky. Computation of the travelling salesman problem by a shrinking blob. Natural Computing, 13(1):1–16, March 2014.
[Jacob20]
Hugo Jacob. Chemin glouton orthogonal le plus long d'une grille. Rapport de stage de L3, encadrant Cyril Gavoille, École Normale Supérieure Paris-Saclay, July 2020.
[Jacob25]
Hugo Jacob. On forbidding simple topological minors and characterising a tree-based variant of bandwidth, August 2025. Preprint.
[Jacob89]
Guy Jacobson. Space-efficient static trees and graphs. In 30th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 549–554. IEEE Computer Society Press, October 1989.
[Jaffe85]
Jeffrey M. Jaffe. Distributed multi-destination routing: The constraints of local information. SIAM Journal on Computing, 14(4):875–888, 1985.
[Jagadish90]
H.V. Jagadish. A compression technique to materialize transitive closure. ACM Transactions on Database Systems, 15(4):558–598, December 1990.
[Jakma16]
Paul Jakma. A distributed, compact routing protocol for the internet. PhD thesis, School of Computing Science, College of Science and Engineering, University of Glasgow, September 2016.
[Janczewski25]
Wojciech Janczewski. Graph labeling schemes and dynamic longest increasing subsequence. PhD thesis, University of Warsovie, Pologne, June 2025.
[Janzer21]
Oliver Janzer. Disproof of a conjecture of Erdős and Simonovits on the Turán number of graphs with minimum degree 3. Technical Report 2109.06110v2 [math.CO], arXiv, November 2021.
[JB98]
Xiaoyi Jiang and Horst Bunke. On the coding of ordered graphs. Computing, 61(1):23–38, March 1998.
[JdKW23]
Bart M.P. Jansen, Jari J.H. de Kroon, and Michał Włodarczyk. 5-approximation for H-treewidth essentially as fast as H-deletion parameterized by solution size. In Inge Li Gørtz, Martín Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 66:1–66:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[Jelinek10]
Vít Jelínek. The rank-width of the square grid. Discrete Applied Mathematics, 158(7):841–850, April 2010.
[JHLR11]
Aubin Jarry, Florian Huc, Pierre Leone, and José D.P. Rolim. Distributed planarization and local routing strategies in sensor networks. Technical Report 1107.5154v1 [cs.NI], arXiv, July 2011.
[JLNRS05]
Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, and Ravi Sundaram. Universal approximations for TSP, Steiner tree, and set cover. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 386–395. ACM Press, May 2005.
[JLP25]
Hugo Jacob, William Lochet, and Christophe Paul. On a tree-based variant of bandwidth and forbidding simple topological minors. Technical Report 2502.11674v1 [cs.DM], arXiv, February 2025.
[JLR00]
Svante Janson, Tomasz Łuczak, and Andrzej Ruciński. Random graphs. Jon Wiley & Sons, 2000.
[JLS22]
Gwenaël Joret, William Lochet, and Michał T. Seweryn. Edge separators for graphs excluding a minor. Technical Report 2212.10998v1 [math.CO], arXiv, December 2022.
[JM11]
Kai Jin and Kevin Matulef. Finding the maximum area parallelogram in a convex polygon. In 23rd Canadian Conference on Computational Geometry (CCCG), August 2011.
[JM25]
Manuel Jakob and Yannic Maus. Towards optimal distributed delta coloring. Technical Report 2504.03080v1 [cs.DS], arXiv, April 2025.
[JMcG97]
David S. Johnson and Lyle A. McGeoch. The traveling salesman problem: A case study in local optimization. In Emile H.L. Aarts and Jan Karel Lenstra, editors, Local Search in Combinatorial Optimization, chapter 8, pages 215–310. Jon Wiley & Sons, 1997.
[JMcKx17]
Mohammadreza Jooyandeh, Brendan D. McKay, Patric R.J. Östergård, Ville H. Pettersson, and Carol T. Zamfirescu. Planar hypohamiltonian graphs on 40 vertices. Journal of Graph Theory, 84(2):121–133, 2017.
[JMN22]
Oliver Janzer, Abhishek Methuku, and Zoltán Lóránt Nagy. On the Turán number of the blow-up of the hexagon. SIAM Journal on Discrete Mathematics, 36(2):1187–1199, June 2022.
[JMS18]
Michael Jünger, Petra Mutzel, and Christiane Spisla. More compact orthogonal drawings by allowing additional bends. Information, 9(7):153, 2018.
[JMW16]
Gwenaël Joret, Piotr Micek, and Veit Wiechert. Sparsity and dimension. In 27th Symposium on Discrete Algorithms (SODA), pages 1804–1813. ACM-SIAM, January 2016.
[JO93]
Ching Yuh Jan and A. Yavuz Oruc. Fast self-routing permutation switching on an asymptotically minimum cost network. IEEE Transactions on Computers, 42(12):1469–1479, December 1993.
[Johansson12]
Fredrik Johansson. Efficient implementation of the Hardy-Ramanujan-Rademacher formula. LMS Journal of Computation and Mathematics, 15:341–359, May 2012.
[Johnson17]
Matthew Johnson. Easier hardness for 3D freeze-tag. In 27th Annual Fall Workshop on Computational Geometry (FWCG), November 2017.
[Johnson87]
David S. Johnson. The NP-completeness column: An ongoing guide -- The many faces of polynomial time. Journal of Algorithms, 8(2):285–303, June 1987.
[Jordan69]
Camille Jordan. Sur les assemblages de lignes. Journal für die reine und angewandte Mathematik, 70:185–190, 1869.
[Jorgensen01]
Leif K. Jørgensen. Vertex partitions of K4,4-minor free graphs. Graphs and Combinatorics, 17(2):265–274, June 2001.
[Jorgensen94]
Leif K. Jørgensen. Contractions to K8. Journal of Graph Theory, 18(5):431–448, August 1994.
[JRS01]
Lujun Jia, Rajmohan Rajaraman, and Torsten Suel. An efficient distributed algorithm for constructing small dominating sets. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 33–42. ACM Press, 2001.
[JRS02]
Lujun Jia, Rajmohan Rajaraman, and Torsten Suel. An efficient distributed algorithm for constructing small dominating sets. Distributed Computing, 15(4):193–205, December 2002.
[JRS98]
Andreas Jakoby, Rüdiger Reischuk, and Christian Schindelhauer. The complexity of broadcasting in planar and decomposable graphs. Discrete Applied Mathematics, 83(1-3):179–206, March 1998.
[JRSST01]
Thor Johnson, Neil Robertson, Paul D. Seymour, and Robin Thomas. Directed tree-width. Journal of Combinatorial Theory, Series B, 82(1):138–154, May 2001.
[JRXL12]
Ruoming Jin, Ning Ruan, Yang Xiang, and Victor Lee. A highway-centric labeling approach for answering distance queries on large sparse graphs. In ACM International Conference on Management of Data (SIGMOD), pages 445–456. ACM Press, May 2012.
[JS12]
Tao Jiang and Robert Seiver. Turán numbers of subdivided graph. SIAM Journal on Discrete Mathematics, 26(3):1238–1255, 2012.
[JSC90]
Ravi Janardan and Wing Siu Cheng. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks. In G. Goos, J. Hartmauis, Jan van Leeuwen, and Nicola Santoro, editors, 4th International Workshop on Distributed Algorithms (WDAG), volume 486 of Lecture Notes in Computer Science, pages 133–150. Springer-Verlag, September 1990.
[JSC92]
Ravi Janardan and Wing Siu Cheng. Efficient distributed algorithms for single-source shortest paths and related problems on plane networks. Mathematical Systems Theory, 25(2):93–122, 1992.
[JSS07]
Jesper Jansson, Kunihiko Sadakane, and Wing-Kin Sung. Ultra-succinct representation of ordered trees. In 18th Symposium on Discrete Algorithms (SODA), pages 575–584. ACM-SIAM, January 2007.
[JSS16]
Spencer Johnson, Anthony Shaheen, and Gustavo Subuyuj. The isoperimetric number of a generalized Paley graph. Serdica Mathematical Journal, 42(3-4):235–250, 2016.
[JSSWx20]
Jiaqing Jiang, Xiaoming Sun, Shang-Hua Teng, Bujiao Wu, Kewen Wu, and Jialin Zhang. Optimal space-depth trade-off of CNOT circuits in quantum logic synthesis. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 213–229. ACM-SIAM, January 2020.
[Juganaru93]
Mihaela Juganaru. Routage avec table de routage compacte. Mémoire de DEA, ENSIMAG, Grenoble, June 1993.
[JV09]
Philippe Jacquet and Laurent Viennot. Remote spanners: what to know beyond neighbors. In 23rd IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE Computer Society Press, May 2009.
[JW12]
Kyle F. Jao and Douglas B. West. Vertex degrees in outerplanar graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 82:229–239, 2012.
[JW13]
Gwenaël Joret and David R. Wood. Complete graph minors and the graph minor structure theorem. Journal of Combinatorial Theory, Series B, 103(1):61–74, January 2013.
[Kachigar19]
Ghazal Kachigar. Questions de localisabilité pour le calcul distribué. PhD thesis, Université Bordeaux, Talence, France, December 2019.
[KADS02]
Andrei Khodakovsky, Pierre Alliez, Mathieu Desbrun, and Peter Schröder. Near-optimal connectivity encoding of 2-manifold polygon meshes. Graphical Models, 64(3-4):147–168, July 2002.
[Kalai19]
Gil Kalai. The argument against quantum computers. Technical Report 1908.02499 [quant-ph], arXiv, August 2019.
[Kalai97]
Gil Kalai. On the paper of Witztum, Rips and Rosenberg on equidistant letter sequences in the Book of Genesis, 1997.
[Kammer07]
Frank Kammer. Determining the smallest k such that g is k-outerplanar. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 359–370. Springer, October 2007.
[Kanj09]
Iyad A. Kanj. On spanners of geometric graphs. In 6th Annual Conference on Theory and Applications of Models of Computation (TAMC), volume 5532 of Lecture Notes in Computer Science, pages 49–58. Springer, May 2009.
[Kann92]
Viggo Kann. On the approximability of the maximum common subgraph problem. In 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 577 of Lecture Notes in Computer Science, pages 375–388. Springer, February 1992.
[Kant92]
Goos Kant. Drawing planar graphs using the lmc-ordering. In 33rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 101–110. IEEE Computer Society Press, October 1992.
[Kante08]
Mamadou Moustapha Kanté. Graphs structurings -- Some algorithmic applications. PhD thesis, Université Bordeaux 1, Talence, France, December 2008.
[Karakostas04]
George Karakostas. A better approximation ratio for the Vertex Cover problem. In Electronic Colloquium on Computational Complexity (ECCC), TR04-084, October 2004.
[Karatsuba95]
Anatolii Alexevich Karatsuba. The complexity of computations. In Steklov Institute of Mathematics, volume 211, pages 169–183, 1995.
[Karp72]
Richard M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, The IBM Research Symposia Series, pages 85–103. NY: Plenum Press, 1972.
[Karpinski15]
Marek Karpinski. Towards better inapproximability bounds for TSP: A challenge of global dependencies. In Electronic Colloquium on Computational Complexity (ECCC), TR15-097, June 2015.
[Karthick14]
T. Karthick. Note on equitable coloring of graphs. The Australasian Journal of Combinatorics, 59(2):251–259, June 2014.
[Karzanov73]
Alexander V. Karzanov. O nakhozhdenii maksimal'nogo potoka v setyakh spetsial'nogo vida i nekotorykh prilozheniyakh. In L.A. Lyusternik, editor, Matematicheskie Voprosy Upravleniya Proizvodstvom, volume 5, pages 81–94. Moscow State University Press, 1973.
[Kavitha07]
Telikepalli Kavitha. Linear time algorithms for abelian group isomorphism and related problems. Journal of Computer and System Sciences, 73(6):986–996, September 2007.
[Kawa07]
Ken-ichi Kawarabayashi. Half integral packing, Erdős-Posá-property and graph minors. In 18th Symposium on Discrete Algorithms (SODA), pages 1187–1196. ACM-SIAM, January 2007.
[Kawa09]
Ken-ichi Kawarabayashi. Planarity allowing few error vertices in linear time. In 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 639–648. IEEE Computer Society Press, October 2009.
[Kawa13]
Ken-ichi Kawarabayashi. 5-coloring K3,k-minor-free graphs. In 24th Symposium on Discrete Algorithms (SODA), pages 985–1003. ACM-SIAM, January 2013.
[Kawa13a]
Ken-ichi Kawarabayashi. Totally odd subdivisions and parity subdivisions: Structures and coloring. In 24th Symposium on Discrete Algorithms (SODA), pages 1013–1029. ACM-SIAM, January 2013.
[KB05]
Craig S. Kaplan and Robert Bosch. TSP art. In Reza Sarhangi and Robert V. Moody, editors, Renaissance Banff: Mathematical Connections in Art, Music and Science, pages 301–308. Bridges Conference, July 2005.
[KB10]
Neelesh Khanna and Surender Baswana. Approximate shortest path oracle under vertex failure. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 513–524. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2010.
[KB78]
Peter D. Killworth and H. Russell Bernard. Reverse small-world experiment. Social Networks, 1(2):159–192, 1978.
[KBOFA20]
David Krakauer, Nils Bertschinger, Eckehard Olbrich, Jessica C. Flack, and Nihat Ay. The information theory of individuality. Theory in Biosciences, 139:209–223, 2020.
[KBvH01]
Arie M.C.A. Koster, Hans Leo Bodlaender, and Stan P.M. van Hoesel. Treewidth: Computational experiments. In 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW), volume 8 of Electronic Notes in Discrete Mathematics, pages 54–57. Elsevier, May 2001.
[KC12]
Ken-ichi Kawarabayashi and Carsten Thomassen. From the plane to higher surfaces. Journal of Combinatorial Theory, Series B, 102(4):852–868, July 2012.
[KC65]
David C. Kay and Gary Chartrand. A characterization of certain ptolemaic graphs. Canadian Journal of Mathematics, 17:342–346, 1965.
[KCBJx03]
Peter D. Killworth, Christopher McCarty, H. Russell Bernard, Eugene C. Johnsen, John Domini, and Gene A. Shelley. Two interpretations of reports of knowledge of subpopulation sizes. Social Networks, 25(3):141–160, 2003.
[KCFB07]
Dmitri Krioukov, KC Claffy, Kevin Fall, and Arthur Brady. On compact routing for the internet. ACM SIGCOMM Computer Communication Review, 37(3):43–52, July 2007.
[KCRAx07]
Karthik Kalambur Lakshminarayanan, Matthew Chapman Caesar, Murali Rangan, Thomas Anderson, Scott Shenker, and Ion Stoica. Achieving convergence-free routing using failure-carrying packets. Technical Report UCB/EECS-2007-28, EECS Department, University of California, Berkeley, ration, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com, February 2007.
[KD19]
Farideh Khoeini and Tomasz Dzido. On some three color Ramsey numbers for paths, cycles, stripes and stars. Graphs and Combinatorics, 35:559–567, 2019.
[Keil88]
J. Mark Keil. Approximating the complete Euclidean graph. In 1st Scandinavian Workshop on Algorithm Theory (SWAT), volume 318 of Lecture Notes in Computer Science, pages 208–213. Springer, July 1988.
[Kelsen96]
Pierre Kelsen. Neighborhood graphs and distributed δ+1-coloring. In 5th Scandinavian Workshop on Algorithm Theory (SWAT), volume 1097 of Lecture Notes in Computer Science, pages 223–233. Springer, July 1996.
[Keshavarz16]
Hamidreza Keshavarz. Applying tabu search to the freeze-tag. In 1st Conference on Swarm Intelligence and Evolutionary Computation (CSIEC), pages 37–41. IEEE Computer Society Press, March 2016.
[KFR04]
Danny Krizanc, Flaminia L. Luccio, and Rajeev Raman. Compact routing schemes for dynamic ring networks. Theory of Computing Systems, 37(5):585–607, 2004.
[KFY04]
Dmitri Krioukov, Kevin Fall, and Xiaowei Yang. Compact routing on internet-like graphs. In 23rd Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 1, pages 208–219, March 2004.
[KG89]
J. Mark Keil and Carl A. Gutwin. The Delaunay triangulation closely approximates the complete Euclidean graph. In International Workshop on Algorithms and Data Structures (WADS), volume 382 of Lecture Notes in Computer Science, pages 47–56. Springer, August 1989.
[KG92]
J. Mark Keil and Carl A. Gutwin. Classes of graphs which approximate the complete Euclidean graph. Discrete & Computational Geometry, 7(1):13–28, December 1992.
[Khot05]
Subhash A. Khot. Hardness of approximating the shortest vector problem in lattices. Journal of the ACM, 52(5):789–808, September 2005.
[Khuller02]
Samir Khuller. The vertex cover problem. ACM SIGACT News - Algorithms Column, 33(2):31–33, June 2002.
[Kir90]
Peter Kirschenhofer. Enumeration of trees. In Arnold R. Kräuter, editor, Séminaire Lotharingien de Combinatoire, 25e Session, pages 19–61, September 1990.
[KK03]
Łukasz Kowalik and Maciej Kurowski. Short path queries in planar graphs in constant time. In 35th Annual ACM Symposium on Theory of Computing (STOC), pages 143–148. ACM Press, 2003.
[KK06]
Łukasz Kowalik and Maciej Kurowski. Oracles for bounded-length shortest paths in planar graphs. ACM Transactions on Algorithms, 2(3):335–363, July 2006.
[KK06c]
Adrian Kosowski and Łukasz Kuszner. On greedy graph coloring in the distributed model. In 12th European Conference on Parallel Computing (EuroPar), volume 4128 of Lecture Notes in Computer Science, pages 592–601. Springer, August 2006.
[KK07]
Amos Korman and Shay Kutten. Controller and estimator for dynamic networks. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 175–184. ACM Press, August 2007.
[KK07a]
Amos Korman and Shay Kutten. Labeling schemes with queries. In 14th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 4474 of Lecture Notes in Computer Science, pages 109–123. Springer, June 2007.
[KK08]
Florica Kramer and Horst Kramer. A survey on the distance-colouring of graphs. Discrete Mathematics, 308(2-3):422–426, February 2008.
[KK08a]
Henry A. Kierstead and Alexandr V. Kostochka. A short proof of the Hajnal-Szemerédi theorem on on equitable colouring. Combinatorics, Probability and Computing, 17(2):265–270, 2008.
[KK09]
Amos Korman and Shay Kutten. A note on models for graph representations. Theoretical Computer Science, 410(14):1401–1412, March 2008.
[KK09a]
Yusuke Kobayashi and Ken-ichi Kawarabayashi. Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. In 20th Symposium on Discrete Algorithms (SODA), pages 1146–1155. ACM-SIAM, January 2009.
[KK12]
Ken-ichi Kawarabayashi and Yusuke Kobayashi. Linear min-max relation between the treewidth of h-minor-free graphs and its largest grid minor. In 29th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 14 of LIPIcs, pages 278–289. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2012.
[KK12a]
Henry A. Kierstead and Alexandr V. Kostochka. Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring. Journal of Graph Theory, 71(1):31–48, September 2012.
[KK14]
Ken-ichi Kawarabayashi and Stephan Kreutzer. An excluded grid theorem for digraphs with forbidden minors. In 25th Symposium on Discrete Algorithms (SODA), pages 72–81. ACM-SIAM, January 2014.
[KK15]
Lior Kamma and Robert Krauthgamer. Metric decompositions of path-separable graphs. Technical Report 1504.07019v1 [cs.DS], arXiv, April 2015.
[KK16]
Lior Kamma and Robert Krauthgamer. Metric decompositions of path-separable graphs. Algorithmica, 79:645–653, November 2017.
[KK77]
Leonard Kleinrock and Farouk Kamoun. Hierarchical routing for large networks -- Performance evaluation and optimization. Computer Networks, 1(3):155–174, January 1977.
[KK80]
Leonard Kleinrock and Farouk Kamoun. Optimal clustering structures for hierarchical topological design of large computer networks. Networks, 10(3):221–248, 1980.
[KK95a]
Evangelos Kranakis and Danny Krizanc. Lower bounds for compact routing. Technical Report TR-95-18, Carleton University, July 1995. Appear in STACS '96.
[KK95b]
Evangelos Kranakis and Danny Krizanc. Complexity of boolean routing. Technical Report TR-95-17, Carleton University, July 1995.
[KK95c]
Evangelos Kranakis and Danny Krizanc. Boolean routing on Cayley networks. Draft, September 1995.
[KK96]
Evangelos Kranakis and Danny Krizanc. Lower bounds for compact routing. In Claude Puech and Rüdiger Reischuk, editors, 13th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1046 of Lecture Notes in Computer Science, pages 529–540. Springer-Verlag, February 1996.
[KK96a]
Evangelos Kranakis and Danny Krizanc. Boolean routing on Cayley networks. In Nicola Santoro and Paul G. Spirakis, editors, 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 119–124. Carleton University Press, June 1996.
[KK98]
Ton Kloks and Dieter Kratsch. Listing all minimal separators of a graph. SIAM Journal on Computing, 27(3):605–613, 1998.
[KK99]
Hans Kellerer and Vladimir Kotov. A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling. Information Systems and Operational Research, 37(1):48–56, February 1999.
[KKKP01]
Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. Labeling schemes for flow and connectivity. Technical Report MCS01-01, The Weizmann Institute of Science, August 2001.
[KKKP02]
Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. Labeling schemes for flow and connectivity. In 13th Symposium on Discrete Algorithms (SODA), pages 927–936. ACM-SIAM, January 2002.
[KKKP04]
Michal Katz, Nir A. Katz, Amos Korman, and David Peleg. Labeling schemes for flow and connectivity. SIAM Journal on Computing, 34(1):23–40, 2004.
[KKL88]
Jeff Kahn, Gil Kalai, and Nathan Linial. The influence of variables on boolean functions. In 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 68–80. IEEE Computer Society Press, October 1988.
[KKLV26]
Philipp Kindermann, Jan Kratochvíl, Giuseppe Liotta, and Pavel Valtr. Three edge-disjoint plane spanning paths in a point set. Discrete Mathematics, 349(3):114780, March 2026.
[KKM01]
Ton Kloks, Dieter Kratsch, and Haiko Müller. On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics, 17(2):295–306, 2001.
[KKM09]
Ken-ichi Kawarabayashi, Stephan Kreutzer, and Bojan Mohar. Linkless and flat embeddings in 3-space in quadratic time. Technical Report 1070, University of Ljubljana, Slovenia, January 2009.
[KKM10]
Ken-ichi Kawarabayashi, Stephan Kreutzer, and Bojan Mohar. Linkless and flat embeddings in 3-space and the unknot problem. In 26th Annual ACM Symposium on Computational Geometry (SoCG), pages 97–106. ACM, June 2010.
[KKM13]
Bruce M. Kapron, Valerie King, and Ben Mountjoy. Dynamic graph connectivity in polylogarithmic worst case time. In 24th Symposium on Discrete Algorithms (SODA), pages 1131–1142. ACM-SIAM, January 2013.
[KKMO23]
Dong Yeap Kang, Tom Kelly, Daniela Kühn, Methuku Abhishek, and Deryk Osthus. A proof of the Erdős-Faber-Lovász conjecture. Technical Report 2101.04698v3 [math.CO], arXiv, January 2023.
[KKMS10]
Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, and Endre Szemerédi. A fast algorithm for equitable coloring. Combinatorica, 30(2):217–224, March 2010.
[KKMSY20]
Ruslan Kapralov, Kamil Khadiev, Joshua Mokut, Yixin Shen, and Maxim Yagafarov. Fast classical and quantum algorithms for online k-server problem on trees. Technical Report 2008.00270v1 [cs.DS], arXiv, August 2020.
[KKO20]
Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. An improved approximation algorithm for TSP in the half integral case. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 28–39. ACM Press, June 2020.
[KKO20a]
Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. A (slightly) improved approximation algorithm for metric TSP. Technical Report 2007.01409v3 [cs.DS], arXiv, August 2020.
[KKO21]
Anna R. Karlin, Nathan Klein, and Shayan Oveis Gharan. A (slightly) improved approximation algorithm for metric TSP. In 53rd Annual ACM Symposium on Theory of Computing (STOC), pages 32–45. ACM Press, June 2021.
[KKP00]
Michal Katz, Nir A. Katz, and David Peleg. Distance labeling schemes for well-separated graph classes. In H. Reichel and S. Tison, editors, 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1770 of Lecture Notes in Computer Science, pages 516–528. Springer Verlag, February 2000.
[KKP05]
Michal Katz, Nir A. Katz, and David Peleg. Distance labeling schemes for well-separated graph classes. Discrete Applied Mathematics, 145(3):384–402, January 2005.
[KKP05a]
Amos Korman, Shay Kutten, and David Peleg. Proof labeling system. In 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 9–18. ACM Press, July 2005.
[KKP10]
Amos Korman, Shay Kutten, and David Peleg. Proof labeling system. Distributed Computing, 22(4):215–233, May 2010.
[KKR12]
Ken-ichi Kawarabayashi, Yusuke Kobayashi, and Bruce A. Reed. The disjoint paths problem in quadratic time. Journal of Combinatorial Theory, Series B, 102(2):424–435, March 2012.
[KKR93]
Evangelos Kranakis, Danny Krizanc, and S.S. Ravi. On multi-label linear interval routing schemes. In 19th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 790 of Lecture Notes in Computer Science, pages 338–349. Springer-Verlag, June 1993.
[KKR96]
Evangelos Kranakis, Danny Krizanc, and S.S. Ravi. On multi-label linear interval routing schemes. The Computer Journal, 39(2):133–139, 1996.
[KKS05]
Irit Katriel, Martin Kutz, and Martin Skutella. Reachability substitutes for planar digraphs. Technical Report MPI-I-2005-1-002, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany, March 2005.
[KKS11]
Ken-ichi Kawarabayashi, Philip N. Klein, and Christian Sommer. Linear-space approximate distance oracles for planar, bounded-genus, and minor-free graphs. In 38th International Colloquium on Automata, Languages and Programming (ICALP), volume 6755 of Lecture Notes in Computer Science (ARCoSS), pages 135–146. Springer, July 2011.
[KKS11a]
Ken-ichi Kawarabayashi, Philip N. Klein, and Christian Sommer. Linear-space approximate distance oracles for planar, bounded-genus, and minor-free graphs. Technical Report 1104.5214v1 [cs.DS], arXiv, April 2011.
[KKS98]
Yoshiharu Kohayakawa, Bernd Kreuter, and Angelika Steger. An extremal problem for random graphs and the number of graphs with large even-girth. Combinatorica, 18(1):101–120, January 1998.
[KKSRx12]
Dmitri Krioukov, Maksim Kitsak, Robert S. Sinkovits, David Rideout, David Meyer, and Marián Boguñá. Network cosmology. Scientific Reports, 2:793, November 2012.
[KKT15]
Valerie King, Shay Kutten, and Mikkel Thorup. Construction and impromptu repair of an MST in a distributed network with o(m) communication. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 71–80. ACM Press, July 2015.
[KKT95]
David R. Karger, Philip N. Klein, and Robert Endre Tarjan. A randomized linear-time algorithm to find minimum spanning trees. Journal of the ACM, 42(2):321–328, March 1995.
[KKU95]
Evangelos Kranakis, Danny Krizanc, and Jorge Urrutia. Compact routing and shortest path information. In Lefteris M. Kirousis and Evangelos Kranakis, editors, 2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 101–112. Carleton University Press, June 1995.
[KL04]
Robert Krauthgamer and James R. Lee. Navigating nets: Simple algorithms for proximity search. In 15th Symposium on Discrete Algorithms (SODA), pages 798–807. ACM-SIAM, January 2004.
[KL05]
Robert Krauthgamer and James R. Lee. The black-box complexity of nearest-neighbor search. Theoretical Computer Science, 348(2):262–276, December 2005.
[KL05a]
Martin Klazar and Florian Luca. On the maximal order of numbers in the "factorisatio numerorum" problem. Technical Report 249, ITI-Series, 2005.
[KL06]
Robert Krauthgamer and James R. Lee. Algorithms on negatively curved spaces. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 119–132. IEEE Computer Society Press, October 2006.
[KL07]
Robert Krauthgamer and James R. Lee. The intrinsic dimensionality of graphs. Combinatorica, 7(5):551–585, September 2007.
[KL18]
Peter Keevash and Eoin Long. A stability result for the cube edge isoperimetric inequality. Journal of Combinatorial Theory, Series A, 155:360–375, April 2017.
[KL20]
Peter Keevash and Eoin Long. Stability for vertex isoperimetry in the cube. Journal of Combinatorial Theory, Series B, 145:113–114, November 2020.
[KL23]
Tuukka Korhonen and Daniel Lokshtanov. An improved parameterized algorithm for treewidth. In 29th Annual ACM Symposium on Theory of Computing (STOC), pages 528–541. ACM Press, June 2023.
[KL25]
Daniel Král' and Ander Lamaison. Planar graph with twin-width seven. European Journal of Combinatorics, 123:103749, January 2025.
[KL76]
I. Kessler and M. Livingston. The expected number of parts in a partition of n. Monatshefte für Mathematik, 81:203–212, September 1976.
[KL81]
Robert J. Kimble Jr. and Allen J. Schwenk. On universal caterpillars. In Gary Chartrand, Yousef Alavi, Donald L. Goldsmith, and Don R. Lick, editors, The Theory of Applications of Graphs, pages 437–447. John Wiley & Sons, 1981.
[KL95]
Danny Krizanc and Flaminia L. Luccio. Boolean routing on chordal rings. In Lefteris M. Kirousis and Evangelos Kranakis, editors, 2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 89–100. Carleton University Press, June 1995.
[Klein02]
Philip N. Klein. Preprocessing an undirected network to enable fast approximate distance queries. In 13th Symposium on Discrete Algorithms (SODA), pages 820–827. ACM-SIAM, January 2002.
[Klein05]
Philip N. Klein. Multiple-source shortest paths in planar graphs. In 16th Symposium on Discrete Algorithms (SODA), pages 146–155. ACM-SIAM, January 2005.
[Klein05a]
Philip N. Klein. A linear-time approximation scheme for planar weighted TSP. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 647–657. IEEE Computer Society Press, October 2005.
[Klein06]
Philip N. Klein. A subset spanner for planar graphs, with application to subset TSP. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 749–756. ACM Press, May 2006.
[Kleinberg00]
Jon M. Kleinberg. The small-world phenomenon: An algorithmic perspective. In 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 163–170. ACM Press, May 2000.
[Kleinberg00a]
Jon M. Kleinberg. Navigation in a small world. Nature, 406:845, August 2000.
[Kleinberg00b]
Jon M. Kleinberg. Detecting a network failure. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 231–239. IEEE Computer Society Press, November 2000.
[Kleinberg06]
Jon M. Kleinberg. Complex networks and decentralized search algorithms. In International Congress of Mathematicians (ICM). European Mathematical Society Publishing House (EMS Ph), August 2006.
[Kleinberg07]
Robert D. Kleinberg. Geographic routing using hyperbolic space. In 26th Annual IEEE Conference on Computer Communications (INFOCOM), pages 1902–1909, May 2007.
[Kleinberg94]
Jon M. Kleinberg. On-line search in a simple polygon. In 5th Symposium on Discrete Algorithms (SODA), pages 8–15. ACM-SIAM, 1994.
[Kleinberg97]
Jon M. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. In 29th Annual ACM Symposium on Theory of Computing (STOC), pages 599–608. ACM Press, May 1997.
[KLL02]
Ton Kloks, C.M. Lee, and Jiping Liu. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs. In 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 2573 of Lecture Notes in Computer Science, pages 282–295. Springer, June 2002.
[KLM07]
Phillip Kaye, Raymond Laflamme, and Michele Mosca. An introduction to quantum computing. Wiley Series on Parallel and distributed computing. Oxford University Press, 2007.
[KLMN04]
Robert Krauthgamer, James R. Lee, Manor Mendel, and Assaf Naor. Measured descent: A new embedding method for finite metrics. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 434–443. IEEE Computer Society Press, October 2004.
[KLMN12]
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, and Lhouari Nourine. On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets. In 23rd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7676 of Lecture Notes in Computer Science, pages 289–298. Springer, December 2012.
[KLMPW04]
Dieter Kratsch, Hoàng-Oanh Le, Haiko Müller, Erich Prisner, and Dorothea Wagner. Additive tree spanners. SIAM Journal on Discrete Mathematics, 17(2):332–340, 2004.
[KLNS12]
Adrian Kosowski, Bi Li, Nicolas Nisse, and Karol Suchan. k-chordal graphs: from cops and robber to compact routing via treewidth. Technical Report hal-00671861, HAL-INRIA, April 2012.
[KLNS12b]
Adrian Kosowski, Bi Li, Nicolas Nisse, and Karol Suchan. k-chordal graphs: from cops and robber to compact routing via treewidth. In 14es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), volume hal-00687120, pages 83–86. HAL, May 2012.
[KLNS15]
Adrian Kosowski, Bi Li, Nicolas Nisse, and Karol Suchan. k-chordal graphs: from cops and robber to compact routing via treewidth. Algorithmica, 72:758–777, July 2015.
[KLO11]
Fabian Kuhn, Nancy A. Lynch, and Rotem Oshman. Distributed computation in dynamic networks. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 513–522. ACM Press, June 2011.
[Kloks94]
Ton Kloks. Treewidth: Computations and approximations, volume 842 of Lecture Notes in Computer Science. Springer-Verlag, June 1994.
[KLPP11]
Erez Kantor, Zvi Lotker, Merav Parter, and David Peleg. The topology of wireless communication. Technical Report 1103.4566v2 [cs.DS], arXiv, March 2011.
[KLS05]
Jochen Könemann, Asaf Levin, and Amitabh Sinha. Approximating the degree-bounded minimum diameter spanning tree problem. Algorithmica, 41(2):117–129, 2005.
[KLSS21]
Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, and Subhash Suri. A constant factor approximation for navigating through connected obstacles in the plane. In 32nd Symposium on Discrete Algorithms (SODA), pages 822–839. ACM-SIAM, January 2021.
[KLT06]
Ravi Kumar, David Liben-Nowell, and Andrew Tomkins. Navigating low-dimensional and hierarchical population networks. In 14th Annual European Symposium on Algorithms (ESA), volume 4168 of Lecture Notes in Computer Science, pages 364–375. Springer, September 2006.
[KLW05]
Ming-Yang Kao, Xiang-Yang Li, and WeiZhao Wang. Average case analysis for binary tree labeling schemes. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 136–145. Springer, December 2005.
[KM01a]
Haim Kaplan and Tova Milo. Short and simple labels for small distances and other functions. In 7th International Workshop on Algorithms and Data Structures (WADS), volume 2125 of Lecture Notes in Computer Science, pages 32–40. Springer, August 2001.
[KM02]
Jack H. Koolen and Vincent Moulton. Hyperbolic bridged graphs. European Journal of Combinatorics, 23(6):683–699, August 2002.
[KM06]
Ken-ichi Kawarabayashi and Bojan Mohar. Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 401–416. ACM Press, May 2006.
[KM07]
Ken-ichi Kawarabayashi and Bojan Mohar. Some recent progress and applications in graph minor theory. Graphs and Combinatorics, 23(1):1–46, 2007.
[KM08]
Ken-ichi Kawarabayashi and Bojan Mohar. Graph and map isomorphism and all polyhedral embeddings in linear time. In 40th Annual ACM Symposium on Theory of Computing (STOC), pages 471–480. ACM Press, June 2007.
[KM09]
Lukasz Kowalik and Marcin Mucha. Deterministic 7/8-approximation for the metric maximum TSP. Theoretical Computer Science, 410(47-49):5000–5009, November 2009.
[KM15]
Marcos Kiwi and Dieter Mitsche. A bound for the diameter of random hyperbolic graphs. In Proceedings of the Meeting on Analytic Algorithmics and Combinatorics (ANALCO), pages 26–39. ACM-SIAM, January 2015.
[KM17]
Marcos Kiwi and Dieter Mitsche. On the size of the second largest component of random hyperbolic graphs. Technical Report 1712.02828v1 [math.PR], arXiv, December 2017.
[KM18]
Marcos Kiwi and Dieter Mitsche. Spectral gap of random hyperbolic graphs and related parameters,. The Annals of Applied Probability, 28(2):941–989, April 2018.
[KM97]
Sandi Klavžar and Uroš Milutinović. Graphs s(n,k) and a variant of the Tower of Hanoi problem. Czechoslovak Mathematical Journal, 47(1):95–104, 1997.
[KML24]
J. Mark Keil, Fraser McLeod, and Debajyoti Mondal. Quantum speedup for some geometric 3SUM-hard problems and beyond,. In 36th Canadian Conference on Computational Geometry (CCCG), pages 215–222, July 2024.
[KMM12]
Ross J. Kang, Matthias Mnich, and Tobias Müller. Induced matchings in subcubic planar graphs. SIAM Journal on Discrete Mathematics, 26(3):1383–1411, 2012.
[KMMS03]
Dieter Kratsch, Ross M. McConnell, Kurt Mehlhorn, and Jeremy P. Spinrad. Certifying algorithms for recognizing interval graphs and permutation graphs. In 14th Symposium on Discrete Algorithms (SODA), pages 158–167. ACM-SIAM, January 2003.
[KMNW05]
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, and Roger Wattenhofer. Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 273–287. Springer, September 2005.
[KMO09]
Philip N. Klein, Shay Mozes, and Oren Weimann. Shortest paths in directed planar graphs with negative lengths: a linear-space O(nlog2n)-time algorithm. In 20th Symposium on Discrete Algorithms (SODA), pages 236–245. ACM-SIAM, January 2009.
[KMP01]
Claire Kenyon-Mathieu, Elchanan Mossel, and Yuval Peres. Glauber dynamics on trees and hyperbolic graphs. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 568–578. IEEE Computer Society Press, October 2001.
[KMPS25]
Michal Koucky, Ian Mertz, Edward Pyne, and Sasha Sami. Collapsing catalytic classes. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 455–463. IEEE Computer Society Press, December 2025.
[KMR08]
Ken-ichi Kawarabayashi, Bojan Mohar, and Bruce A. Reed. A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 771–780. IEEE Computer Society Press, October 2008.
[KMRR05]
Joachim Kneis, Daniel Mölle, Stefan Richter, and Peter Rossmanith. Algorithms based on the treewidth of sparse graphs. In Dieter Kratsch, editor, 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 3787 of Lecture Notes in Computer Science, pages 385–396. Springer, June 2005.
[KMRS15]
Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth. Routing in unit disk graphs. Technical Report 1510.01072 [cs.CG], arXiv, October 2015.
[KMS02]
Haim Kaplan, Tova Milo, and Ronen Shabo. A comparison of labeling schemes for ancestor queries. In 13th Symposium on Discrete Algorithms (SODA), pages 954–963. ACM-SIAM, January 2002.
[KMS07]
Haim Kaplan, Tova Milo, and Ronen Shabo. Compact labeling scheme for XML ancestor queries. Theory of Computing Systems, 40(1):55–99, 2007.
[KMS07a]
Samuel A. Kutin, David Petrie Moulton, and Lawren M. Smithline. Computation at a distance. Technical Report 0701194v1 [quant-ph], arXiv, January 2007.
[KMS13]
Philip N. Klein, Shay Mozes, and Christian Sommer. Structured recursive separator decompositions for planar graphs in linear time. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 505–514. ACM Press, June 2013.
[KMT08]
Hirotada Kobayashi, Keiji Matsumoto, and Seiichiro Tani. Fast exact quantum leader election on anonymous rings. In 8th Asian Conference on Quantum Information Science (AQIS), pages 157–158, August 2008.
[KMT09]
Hirotada Kobayashi, Keiji Matsumoto, and Seiichiro Tani. Brief annoucement: Exactly electing a unique leader is not harder than computing symmetric functions on anonymous quantum network. In 28th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 334–335. ACM Press, August 2009.
[KMT09b]
Hirotada Kobayashi, Keiji Matsumoto, and Seiichiro Tani. Quantum leader election via exact amplitude amplification, 2009.
[KMW04]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. What cannot be computed locally!In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 300–309. ACM Press, July 2004.
[KMW05]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. On the locality of bounded growth. In 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 60–68. ACM Press, July 2005.
[KMW06]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. The price of being near-sighted. In 17th Symposium on Discrete Algorithms (SODA), pages 980–989. ACM-SIAM, January 2006.
[KMW16]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. Local computation: Lower and upper bounds. Journal of the ACM, 63(2):Article No. 17, pp. 1–44, March 2016.
[KN05]
Marek Karpinski and Yakov Nekrich. Predecessor queries in constant time?In 13th Annual European Symposium on Algorithms (ESA), volume 3669 of Lecture Notes in Computer Science, pages 238–248. Springer, October 2005.
[KN11]
Haim Kaplan and Yahav Nussbaum. Minimum s-t cut in directed planar graphs when the source and the sink are close. In 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 9 of LIPIcs. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2011.
[KN97]
Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, 1997.
[Knopp81]
Marvin I. Knopp. Analytic number theory, volume 899 of Lecture Notes in Mathematics. Springer-Verlag, 1981.
[KNR88]
Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. In 20th Annual ACM Symposium on Theory of Computing (STOC), pages 334–343. ACM Press, May 1988.
[KNR92]
Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 5(4):596–603, 1992.
[KNS01]
William Kocay, Daniel Neilson, and Ryan Szypowski. Drawing graphs on the torus. Ars Combinatoria, 59:259–277, 2001.
[KNTW12]
Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, and Paul Wollan. K6 minors in large 6-connected graphs. Journal of Combinatorial Theory, Series B, 129:158–203, March 2012.
[Knuth68]
Donald Ervin Knuth. The art of computer programming. Volume 1 / fundamental algorithms. Addison-Wesley, 1968.
[Knuth76]
Donald Ervin Knuth. The computer as Master Mind. Journal of Recreational Mathematics, 9(1):1–6, September 1976.
[KO05]
Daniela Kühn and Deryk Osthus. Complete minors in Ks,s-free graphs. Combinatorica, 25(1):49–64, January 2005.
[KO05a]
Daniela Kühn and Deryk Osthus. Four-cycles in graphs without a given even cycle. Journal of Graph Theory, 48(2):147–156, February 2005.
[KO11]
Fabian Kuhn and Rotem Oshman. Dynamic networks: models and algorithms. ACM SIGACT News - Distributed Computing Column, 42(1):82–96, March 2011.
[KO11a]
Fabian Kuhn and Rotem Oshman. The complexity of data aggregation in directed networks. In 25th International Symposium on Distributed Computing (DISC), volume 6950 of Lecture Notes in Computer Science (ARCoSS), pages 416–431. Springer, September 2011.
[KO13]
Ken-ichi Kawarabayashi and Kenta Ozeki. 4-connected projective-planar graphs are hamiltonian-connected. In 24th Symposium on Discrete Algorithms (SODA), pages 378–395. ACM-SIAM, January 2013.
[KO14]
O-joung Kwon and Sang-il Oum. Graphs of small rank-width are pivot-minors of graphs of small tree-width. Discrete Applied Mathematics, 168:108–118, May 2014.
[KO62]
Anatolii Alexevich Karatsuba and Yuri Ofman. Multiplication of many-digital numbers by automatic computers. Doklady Akad. Nauk SSSR, 145(2):293–294, 1962.
[Koebe36]
Paul Koebe. Kontaktprobleme der konformen abbildung. Berichte über die Verhandlungen der Sächsische Akademie der Wissenschaften zu Leipzig, Mathematisch-Physische Klasse, 88:141–164, 1936.
[Koivisto06]
Mikko Koivisto. An O*(2n) algorithm for graph coloring and other partitioning problems via inclusion–exclusion. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 583–590. IEEE Computer Society Press, October 2006.
[Kolmogorov65]
Andreï Nikolaïevitch Kolmogorov. Three approaches to the quantitative definition of information. Problemy Peredachi Informatsii (Problems of Information Transmission), 1(1):3–11, 1965.
[Kolmogorov68]
Andreï Nikolaïevitch Kolmogorov. Three approaches to the quantitative definition of information. International Journal of Computer Mathematics, 2(1-4):157–168, 1968.
[Konig16]
Dénes Kőnig. Über graphen und ihre anwendung auf determinantentheorie und mengenlehre. Mathematische Annalen, 77:453–465, December 1916.
[KOR98]
Eyal Kushilevitz, Rafail Ostrovsky, and Adi Rosén. Log-space polynomial end-to-end communication. SIAM Journal on Computing, 27(6):1531–1549, December 1998.
[Korhonen22]
Tuukka Korhonen. A single-exponential time 2-approximation algorithm for treewidth. In 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 184–192. IEEE Computer Society Press, February 2022.
[Korhonen25]
Tuukka Korhonen. Dynamic treewidth in logarithmic time. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 789–798. IEEE Computer Society Press, December 2025.
[Korman05]
Amos Korman. General compact labeling schemes for dynamic trees. In 19th International Symposium on Distributed Computing (DISC), volume 3724 of Lecture Notes in Computer Science, pages 457–471. Springer, September 2005.
[Korman07]
Amos Korman. Labeling schemes for vertex connectivity. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 102–109. Springer, July 2007.
[Korman07a]
Amos Korman. General compact labeling schemes for dynamic trees. Distributed Computing, 20(3):179–193, 2007.
[Korman08]
Amos Korman. Improved compact routing schemes for dynamic trees. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 185–194. ACM Press, August 2008.
[Korman09]
Amos Korman. Compact routing schemes for dynamic trees in the fixed port model. In 10th International Conference on Distributed Computing and Networking (ICDCN), volume 5408 of Lecture Notes in Computer Science, pages 218–229. Springer, January 2009.
[Korman15]
Amos Korman. Distributed decision and distributed biological algorithms, September 2015. Thèse d'habilitation à diriger les recherches, Université Paris Diderot - Paris 7.
[Kortsarz01]
Guy Kortsarz. On the hardness of approximating spanners. Algorithmica, 30(3):432–450, January 2001.
[Kortsarz98]
Guy Kortsarz. On the hardness of approximating spanners. In 1st International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 1444 of Lecture Notes in Computer Science, pages 135–146. Springer, August 1998.
[Kosowski13]
Adrian Kosowski. Time and space-efficient algorithms for mobile agents in an anonymous network, September 2013. Thèse d'habilitation à diriger les recherches, Université de Bordeaux.
[KOSS06]
Kishore Kothapalli, Melih Onus, Christian Scheideler, and Christian Schindelhauer. Distributed coloring in Õ(√logn) bit rounds. In 20th IEEE International Parallel & Distributed Processing Symposium (IPDPS). IEEE Computer Society Press, April 2006.
[Kostochka84]
Alexandr V. Kostochka. A lower bound for the Hadwiger number of graphs by the average degree. Combinatorica, 4(4):307–316, December 1984.
[Kouekam21]
Christian Kouekam. Induced universal graphs for edge-colored complete graphs. Master thesis, Karlsruhe Institute of Technology, Department of Informatics Institute of Theoretical Informatics, July 2021.
[KOY14]
Kyohei Kozawa, Yota Otachi, and Koichi Yamazaki. Lower bounds for treewidth of product graphs. Discrete Applied Mathematics, 162:251–258, January 2014.
[KP02]
Shimon Kogan and Holger Petersen. Distance labeling in general graphs. In Workshop Für Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen (Theorietag), page 9. Wilhelm-Schickard-institut für Informatik, 2002.
[KP03]
Amos Korman and David Peleg. Labeling schemes for weighted dynamic tree. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 369–383. Springer, July 2003.
[KP04]
Jon M. Kleinberg and Christos H. Papadimitriou. Computability and complexity, 2004. In Computer Science: Reflections on the field, Refections from the Field, Natl. Academies Press.
[KP06]
Amos Korman and David Peleg. Dynamic routing schemes for general graphs. In 33rd International Colloquium on Automata, Languages and Programming (ICALP), volume 4051 of Lecture Notes in Computer Science, pages 619–630, 2006.
[KP07]
Amos Korman and David Peleg. Compact separator decompositions in dynamic trees and applications to labeling schemes. In 21st International Symposium on Distributed Computing (DISC), volume 4731 of Lecture Notes in Computer Science, pages 313–327. Springer, September 2007.
[KP08]
Iyad A. Kanj and Ljubomir Perković. On geometric spanners of Euclidean and unit disk graphs. In 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume hal-00231084, pages 409–420. HAL, February 2008.
[KP08a]
Amos Korman and David Peleg. Dynamic routing schemes for graphs with low local density. ACM Transactions on Algorithms, 4(4):A41, 2008.
[KP08b]
Alexandr V. Kostochka and Noah Prince. On Ks,t minors in graphs of given average degree. Discrete Mathematics, 308(19):4435–4445, October 2008.
[KP10]
Alexandr V. Kostochka and Noah Prince. Dense graphs have K3,t minors. Discrete Mathematics, 310(20):2637–2654, October 2010.
[KP11]
Kishore Kothapalli and Sriram V. Pemmaraju. Distributed graph coloring in a few rounds. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 31–40. ACM Press, June 2011.
[KP19]
Adrian Kosowski and Dominik Pajak. Does adding more agents make a difference? a case study of cover time for the rotor-router. Journal of Computer and System Sciences, 106:80–93, December 2019.
[KP22]
Shimon Kogan and Merav Parter. Having hope in hops: New spanners, preservers and lower bounds for hopsets. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 766–777. IEEE Computer Society Press, October 2022.
[KP23]
Tomasz Kociumaka and Adam Polak. Bellman-Ford is optimal for shortest hop-bounded paths. In Inge Li Gørtz, Martín Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 72:1–72:10. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[KP93]
Guy Kortsarz and David Peleg. Generating low-degree 2-spanners. Technical Report CS93-07, The Weizmann Institute of Science, 1993.
[KP94]
Guy Kortsarz and David Peleg. Generating sparse 2-spanners. Journal of Algorithms, 17(2):222–236, September 1994.
[KP94a]
Henry A. Kierstead and Stephen G. Penrice. Radius two trees specify χ-bounded classes. Journal of Graph Theory, 18(2):119–129, March 1994.
[KP95]
Shay Kutten and David Peleg. Fast distributed construction of k-dominating sets and applications. In 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 238–249. ACM Press, August 1995.
[KP95a]
Guy Kortsarz and David Peleg. Approximation algorithms for minimum time broadcast. SIAM Journal on Discrete Mathematics, 8(3):401–427, 1995.
[KP98]
Shay Kutten and David Peleg. Fast distributed construction of small k-dominating sets and applications. Journal of Algorithms, 28(1):40–66, July 1998.
[KP98a]
Guy Kortsarz and David Peleg. Generating low-degree 2-spanners. SIAM Journal on Computing, 27(5):1438–1456, October 1998.
[KPBV08]
Dmitri Krioukov, Fragkiskos Papadopoulos, Marián Boguñá, and Amin Vahdat. Efficient navigation in scale-free networks embedded in hyperbolic metric spaces. Technical Report 0805.1266v1 [cond-math.stat-mech], arXiv, May 2008.
[KPGR25]
Rasmus Kyng, Maximilian Probst Gutenberg, and Tim Rieder. Random-shift revisited: Tight approximations for tree embeddings and ℓ1-oblivious routings. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 2135–2145. IEEE Computer Society Press, December 2025.
[KPKVB10]
Dmitri Krioukov, Fragkiskos Papadopoulos, Maksim Kitsak, Amin Vahdat, and Marián Boguñá. Hyperbolic geometry of complex networks. Physical Review E, 82(036106), September 2010.
[KPP15]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. Higher lower bounds from the 3SUM conjecture. Technical Report 1407.6756v2 [cs.DS], arXiv, July 2015.
[KPP16]
Tsvi Kopelowitz, Seth Pettie, and Ely Porat. Higher lower bounds from the 3SUM conjecture. In 27th Symposium on Discrete Algorithms (SODA), pages 1272–1287. ACM-SIAM, January 2016.
[KPPRT15]
Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. On the complexity of universal leader election. Journal of the ACM, 62(1):Article No. 7, pp. 1–27, February 2015.
[KPPS25]
Kacper Kluk, Marcin Pilipczuk, Michał Pilipczuk, and Giannos Stamoulis. Faster diameter computation in graphs of bounded Euler genus. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 109:1–109:19. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[KPR02]
Amos Korman, David Peleg, and Yoav Rodeh. Labeling schemes for dynamic tree networks. In 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 2285 of Lecture Notes in Computer Science, pages 76–87. Springer, March 2002.
[KPR04]
Amos Korman, David Peleg, and Yoav Rodeh. Labeling schemes for dynamic tree networks. Theory of Computing Systems, 37(1):49–75, 2004.
[KPR06]
Amos Korman, David Peleg, and Yoav Rodeh. Constructing labeling schemes through universal matrices. In 17th Annual International Symposium on Algorithms and Computation (ISAAC), volume 4288 of Lecture Notes in Computer Science, pages 409–418. Springer, December 2006.
[KPR10]
Amos Korman, David Peleg, and Yoav Rodeh. Constructing labeling schemes through universal matrices. Algorithmica, 57(4):641–652, August 2010.
[KPR93]
Philip N. Klein, Serge A. Plotkin, and Satish B. Rao. Excluded minors, network decomposition, and multicommodity flow. In 25th Annual ACM Symposium on Theory of Computing (STOC), pages 682–690. ACM Press, May 1993.
[KPSX11]
Iyad A. Kanj, Michael Pelsmajer, Marcus Schaefer, and Ge Xia. On the induced matching problem. Journal of Computer and System Sciences, 77(6):1058–1070, November 2011.
[KPSZ96]
Dimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, and Christos D. Zaroliagis. Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems. Theoretical Computer Science, 168(1):121–154, November 1996.
[KPT16]
Iyad A. Kanj, Ljubomir Perković, and Duru Türkoğlu. Degree four plane spanners: Simpler and better. In 32nd International Symposium on Computational Geometry (SoCG), volume 51 of LIPIcs, pages 45:1–45:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, June 2016.
[KPU88]
Danny Krizanc, David Peleg, and Eli Upfal. A time-randomness tradeoff for oblivious routing. In 20th Annual ACM Symposium on Theory of Computing (STOC), pages 93–102. ACM Press, May 1988.
[KPX08]
Iyad A. Kanj, Ljubomir Perković, and Ge Xia. Computing lightweight spanners locally. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 365–378. Springer, September 2008.
[KPX10]
Iyad A. Kanj, Ljubomir Perković, and Ge Xia. On spanners and lightweight spanners of geometric graphs. SIAM Journal on Computing, 39(6):2132–2161, 2009.
[KR00]
Art Kazmierczak and Sridhar Radhakrishnan. An optimal distributed ear decomposition algorithm with applications to biconnectivity and outerplanarity testing. IEEE Transactions on Parallel and Distributed Systems, 11(2):110–118, February 2000.
[KR00a]
Jochen Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. In 32nd Annual ACM Symposium on Theory of Computing (STOC), pages 537–546. ACM Press, May 2000.
[KR02]
David R. Karger and Matthias Ruhl. Finding nearest neighbors in growth-restricted metrics. In 34th Annual ACM Symposium on Theory of Computing (STOC), pages 741–750. ACM Press, May 2002.
[KR02a]
Jochen Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM Journal on Computing, 31(6):1783–1893, 2002.
[KR03]
Daniel Kobler and Udi Rotics. Finding maximum induced matchings in subclasses of claw-free and P5-free graphs, and in graphs with matching and induced matching of equal maximum size. Algorithmica, 37(4):327–346, 2003.
[KR06]
Robert Krauthgamer and Yuval Rabani. Improved lower bounds for embeddings into L1. In 17th Symposium on Discrete Algorithms (SODA), pages 1010–1017. ACM-SIAM, January 2006.
[KR07]
Ken-ichi Kawarabayashi and Bruce A. Reed. Computing crossing number in linear time. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 382–390. ACM Press, June 2007.
[KR08]
Robert Krauthgamer and Tim Roughgarden. Metric clustering via consistent labeling. In 19th Symposium on Discrete Algorithms (SODA), pages 809–818. ACM-SIAM, January 2008.
[KR09]
Ken-ichi Kawarabayashi and Bruce A. Reed. Hadwiger's conjecture is decidable. In 41st Annual ACM Symposium on Theory of Computing (STOC), pages 445–454. ACM Press, May 2009.
[KR10]
Ken-ichi Kawarabayashi and Bruce A. Reed. A separator theorem in minor-closed classes. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 153–162. IEEE Computer Society Press, October 2010.
[KR10a]
Bo'az Klartag and Oded Regev. Quantum one-way communication is exponentially stronger than classical communication. Technical Report 1009.3640v1 [quant-ph], arXiv, September 2010.
[KR17]
Janne H. Korhonen and Joel Rybicki. Deterministic subgraph detection in broadcast CONGEST. In 21st International Conference on Principles of Distributed Systems (OPODIS), volume 95 of LIPIcs, pages 4:1–4:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2017.
[KR18]
O-Joung Kwon and Jean-Florent Raymond. Packing and covering induced subdivisions. Technical Report 1803.07581v2 [cs.DS], arXiv, November 2018.
[KR18a]
Ken-ichi Kawarabayashi and Benjamin Rossman. A polynomial excluded-minor approximation of treedepth. In 29th Symposium on Discrete Algorithms (SODA), pages 234–246. ACM-SIAM, 2018.
[KR20]
Martin Krombholz and Michael Rathjen. Upper bounds on the graph minor theorem. In Peter M. Schuster, Monika Seisenberger, and Andreas Weiermann, editors, Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends in Logic, pages 145–159. Springer, Cham, 2020.
[KR96]
Jon M. Kleinberg and Ronitt Rubinfeld. Short paths in expander graphs. In 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 86–95. IEEE Computer Society Press, October 2007.
[KR99]
Davis King and Jarek Rossignac. Guaranteed 3.67V bit encoding of planar triangle graphs. In 11th Canadian Conference on Computational Geometry (CCCG), pages 146–149, August 1999.
[Kraft49]
Leon G. Kraft. A device for quantizing, grouping, and coding amplitude modulated pulses. M.S. thesis, Massachusetts Institute of Technology, Cambridge, MA, May 1949.
[Kratsch00]
Dieter Kratsch. Domination and total domination on asteroidal triple-free graphs. Discrete Applied Mathematics, 99(1-3):111–123, February 2000.
[Kreutzer08]
Stephan Kreutzer. Algorithmic meta-theorems, September 2008.
[KRHS94]
Philip N. Klein, Satish B. Rao, Monika Rauch Henzinger, and Sairam Subramanian. Faster shortest-path algorithms for planar graphs. In 26th Annual ACM Symposium on Theory of Computing (STOC), pages 27–37. ACM Press, May 1994.
[Krill23]
Thilo Krill. Universal graphs for the topological minor relation. Technical Report 2203.12643v2 [math.CO], arXiv, May 2023.
[Krishnamachari05]
Bhaskar Krishnamachari. Networking wireless sensors. Cambridge University Press, 2005.
[KRRS02]
Rastislav Královič, Branislav Rovan, Peter Ružička, and Daniel Štefankovič. Efficient deadlock-free multi-dimensional interval routing in interconnection networks. Computing and Informatics, 21(3):265–287, 2002.
[KRRS98]
Rastislav Královič, Branislav Rovan, Peter Ružička, and Daniel Štefankovič. Efficient deadlock-free multi-dimensional interval routing in interconnection networks. In Shay Kutten, editor, 12th International Symposium on Distributed Computing (DISC), volume 1499 of Lecture Notes in Computer Science, pages 273–287. Springer, September 1998.
[KRRSx00]
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Dandapani Sivakumar, Andrew Tomkins, and Eli Upfal. Stochastic models for the Web graph. In 41st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 57–65. IEEE Computer Society Press, November 2000.
[KRRSx00a]
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Dandapani Sivakumar, Andrew Tomkins, and Eli Upfal. The Web as a graph. In 19th ACM Symposium on Principles of Database Systems (PODS), pages 1–10, May 2000.
[KRS00]
Rastislav Královič, Peter Ružička, and Daniel Štefankovič. The complexity of shortest path and dilation bounded interval routing. Theoretical Computer Science, 234(1-2):85–107, March 2000.
[KRS96]
Rastislav Královič, Peter Ružička, and Daniel Štefankovič. The complexity of shortest path and dilation bounded interval routing. Technical report, Comenius University, Department of Computer Science, Faculty of Mathematics and Physics, Bratislava, Slovak Republic, August 1996.
[KRS97]
Rastislav Královič, Peter Ružička, and Daniel Štefankovič. The complexity of shortest path and dilation bounded interval routing. In Christian Lengaur, Martin Griebl, and Sergei Gorlatch, editors, 3rd International Euro-Par Conference, volume 1300 of Lecture Notes in Computer Science, pages 258–265. Springer, August 1997.
[KRT93]
Ming-Yang Kao, John H. Rief, and Stephen R. Tate. Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. In 4th Symposium on Discrete Algorithms (SODA), pages 441–447. ACM-SIAM, 1993.
[KRT94]
Valerie King, Satish B. Rao, and Robert Endre Tarjan. A faster deterministic maximum flow algorithm. Journal of Algorithms, 17(3):447–474, November 1994.
[KRT96]
Ming-Yang Kao, John H. Reif, and Stephen R. Tate. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Information and Computation, 131(1):63–79, November 1996.
[Krumme92]
David W. Krumme. Fast gossiping for the hypercube. SIAM Journal on Computing, 21(2):365–380, April 1992.
[KRX06]
Goran Konjevod, Andréa Werneck Richa, and Donglin Xia. Optimal-stretch name-independent compact routing in doubling metrics. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 198–207. ACM Press, July 2006.
[KRX07]
Goran Konjevod, Andréa Werneck Richa, and Donglin Xia. Optimal scale-free compact routing schemes in doubling networks. In 18th Symposium on Discrete Algorithms (SODA), pages 939–948. ACM-SIAM, January 2007.
[KRX08]
Goran Konjevod, Andréa Werneck Richa, and Donglin Xia. Dynamic routing and location services in metrics of low doubling dimension. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 379–393. Springer, September 2008.
[KRXY07]
Goran Konjevod, Andréa Werneck Richa, Donglin Xia, and Hai Yu. Compact routing with slack in low doubling dimension. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 71–80. ACM Press, August 2007.
[KRXZ11]
Goran Konjevod, Andréa Werneck Richa, Donglin Xia, and Ling Zhou. Brief announcement: Randomized compact routing in decomposable metrics. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 351–352. ACM Press, June 2011.
[KS01]
Henrik Koy and Claus-Peter Schnorr. Segment LLL-reduction of lattice bases. In International Conference on Cryptography and Lattices, volume 2146 of Lecture Notes in Computer Science, pages 67–80. Springer-Verlag, 2001.
[KS06]
Dieter Kratsch and Jeremy P. Spinrad. Between O(nm) and O(nα). SIAM Journal on Computing, 36(2):310–325, 2006.
[KS10]
Ken-ichi Kawarabayashi and Christian Sommer. Exact distance queries for planar graphs using linear space, February 2010. Preprint.
[KS15]
Ken-ichi Kawarabayashi and Anastasios Sidiropoulos. Beyond the Euler characteristic: Approximating the genus of general graphs. In 47th Annual ACM Symposium on Theory of Computing (STOC), pages 675–682. ACM Press, June 2015.
[KS25]
Seri Khoury and Aaron Schild. Breaking barriers for distributed MIS by faster degree reduction. Technical Report 2505.15652v1 [cs.DC], arXiv, May 2025.
[KS25a]
Seri Khoury and Aaron Schild. Round elimination via self-reduction: Closing gaps for distributed maximal matching. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 2295–2308. IEEE Computer Society Press, December 2025.
[KS25b]
Nikhil Kumar and Chaitanya Swamy. Almost tight additive guarantees for k-edge-connectivity. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 205–219. IEEE Computer Society Press, December 2025.
[KS93]
Ephraim Korach and Nir Solel. Tree-width, path-width, and cutwidth. Discrete Applied Mathematics, 43(1):97–101, May 1993.
[KS98]
Philip N. Klein and Sairam Subramanian. A fully dynamic approximation scheme for shortest paths in planar graphs. Algorithmica, 22(3):235–249, November 1998.
[KSS04]
Jon M. Kleinberg, Mark Sandler, and Aleksandrs Slivkins. Network failure detection and graph connectivity. In 15th Symposium on Discrete Algorithms (SODA), pages 76–85. ACM-SIAM, 2004.
[KST13]
Ken-ichi Kawarabayashi, Christian Sommer, and Mikkel Thorup. More compact oracles for approximate distances in undirected planar graphs. In 24th Symposium on Discrete Algorithms (SODA), pages 550–563. ACM-SIAM, January 2013.
[KST16]
Naoto Komuro, Kichi-Suke Saito, and Ryotaro Tanaka. On the class of Banach spaces with james constant √2. Mathematische Nachrichten, 289(8-9):1005–1020, 2016.
[KST54]
T. Kővári, Vera T. Sós, and Pál Turán. On a problem of K. Zarankiewicz. Colloquium Mathematicae, 3(1):50–57, 1954.
[KST94]
Haim Kaplan, Ron Shamir, and Robert Endre Tarjan. Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping. In 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 780–791. IEEE Computer Society Press, November 1994.
[KSV11]
Amos Korman, Jean-Sébastien Sereni, and Laurent Viennot. Toward more localized local algorithms: removing assumptions concerning global knowledge. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 49–58. ACM Press, June 2011.
[KSV13]
Peter Keevash, Benny Sudakov, and Jacques Verstraëte. On a conjecture of Erdős and Simonovits: Even cycles. Combinatorica, 33(6):699–732, 2013.
[KSV21]
Simeon Kublenz, Sebastian Siebertz, and Alexandre Vigny. Constant round distributed domination on graph classes with bounded expansion. In Tomasz Jurdziński and Stefan Schmid, editors, 28th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 12810 of Lecture Notes in Computer Science, pages 334–351. Springer, Cham, June 2021.
[KSW04]
Jon M. Kleinberg, Aleksandrs Slivkins, and Tom Wexler. Triangulation and embedding using small sets of beacons. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 444–453. IEEE Computer Society Press, October 2004.
[KSW96]
André E. Kézdy, Hunter S. Snevily, and Chi Wang. Partitioning permutations into increasing and decreasing subsequences. Journal of Combinatorial Theory, Series A, 73(2):353–359, February 1996.
[KT05]
Ken-ichi Kawarabayashi and Bjarne Toft. Any 7-chromatic graphs has K7 or K4,4 as a minor. Combinatorica, 25(3):327–353, May 2005.
[KT06]
Jon M. Kleinberg and Éva Tardos. Algorithm design. Addison Wesley, 2006.
[KT10]
Stephan Kreutzer and Siamak Tazari. On brambles, grid-like minors, and parameterized intractability of monadic second-order logic. In 21st Symposium on Discrete Algorithms (SODA), pages 354–364. ACM-SIAM, January 2010.
[KT10a]
Stephan Kreutzer and Siamak Tazari. Lower bounds for the complexity of monadic second-order logic. In 25th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 189–198. IEEE Computer Society Press, July 2010.
[KT11]
Athanassios Koutsonas and Dimitrios M. Thilikos. Planar feedback vertex set and face cover: Combinatorial bounds and subexponential algorithms. Algorithmica, 60(4):987–1003, August 2011.
[KT14]
Ken-ichi Kawarabayashi and Mikkel Thorup. Coloring 3-colorable graphs with o(n1/5) colors. In 31st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 25 of LIPIcs, pages 458–469. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2014.
[KT16]
Frank Kammer and Torsten Tholey. Approximate tree decompositions of planar graphs in linear time. Technical Report 1104.2275v5 [cs.DS], arXiv, May 2016.
[KT99]
Haim Kaplan and Robert Endre Tarjan. Purely functional, real-time deques with catenation. Journal of the ACM, 31(11-16):1709–1723, September 1999.
[KTJ92]
Hermann König and Nicole Tomczak-Jaegermann. Norms of minimal projections. Technical Report math/9211211v1 [math.FA], arXiv, November 1992.
[KTW18]
Ken-ichi Kawarabayashi, Robin Thomas, and Paul Wollan. A new proof of the flat wall theorem. Journal of Combinatorial Theory, Series B, 129:204–238, March 2018.
[KTW21]
Ken-ichi Kawarabayashi, Robin Thomas, and Paul Wollan. Quickly excluding a non-planar graph. Technical Report 2010.12397v2 [math.CO], arXiv, January 2021.
[Kuhn01]
Daniela Kühn. Minor-universal planar graphs without accumulation points. Journal of Graph Theory, 36(1):1–7, January 2001.
[Kuhn09]
Fabian Kuhn. Weak graph colorings: distributed algorithms and applications. In 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 138–144. ACM Press, August 2009.
[Kupavskii20]
Andrey Kupavskii. The VC-dimension of k-vertex d-polytopes. Technical Report 2004.04841v2 [cs.CG], arXiv, April 2020.
[Kuratowski30]
Kazimierz Kuratowski. Sur le problème des courbes gauches en Topologie. Fundamenta Mathematicae, 15:271–283, 1930.
[Kurowski04]
Maciej Kurowski. A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. Information Processing Letters, 92(2):95–98, October 2004.
[KUV19]
Adrian Kosowski, Przemysław Uznański, and Laurent Viennot. Hardness of exact distance queries in sparse graphs through hub labeling. In 38th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 272–279. ACM Press, July 2019.
[KV03]
Jeong Han Kim and Van H. Vu. Generating random regular graphs. In 35th Annual ACM Symposium on Theory of Computing (STOC), pages 213–222. ACM Press, 2003.
[KV09]
Joseph B. Keller and Ravi Vakil. 𝜋p, the value of 𝜋 in ℓp. The American Mathematical Monthly, 116(10):931–935, December 2009.
[KV10]
Bernhard Korte and Jens Vygen. Optimisation combinatoire: Théorie et algorithmes. Springer, 2010.
[KV17]
Adrian Kosowski and Laurent Viennot. Beyond highway dimension: Small distance labels using tree skeletons. In 28th Symposium on Discrete Algorithms (SODA), pages 1462–1478. ACM-SIAM, January 2017.
[KW01]
Michael Kaufmann and Dorothea Wagner. Drawing graphs, volume 2025 of Lecture Notes in Computer Science. Springer, 2001.
[KW05]
Fabian Kuhn and Roger Wattenhofer. Constant-time distributed dominating set approximation. Distributed Computing, 17(4):303–310, 2005.
[KW06]
Fabian Kuhn and Roger Wattenhofer. On the complexity of distributed graph coloring. In 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 7–15. ACM Press, July 2006.
[KW10]
Ken-ichi Kawarabayashi and Paul Wollan. A shorter proof of the Graph Minor Algorithm -- The unique linkage Theorem --. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 687–694. ACM Press, June 2010.
[KW11]
Ken-ichi Kawarabayashi and Paul Wollan. A simpler algorithm and shorter proof for the graph minor decomposition. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 451–458. ACM Press, June 2011.
[KW16]
Ioannis Koutis and R. Ryan Williams. Limits and applications of group algebras for parameterized problems. ACM Transactions on Algorithms, 12(3):Article No. 31, pp. 1–18, June 2016.
[KW95]
Kenneth Keeler and Jeffery R. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58(3):239–252, April 1995.
[KWZ09]
Pascal von Rickenbach, Roger Wattenhofer, and Aaron Zollinger. Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Transactions on Networking, 17(1):172–185, February 2009.
[KYK80]
Tohru Kikuno, Noriyoshi Yoshida, and Yoshiaki Kakuda. The NP-completeness of the dominating set problem in cubic planar graphs. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E63-E(6):443–444, 1980.
[KZ22]
Vladislav Kozhevnikov and Maksim Zhukovskii. Large cycles in generalized johnson graphs. Technical Report 2203.03006v1 [math.CO], arXiv, March 2022.
[KZ25]
Michael Krivelevich and Maksim Zhukovskii. Non-isomorphic subgraphs in random graphs. Technical Report 2505.14623v1 [math.CO], arXiv, May 2025.
[KZ97]
Marek Karpinski and Alexander Zelikovsky. Approximating dense cases of covering problems. In Panos M. Pardalos and Dingzhu Du, editors, DIMACS Workshop on Network Design: Connectivity and Facilites Location, volume 40 of Discrete Mathematics & Theoretical Computer Science, pages 169–178. American Mathematical Society, April 1997.
[LA91]
Jens Lagergren and Stefan Arnborg. Finding minimal forbidden minors using a finite congruence. In 18th International Colloquium on Automata, Languages and Programming (ICALP), volume 510 of Lecture Notes in Computer Science, pages 532–543. Springer, July 1991.
[Labourel07]
Arnaud Labourel. Partition d'arêtes et représentation implicite de graphes. PhD thesis, Université Bordeaux 1, Talence, France, December 2007.
[Labourel08]
Arnaud Labourel. On universal graphs of minor closed families. In International Conference on Topological & Geometric Graph Theory (TGGT), volume 31 of Electronic Notes in Discrete Mathematics, pages 85–89, August 2008.
[Lagarias10]
Jeffrey C. Lagarias. The ultimate challenge: The 3x+1 problem. American Mathematical Society, 2010.
[Lagergren96]
Jens Lagergren. Efficient parallel algorithms for graphs of bounded tree-width. Journal of Algorithms, 20(1):20–44, January 1996.
[Laing03]
Kofi Ambrose Laing. Name-independent compact routing in trees. Technical Report 2003-02, Tufts University Department of Computer Science, November 2003. Appears in PODC '04 as Brief Announcement.
[Laing04]
Kofi Ambrose Laing. Brief announcement: Name-independent compact routing in trees. In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 382–382. ACM Press, July 2004.
[Laing07]
Kofi Ambrose Laing. Name-independent compact routing in trees. Information Processing Letters, 103(2):57–60, July 2007.
[Laloe17]
Franck Laloë. L'argument de Einstein, Podolsky et Rosen. bibnum, 2017.
[Lamathe04]
Cédric Lamathe. The number of labelled k-arch graphs. Journal of Integer Sequences, 7:04.3.1, 2004.
[Lan01]
Jean-Marc Lanlignel. Autour de la décomposition en coupes. PhD thesis, Université Montpellier II -- Sciences et Techniques du Languedoc, June 2001.
[Larsen12]
Kasper Green Larsen. The cell probe complexity of dynamic range counting. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 85–94. ACM Press, May 2012.
[Lau80]
Hang Tong Lau. Finding a Hamiltonian cycle in the square of a block. PhD thesis, McGill University, Montreal, Canada, March 1980.
[Laurencine99]
Willy Laurencine. Facteur d'étirement moyen et tables de routage de compacité 1. Stage de DEA, Université Bordeaux I, LaBRI, 351, cours de la Libération, 33405 Talence cedex, France, June 1999.
[Lazarus10]
Francis Lazarus. Graphes et surfaces, 2010. Slides.
[LB05]
Rodrigo S.C. Leão and Valmir C. Barbosa. Generating all the cubic graphs that have a 6-cycle double cover. In 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics (GRACO), volume 19 of Electronic Notes in Discrete Mathematics, pages 87–93, 2005.
[LB06]
Rodrigo S.C. Leão and Valmir C. Barbosa. Minimal chordal sense of direction and circulant graphs. In Rastislav Královič and Paweł Urzyczyn, editors, 31st International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 4162 of Lecture Notes in Computer Science, pages 670–680. Springer, August 2006.
[LB62]
C.G. Lekkerkerker and Johan Christoph Boland. Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae, 51:45–64, 1962.
[LB96]
Weifa Liang and Richard P. Brent. Constructing the spanners of graphs in parallel. In 10th International Parallel Processing Symposium (IPPS), pages 206–210, April 1996.
[LCW02]
Xiang-Yang Li, Gruia Calinescu, and Peng-Jun Wan. Distributed construction of a planar spanner and routing for ad hoc wireless networks. In 21st Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 3, pages 1268–1277. IEEE, June 2002.
[LD13]
Jianbo Li and Honglin Ding. Approximation schemes for the 3-partitioning problems. Communications and Networks, 5(1B):90–95, February 2013.
[Lee16]
James R. Lee. Separators in region intersection graphs, 2016. preprint.
[Lee80]
Der-Tsai Lee. Two-dimensional Voronoi diagrams in the Lp-metric. Journal of the ACM, 27(4):604–618, October 1980.
[Leech56]
John Leech. On the representation of 1, 2, ..., n by differences. Journal of the London Mathematical Society, 31(2):160–169, April 1956.
[LeGall14]
Francois Le Gall. Powers of tensors and fast matrix multiplication. In 39th International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 296–303. ACM Press, July 2014.
[Lehner22]
Florian Lehner. Universal planar graphs for the topological minor relation. Technical Report 2203.03477v3 [math.CO], arXiv, March 2022.
[Leighton92]
Frank Thomson Leighton. Introduction to parallel algorithms and architectures: Arrays - trees - hypercubes. Morgan Kaufmann, 1992.
[Leighton95]
Frank Thomson Leighton. Introduction aux algorithmes et architectures : Grilles, arbres, hypercubes. International Thomson Publishing, 1995.
[Leiserson80]
Charles E. Leiserson. Area-efficient graph layouts (for VLSI). In 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 270–280. IEEE Computer Society Press, October 1980.
[Lenzen11]
Christoph Lenzen. Synchronization and symmetry breaking in distributed systems. PhD thesis, ETH Zürich, Switzerland, December 2011.
[Lev15]
Vsevolod F. Lev. Edge-isoperimetric problem for Cayley graphs and generalized Takagi functions. SIAM Journal on Discrete Mathematics, 29(4):2389–2411, January 2015.
[Levi73]
Giorgio Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341–352, December 1973.
[LGM18]
Francois Le Gall and Frédéric Magniez. Sublinear-time quantum computation of the diameter in CONGEST networks. In 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 337–347. ACM Press, July 2018.
[LGM18a]
Francois Le Gall and Frédéric Magniez. Sublinear-time quantum computation of the diameter in CONGEST networks. Technical Report 1804.02917v2 [cs.DC], arXiv, May 2018.
[LGM18b]
Bernhard Haeupler, Jason Li, and Goran Zuzic. Minor excluded network families admit fast distributed algorithms. In 37th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 465–474. ACM Press, July 2018.
[LGNR18]
Francois Le Gall, Harumichi Nishimura, and Ansis Rosmanis. Quantum advantage for the LOCAL model in distributed computing. Technical Report 1810.10838v1 [quant-ph], arXiv, October 2018.
[LGR22]
Francois Le Gall and Ansis Rosmanis. Non-trivial lower bound for 3-coloring the ring in the quantum LOCAL model. Technical Report 2212.02768v1 [quant-ph], arXiv, December 2022.
[Li14]
Bi Li. Tree decompositions and routing problems. PhD thesis, Université de Nice Sophia-Antipolis, France, November 2014.
[Li15]
Anshui Li. Aspects of random geometric graphs: pursuit-evasion and treewidth. PhD thesis, Utrecht University, Nederlands, December 2015.
[Liedloff08]
Mathieu Liedloff. Finding a dominating set on bipartite graphs. Information Processing Letters, 107(5):154–157, August 2008.
[Lindblad04]
Göran Lindblad. A general no-cloning theorem. Letters in Mathematical Physics, 47(2):189–196, January 2004.
[Linial86]
Nathan Linial. Legal coloring of graphs. Combinatorica, 6(1):49–54, March 1986.
[Linial87]
Nathan Linial. Distributive graph algorithms -- Global solutions from local data. In 28th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 331–335. IEEE Computer Society Press, October 1987.
[Linial92]
Nathan Linial. Locality in distributed graphs algorithms. SIAM Journal on Computing, 21(1):193–201, 1992.
[Lint85]
Jacobus H. van Lint. {0,1,*} distance problems in combinatorics. In Ian Anderson, editor, Surveys in Combinatorics 1985, invited papers for the 10th British Combinatorial Conference, volume 103 of London Mathematical Society Lecture Note Series, pages 113–135. Cambridge University Press, July 1985.
[Liskovets96]
Valery A. Liskovets. Some asymptotical estimates for planar Eulerian maps. Combinatorics, Probability and Computing, 5(2):131–138, June 1996.
[Liu20]
Chun-Hung Liu. Recent progress on well-quasi-ordering graphs. In Peter M. Schuster, Monika Seisenberger, and Andreas Weiermann, editors, Well-Quasi Orders in Computation, Logic, Language and Reasoning, volume 53 of Trends in Logic, pages 161–188. Springer, Cham, 2020.
[Liu21]
Chun-Hung Liu. Asymptotic dimension of minor-closed families and beyond. In 32nd Symposium on Discrete Algorithms (SODA), pages 1997–2013. ACM-SIAM, January 2021.
[Liu23]
Chun-Hung Liu. Assouad--Nagata dimension of minor-closed metrics. Technical Report 2308.12273v4 [math.CO], arXiv, May 2023.
[Liu85]
Yanpei Liu. Enumeration rooted simple planar maps. Acta Mathematicae Applicatae Sinica, 2(2):101–111, December 1985.
[Liu88]
Yanpei Liu. Enumeration of simple planar maps. Utilitas Mathematica, 34:97–104, 1988.
[LJD93]
S. Lakshmivarahan, Jung-Sing Jwo, and Sudarshan K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing, 19(4):361–407, April 1993.
[LKNW15]
Richard M. Levenson, Elizabeth A. Krupinski, Victor M. Navarro, and Edward A. Wasserman. Pigeons (columba livia) as trainable observers of pathology and radiology breast cancer images. Public Library of Science (PLoS) ONE, 10(11):1–21, November 2015.
[LL04]
Ana Sánchez Lladó and Susana Clara López. Minimum degree and minimum number of edge-disjoint trees. Discrete Mathematics, 275:195–205, 2004.
[LL25]
Lan Lin and Yixun Lin. Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes. Discrete Applied Mathematics, 363(1-3):201–214, March 2025.
[LL25a]
Lvzhou Li and Jingquan Luo. Nearly optimal circuit size for sparse quantum state preparation. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 113:1–113:13. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[LL92]
Christos Levcopoulos and Andrzej Lingas. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica, 8(1-6):251–256, December 1992.
[LL97]
William Lenhart and Giuseppe Liotta. Drawable and forbidden minimum weight triangulations. In 5th International Symposium on Graph Drawing (GD), volume 1353 of Lecture Notes in Computer Science, pages 1–12. Springer, 1997.
[LL99]
Hoàng-Oanh Le and Van Bang Le. Optimal tree 3-spanners in directed path graphs. Networks, 34(2):81–87, September 1999.
[LLL17]
Sylvain Lazard, William Lenhart, and Giuseppe Liotta. On the edge-length ratio of outerplanar graphs. In Frati Fabrizio and Ma Kwan-Liu, editors, 25th International Symposium on Graph Drawing and Network Visualization (GD), volume 10692 of Lecture Notes in Computer Science, pages 17–23. Springer, September 2017.
[LLO12]
Choongbum Lee, Joonkyung Lee, and Sang-il Oum. Rank-width of random graphs. Journal of Graph Theory, 70(3):339–347, July 2012.
[LLR95]
Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215–245, June 1995.
[LLS04]
Ching-Chi Lin, Hsueh-I Lu, and I-Fan Sun. Improved compact visibility representation of planar graph via Schnyder's realizer. SIAM Journal on Discrete Mathematics, 18(1):19–29, 2004.
[LLT20]
Kai-Yuan Lai, Hsueh-I Lu, and Mikkel Thorup. Three-in-a-tree in near linear time. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 1279–1292. ACM Press, June 2020.
[LLX23]
Lvzhou Li, Jingquan Luo, and Yongzhen Xu. Playing Mastermind on quantum computers. Technical Report 2207.09356v4 [quant-ph], arXiv, February 2023.
[LM03]
Vadim E. Levit and Eugen Mandrescu. Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings. Discrete Applied Mathematics, 132(1-3):163–174, October 2003.
[LM05]
Vadim E. Levit and Eugen Mandrescu. The independence polynomial of a graph -- A survey. In 1st International Conference on Algebraic Informatics (CAI), pages 231–252, 2005.
[LM08]
Frank Thomson Leighton and Ankur Moitra. Some results on greedy embeddings in metric spaces. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 337–346. IEEE Computer Society Press, October 2008.
[LM17]
Anshui Li and Tobias Müller. On the treewidth of random geometric graphs and percolated grids,. Advances in Applied Probability, 49(1):49–60, March 2017.
[LMOP00]
Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, and Linda Pagli. Masked interval routing: A new interval routing scheme. The Computer Journal, 43(2):121–129, 2000.
[LMOP98]
Fabrizio Luccio, Mohammed Mahafzah, Mahmoud Al-Omari, and Linda Pagli. Masked interval routing: a new interval routing scheme. In Luisa Gargano and David Peleg, editors, 5th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 188–199. Carleton Scientific, June 1998.
[LMPSZ20]
Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk, Saket Saurabh, and Meirav Zehavi. An exponential time parameterized algorithm for planar disjoint paths. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 1307–1316. ACM Press, June 2020.
[LMR94]
Frank Thomson Leighton, Bruce M. Maggs, and Satish B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167–180, 1994.
[LMR99]
Frank Thomson Leighton, Bruce M. Maggs, and Andréa Werneck Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19(3):375–401, 1999.
[LMS11]
Daniel Lokshtanov, Dániel Marx, and Saket Saurabh. Known algorithms on graphs of bounded treewidth are probably optimal. In 22nd Symposium on Discrete Algorithms (SODA), pages 777–789. ACM-SIAM, January 2011.
[LMZ11]
Vadim V. Lozin, Colin Mayhill, and Viktor Zamaraev. A note on the speed of hereditary graph properties. The Electronic Journal of Combinatorics, 18(1):#P157, 2011.
[LMZ13]
Robert Lukot'ka, Ján Mazák, and Xuding Zhu. Degenerated induced subgraphs of planar graphs. In Jaroslav Nešetřil and Marco Pellegrini, editors, 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 16 of CRM, pages 259–264. Edizioni della Normale, September 2013.
[LN17]
Zsolt Lángi and Márton Naszódi. On the multiple Borsuk numbers in normed spaces. Studia Scientiarum Mathematicarum Hungarica, 54(1):13–26, March 2017.
[LNLP78]
László Lovász, Victor Neumann-Lara, and Michael D. Plummer. Mengerian theorems for paths of bounded length. Periodica Mathematica Hungarica, 9(4):269–276, 1978.
[LNS85]
Richard J. Lipton, Stephen Charles North, and Jonathan S. Sandberg. A method for drawing graphs. In 1st Annual ACM Symposium on Computational Geometry (SoCG), pages 153–160. ACM, 1985.
[LNS98]
Christos Levcopoulos, Giri Narasimhan, and Michiel Smid. Efficient algorithms for constructing fault-tolerant geometric spanners. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 186–195. ACM Press, May 1998.
[LNSS07]
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, and Mohit Singh. Survivable network design with degree or order constraints. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 651–660. ACM Press, June 2007.
[Lochet21]
Willian Lochet. A polynomial time algorithm for the k-disjoint shortest paths problem. In 32nd Symposium on Discrete Algorithms (SODA), pages 169–178. ACM-SIAM, January 2021.
[Lokshtanov06]
Daniel Lokshtanov. Determining treelength is hard. Research Report 333, Department of Informatics, University of Bergen, Bergen, Norway, October 2006.
[Lokshtanov06a]
Daniel Lokshtanov. Finding the longest isometric cycle in a graph. Research Report 326, Department of Informatics, University of Bergen, Bergen, Norway, June 2006.
[Lokshtanov07]
Daniel Lokshtanov. On the complexity of computing treelength. In 32nd International Symposium on Mathematical Foundations of Computer Science (MFCS), volume Lecture Notes in Computer Science, pages 276–287. Springer, August 2007.
[Lokshtanov09]
Daniel Lokshtanov. Finding the longest isometric cycle in a graph. Discrete Applied Mathematics, 157(12):2670–2674, June 2009.
[Lokshtanov10]
Daniel Lokshtanov. On the complexity of computing treelength. Discrete Applied Mathematics, 158(7):820–827, April 2010.
[Longyear70]
Judith Q. Longyear. Regular d-valent graphs of girth 6 and 2(d2-d+1) vertices. Journal of Combinatorial Theory, 9(4):420–422, December 1970.
[LOPSZ15]
Jakub Łącki, Jakub Oćwieja, Marcin Pilipczuk, Piotr Sankowski, and Anna Zych. The power of dynamic distance oracles: Efficient dynamic algorithms for the Steiner tree. In 47th Annual ACM Symposium on Theory of Computing (STOC), pages 11–20. ACM Press, June 2015.
[LOS03]
Alejandro López-Ortiz and Sven Schuierer. Searching and on-line recognition of star-shaped polygons. Information and Computation, 185(1):66–88, August 2003.
[Loukas20]
Andreas Loukas. What graph neural networks cannot learn: depth vs width. In 8th International Conference on Learning Representations (ICLR), April 2020.
[Lovasz05]
László Lovász. Graph minor theory. Bulletin of the American Mathematical Society (New Series), 43(1):75–86, October 2005.
[Lovasz75]
László Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13(4):383–390, 1975.
[Lovasz77]
László Lovász. A homology theory for spanning trees of graphs. Acta Mathematica Academiae Scientarium Hungaricae, 30(3-4):241–251, 1977.
[Lovasz78]
László Lovász. Kneser's conjecture, chromatic number and homotopy. Journal of Combinatorial Theory, Series A, 25(3):319–324, November 1978.
[LOW08]
Christoph Lenzen, Yvonne Anne Oswald, and Roger Wattenhofer. What can be approximated locally? -- Case study: Dominating sets in planar graphs. In 20th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 46–54. ACM Press, June 2008.
[LOW10]
Christoph Lenzen, Yvonne Anne Oswald, and Roger Wattenhofer. What can be approximated locally? -- Case study: Dominating sets in planar graphs. TIK Report 331, ETH Zürich, Switzerland, 2010.
[Lozin23]
Vadim V. Lozin. Hereditary classes of graphs: A parametric approach. Discrete Applied Mathematics, 325:134–151, January 2023.
[LP08]
Kevin M. Lillis and Sriram V. Pemmaraju. On the efficiency of a local iterative algorithm to compute Delaunay realizations. In 7th International Workshop on Experimental Algorithms (WEA), volume 5038 of Lecture Notes in Computer Science, pages 69–86. Springer, May 2008.
[LP21]
Yaowei Long and Seth Pettie. Planar distance oracles with better time-space tradeoffs. In 32nd Symposium on Discrete Algorithms (SODA), pages 2517–2537. ACM-SIAM, January 2021.
[LPL15]
Ching-Hao Liu, Sheung-Hung Poon, and Jin-Yong Lin. Independent dominating set problem revisited. Theoretical Computer Science, 562:1–22, January 2015.
[LPPS14]
Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. In 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 186–195. IEEE Computer Society Press, October 2014.
[LPRS97]
Nathan Linial, David Peleg, Yuri Rabinovich, and Michael E. Saks. Neighborhood packings, covers and polling in graphs and compact metric spaces, 1997. Full version of ISTCS '93 pp. 141-149: Sphere Packing and Local Majorities in Graphs.
[LPS05]
Ying Kit Lai, Chung Keung Poon, and Benyun Shi. Approximate colored range queries. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 360–369. Springer, December 2005.
[LPS13]
Christoph Lenzen and Boaz Patt-Shamir. Fast routing table construction using small messages. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 381–390. ACM Press, May 2012.
[LPS14]
Christoph Lenzen and Boaz Patt-Shamir. Improved distributed Steiner forest construction. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 262–271. ACM Press, July 2014.
[LPS15]
Christoph Lenzen and Boaz Patt-Shamir. Fast partial distance estimation and applications. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 153–162. ACM Press, July 2015.
[LPSP01]
Zvi Lotker, Boaz Patt-Shamir, and David Peleg. Distributed MST for constant diameter graphs. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 63–71. ACM Press, 2001.
[LPSPP03]
Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. MST construction in O(loglogn) communication rounds. In 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 94–100. ACM Press, 2003.
[LPSPP05]
Zvi Lotker, Boaz Patt-Shamir, Elan Pavlov, and David Peleg. Minimum-weight spanning tree construction in O(loglogn) communication rounds. SIAM Journal on Computing, 35(1):120–131, 2005.
[LPVV01]
Francis Lazarus, Michel Pocchiola, Gert Vegter, and Anne Verroust. Computing a canonical polygonal schema of an orientable triangulated surface. In 17th Annual ACM Symposium on Computational Geometry (SoCG), pages 80–89. ACM, June 2001.
[LPW13]
Christoph Lenzen, Yvonne-Anne Pignolet, and Roger Wattenhofer. Distributed minimum dominating set approximations in restricted families of graphs. Distributed Computing, 26(2):119–137, March 2013.
[LQ22]
On-Hei Solomon Lo and Jianguo Qian. Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators. SIAM Journal on Discrete Mathematics, 36(2):1496–1501, 2022.
[LR03]
Van Bang Le and Bert Randerath. On stable cutsets in line graphs. Theoretical Computer Science, 301(1-3):463–475, May 2003.
[LR05]
Kofi Ambrose Laing and Rajmohan Rajaraman. Brief announcement: A space lower bound for name-independent compact routing in trees. In 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), page 216. ACM Press, July 2005.
[LR07]
Vadim V. Lozin and Gábor Rudolf. Minimal universal bipartite graphs. Ars Combinatoria, 84:345–356, 2007.
[LS03]
Emmanuelle Lebhar and Nicolas Schabanel. Searching for optimal paths in long-range contact networks. Research Report 2003-55, LIP, École Normale Supérieure de Lyon, November 2003.
[LS04]
Emmanuelle Lebhar and Nicolas Schabanel. Almost optimal decentralized routing in long-range contact networks. In 31st International Colloquium on Automata, Languages and Programming (ICALP), volume 3142 of Lecture Notes in Computer Science, pages 894–905. Springer, July 2004.
[LS05]
Emmanuelle Lebhar and Nicolas Schabanel. Close to optimal decentralized routing in long-range contact networks. Theoretical Computer Science, 348(2-3):294–310, December 2005.
[LS08]
Emmanuelle Lebhar and Nicolas Schabanel. Graph augmentation via metric embedding. In 12th International Conference on Principles of Distributed Systems (OPODIS), volume 5401 of Lecture Notes in Computer Science, pages 217–225. Springer, December 2008.
[LS10]
James R. Lee and Anastasios Sidiropoulos. Genus and the geometry of the cut graph. In 21st Symposium on Discrete Algorithms (SODA), pages 193–201. ACM-SIAM, January 2010.
[LS11]
Jakub Łącki and Piotr Sankowski. Min-cuts and shortest cycles in planar graphs in O(nloglogn) time. In 19th Annual European Symposium on Algorithms (ESA), volume 6942 of Lecture Notes in Computer Science, pages 155–166. Springer-Verlag, September 2011.
[LS14]
Juhana Laurinharju and Jukka Suomela. Brief announcement: Linial's lower bound made easy. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 377–378. ACM Press, July 2014.
[LS14a]
Alexander Leaf and Paul D. Seymour. Tree-width and planar minors. Technical Report MSR-TR-2010-165, Princeton University, 2014.
[LS15]
Alexander Leaf and Paul D. Seymour. Tree-width and planar minors. Journal of Combinatorial Theory, Series B, 111:38–53, March 2015.
[LS22]
Yaowei Long and Thatchaphol Saranurak. Near-optimal deterministic vertex-failure connectivity oracles. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1002–1010. IEEE Computer Society Press, October 2022.
[LS23]
Jérémy Lavollée and Konrad J. Swanepoel. A tight bounding for the number of edges of matchstick graphs. Technical Report 2209.09800v2 [math.CO], arXiv, June 2023.
[LS95]
Arthur L. Liestman and Thomas C. Shermer. Degree-contrained network spanners with nonconstant delay. SIAM Journal on Discrete Mathematics, 8(2):291–321, May 1995.
[LSR20]
Pierre Leone, Kasun Samarasinghe, and José D.P. Rolim. Every Schnyder drawing is a greedy embedding. Theoretical Computer Science, 807:234–244, 2020.
[LSW04]
Xiang-Yang Li, Ivan Stojmenovic, and Yu Wang. Partial Delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems, 15(4):350–361, April 2004.
[LSZ08]
Hagay Levin, Michael Schapira, and Aviv Zohar. Interdomain routing and games. In 40th Annual ACM Symposium on Theory of Computing (STOC), pages 57–66. ACM Press, June 2008.
[LT15]
Maarten Löffler and Csaba D. Tóth. Linear-size universal point sets for one-bend drawings. In 23rd International Symposium on Graph Drawing and Network Visualization (GD), volume 9411 of Lecture Notes in Computer Science, pages 423–429. Springer, September 2015.
[LT18]
Thomas M. Liggett and Wenpin Tang. One-dependent hard-core processes and colorings of the star graph. Technical Report 1804.0687v1 [math.PR], arXiv, April 2018.
[LT79]
Richard J. Lipton and Robert Endre Tarjan. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics, 36(2):177–189, April 1979.
[LT80]
Richard J. Lipton and Robert Endre Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9(3):615–627, August 1980.
[LTNBx21]
Kai Sheng Lee, Yuanzheng Paul Tan, L. Harold Nguyen, Rangga P. Budoyo, Hyang Kyu Park, C. Hufnagel, Yung Szen Yap, Nadja Møbjerg, Vlatko Vedral, Tomasz Paterek, and Rainer Dumke. Entanglement between superconducting qubits and a tardigrade. Technical Report 2112.07978v2 [quant-ph], arXiv, December 2021.
[LTvM15]
Dajie Liu, Stojan Trajanovski, and Piet van Mieghem. ILIGRA: An efficient inverse line graph algorithm. Journal of Mathematical Modelling and Algorithms in Operations Research, 14(1):13–33, March 2015.
[LTZ25]
George Z. Li, Zihan Tan, and Tianyi Zhang. Paths and intersections: Exact emulators for planar graphs. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1906–1929. IEEE Computer Society Press, December 2025.
[Lu01]
Linyuan Lu. The diameter of random massive graphs. In 12th Symposium on Discrete Algorithms (SODA), pages 912–921. ACM-SIAM, January 2001.
[Lu02]
Hsueh-I Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In 13th Symposium on Discrete Algorithms (SODA), pages 223–224. ACM-SIAM, January 2002.
[Lu02a]
Hsueh-I Lu. Improved compact routing tables for planar networks via orderly spanning trees. In 8th Annual International Computing & Combinatorics Conference (COCOON), volume 2387 of Lecture Notes in Computer Science, pages 57–66. Springer, August 2002.
[Lu02b]
Hsueh-I Lu. Linear-time information-theoretically optimal encodings supporting constant-time queries for constant-genus graphs. Preprint, April 2002.
[LU18]
Stefan Langerman and Yushi Uno. Threes!, Fives, 1024!, and 2048 are hard. Theoretical Computer Science, 748:17–27, November 2018.
[LU95]
Felix Lazebnik and Vasiliy A. Ustimenko. Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Applied Mathematics, 60(1-3):275–284, June 1995.
[Luby85]
Michael Luby. A simple parallel algorithm for the maximal independent set problem. In 17th Annual ACM Symposium on Theory of Computing (STOC), pages 1–10. ACM Press, May 1985.
[Luby86]
Michael Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15(4):1036–1053, November 1986.
[Luce24]
Maël Luce. Distributed randomized and quantum algorithms for cycle detection in networks. PhD thesis, Université Paris Cité, Paris, France, December 2024.
[Lucena07]
Brian Lucena. Achievable sets, brambles, and sparse treewidth obstructions. Discrete Applied Mathematics, 155(8):1055–1065, April 2007.
[LUW95]
Felix Lazebnik, Vasiliy A. Ustimenko, and Andrew J. Woldar. A new series of dense graphs of high girth. Bulletin of the American Mathematical Society (New Series), 32(1):73–79, January 1995.
[LV05]
Thomas Lam and Jacques Verstraëte. A note on graphs without short even cycles. The Electronic Journal of Combinatorics, 12:#R5, April 2005.
[LV08]
Ming Li and Paul M.B. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer-Verlag, 2008.
[LV93]
Ming Li and Paul M.B. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer-Verlag, 1993.
[LV95]
Ming Li and Paul M.B. Vitányi. A new approach to formal language theory by Kolmogorov complexity. SIAM Journal on Computing, 24(2):398–410, April 1995.
[LV97]
Ming Li and Paul M.B. Vitányi. An introduction to Kolmogorov complexity and its applications. Springer-Verlag, 1997.
[LVPS08]
Kirill Levchenko, Geoffrey Voelker, Ramamohan Paturi, and Stefan Savage. XL: An efficient network routing algorithm. In ACM SIGCOMM Conference on Data Communication, pages 15–26. ACM Press, August 2008.
[LW03]
Xiang-Yang Li and Yu Wang. Efficient construction of low weight bounded degree planar spanner. In 9th Annual International Computing & Combinatorics Conference (COCOON), volume 2697 of Lecture Notes in Computer Science, pages 374–384. Springer, July 2003.
[LW04]
Xiang-Yang Li and Yu Wang. Efficient construction of low weight bounded degree planar spanner. International Journal of Computational Geometry and Applications, 14(1-2):69–84, 2004.
[LW08]
Christoph Lenzen and Roger Wattenhofer. Leveraging Linial's locality limit. In 22nd International Symposium on Distributed Computing (DISC), volume 5218 of Lecture Notes in Computer Science, pages 394–407. Springer, September 2008.
[LW08a]
Christian Liebchena and Gregor Wünscha. The zoo of tree spanner problems. Discrete Applied Mathematics, 156(5):569–587, March 2008.
[LW10]
Christoph Lenzen and Roger Wattenhofer. Minimum dominating set approximation in graphs of bounded arboricity. In 24th International Symposium on Distributed Computing (DISC), volume 6343 of Lecture Notes in Computer Science, pages 510–524. Springer, September 2010.
[LW10a]
Hao Li and Mariusz Woźniak. A note on graphs containing all trees of a given size. Ars Combinatoria, 94, January 2010.
[LW11]
Christoph Lenzen and Roger Wattenhofer. MIS on trees. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41–48. ACM Press, June 2011.
[LW19]
Anita Liebenau and Nicholas C. Wormald. Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph. Technical Report 1702.08373v3 [math.CO], arXiv, August 2019.
[LW24]
Christoph Lenzen and Sophie Wenning. Tight bounds for constant-round domination on graphs of high girth and low expansion. Technical Report 2408.12998v1 [cs.DC], arXiv, August 2024.
[LW80]
Der-Tsai Lee and C.K. Wong. Voronoï diagrams in L1 (L\infty) metrics with 2-dimensional storage applications. SIAM Journal on Computing, 9(1):200–211, February 1980.
[LW87]
Valery A. Liskovets and Timothy R. Walsh. Ten steps to counting planar graphs. Congressus Numerantium, 60:269–277, 1987.
[LW96]
Peter Loh and Jing Wenge. Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks. In 2nd IEEE International Conference on Algorithms & Architectures for Parallel Processing (ICAPP), pages 348–355, June 1996.
[LWJX26]
Pingshan Li, Jue Wu, Wei Jin, and Min Xu. The characterization of the lower bound on the dissociation number of trees. Discrete Mathematics, 349(2):114854, February 2026.
[LY08]
Hsueh-I Lu and Chia-Chi Yeh. Balanced parentheses strike back. ACM Transactions on Algorithms, 4(3):A28, 2008.
[LY25]
Shuxing Li and Chi Hoi Yip. Generalized additive bases and difference bases for cartesian product of finite abelian groups. Technical Report 2509.24034v1 [math.CO], arXiv, September 2025.
[LY80]
John M. Lewis and Mihalis Yannakakis. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences, 20(2):219–230, April 1980.
[Lynch89]
Nancy A. Lynch. A hundred impossibility proofs for distributed computing. In 8th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 1–28. ACM Press, 1989.
[Lynch97]
Nancy A. Lynch. Distributed algorithms. The Morgan Kaufmann Series in Data Management Systems. Morgan Kaufmann, 1997.
[LZ09]
Yury Lifshits and Shengyu Zhang. Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. In 20th Symposium on Discrete Algorithms (SODA), pages 318–326. ACM-SIAM, January 2009.
[LZ25]
Jingxun Liang and Renfei Zhou. Optimal static fully indexable dictionaries. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 114:1–114:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[LZ76]
Abraham Lempel and Jacob Ziv. On the complexity of finite sequences. IEEE Transactions on Information Theory, IT-22(1):75–81, January 1976.
[Mader67]
Wolfgang Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Mathematische Annalen, 174(4):265–268, December 1967.
[Madry13]
Aleksander Mądry. Navigating central path with electrical flows: From flows to matchings, and back. In 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 253–262. IEEE Computer Society Press, October 2013.
[Magnard21]
Thomas Magnard. Plongements topologiques de graphes sur les complexes simpliciaux. PhD thesis, Université Bordeaux 1, Talence, France, October 2021.
[Maharry00]
John Maharry. A characterization of graphs with no cube minor. Journal of Combinatorial Theory, Series B, 80(2):179–201, November 2000.
[Maharry08]
John Maharry. An excluded minor theorem for the octahedron plus an edge. Journal of Graph Theory, 57(2):124–130, February 2008.
[Maharry99]
John Maharry. An excluded minor theorem for the octahedron. Journal of Graph Theory, 31(2):95–100, 1999.
[Mahdian00]
Mohammad Mahdian. The strong chromatic index of graphs. Master thesis, Graduate Department of Computer Science, University of Toronto, 2000.
[Mahler53]
Kurt Mahler. On the approximation of 𝜋. Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Series A, 56(1):30–42, 1953.
[Mahler53a]
Kurt Mahler. On the approximation of logarithms of algebraic numbers. Philosophical Transactions of the Royal Society A, 245(A. 898):371–398, January 1953.
[Mahumd13]
Sharifa Rania Mahumd. Survey on convex drawing of planar graph. IOSR Journal of Computer Engineering, 8(4):7–17, February 2013.
[Makarychev97]
Yury Makarychev. A short proof of Kuratowski's graph planarity criterion. Journal of Graph Theory, 25(3):129–131, 1997.
[Malitz88]
Seth M. Malitz. Genus g graphs have pagenumber O(√g). In 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 458–468. IEEE Computer Society Press, October 1988.
[Malitz94]
Seth M. Malitz. Genus γ graphs have pagenumber O(√γ). Journal of Algorithms, 17(1):85–109, July 1994.
[MAN04]
Kazuyuki Miura, Machiko Azuma, and Takao Nishizeki. Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs. In 10th Annual International Computing & Combinatorics Conference (COCOON), volume 3106 of Lecture Notes in Computer Science, pages 309–318. Springer, 2004.
[Mandal07]
Swagata Mandal. Some sequential and parallel algorithms on circular-arc graphs. PhD thesis, Vidyasagar University, Midnapore (India), January 2007.
[Mango06]
Domenico Mango. An experimental evaluation of algorithms for IP tables minimization. PhD thesis, Università di L'Aquila, Italy, 2006.
[Mans98]
Bernard Mans. On the interval routing of chordal rings of degree 4. Technical Report C/TR98-09, Macquarie University, Dept. of Computing, School of MPCE, Macquarie University, Sydney NSW2109, Australia, July 1998.
[Mans99]
Bernard Mans. On the interval routing of chordal rings. In International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN), pages 16–21. IEEE Computer Society Press, June 1999.
[Marckert17]
Jean-Francois Marckert. The probability that n random points in a disk are in convex position. Brazilian Journal of Probability and Statistics, 31(2):320–337, 2017.
[Mari20]
Mathieu Mari. Greedy approaches to approximation of some NP-hard combinatorial optimization problems. PhD thesis, École Normale Supérieure, Paris, September 2020.
[Marx07]
Dániel Marx. On the optimality of planar and geometric approximation schemes. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 338–348. IEEE Computer Society Press, October 2007.
[Marx07a]
Dániel Marx. Can you beat treewidth. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 169–179. IEEE Computer Society Press, October 2007.
[Mathar16]
Richard J. Mathar. Topologically distinct sets of non-intersecting circles in the plane. Technical Report 1603.00077v1 [cs.DC], arXiv, September 2016.
[Matousek02]
Jiří Matoušek. Embedding finite metric spaces into normed spaces. In Lectures on Discrete Geometry, volume 212 of Graduate Texts in Mathematics, chapter 15, pages 323–362. Springer, 2002.
[Matousek04]
Jiří Matoušek. A combinatorial proof of Kneser's conjecture. Combinatorica, 24(1):163–170, January 2004.
[Matousek04a]
Jiří Matoušek. Bounded VC-dimension implies a fractional Helly theorem. Discrete & Computational Geometry, 31(2):251–255, February 2004.
[Matousek13]
Jiří Matoušek. String graphs and separators. Technical Report 1311.5048v1 [math.CO], arXiv, November 2013.
[Matschke22]
Benjamin Matschke. On the square peg problem and its relatives. Technical Report 1001.0186v2 [math.MG], arXiv, March 2022.
[Maus21]
Yannic Maus. Distributed graph coloring made easy. In 33rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 362–372. ACM Press, July 2021.
[Maynard16]
James Maynard. Large gaps between primes. Annals of Mathematics, 183(3):915–933, May 2016.
[Mazumdar15]
Ayra Mazumdar. Storage capacity of repairable networks. Technical Report 1408.4862v2 [cs.IT], arXiv, July 2015.
[MB02]
Grégoire Malandain and Jean-Daniel Boissonnat. Computing the diameter of a point set. International Journal of Computational Geometry and Applications, 12(6):489–510, 2002.
[MB14]
Zahra Moezkarimi and Alireza Bagheri. A PTAS for geometric 2-FTP. Information Processing Letters, 114(12):670–675, December 2014.
[MB71]
Saunders MacLane and Garrett Birkhoff. Algebra. Macmillian Co., 1971.
[McCarty25]
Rose McCarty. Vertex-minors and quantum computing, October 2025. Slides at Bertinoro Workshop on Algorithms.
[McClintok12]
Jessica McClintok. Extremal graph theory for book-embeddings. Master of computer science thesis, The University of Melbourne, Australia, October 2012.
[McConnell01]
Ross M. McConnell. Linear-time recognition of circular-arc graphs. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 386–394. IEEE Computer Society Press, October 2001.
[McCS97]
Ross M. McConnell and Jeremy P. Spinrad. Linear-time transitive orientation. In 8th Symposium on Discrete Algorithms (SODA), pages 19–25. ACM-SIAM, January 1997.
[McDiarmid08]
Colin J.H. McDiarmid. Random graphs on surfaces. Journal of Combinatorial Theory, Series B, 98(4):778–797, July 2008.
[McDK12]
Colin J.H. McDiarmid and Valentas Kurauskas. Random graphs containing few disjoint excluded minors. Random Structures and Algorithms, 44(2):240–268, March 2012.
[McDR08]
Colin J.H. McDiarmid and Bruce A. Reed. On the maximum degree of a random planar graph. Combinatorics, Probability and Computing, 17(4):591–601, July 2008.
[McDS21]
Colin McDiarmid and Sophia Saller. Random graphs embeddable in order-dependent surfaces. Technical Report 2108.07666v1 [math.CO], arXiv, August 2021.
[McDSW05]
Colin J.H. McDiarmid, Angelika Steger, and Dominic J.A. Welsh. Random planar graphs. Journal of Combinatorial Theory, Series B, 93(2):187–205, March 2005.
[McGKTx22]
Thomas McGrath, Andrei Kapishnikov, Nenad Tomašev, Adam Pearce, Demis Hassabis, Been Kim, Ulrich Paquet, and Vladimir Kramnik. Acquisition of chess knowledge in alphazero. Technical Report 2111.09259v3 [cs.AI], arXiv, August 2022.
[McGregor82]
James J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software: Practice and Experience, 12(1):23–34, January 1982.
[McKee17]
Terry A. McKee. New graph classes characterized by weak vertex separators and two-pairs. AKCE International Journal of Graphs and Combinatorics, 14(1):13–17, 2017.
[McKMcM99]
Terry A. McKee and Fred R. McMorris. Topics in intersection graph theory. Monographs on Discrete Mathematics and Applications. SIAM, 1999.
[McKP14]
Brendan D. McKay and Adolfo Piperno. Practical graph isomorphism, II. Journal of Symbolic Computation, 60:94–112, 2014.
[McKW90]
Brendan D. McKay and Nicholas C. Wormald. Asymptotic enumeration by degree sequence of graphs of high degree. European Journal of Combinatorics, 11(6):565–580, November 1990.
[McKW91]
Brendan D. McKay and Nicholas C. Wormald. Asymptotic enumeration by degree sequence of graphs with degrees o(n1/2). Combinatorica, 11(4):369–382, December 1991.
[Menabrea42]
Luigi-Federico Menabrea. Notions sur la machine analytique de M. Charles Babbage. Bibliothèque universelle de Genève, nouvelle série, 41:352–376, October 1842.
[Mermin85]
N. David Mermin. Is the moon there when nobody looks? Reality and the quantum theory. Physics Today, 38(4):38–47, April 1985.
[Mermin90]
N. David Mermin. Quantum mysteries revisited. American Journal of Physics, 58(8):731–734, 1990.
[Meyer03]
Ulrich Meyer. Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. Journal of Algorithms, 48(1):91–134, August 2003.
[Meyer73]
Walter Meyer. Equitable coloring. The American Mathematical Monthly, 80(8):920–922, 1973.
[MG08]
Wolfgang Mulzer and Günter Rote. Minimum-weight triangulation is NP-hard. Journal of the ACM, 55(2):Article No. 11, pp. 1–29, May 2008.
[MH05]
Manor Mendel and Sariel Har-Peled. Fast construction of nets in low dimensional metrics, and their applications. In 21st Annual ACM Symposium on Computational Geometry (SoCG), pages 150–158. ACM, June 2005.
[MH06]
Manor Mendel and Sariel Har-Peled. Fast construction of nets in low dimensional metrics, and their applications. SIAM Journal on Computing, 35(5):1148–1184, 2006.
[MHW11]
Huaiyuan Ma, Bjarne E. Helvik, and Otto J. Wittner. An impact of addressing schemes on routing scalability. Journal of Communications and Networks, 13(6):602–611, December 2011.
[Milani18]
Alessia Milani. On the complexity of democratizing concurrent programming: Some upper and lower bounds, November 2018. Thèse d'habilitation à diriger les recherches, Université de Bordeaux, LaBRI.
[Milgram67]
Stanley Milgram. The small-world problem. Psychology Today, 2:60–67, 1967.
[Miller84]
Gary L. Miller. Finding small simple cycle separators for 2-connected planar graphs. In 16th Annual ACM Symposium on Theory of Computing (STOC), pages 376–382. ACM Press, April 1984.
[Miller86]
Gary L. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, 32(3):265–279, June 1986.
[Miller87]
Gary L. Miller. An additivity theorem for the genus of a graph. Journal of Combinatorial Theory, Series B, 43(1):25–47, August 1987.
[Miltersen93]
Peter Bro Miltersen. The bit probe complexity measure revisited. In 10th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 665 of Lecture Notes in Computer Science, pages 662–671. Springer, 1993.
[Mitchell79]
Sandra L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Information Processing Letters, 9(5):229–232, December 1979.
[Mitchell99]
Joseph S.B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28(4):1298–1309, 1999.
[MK84]
Michael L. Fredman and János Komlós. On the size of separating systems and families of perfect hash functions. SIAM Journal on Algebraic and Discrete Methods, 5(1):61–68, March 1984.
[MKTPG10]
Marcin Markiewicz, Adrian Kosowski, Tomasz Tylec, Jarosław Pykacz, and Cyril Gavoille. Static quantum games revisited. Technical Report 1001.2257v3 [quant-ph], arXiv, January 2010.
[MLM17]
Dominic J. Moylett, Noah Linden, and Ashley Montanaro. Quantum speedup of the travelling-salesman problem for bounded-degree graphs. Physical Review A, 95(3):032323, March 2017.
[MM93]
King-Tim Mak and Andrew J. Morton. A modified Lin-Kernighan traveling-salesman heuristic. Operations Research Letters, 13(3):127–132, April 1993.
[MM95]
King-Tim Mak and Andrew J. Morton. Distances between traveling salesman tours. Discrete Applied Mathematics, 58(3):281–291, April 1995.
[MMBV17]
Jan Hendrik Metzen, Chaithanya Kumar Mummadi, Thomas Brox, and Volker Fischer. Universal adversarial perturbations against semantic image segmentation. Technical Report 1704.05712v3 [stat.ML], arXiv, July 2017.
[MMM21]
Arturo Merino, Ondřej Mička, and Torsten Mütze. On a combinatorial generation problem of Knuth. In 32nd Symposium on Discrete Algorithms (SODA), pages 735–743. ACM-SIAM, January 2021.
[MMN23]
Arturo Merino, Torsten Mütze, and Namrata. Kneser graphs are Hamiltonian. In 55th Annual ACM Symposium on Theory of Computing (STOC), pages 963–970. ACM Press, June 2023.
[MMS20]
Anil Maheshwari, Wolfgang Mulzer, and Michiel Smid. A simple randomized O(NlogN)-time closest-pair algorithm in doubling metrics. Journal of Computational Geometry, 11(1):507–524, 2020.
[MN04]
Chip Martel and Van Nguyen. Analyzing Kleinberg's (and other) small-world models. In 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 179–188. ACM Press, July 2004.
[MN06]
Alexander Mednykh and Roman Nedela. Enumeration of unrooted maps of a given genus. Journal of Combinatorial Theory, Series B, 96(5):706–729, September 2006.
[MN06a]
Manor Mendel and Assaf Naor. Ramsey partitions and proximity data structures. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 109–118. IEEE Computer Society Press, October 2006.
[MN07]
Veli Mäkinena and Gonzalo Navarro. Rank and select revisited and extended. Theoretical Computer Science, 387(3):332–347, November 2007. Special issue on "The Burrows-Wheeler Transform and its applications".
[MN07a]
Manor Mendel and Assaf Naor. Ramsey partitions and proximity data structures. Journal of the European Mathematical Society, 9(2):253–275, 2007.
[MN12]
J. Ian Munro and Patrick K. Nicholson. Succinct posets. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 743–754. Springer-Verlag, September 2012.
[MNN17]
J. Ian Munro, Gonzalo Navarro, and Yakov Nekrich. Space-efficient construction of compressed indexes in deterministic linear time. In 28th Symposium on Discrete Algorithms (SODA), pages 408–424. ACM-SIAM, January 2017.
[MNR17]
Hugh Montgomery, Ashkan Nikeghbali, and Michael Th. Rassias. Exploring the riemann Zeta function. Springer, 2017.
[MNW04]
Gurmeet Singh Manku, Moni Naor, and Udi Wieder. Know thy neighbor's neighbor: The power of lookahead in randomized P2P networks. In 36th Annual ACM Symposium on Theory of Computing (STOC), pages 54–63. ACM Press, June 2004.
[Mochon05]
Carlos Mochon. A large family of quantum weak coin-flipping protocols. Physical Review A, 72(022341), 2005.
[Modanese25]
Augusto Modanese. Recent breakthroughs in distributed quantum computing, October 2025. Workshop on Advances in Distributed Graph Algorithms (ADGA).
[Mohar01]
Bojan Mohar. Graph minors and graphs on surfaces, July 2001. Invited talk at the 18th British Combinatorial Conference, Sussex, UK.
[Mohar89]
Bojan Mohar. lsoperimetric numbers of graphs. Journal of Combinatorial Theory, Series B, 47(3):274–291, December 1989.
[Mohar96]
Bojan Mohar. Embedding graphs in an arbitrary surface in linear time. In 28th Annual ACM Symposium on Theory of Computing (STOC), pages 392–397. ACM Press, May 1996.
[Mohar97]
Bojan Mohar. Face-width of embedded graphs. Mathematica Slovaca, 47(1):35–36, 1997.
[Mohar98]
Bojan Mohar. On the orientable genus of graphs with bounded nonorientable genus. Discrete Mathematics, 182(1-3):245–253, March 1998.
[Mohar99]
Bojan Mohar. A linear time algorithm for embedding graphs in an arbitrary surface. SIAM Journal on Discrete Mathematics, 12(1):6–26, 1999.
[Mohar99a]
Bojan Mohar. Drawing graphs in the hyperbolic plane. In 7th International Symposium on Graph Drawing (GD), volume 1731 of Lecture Notes in Computer Science, pages 127–136. Springer, 1999.
[Mohring85]
Rolf H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In Ivan Rival, editor, Graphs and Order, volume 147 of NATO ASI Series C: Mathematical and Physical Sciences, chapter 2, pages 41–101. Springer, 1985.
[Monien85]
Burkhard Monien. How to find long paths efficiently. In G. Ausiello and M. Lucertini, editors, Analysis and Design of Algorithms for Combinatorial Problems, volume 109 of North-Holland Mathematics Studies, pages 239–254. North-Holland, 1985.
[Monien91]
Burkhard Monien. Simulating binary trees on X-trees. In 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 147–158. ACM Press, 1991.
[Montealegre17]
Piedro Montealegre Barba. Algorithmes de graphes séquentiels et distribués. PhD thesis, Université d'Orléans, France, February 2017.
[Moon65]
John W. Moon. On minimal n-universal graphs. Glasgow Mathematical Journal, 7(1):32–33, January 1965.
[Morgan05]
David Morgan. A dynamic implicit adjacency labelling schemes for line graphs. In 9th International Workshop on Algorithms and Data Structures (WADS), volume 3608 of Lecture Notes in Computer Science, pages 294–305. Springer, August 2005.
[Morgan05a]
David Morgan. A dynamic implicit adjacency labelling schemes for line graphs. Technical Report TR05-03, Department of Computing Science, University of Alberta, January 2005.
[Morgan05b]
David Morgan. Useful names for vertices: An introduction to dynamic implicit informative labelling schemes. Technical Report TR05-04, Department of Computing Science, University of Alberta, January 2005.
[Morin21]
Pat Morien. A fast algorithm for the product structure of planar graphs. Algorithmica, 83(5):1544–1558, May 2021.
[Morin23s]
Ludovic Morin. Probabilité que n points soient en position convexe dans un k-gone régulier : résultats asymptotiques, December 2023. GT Combinatoire et interactions.
[MOS98]
Petra Mutzel, Thomas Odenthal, and Mark Scharbrodt. The thickness of graphs: A survey. Graphs and Combinatorics, 14:59–73, 1998.
[Moss89]
Lawrence S. Moss. Existence and nonexistence of universal graphs. Fundamenta Mathematicae, 133:25–37, 1989.
[Moss92]
Lawrence S. Moss. Distanced graphs. Discrete Mathematics, 102(3):287–305, May 1992.
[Mouawad19]
Amer Mouawad. Algorithmic aspects of reconfiguration: The story of vertex cover reconfiguration -- Part II. In 3rd International Workshop on Combinatorial Reconfiguration (CoRe), May 2019.
[MP12]
Dieter Mitsche and Guillem Perarnau. On the treewidth and related parameters of random geometric graphs. In 29th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 14 of LIPIcs, pages 408–419. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2012.
[MP14]
Dániel Marx and Michał Pilipczuk. Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask). In 31st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 25 of LIPIcs, pages 542–553. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2014.
[MP17]
Avery Miller and Andrzej Pelc. Deterministic distributed construction of t-dominating sets in time t. Discrete Applied Mathematics, 222:172–178, May 2017.
[MP23]
Avery Miller and Andrzej Pelc. Fast deterministic rendezvous in labeled lines. In Rotem Oshman, editor, 37th International Symposium on Distributed Computing (DISC), volume 281 of LIPIcs, pages 29:1–29:22. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2023.
[MP53]
Kurt Mahler and J. Popken. On a maximum problem in arithmetic (dutch). Nieuw Archief voor Wiskunde, 3(1):1–15, 1953.
[MPP05]
Christian Worm Mortensen, Rasmus Pagh, and Mihai Pǎtrascu. On dynamic range reporting in one dimension. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 104–111. ACM Press, May 2005.
[MPT20]
Ciaran McCreesh, Patrick Prosser, and James Trimble. The Glasgow subgraph solver: Using constraint programming to tackle hard subgraph isomorphism problem variants. In Graph Transformation, 13th International Colloquium on Graph Theory (ICGT), volume 12150 of Lecture Notes in Computer Science, pages 316–324. Springer, June 2020.
[MPT22]
Benjamin Moore, Luke Postle, and Lise Turner. Local Hadwiger's conjecture. Technical Report 2203.06718v2 [math.CO], arXiv, March 2022.
[MPT23]
Benjamin Moore, Luke Postle, and Lise Turner. Local Hadwiger's conjecture. Journal of Combinatorial Theory, Series B, 162:154–183, September 2023.
[MR01]
J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. SIAM Journal on Computing, 31(3):762–776, 2001.
[MR25]
Vignesh Manoharan and Vijaya Ramachandran. Distributed distance sensitivity oracles. In Ulrich Schmid and Roman Kuznets, editors, 32nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 15671 of Lecture Notes in Computer Science, pages 366–383. Springer, June 2025.
[MR95]
Rajeev Motwani and Prabhakar Raghavan. Randomized algorithms. Cambridge University Press, 1995.
[MR97]
J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 118–126. IEEE Computer Society Press, October 1997.
[MRRR03]
J. Ian Munro, Rajeev Raman, Venkatesh Raman, and Satti Srivivasa Rao. Succinct representations of permutations. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 345–356. Springer, July 2003.
[MRZ16]
Yves Métivier, John Michael Robson, and Akka Zemmari. A distributed enumeration algorithm and applications to all pairs shortest paths, diameter... Information and Computation, 247:141–151, April 2016.
[MS00]
Shlomo Moran and Sagi Snir. Simple and efficient network decomposition and synchronization. Theoretical Computer Science, 243(1-2):217–241, July 2000.
[MS00a]
Walter Morris and Valeriu Soltan. The Erdős-Szekeres problem on points in convex position -- A survey. Bulletin of the American Mathematical Society, 37(4):437–458, June 2000.
[MS01]
Bernard Mans and Igor Shparlinski. Bisecting and gossiping in circulant graphs, 2001. Soumission SODA '02.
[MS04]
Marcin Mucha and Piotr Sandowski. Finding maximum matchings via Gaussian elimination. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 248–255. IEEE Computer Society Press, October 2004.
[MS04a]
Horst Martini and Konrad J. Swanepoel. The geometry of Minkowski spaces -- A survey. Part II. Expositiones Mathematicae, 22(2):93–144, 2004.
[MS11]
Hiroyasu Mizuguchi and Kichi-Suke Saito. Some geometric constants of absolute normalized norms on ℝ2. Annals of Functional Analysis, 2(2):22–23, 2011.
[MS77]
Florence Jessie MacWilliams and Neil James Alexander Sloane. The theory of error-correcting codes, volume 16 of North-Holland Mathematical Library. North-Holland, 1977.
[MS80]
David W. Matula and Robert R. Sokal. Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geographical Analysis, 12(3):205–298, July 1980.
[MS95]
Friedhelm Meyer auf der Heide and Christian Scheideler. Space-efficient routing in vertex-symmetric networks, 1995. Manuscript.
[MS95a]
Friedhelm Meyer auf der Heide and Christian Scheideler. Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In Paul G. Spirakis, editor, 3rd Annual European Symposium on Algorithms (ESA), volume 979 of Lecture Notes in Computer Science, pages 341–354. Springer-Verlag, September 1995.
[MS96]
Gary MacGillivray and Karen Seyffarth. Domination numbers of planar graphs. Journal of Graph Theory, 22(3):213–229, 1996.
[MS99]
Vincent Moulton and Michael A. Steel. Retractions of finite distance functions onto tree metrics. Discrete Applied Mathematics, 91(1-3):215–233, January 1999.
[MSST13]
Guilherme O. Mota, Gábor N. Sárkõzy, Mathias Schacht, and Anusch Taraz. Ramsey numbers for bipartite graphs with small bandwidth. In Jaroslav Nešetřil and Marco Pellegrini, editors, 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 16 of CRM, pages 165–170. Edizioni della Normale, September 2013.
[MSTT09]
Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, and Panagiotis Tsikouras. Recursive generating of k-ary trees. Journal of Integer Sequences, 12:09.7.7, 2009.
[MSTW13]
Jiří Matoušek, Eric Sedgwick, Martin Tancer, and Uli Wagner. Untangling two systems of noncrossing curves. In 21st International Symposium on Graph Drawing (GD), volume 8242 of Lecture Notes in Computer Science, pages 472–483. Springer, September 2013.
[MSW01]
Horst Martini, Konrad J. Swanepoel, and Gunter Weiß. The geometry of Minkowski spaces -- A survey. Part I. Expositiones Mathematicae, 19(2):97–142, 2001.
[MSW95]
Friedhelm Meyer auf der Heide, Martin Storch, and Rolf Wanka. Optimal trade-offs between size and slowdown for universal parallel networks. In 7th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 119–128. ACM Press, July 1995.
[MT01]
Bojan Mohar and Carsten Thomassen. Graphs on surfaces. The Johns Hopkins University Press, 2001.
[MT12]
Shay Mozes and Christian Sommer. Exact distance oracles for planar graphs. In 23rd Symposium on Discrete Algorithms (SODA), pages 209–222. ACM-SIAM, January 2012.
[MT20]
Yannic Maus and Tigran Tonoyan. Local conflict coloring revisited: Linial for lists. In Hagit Attiya, editor, 34th International Symposium on Distributed Computing (DISC), volume 179 of LIPIcs, pages 16:1–16:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, October 2020.
[MT90]
M.D. May and P.W. Thompson. Transputers and routers: Components for concurrent machines. In Transputers and Routers: Function, Performance and Applications, chapter 1. INMOS Ltd., April 1990.
[MT91]
Jiří Matoušek and Robin Thomas. Finding tree-decompositions of graphs. Journal of Algorithms, 12(1):1–22, 1991.
[MT96]
Lesley R. Matheson and Robert Endre Tarjan. Dominating sets in planar graphs. European Journal of Combinatorics, 17(6):565–568, August 1996.
[MT98]
Mikhail E. Muzychuk and Gottfried Tinhoffer. Recognizing circulant graphs of prime order in polynomial time. The Electronic Journal of Combinatorics, 5:#R25, 1998.
[MTV91]
Gary L. Miller, Shang-Hua Teng, and S.A. Vavasis. A unified geometric approach to graph separators. In 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 538–547. IEEE Computer Society Press, October 1991.
[MTW93]
M.D. May, P.W. Thompson, and Peter H. Welch. Networks, routers and transputers: Function, perfomance, and applications. IOS Press, Netherlands, February 1993.
[MU17]
Michael Mitzenmacher and Eli Upfal. Probability and computing. Cambridge, 2017.
[Mucha12]
Marcin Mucha. 13/9-approximation for graphic TSP. In 29th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 14 of LIPIcs, pages 30–41. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, February 2012.
[Mugwaneza93]
Léon Mugwaneza. Contrôle des communications dans les machines parallèles à mémoire distribuèe -- Contribution au routage automatique des messages. PhD thesis, Institut National Polytechnique de Grenoble, November 1993.
[Muller88]
John H. Muller. Local structure in graph classes. PhD thesis, Georgia Institute of Technology, Atlanta, Georgia, USA, March 1988.
[Mulzer04]
Wolfgang Mulzer. Minimum dilation triangulations for the regular n-gon. Master thesis, Freie Universität Berlin, October 2004.
[Munro96]
J. Ian Munro. Tables. In 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 1180 of Lecture Notes in Computer Science, pages 37–42. Springer-Verlag, December 1996.
[MV00]
Jiří Matoušek and Jan Vondrák. The probabilistic method, 2000.
[MV08]
Jiří Matoušek and Jan Vondrák. The probabilistic method, March 2008.
[MV24]
Sam Mattheus and Jacques Verstraëte. The asymptotics of r(4,t). Technical Report 2306.04007v5 [math.CO], arXiv, February 2024.
[MVPR96]
M.S. Madanlal, G. Venkatesan, and C. Pandu Rangan. Tree 3-spanners on interval, permutation and regular bipartite graphs. Information Processing Letters, 59(2):97–102, July 1996.
[MW04]
Thomas Moscibroda and Roger Wattenhofer. Efficient computation of maximal independent sets in unstructred multi-hop radio networks. In IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, pages 51–59, October 2004.
[MW18]
J. Ian Munro and Kaiyu Wu. Succinct data structures for chordal graphs. In Wen-Lian Hsu, Der-Tsai Lee, and Chung-Shou Liao, editors, 29th Annual International Symposium on Algorithms and Computation (ISAAC), volume 123 of LIPIcs, pages 67:1–67:12. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2018.
[MW20]
Wolfgang Mulzer and Max Willert. Headerless routing in unit disk graphs. In 31st Annual International Symposium on Algorithms and Computation (ISAAC), volume 181 of LIPIcs, pages 16:1–16:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[MW86]
Clyde L. Monma and Victor K. Wei. Intersection graphs of paths in a tree. Journal of Combinatorial Theory, Series B, 41(2):141–181, October 1986.
[MWQLS10]
Yun Mao, Feng Wang, Lili Qiu, Simon Lam, and Jonathan Smith. S4: Small state and small stretch compact routing protocol for large static wireless networks. IEEE/ACM Transactions on Networking, pages 1–14, April 2010.
[MZ02]
Jiří Matoušek and Günter M. Ziegler. Topological lower bounds for the chromatic number: A hierarchy, 2002.
[MZ22]
Claire Mathieu and Hang Zhou. A tight (1.5+ε)-approximation for unsplittable capacitated vehicle routing on trees. Technical Report 2202.05691v2 [cs.DS], arXiv, November 2022.
[MZZ25]
Hendrik Molter, Meirav Zehavi, and Amit Zivan. Treewidth parameterized by feedback vertex number. In Keren Censor-Hillel, Fabrizio Grandoni, Joël Ouaknine, and Gabriele Puppis, editors, 52nd International Colloquium on Automata, Languages, and Programming (ICALP), volume 334 of LIPIcs, pages 120:1–120:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2025.
[Nachmias20]
Asaf Nachmias. Planar maps, random walks and circle packing, volume 2243 of Lecture Notes in Mathematics. Springer, Cham, 2020.
[Nachmias20a]
Asaf Nachmias. The circle packing theorem. In Planar Maps, Random Walks and Circle Packing, volume 2243 of Lecture Notes in Mathematics, chapter 3, pages 33–46. Springer, Cham, 2020.
[Nanongkai14]
Danupon Nanongkai. Brief announcement: almost-tight approximation distributed algorithm for minimum cut. In 33rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 382–384. ACM Press, July 2014.
[Naor90]
Moni Naor. Succinct representation of general unlabeled graphs. Discrete Applied Mathematics, 28(3):303–307, September 1990.
[Naor91]
Moni Naor. A lower bound on probabilistic algorithms for distributive ring coloring. SIAM Journal on Discrete Mathematics, 4(3):409–412, 1991.
[Narayana59]
T.V. Narayana. A partial order and its application to probability. Sankhyā, The Indian Journal of Statistics, 21:91–98, 1959.
[NashWilliams61]
Crispin St. John Alvah Nash-Williams. Edge-disjoint spanning trees of finite graphs. Journal of the London Mathematical Society, 36(1):445–450, 1961.
[NashWilliams64]
Crispin St. John Alvah Nash-Williams. Decomposition of finite graphs into forests. Journal of the London Mathematical Society, 39(1):12, 1964.
[NC88]
Takao Nishizeki and Norishige Chiba. Planar graphs: Theory and algorithms. North-Holland Mathematics Studies 140 / Annals of Discrete Mathematics 32. Elsevier Science Ltd, 1988.
[NDG02]
Hung Quang Ngo, Ding-Zhu Du, and Ronald Lewis Graham. New bounds on a hypercube coloring problem. Information Processing Letters, 84(5):265–269, December 2002.
[Neciporuk66]
è. I. Nečiporuk. On a boolean function. Doklady Akad. Nauk SSSR, 169(4):765–766, 1966.
[Nederlof25]
Jesper Nederlof. Weighted k-path and other problems in almost o*(2k) deterministic time via dynamic representative sets. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 2816–2827. IEEE Computer Society Press, December 2025.
[Negami01]
Seiya Negami. Crossing numbers of graph embedding pairs on closed surfaces. Journal of Graph Theory, 36(1):8–23, April 2001.
[Nehez02]
Martin Nehéz. The compactness lower bound of shortest-path interval routing on n × n tori with random faulty links. Technical Report 582, KAM-DIMATIA Series, Charles University, Praha, 2002.
[Nekrich21]
Yakov Nekrich. New data structures for orthogonal range reporting and range minima queries. In 32nd Symposium on Discrete Algorithms (SODA), pages 1191–1205. ACM-SIAM, January 2021.
[Neuman64]
František Neuman. On a certain ordering of the vertices of a tree. Časopis pro pěstování matematiky, 89(3):323–339, 1964.
[Newman01]
M.E.J. Newman. The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences of the USA (PNAS), 98(2):404–409, January 2004.
[Niedermeier06]
Rolf Niedermeier. Invitation to fixed-parameter algorithms, volume 31 of Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, 2006.
[Nielsen00]
Frank Nielsen. Fast stabbing of boxes in high dimensions. Theoretical Computer Science, 246(1-2):53–72, September 2000.
[Nielsen99]
M.A. Nielsen. Conditions for a class of entanglement transformations. Physical Review Letters, 83(2):436–439, July 1999.
[Nisan90]
Noam Nisan. Pseudorandom generators for space-bounded computations. In 22nd Annual ACM Symposium on Theory of Computing (STOC), pages 204–212. ACM Press, May 1990.
[Nisan92]
Noam Nisan. RL \subseteq SC. In 24th Annual ACM Symposium on Theory of Computing (STOC), pages 619–623. ACM Press, 1992.
[Nisan92a]
Noam Nisan. Pseudorandom generators for space-bounded computation. Combinatorica, 12(4):449–461, December 1992.
[Nisan94]
Noam Nisan. RL \subseteq SC. Computational Complexity, 4(1):1–11, 1994.
[Nisse14]
Nicolas Nisse. Algorithmic complexity between structure and knowledge: How pursuit-evasion games help, May 2014. Thèse d'habilitation à diriger les recherches, Université de Nice Sophia-Antipolis.
[Nivasch10]
Gabriel Nivasch. Improved bounds and new techniques for Davenport-Schinzel sequences and their generalizations. Journal of the ACM, 57(3):Article No. 17, pp. 1–44, March 2010.
[NLRC91]
Victor Neumann-Lara and Eduardo Rivera-Campo. Spanning trees with bounded degrees. Combinatorica, 11(1):55–61, March 1991.
[NM05]
Van Nguyen and Chip Martel. Analyzing and characterizing small-world graphs. In 16th Symposium on Discrete Algorithms (SODA), pages 311–320. ACM-SIAM, January 2005.
[NM07]
Gonzalo Navarro and Veli Mäkinen. Compressed full-text indexes. ACM Computing Surveys, 39(1):A2, 2007.
[NM24]
Juan Carlos Nuñno and Muñoz Francisco. The ruler sequence revisited: A dynamic perspective. Mathematics, 12(5):742, 2024.
[NN13]
Gonzalo Navarro and Yakov Nekrich. Optimal dynamic sequence representations. In 24th Symposium on Discrete Algorithms (SODA), pages 865–876. ACM-SIAM, January 2013.
[NN14]
M. Zh. Nikoghosyan and Zh. G. Nikoghosyan. A common generalization of Dirac's two theorems. Technical Report 1404.0496v1 [math.CO], arXiv, April 2014.
[NN96]
Lata Narayanan and Naomi Nishimura. Interval routing on k-trees. In Nicola Santoro and Paul G. Spirakis, editors, 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 104–118. Carleton University Press, June 1996.
[NN98]
Lata Narayanan and Naomi Nishimura. Interval routing on k-trees. Journal of Algorithms, 26(2):325–369, February 1998.
[NO05]
Martin Nehéz and Daniel Olejár. An improved interval routing scheme for almost all networks based on dominating cliques. In 16th Annual International Symposium on Algorithms and Computation (ISAAC), volume 3827 of Lecture Notes in Computer Science, pages 524–532. Springer, December 2005.
[NO97]
Lata Narayanan and Jaroslav Opatrny. Compact routing on chordal rings of degree four. In Danny Krizanc and Peter Widmayer, editors, 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 125–137. Carleton Scientific, July 1997.
[NOdM05a]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion I. Decompositions. Technical Report 739, KAM-DIMATIA Series, Charles University, Praha, 2005.
[NOdM06]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Linear time low tree-width partitions and algorithmic consequences. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 391–400. ACM Press, May 2006.
[NOdM08a]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion I. Decompositions. European Journal of Combinatorics, 29(3):760–776, April 2008.
[NOdM08b]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion II. Algorithmic aspects. European Journal of Combinatorics, 29(3):777–791, April 2008.
[NOdM08c]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. European Journal of Combinatorics, 29(4):1012–1024, May 2008.
[NOdM16]
Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity, June 2016. Talk at Luchon.
[NOdMx20]
Jaroslav Nešetřil, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz. Linear rankwidth meets stability. In Shuchi Chawla, editor, 31st Symposium on Discrete Algorithms (SODA), pages 1180–1199. ACM-SIAM, January 2020.
[Norris97]
James R. Norris. Markov chains. Cambridge, 1997.
[NORS21]
Jaroslav Nešetřil, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz. Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. European Journal of Combinatorics, 91(103223), January 2021.
[notes:Gavoille-AAp]
Cyril Gavoille. Analyse d'algorithme -- Cours d'introduction à la complexité paramétrique et aux algorithmes d'approximation, 2025. Notes de cours.
[notes:Gavoille-AD]
Cyril Gavoille. Algorithmique distribuée, 2025. Notes de cours.
[notes:Gavoille-TAP]
Cyril Gavoille. Techniques algorithmiques et programmation, 2025. Notes de cours.
[NOW12]
Jaroslav Nešetřil, Patrice Ossona de Mendez, and David R. Wood. Characterisations and examples of graph classes with bounded expansion. European Journal of Combinatorics, 33(3):350–373, April 2012.
[Noy04]
Marc Noy. The asymptotic growth of the number of planar graphs. Personal communication, 2004.
[NP85]
Jaroslav Nešetřil and Svatopluk Poljak. On the complexity of subgraph problem. Commentationes Mathematicae Universatis Carolinae, 26(2):415–419, 1985.
[NPA07]
Miguel Navascués, Stefano Pironio, and Antonio Acín. Bounding the set of quantum correlations. Physical Review Letters, 98(010401), January 2007.
[NPA08]
Miguel Navascués, Stefano Pironio, and Antonio Acín. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. Technical Report 0803.4290v1 [quant-ph], arXiv, March 2008.
[NPSY00]
Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, and Moti Yung. Connectivity properties in random regular graphs with edge faults. International Journal of Foundations of Computer Science, 11(2):247–262, 2000.
[NPSY94]
Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, and Moti Yung. Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing. In 21st International Colloquium on Automata, Languages and Programming (ICALP), volume 820 of Lecture Notes in Computer Science, pages 508–515. Springer-Verlag, 1994.
[NR13]
Marc Noy and Lander Ramos. Random planar graphs with minimum degree two and three. In Jaroslav Nešetřil and Marco Pellegrini, editors, 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 16 of CRM, pages 251–258. Edizioni della Normale, September 2013.
[NR16]
John Forbes Jr. Nash and Michael Th. Rassias. Open problems in mathematics. Springer, 2016.
[NRR20]
Marc Noy, Clément Requilé, and Juanjo Rué. Further results on random cubic planar graphs. Random Structures and Algorithms, 56(3):892–924, May 2020.
[NRS09]
Nicolas Nisse, Ivan Rapaport, and Karol Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. In 16th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 5869 of Lecture Notes in Computer Science, pages 252–265. Springer, July 2009.
[NRS12]
Nicolas Nisse, Ivan Rapaport, and Karol Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. Theoretical Computer Science, 444:1–17, July 2012.
[NRT00]
Naomi Nishimura, Prabhakar Ragde, and Dimitrios M. Thilikos. Finding smallest supertrees under minor containment. International Journal of Foundations of Computer Science, 11(3):445–465, 2000.
[NRTW06]
Sergey Norin, Bruce Reed, Andrew Thomason, and David R. Wood. Proper minor-closed families are small. Journal of Combinatorial Theory, Series B, 96(5):754–757, September 2006. Short communication.
[NRTW20]
Sergey Norin, Bruce Reed, Andrew Thomason, and David R. Wood. A lower bound on the average degree forcing a minor. The Electronic Journal of Combinatorics, 27(2):#P2.4, 2008.
[NS06]
Vladimir Nikiforov and Richard H. Schelp. Cycle lengths in graphs with large minimum degree. Journal of Graph Theory, 52(2):157–170, 2006.
[NS07]
Giri Narasimhan and Michiel Smid. Geometric spanner networks. Cambridge University Press, 2007.
[NS95]
Sotiris E. Nikoletseas and Paul G. Spirakis. Expander properties in random regular graphs with edge faults. In Ernst W. Mayr and Claude Puech, editors, 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 900 of Lecture Notes in Computer Science, pages 421–432. Springer-Verlag, 1995.
[NS95a]
Moni Naor and Larry Stockmeyer. What can be computed locally. SIAM Journal on Computing, 24(6):1259–1277, December 1995.
[NS96]
Lata Narayanan and Sunil Shende. Characterizations of networks supporting shortest-path interval labeling schemes. In Nicola Santoro and Paul G. Spirakis, editors, 3rd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 73–87. Carleton University Press, June 1996.
[NSS23]
Tung Nguyen, Alex Scott, and Paul D. Seymour. Induced subgraphs density. VII. The five-vertex path, December 2023.
[NSS25]
Tung Nguyen, Alex Scott, and Paul D. Seymour. A counterexample to the coarse Menger conjecture. Journal of Combinatorial Theory, Series B, 173:68–82, July 2025.
[NUU07]
Shin-ichi Nakano, Ryuhei Uehara, and Takeaki Uno. A new approach to graph recognition and applications to distance-hereditary graphs. In 4th International Conference on Theory and Applications of Models of Computation (TAMC), volume 4484 of Lecture Notes in Computer Science, pages 115–127. Springer, July 2007.
[NV08]
Igor Nitto and Rossano Venturini. On compact representations of all-pairs-shortest-path-distance matrices. In 15th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 5029 of Lecture Notes in Computer Science, pages 166–177. Springer, 2008.
[NW83]
Richard Nowakowski and Peter Winkler. Vertex-to-vertex pursuit in a graph. Discrete Mathematics, 43(2-3):235–239, 1983.
[NYT00]
Toshiyuki Nakagaki, Hiroyasu Yamada, and Ágota Tóth. Maze-solving by an amoeboid organism. Nature, 407:470, September 2000.
[OdM24]
Patrice Ossona de Mendez. Introduction to structural complexity, May 2024. Slides de cours pour l'École Doctorale Math-Info de Bordeaux.
[OdM94]
Patrice Ossona de Mendez. Orientations bipolaires. PhD thesis, École des Hautes Études en Sciences Sociales, 1994.
[Oellermann11]
Ortrud R. Oellermann. Menger's Theorem, May 2011.
[Oh20]
Eunjin Oh. Shortest-path queries in geometric networks. In 31st Annual International Symposium on Algorithms and Computation (ISAAC), volume 181 of LIPIcs, pages 52:1–52:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, December 2020.
[Olariu89]
Stephan Olariu. Weak-bipolarizable graphs. Discrete Mathematics, 74(1-2):159–171, 1989.
[OliveiraSilva06]
Tomás Oliveira e Silva. Computing 𝜋(x): the combinatorial method. Revista do DETUA, 4(6):759–768, March 2006.
[OMM04]
Masaki Owari, Keiji Matsumoto, and Mio Murao. Entanglement convertibility for infinite-dimensional pure bipartite states. Physical Review A, 70(5):1–4, 2004.
[OO12]
Katsuhiro Ota and Kenta Ozeki. Spanning trees in 3-connected K3,t-minor-free graphs. Journal of Combinatorial Theory, Series B, 102(5):1179–1188, September 2012.
[OP06]
Krzysztof Onak and Paweł Parys. Generalization of binary search: Searching in trees and forest-like partial orders. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 379–388. IEEE Computer Society Press, October 2006.
[OpenAI26]
OpenAI. Planar point sets with many unit distances, May 2026.
[OpenAI26b]
OpenAI. A proof of the cycle double cover conjecture, July 2026.
[OPS25]
Patrice Ossona de Mendez, Michał Pilipczuk, and Sebastian Siebertz. Transducing paths in graph classes with unbounded shrubdepth. European Journal of Combinatorics, 123:103660, January 2025.
[OPT03]
Deryk Osthus, Hans Jürgen Prömel, and Anusch Taraz. On random planar graphs, the number of planar graphs and their triangulations. Journal of Combinatorial Theory, Series B, 88(1):119–134, May 2003.
[OR05]
Rafail Ostrovsky and Yuval Rabani. Low distortion embeddings for edit distance. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 218–224. ACM Press, May 2005.
[Orlin13]
James B. Orlin. Max flows in O(nm) time, or better. In 45th Annual ACM Symposium on Theory of Computing (STOC), pages 765–774. ACM Press, June 2013.
[ORourke09]
Joseph O'Rourke. Some properties of Yao Y4 subgraphs. Technical Report 0905.2249v1 [cs.CG], arXiv, May 2009.
[ORourke10]
Joseph O'Rourke. The Yao graph Y6 is a spanner. Technical Report 1003.3713v1 [cs.CG], arXiv, March 2010.
[ORourke87]
Joseph O'Rourke. Art gallery theorems and algorithms. Oxford University Press, 1987.
[OS06]
Sang-il Oum and Paul D. Seymour. Approximating clique-width and branch-width. Journal of Combinatorial Theory, Series B, 96(4):514–528, July 2006.
[OS11]
Yota Otachi and Ryohei Suda. Bandwidth and pathwidth of three-dimensional grids. Discrete Mathematics, 311(11-12):881–887, 2011.
[OS12]
Christian Ortolf and Christian Schindelhauer. Online multi-robot exploration of grid graphs with rectangular obstacles. In 24th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 27–36. ACM Press, June 2012.
[OS13]
Lale Özkahya and Brendon Stanton. On a covering problem in the hypercube. In Jaroslav Nešetřil and Marco Pellegrini, editors, 7th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), volume 16 of CRM, pages 595–598. Edizioni della Normale, September 2013.
[Osserman78]
Robert Osserman. The isoperimeter inequality. Bulletin of the American Mathematical Society, 84(6):1182–1238, November 1978.
[Otter48]
Richard Otter. The number of trees. Annals of Mathematics, 49(3):583–599, July 1948.
[Oum17]
Sang-il Oum. Rank-width: Algorithmic and structural results. Discrete Applied Mathematics, 231:15–24, November 2017.
[Oum26]
Sang-il Oum. A proof of the cycle double cover conjecture by openai: an exposition. Technical Report 2607.16356v2 [math.CO], arXiv, July 2024.
[Ouvrard21]
Paul Ouvrard. Reconfiguration problems in graphs. PhD thesis, Université Bordeaux, Talence, France, March 2021.
[Owen95]
Art Owen. Software in C for orthogonal arrays. Technical report, Department of Statistics, Stanford, California, USA, July 1995.
[OY11]
Kenta Ozeki and Tomoki Yamashita. Spanning trees: A survey. Graphs and Combinatorics, 27:1–26, 2011.
[Pace12]
Gordon J. Pace. Mathematics of discrete structures for computer science. Springer, 2012.
[Pach81]
János Pach. A problem of Ulam on planar graphs. European Journal of Combinatorics, 2(4):357–361, December 1981.
[Pagh01]
Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353–363, 2001.
[Panconesi99]
Alessandro Panconesi. Distributed algorithms notes (manuscript), 1999.
[Papadimitriou77]
Christos H. Papadimitriou. The Euclidean travelling salesman problem is NP-complete. Theoretical Computer Science, 4(3):237–244, June 1977.
[Parberry95]
Ian Parberry. A real-time algorithm for the (n2-1)-puzzle. Information Processing Letters, 56(1):23–28, October 1995.
[Parter15]
Merav Parter. Dual failure resilient BFS structure. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 482–490. ACM Press, July 2015.
[Patrascu07]
Mihai Pǎtrascu. Lower bounds for 2-dimensional range counting. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 40–46. ACM Press, June 2007.
[Patrascu08]
Mihai Pǎtrascu. Succincter. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 305–313. IEEE Computer Society Press, October 2008.
[Patrascu08a]
Mihai Pǎtrascu. (data) STUCTURES. In 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 434–443. IEEE Computer Society Press, October 2008.
[Patrascu10]
Mihai Pǎtrascu. Towards polynomial lower bounds for dynamic problems. In 42nd Annual ACM Symposium on Theory of Computing (STOC), pages 603–609. ACM Press, June 2010.
[Pavez23]
Matías Pavez-Signé. Spanning trees in the square of pseudorandom graphs. Technical Report 2307.00322v2 [math.CO], arXiv, November 2023.
[PB04]
Lucia Draque Penso and Valmir C. Barbosa. A distributed algorithm to find k-dominating sets. Discrete Applied Mathematics, 141(1-3):243–253, May 2004.
[PB89]
Loren K. Platzman and John J. Bartholdi III. Space-filling curves and the planar travelling salesman problem. Journal of the ACM, 36(4):719–737, October 1989.
[PC05]
Jun-Pie Pan and Gerard J. Chang. Isometric-path numbers of bloack graphs. Information Processing Letters, 93(2):99–102, January 2005.
[PCRRx17]
Rui Pereira, Marco Couto, Francisco Ribeiro, Rui Rua, Jácome Cunha, João Paulo Fernandes, and João Saraiva. Energy efficiency across programming languages: How do energy, time, and memory relate?In 10th ACM SIGPLAN International Conference on Software Language Engineering (SLE), pages 256–267. ACM Press, October 2017.
[PCZWZ08]
Jian-Wei Pan, Zeng-Bing Chen, Marek Żukowski, Harald Weinfurter, and Anton Zeilinger. Multi-photon entanglement and interferometry. Technical Report 0805.2853v1 [quant-ph], arXiv, May 2008.
[PD04]
Mihai Pǎtrascu and Erik D. Demaine. Lower bounds for dynamic connectivity. In 36th Annual ACM Symposium on Theory of Computing (STOC), pages 546–553. ACM Press, June 2004.
[PdOS23]
Lehilton Lelis Chaves Pedrosa and Lucas de Oliveira Silva. Freeze-tag is NP-hard in 3D with L1 distance. In 12th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), volume 223:C, pages 360–366. Procedia Computer Science, September 2023.
[PdOS25]
Lehiton Lelis Chaves Pedrosa and Lucas de Oliveira Silva. Freeze-tag is NP-hard in 2D with L1 distance. Technical Report 2509.14357v1 [cs.CG], arXiv, September 2025. Withdraw, June 2026.
[Peleg00]
David Peleg. Informative labeling schemes for graphs. In 25th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 1893 of Lecture Notes in Computer Science, pages 579–588. Springer, August 2000.
[Peleg00a]
David Peleg. Proximity-preserving labeling schemes. Journal of Graph Theory, 33(3):167–176, January 2000.
[Peleg00b]
David Peleg. Distributed computing: A locality-sensitive approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
[Peleg02]
David Peleg. Low stretch spanning trees. In 27th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 2420 of Lecture Notes in Computer Science, pages 68–80. Springer-Verlag, 2002.
[Peleg05]
David Peleg. Informative labeling schemes for graphs. Theoretical Computer Science, 340(3):577–593, August 2005.
[Peleg90]
David Peleg. Time-optimal leader election in general networks. Journal of Parallel and Distributed Computing, 8(1):96–99, January 1990.
[Peleg99]
David Peleg. Proximity-preserving labeling schemes and their applications. In Peter Widmayer, Gabriele Neyer, and Stephan Eidenbenz, editors, 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1665 of Lecture Notes in Computer Science, pages 30–41. Springer, June 1999.
[Pelsmajer04]
Michael J. Pelsmajer. Maximum induced linear forests in outerplanar graphs. Graphs and Combinatorics, 20(1):121–129, March 2004.
[Perifel13]
Sylvain Perifel. Complexité algorithmique. Ellipse, 2013.
[Perlman82]
Radia J. Perlman. Hierarchical networks and the subnetwork partition problem. In 5th Conference on System Sciences, 1982.
[Perlman85]
Radia J. Perlman. Hierarchical networks and the subnetwork partition problem. Computer Networks, 9(4):297–303, 1985.
[Pettie07]
Seth Pettie. Low distortion spanners. In 34th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 78–89. Springer, July 2007.
[Pettie08]
Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 253–262. ACM Press, August 2008.
[Pettie09]
Seth Pettie. Distributed algorithms for ultrasparse spanners and linear size skeletons. Distributed Computing, 22(3):147–166, 2009.
[Pettie13]
Seth Pettie. Sharp bounds on Davenport-Schinzel sequences of every order. In 29th Annual ACM Symposium on Computational Geometry (SoCG), pages 319–328. ACM, June 2013.
[Pettie99]
Seth Pettie. Finding minimum spanning trees in O(mα(m,n)). Technical Report TR-99-23, University of Texas, October 1999.
[Petz90]
Dénes Petz. A de Finetti-type theorem with m-dependent states. Probability Theory and Related Fields, 85(1):65–72, 1990.
[PFM74]
Michael S. Paterson, Michael J. Fischer, and Albert R. Meyer. An improved overlap argument for on-line multiplication. In Richard M. Karp, editor, Complexity of Computation, volume VII, pages 97–111. SIAM-AMS proceedings, American Mathematical Society, 1974.
[PG04]
Srinivasan Parthasarathy and Rajiv Gandhi. Distributed algorithms for coloring and domination in wireless ad hoc networks. In 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 3328 of Lecture Notes in Computer Science, pages 447–459. Springer-Verlag, December 2004.
[PHH13]
Seth Pettie and Hsin-Hao Su. Fast distributed coloring algorithms for triangle-free graphs. In 40th International Colloquium on Automata, Languages and Programming (ICALP), volume 7966 of Lecture Notes in Computer Science, pages 681–693. Springer, July 2013.
[Picavet26]
Timothé Picavet. Algorithmes distribués et structures locales dans les graphes. PhD thesis, Université Bordeaux, Talence, France, June 2026.
[Pitois24]
Francois Pitois. Recherche de régularités et représentations succinctes de graphes. PhD thesis, Université Franche-Comté, July 2024.
[PKK19]
Niranjan P.K. and Srinivasa Rao Kola. The k-distance chromatic number of trees and cycles. AKCE International Journal of Graphs and Combinatorics, 16(2):230–235, 2019.
[Planche18]
Léo Planche. Décomposition de graphes en plus courts chemins et en cycles de faible excentricité. PhD thesis, Université Sorbonne-Paris-Cité, November 2018.
[Plotkin89]
Serge A. Plotkin. Sticky bits and universality of consensus. In 8th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 159–175. ACM Press, 1989.
[Plotnikov00]
Anatoly D. Plotnikov. An efficient algorithm for the minimum clique partition problem, 2000.
[Plummer68]
Michael D. Plummer. On minimal blocks. Transactions of the American Mathematical Society, 134(1):85–94, 1968.
[PMDE11]
Fatemeh Panahi, Ali Mohades, Mansoor Davoodi, and Marziyeh Eskandari. Weak matching points with triangles. In 23rd Canadian Conference on Computational Geometry (CCCG), August 2011.
[PMH08]
Ketan N. Patel, Igor L. Markov, and John P. Hayes. Optimal synthesis of linear reversible circuits. Quantum Information and Computation, 8(3):282–294, March 2008.
[Postle19]
Luke Postle. Linear-time and efficient distributed algorithms for list coloring graphs on surfaces. In 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 929–941. IEEE Computer Society Press, November 2019.
[Postle19a]
Luke Postle. Linear-time and efficient distributed algorithms for list coloring graphs on surfaces. Technical Report 1904.03723v2 [math.CO], arXiv, November 2019.
[Poulalhon02]
Dominique Poulalhon. Problèmes énumératifs autour des cartes combinatoires et des factorisations dans le groupe symétrique. PhD thesis, Ecole Polytechnique, LIX, December 2002.
[PP07]
Sriram V. Pemmaraju and Imran A. Pirwani. Good quality virtual realization of unit ball graphs. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 311–322. Springer, October 2007.
[PP13]
Merav Parter and David Peleg. Sparse fault-tolerant BFS trees. In Hans L. Bodlaender and Giuseppe F. Italiano, editors, 21st Annual European Symposium on Algorithms (ESA), volume 8125 of Lecture Notes in Computer Science (ARCoSS), pages 779–790. Springer, September 2013.
[PP14]
Merav Parter and David Peleg. Fault tolerant approximate BFS structures. In 25th Symposium on Discrete Algorithms (SODA), pages 1073–1092. ACM-SIAM, January 2014.
[PP22]
Jinyoung Park and Tuan Pham. A proof of the Kahn-Kalai conjecture. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 636–639. IEEE Computer Society Press, October 2022.
[PP23]
Jinyoung Park and Tuan Pham. A proof of the Kahn-Kalai conjecture. Technical Report 2203.17207v2 [math.CO], arXiv, April 2023.
[PP24]
Christophe Paul and Evangelos Protopapas. Tree-layout based graph classes: Proper chordal graphs. In Olaf Beyersdorff, Mamadou Moustapha Kanté, Orna Kupferman, and Daniel Lokshtanov, editors, 41st Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 289 of LIPIcs, pages 55:1–55:18. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2024.
[PPKSx09]
Marcin Pawłowski, Tomasz Paterek, Dagomir Kaszlikowski, Valerio Scarani, and Andreas Winter. Information causality as a physical principle. Nature, 461:1101–1104, 2009.
[PPS16]
Merav Parter, David Peleg, and Shay Solomon. Local-on-average distributed tasks. In 27th Symposium on Discrete Algorithms (SODA), pages 220–239. ACM-SIAM, January 2016.
[PPT23]
Christophe Paul, Evangelos Protopapas, and Dimitrios M. Thilikos. Universal obstructions of graph parameters. Technical Report 2304.14121v1 [cs.DM], arXiv, April 2023.
[PQ82]
Jean-Claude Picard and Maurice Queyranne. A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory. Networks, 12(2):141–160, 1982.
[PR00]
David Peleg and Vitaly Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM Journal on Computing, 30(5):1427–1442, 2000.
[PR00a]
Ljubomir Perković and Bruce A. Reed. An improved algorithm for finding tree decompositions of small width. International Journal of Foundations of Computer Science, 11(3):365–371, 2000.
[PR02]
Seth Pettie and Vijaya Ramachandran. An optimal minimum spanning tree algorithm. Journal of the ACM, 49(1):16–34, January 2002.
[PR06]
Enoch Peserico and Larry Rudolph. Efficient routing on trees and polynomial growth graphs of arbitrary size with constant bits per node, 2006.
[PR09]
Igor Pak and Radoš Radoičić. Hamiltonian paths in Cayley graphs. Discrete Mathematics, 309(17):5501–5508, September 2009.
[PR10]
David Peleg and Liam Roditty. Relaxed spanners for directed disk graphs. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 5 of LIPIcs, pages 609–620. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, March 2010.
[PR10a]
Mihai Pǎtrascu and Liam Roditty. Distance oracles beyond the Thorup-Zwick bound. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 815–823. IEEE Computer Society Press, October 2010.
[PR11]
Ely Porat and Liam Roditty. Preprocess, set, query!In 19th Annual European Symposium on Algorithms (ESA), volume 6942 of Lecture Notes in Computer Science, pages 603–614. Springer, September 2011.
[PR20]
Michał Przykucki and Alexander Roberts. Vertex-isoperimetric stability in the hypercube. Journal of Combinatorial Theory, Series A, 172:105186, May 2021.
[PR21]
Vern I. Paulsen and Mizanur Rahaman. Bisynchronous games and factorizable maps. Annales Henri Poincaré, 22:593–614, January 2021.
[PR22]
Johannes Pardey and Dieter Rautenbach. Almost balanced perfect matchings in balanced edge-colored complete graphs. In 11th International Colloquium on Graph Theory (ICGT), page Paper No. 37, July 2022.
[Pratt75]
Vaughan R. Pratt. Every prime has a succinct certificate. SIAM Journal on Computing, 4(3):1295–1309, September 1975.
[Prisner97]
Erich Prisner. Distance approximating spanning trees. In 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1200 of Lecture Notes in Computer Science, pages 499–510. Springer, 1997.
[Pritchard06]
David Pritchard. An optimal distributed edge-biconnectivity algorithm. Technical Report 0602013v1 [cs.DC], arXiv, February 2006.
[Pro81]
Andrzej Proskurowski. Minimum broadcast trees. IEEE Transactions on Computers, C-30(5):363–366, May 1981.
[Probst18]
Maximilian Probst Gutenberg. On the complexity of the (approximate) nearest colored node problem. In 26th Annual European Symposium on Algorithms (ESA), volume 112 of LIPIcs, pages 68:1–68:14. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, August 2018.
[Propp93]
James Propp. Lattice structure for orientations of graphs. Technical Report 0209005v1 [math.CO] (2002), arXiv, October 1993.
[PRR03]
Michal Parnas, Dana Ron, and Ronitt Rubinfeld. Testing membership in parenthesis languages. Random Structures and Algorithms, 22(1):98–138, January 2003.
[PRR97]
C. Greg Plaxton, Rajmohan Rajaraman, and Andréa Werneck Richa. Accessing nearby copies of replicated objects in a distributed environment. In 9th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 311–320. ACM Press, June 1997.
[PRS09]
Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar. Solving dominating set in larger class of graphs: FPT algorithms and polynomial kernels. In 17th Annual European Symposium on Algorithms (ESA), volume 5757 of Lecture Notes in Computer Science, pages 694–705. Springer, September 2009.
[PRS12]
Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar. Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Transactions on Algorithms, 9(1):Article No. 11, pp. 1–23, December 2012.
[PRS94]
Serge A. Plotkin, Satish B. Rao, and Warren D. Smith. Shallow excluded minors and improved graph decomposition. In 5th Symposium on Discrete Algorithms (SODA), pages 462–470. ACM-SIAM, 1994.
[PRSW16]
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen. Near optimal adjacency labeling schemes for power-law graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP), volume 55 of LIPIcs, pages 133:1–133:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2016.
[PS03]
Dominique Poulalhon and Gilles Schaeffer. Optimal coding and sampling of triangulations. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 1080–1094. Springer, July 2003.
[PS06]
Dominique Poulalhon and Gilles Schaeffer. Optimal coding and sampling of triangulations. Algorithmica, 46(3-4):505–527, November 2006.
[PS09]
Konstantinos Panagiotou and Angelika Steger. Maximal biconnected subgraphs of random planar graphs. In 20th Symposium on Discrete Algorithms (SODA), pages 432–440. ACM-SIAM, January 2009.
[PS19]
Michał Pilipczuk and Sebastian Siebertz. Polynomial bounds for centered colorings on proper minor-closed graph classes. In 30th Symposium on Discrete Algorithms (SODA), pages 1501–1520. ACM Press, January 2019.
[PS78]
Yehoshua Perl and Yossi Shiloach. Finding two disjoint paths between two pairs of vertices in a graph. Journal of the ACM, 25(1):1–9, 1978.
[PS79]
Edgar M. Palmer and Allen J. Schwenk. On the number of trees in a random forest. Journal of Combinatorial Theory, Series B, 27(2):109–121, October 1979.
[PS87]
Azaria Paz and Claus-Peter Schnorr. Approximating integer lattices by lattices with cyclic factor group. In 14th International Colloquium on Automata, Languages and Programming (ICALP), volume 267 of Lecture Notes in Computer Science, pages 386–393. Springer-Verlag, 1987.
[PS89]
David Peleg and Alejandro A. Schäffer. Graph spanners. Journal of Graph Theory, 13(1):99–116, 1989.
[PS89a]
David Peleg and Alejandro A. Schäffer. Time bounds on fault-tolerant broadcasting. Networks, 19(7):803–822, December 1989.
[PS92]
Alessandro Panconesi and Aravind Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In 24th Annual ACM Symposium on Theory of Computing (STOC), pages 581–592. ACM Press, 1992.
[PS95]
Alessandro Panconesi and Aravind Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. Combinatorica, 15(2):255–280, June 1995.
[PS96]
Alessandro Panconesi and Aravind Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):356–374, March 1996.
[PS96a]
Hans Jürgen Prömel and Angelika Steger. Note: Counting h-free graphs. Discrete Mathematics, 154:311–315, 1996.
[PS97]
Andreas Parra and Petra Scheffler. Characterizations and algorithmic applications of chordal graphs embeddings. Discrete Applied Mathematics, 79(1-3):171–188, November 1997.
[PSK03]
Sudebkumar Prasant Pal, Sudhir Kumar Singh, and Somesh Kumar. Multi-partite quantum entanglement versus randomization: Fair and unbiased leader election in networks. Technical Report 0306195v1 [quant-ph], arXiv, June 2003.
[PSS01]
Hans Jürgen Prömel, Thomas Schickinger, and Angelika Steger. On the structure of clique-free graphs. Discrete Mathematics, 19(1):37–53, 2001.
[PSS92]
János Pach, William Steiger, and Endre Szemerédi. An upper bound on the number of planar K-sets. Discrete & Computational Geometry, 7(2):109–123, February 1992. Appears also in FOCS '89.
[PSW10]
Britta Peis, Martin Skutella, and Andreas Wiese. Packet routing on the grid. In 10th Latin American Symposium on Theoretical Informatics (LATIN), volume 6034 of Lecture Notes in Computer Science, pages 120–130, April 2010.
[PT01]
David Peleg and D. Tendler. Low stretch spanning trees for planar graphs. Technical Report MCS01-14, The Weizmann Institute of Science, April 2001.
[PT05]
János Pach and Gábor Tardos. Forbidden patterns and unit distances. In 21st Annual ACM Symposium on Computational Geometry (SoCG), pages 1–9. ACM, June 2005.
[PT06]
Mihai Pǎtrascu and Mikkel Thorup. Time-space trade-offs for predecessor search. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 232–240. ACM Press, May 2006.
[PT07]
Mihai Pǎtrascu and Mikkel Thorup. Randomization does not help searching predecessors. In 18th Symposium on Discrete Algorithms (SODA), pages 555–564. ACM-SIAM, January 2007.
[PT07a]
Mihai Pǎtrascu and Mikkel Thorup. Planning for fast connectivity updates. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 263–271. IEEE Computer Society Press, October 2007.
[PT09]
Mihai Pǎtrascu and Mikkel Thorup. Higher lower bounds for near-neighbor and further rich problems. SIAM Journal on Computing, 39(2):730–741, 2009.
[PT11]
Mihai Pǎtrascu and Mikkel Thorup. Don't rush into a union: Take time to find your roots. In 43rd Annual ACM Symposium on Theory of Computing (STOC), pages 559–568. ACM Press, June 2011.
[PT13]
Mihai Pǎtrascu and Mikkel Thorup. Twisted tabulation hashing. In 24th Symposium on Discrete Algorithms (SODA), pages 209–228. ACM-SIAM, January 2013.
[PT23]
Pegah Pournajafi and Nicolas Trotignon. Burling graphs revisited, part I: New characterizations. Technical Report 2104.07001v3 [math.CO], arXiv, September 2023.
[PT93]
László Pyber and Zsolt Tuza. Menger-type theorems with restrictions on path lengths. Discrete Mathematics, 120(1-3):161–174, September 1993.
[PT97]
János Pach and Géza Tóth. Graphs drawn with few crossings per edge. Combinatorica, 17(3):427–439, September 1997.
[PTW10]
Rina Panigrahy, Kunal Talwar, and Udi Wieder. Lower bounds for near neighbor search via metric expansion. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 805–814. IEEE Computer Society Press, October 2010.
[PU87]
David Peleg and Eli Upfal. Efficient message passing using succinct routing tables. Technical Report RJ 5768, IBM Research Division, Almaden, August 1987.
[PU87a]
David Peleg and Eli Upfal. The generalized packet routing problem. Theoretical Computer Science, 53(2-3):281–293, 1987.
[PU87b]
David Peleg and Jeffrey D. Ullman. An optimal synchronizer for the hypercube. In 6th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 77–85. ACM Press, August 1987.
[PU88]
David Peleg and Eli Upfal. A tradeoff between space and efficiency for routing tables. In 20th Annual ACM Symposium on Theory of Computing (STOC), pages 43–52. ACM Press, May 1988.
[PU89]
David Peleg and Eli Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510–530, July 1989.
[PU89a]
David Peleg and Eli Upfal. The token distribution problem. SIAM Journal on Computing, 18(2):229–243, April 1989.
[PU89b]
David Peleg and Jeffrey D. Ullman. An optimal synchronizer for the hypercube. SIAM Journal on Computing, 18(4):740–747, 1989.
[PU90]
David Peleg and Eli Upfal. A time-randomness trade-off for oblivious routing. SIAM Journal on Computing, 19(2):256–266, April 1990.
[PV10]
Mihai Pǎtrascu and Emanuele Viola. Cell-probe lower bounds for succinct partial sums. In 21st Symposium on Discrete Algorithms (SODA), pages 117–122. ACM-SIAM, October 2010.
[PV81]
Franco P. Preparata and Jean Vuillemin. The cube-connected cycles: a versatile network for parallel computation. Communications of the ACM, 24(5):300–309, May 1981.
[PvG87]
David Peleg and Allen van Gelder. Packet distributed on a ring. Journal of Parallel and Distributed Computing, 6(3):558–567, May 1989.
[PW20]
Pál András Papp and Roger Wattenhofer. On the hardness of red-blue pebble games. Technical Report 2005.08609v1 [cs.CC], arXiv, May 2020.
[PW22]
Robert D. Poodiack and William E. Wood. Squigonometry: The study of imperfect circles. Undergraduate Mathematics Series. Springer, 2022.
[PY91]
Christos H. Papadimitriou and Mihalis Yannakakis. Shortest paths without a map. Theoretical Computer Science, 84(1):127–150, July 1991.
[PZ04]
Florian Pfender and Günter M. Ziegler. Kissing numbers, sphere packings, and some unexpected proofs. Notices of the American Mathematical Society, 51(8):873–883, September 2004.
[QXZL26]
Wentao Qi, Yongzhen Xu, Shenggen Zheng, and Lvzhou Li. Quantum algorithm for secret learning in Mastermind game. Science China Physics, Mechanics & Astronomy, 69(1):210311, 2026.
[RAB22]
Fatemeh Rajabi-Alni and Alireza Bagheri. Approximation algorithms for the freeze tag problem inside polygons. Technical report, Research Square, August 2022.
[Racke06]
Harald Räcke. Lectures on metric embeddings, 2006.
[Rado64]
Richard Rado. Universal graphs and universal functions. Acta Mathematica, 9(1):331–340, 1964.
[Radziszowski21]
Stanisław Radziszowski. Small Ramsey numbers. The Electronic Journal of Combinatorics, Dynamic Survey(#DS1), January 2021.
[Ramsey30]
Frank Plumpton Ramsey. On a problem of formal logic. Proceedings of the London Mathematical Society, 30(1):264–286, 1935.
[Rao92]
Satish B. Rao. Faster algorithms for finding small edge cuts in planar graphs. In 24th Annual ACM Symposium on Theory of Computing (STOC), pages 229–240. ACM Press, 1992.
[Rao99]
Satish B. Rao. Small distorbtion and volume preserving embeddings for planar and Euclidian metrics. In 15th Annual ACM Symposium on Computational Geometry (SoCG), pages 300–306. ACM, 1999.
[rapp:Gav18]
Christian Barillot, Inbar Fijalkow, Isabelle Queinnec, Fabrice Théoleyre, Hélène Touzet, Michel Beaudouin-Lafon, Marie-Paule Cani, Francois Chaumette, Gérald Conreur, Véronique Cortier, Cyril Gavoille, Guy Gogniat, Julien Gossa, Andreas Herzig, Jean Krivine, Philippe Lamarre, Francoise Lamnabhi, Anne-Catherine Letournel, Lionel Seinturier, Isabelle Tellier, Serge Torres, Charlotte Truchet, Alexandros Tsoukias, and Michel Verleysen. Rapport de prospective du conseil scientifique de l'institut des sciences de l'information et leurs interactions (INS2I). Technical Report hal-01956087, HAL, December 2018.
[rapp:GGHIM11]
Cyril Gavoille, Christian Glacet, Nicolas Hanusse, David Ilcinkas, and Frédéric Majorczyk. Simulations de routage du schéma AGMaNT. Rapport de contrat (final) DCR - Alcaltel-Lucent Bell, LaBRI, Université Bordeaux, February 2011.
[Ratel19]
Sébastien Ratel. Densiteé, VC-dimension et étiquetages de graphes. PhD thesis, Université d'Aix-Marseille, France, November 2019.
[Ravi94]
R. Ravi. Rapid rumor ramification: approximating the minimum broadcast time. In 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 202–213. IEEE Computer Society Press, November 1994.
[Raynal13]
Michel Raynal. Distributed algorithms for message-passing systems. Springer, 2013.
[Raynal18]
Michel Raynal. Fault-tolerant message-passing distributed systems: An algorithmic approach. Springer, 2018.
[Raynal85]
Michel Raynal. Algorithmes distribués et protocoles. Eyrolles, 1985.
[Razenshteyn12]
Ilya Razenshteyn. On ε-nets, distance oracles, and metric embeddings, June 2012. Sumitted and rejected to ISAAC'12.
[RB00]
Robert Raussendorf and Hans J. Briegel. Quantum computing via measurements only. Technical Report 0010033v1 [quant-ph], arXiv, October 2000.
[RBB03]
Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel. Quantum computing via measurements only. Physical Review A, 68(2):022312, August 2003.
[RC81]
John P. Robinson and Martin Cohn. Counting sequences. IEEE Transactions on Computers, C-30(1):17–23, January 1981.
[Read60]
Ronald C. Read. The enumeration of locally restricted graphs (II). Journal of the London Mathematical Society, s1-35(3):344–351, July 1960.
[Rechenmann14]
Francois Rechenmann. Le premier article scientifique de l'histoire de l'informatique ?, March 2014.
[Recuero17]
Pedro M. Recuero. Toward an enumeration of unlabeled trees. Technical Report 1703.06113v1 [cs.DS], arXiv, March 2017.
[Reed03]
Bruce A. Reed. Algorithmic aspects of tree width, pages 85–107. Springer, 2003.
[Reed92]
Bruce A. Reed. Finding approximate separators and computing treewidth quickly. In 24th Annual ACM Symposium on Theory of Computing (STOC), pages 221–228. ACM Press, 1992.
[Reed95]
Bruce A. Reed. Rooted routing in the plane. Discrete Applied Mathematics, 57(2-3):213–227, February 1995.
[Reed97]
Bruce A. Reed. Tree width and tangles: A new connectivity measure and some applications. In R. Bailey, editor, Surveys in Combinatorics, volume 241 of London Mathematical Society Lecture Note Series, pages 87–162. Cambridge University Press, July 1985.
[REGH22]
Václav Rozhon, Michael Elkin, Christoph Grunau, and Bernhard Haeupler. Deterministic low-diameter decompositions for weighted graphs and distributed and parallel applications. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1114–1121. IEEE Computer Society Press, October 2022.
[Reingold05]
Omer Reingold. Undirected ST-connectivity in log-space. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 376–385. ACM Press, May 2005.
[Reingold08]
Omer Reingold. Undirected connectivity in log-space. Journal of the ACM, 55(4):Article No. 17, pp. 1–24, September 2008.
[Reyes09]
Patricio A. Reyes. Collecte d'information dans les réseaux radio. PhD thesis, Université de Nice Sophia-Antipolis, France, August 2009.
[RF09]
Rebecca Robinson and Graham Farr. Structure and recognition of graphs with no 6-wheel subdivision. Algorithmica, 55(4):703–728, December 2009.
[RF09a]
Rebecca Robinson and Graham Farr. Graphs with no 7-wheel subdivision. Technical Report TR-2009-239, Clayton School of Information Technology, Monash University, Victoria, Australia, April 2009.
[RG20]
Václav Rozhon and Mohsen Ghaffari. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 350–363. ACM Press, June 2020.
[RGHCB11]
Gábor Rétvári, András Gulvás, Zalán Heszberger, Márton Csernai, and József J. Bíró. Compact policy routing. In 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 129–138. ACM Press, June 2011.
[RGMPx21]
Gal Raayoni, Shahar Gottlieb, Yahel Manor, George Pisha, Yoav Harris, Uri Mendlovic, Doron Haviv, Yaron Hadad, and Ido Kaminer. Generating conjectures on fundamental constants with the Ramanujan Machine. Nature, 590:67–73, February 2021.
[Richter08]
Wolf-Dieter Richter. On the 𝜋-function for nonconvex l2,p-circle discs. Lithuanian Mathematical Journal, 48(3):332–338, 2008.
[Richter08a]
Wolf-Dieter Richter. On l2,p-circle numbers. Lithuanian Mathematical Journal, 48(2):228–234, 2008.
[Richter11]
Wolf-Dieter Richter. Circle numbers for star discs. International Scholarly Research Notices, 2011(Article ID 479262), 2011.
[Rival85]
Ivan Rival. Graphs and order, volume 147 of NATO ASI Series C: Mathematical and Physical Sciences. Springer, 1985.
[Rivier97]
Nicolas Rivier. Statistical thermodynamics of foam. In Jean-Francois Sadoc and Nicolas Rivier, editors, Foams and Emulsions, volume 354 of NATO ASI Series (Series E: Applied Sciences), pages 105–126. Springer, May 1997.
[RL08]
Bruce A. Reed and Zhentao Li. Optimization and recognition for k5-minor free graphs in linear time. In 8th Latin American Symposium on Theoretical Informatics (LATIN), volume 4957 of Lecture Notes in Computer Science, pages 206–215, April 2008.
[RLB13]
Ronald Lewis Graham, Jaroslav Nešetřil, and Steve Butler. The mathematics of paul erdős II. Springer, 2013.
[RLDL94]
Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, and S. Lakshmivarahan. Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs. Information Processing Letters, 49(1):45–50, January 1994.
[RNN98]
Md. Saidur Rahman, Shin-ichi Nakano, and Takao Nishizeki. Rectangular grid drawings of plane graphs. Computational Geometry: Theory and Applications, 10(3):203–220, June 1998.
[Roberts69]
Fred S. Roberts. Indifference graphs. In Frank Harary, editor, Proof Techniques in Graph Theory, pages 139–146. Academic Press, 1969.
[Robinson21]
Peter Robinson. Being fast means being chatty: The local information cost of graph spanners. In 32nd Symposium on Discrete Algorithms (SODA), pages 2105–2120. ACM-SIAM, January 2021.
[Robinson49]
Julia B. Robinson. On the Hamiltonian game (a traveling-salesman problem). Technical Report RM-303, Research Memorandum -- Project RAND -- U.S. Air Force, Santa Monica, California, USA, December 1949.
[Roditty07]
Liam Roditty. On the k-simple shortest paths problem in weighted directed graphs. In 18th Symposium on Discrete Algorithms (SODA), pages 920–928. ACM-SIAM, January 2007.
[Roditty13]
Liam Roditty. Decremental maintenance of strongly connected components. In 24th Symposium on Discrete Algorithms (SODA), pages 1143–1150. ACM-SIAM, January 2013.
[Rodl81]
Vojtěch Rödl. A note on universal graphs. Ars Combinatoria, 11:225–229, 1981.
[Rodl85]
Vojtěch Rödl. On a packing and covering problem. European Journal of Combinatorics, 6(1):69–78, March 1985.
[Rohde10]
Steffen Rohde. Oded Schramm: From circle packing to SLE. Technical Report 1007.2007v1 [math.CV], arXiv, July 2010.
[Rosenbaum13]
David Rosenbaum. Breaking the nlogn barrier for solvable-group isomorphism. In 24th Symposium on Discrete Algorithms (SODA), pages 1054–1073. ACM-SIAM, January 2013.
[Rossignac99]
Jarek Rossignac. Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics, 5(1):47–61, 1999.
[Rotbart14]
Noy Rotbart. A survey on labeling schemes for trees, September 2014. In preparation.
[Rotbart16]
Noy Rotbart. New ideas on labeling schemes. PhD thesis, University of Copenhagen, October 2016.
[Rote19]
Günter Rote. The largest contained quadrilateral and the smallest enclosing parallelogram of a convex polygon. Technical Report 1905.11203v2 [cs.CG], arXiv, June 2019.
[Roughgarden22]
Tim Roughgarden. Algorithms illuminated. Soundlikeyourself, September 2022.
[Roussopoulos73]
Nicholas D. Roussopoulos. A max{m,n} algorithm for determining the graph H from its line graph G. Information Processing Letters, 2(4):108–112, October 1973.
[Rozendaal25]
Wouter Rozendaal. Étude de codes LDPC quantiques et de leur décodage. PhD thesis, Université Bordeaux, Talence, France, December 2025.
[Rozhon24]
Václav Rozhon. Local complexity: New results and bridges to other fields. PhD thesis, ETH Zürich, Switzerland, 2024.
[RP00]
Eleanor Rieffel and Wolfgang Polak. An introduction to quantum computing for non-physicists. ACM Computing Surveys, 32(3):300–335, September 2000.
[RR03]
Rajeev Raman, Venkatesh Raman, and Satti Srivivasa Rao. Succinct dynamic dictionaries and trees. In 30th International Colloquium on Automata, Languages and Programming (ICALP), volume 2719 of Lecture Notes in Computer Science, pages 357–368. Springer, June 2003.
[RR06]
Oded Regev and Ricky Rosen. Lattice problems and norm embeddings. In 38th Annual ACM Symposium on Theory of Computing (STOC), pages 447–456. ACM Press, 2006.
[RR11]
Jakub Radoszewski and Wojciech Rytter. Hamiltonian paths in the square of a tree. In 22nd Annual International Symposium on Algorithms and Computation (ISAAC), volume 7074 of Lecture Notes in Computer Science, pages 90–99. Springer, December 2011.
[RR22]
Cyrus Rashtchian and William Raynaud. Edge isoperimetric inequalities for powers of the hypercube. The Electronic Journal of Combinatorics, 29(1):#P1.47, 2022.
[RR49]
László Rédei and Alfréd Rényi. On the representation of the numbers 1,2,...,N by means of differences. Matematicheskii Sbornik, 66(3):385–389, 1949.
[RR88]
G. Ramalingam and P. Rangan. A unified approach to dominating problems on interval graphs. Information Processing Letters, 27(5):271–274, April 1988.
[RRR01]
Rajeev Raman, Venkatesh Raman, and Satti Srivivasa Rao. Succinct dynamic data structures. In 7th International Workshop on Algorithms and Data Structures (WADS), volume 2125 of Lecture Notes in Computer Science, pages 426–437. Springer, August 2001.
[RRR02]
Rajeev Raman, Venkatesh Raman, and Satti Srivivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In 13th Symposium on Discrete Algorithms (SODA), pages 233–242. ACM-SIAM, January 2002.
[RS00]
Peter Ružička and Daniel Štefankovič. On the complexity of multi-dimensional interval routing schemes. Theoretical Computer Science, 245(2):255–280, August 2000.
[RS01]
Markus Röttger and Ulf Peter Schroeder. Efficient embeddings of grids into grids. Discrete Applied Mathematics, 108(1-2):143–173, February 2001.
[RS03a]
Neil Robertson and Paul D. Seymour. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory, Series B, 89(1):43–76, September 2003.
[RS03b]
Neil Robertson and Paul D. Seymour. Graph minors. XVIII. Tree-decomposition and well-quasi-ordering. Journal of Combinatorial Theory, Series B, 89(1):77–108, September 2003.
[RS04a]
Neil Robertson and Paul D. Seymour. Graph minors. XIX. Well-quasi-ordering on a surface. Journal of Combinatorial Theory, Series B, 90(2):325–385, March 2004.
[RS04b]
Neil Robertson and Paul D. Seymour. Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B, 92(2):325–357, November 2004.
[RS07]
Liam Roditty and Michael Segal. On bounded leg shortest paths problems. In 18th Symposium on Discrete Algorithms (SODA), pages 775–784. ACM-SIAM, January 2007.
[RS08]
Julien Robert and Nicolas Schabanel. Non-clairvoyant scheduling with precedence constraints. In 19th Symposium on Discrete Algorithms (SODA), pages 491–500. ACM-SIAM, January 2008.
[RS09]
Neil Robertson and Paul D. Seymour. Graph minors. XXI. Graphs with unique linkages. Journal of Combinatorial Theory, Series B, 99(3):583–616, May 2009.
[RS10]
Neil Robertson and Paul D. Seymour. Graph minors. XXIII. Nash-Williams' immersion conjecture. Journal of Combinatorial Theory, Series B, 100(2):181–205, March 2010.
[RS12]
Neil Robertson and Paul D. Seymour. Graph minors. XXII. Irrelevant vertices in linkage problems. Journal of Combinatorial Theory, Series B, 102(2):530–563, March 2012.
[RS15]
Joel Rybicki and Jukka Suomela. Exact bounds for distributed graph colouring. In 22nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 9439 of Lecture Notes in Computer Science, pages 46–60. Springer, July 2015.
[RS16]
Wolf-Dieter Richter and Kay Schicker. Circle numbers of regular convex polygons. Results in Mathematics, 69(3-4):521–538, 2016.
[RS60]
Irving S. Reed and Gustave Solomon. Polynomial codes over certain finite fields. Journal of the Society for Industrial and Applied Mathematics, 8(2):300–304, 1960.
[RS83]
Neil Robertson and Paul D. Seymour. Graph minors. I. Excluding a forest. Journal of Combinatorial Theory, Series B, 35(1):39–61, August 1983.
[RS83a]
Edward M. Reingold and Kenneth J. Supowit. Probabilistic analysis of divide-and-conquer heuristics for minimum weighted Euclidean matching. Networks, 13(1):49–66, 1983.
[RS83b]
Edward M. Reingold and Kenneth J. Supowit. Divide and conquer heuristics for minimum weighted Euclidean matching. SIAM Journal on Computing, 12(1):118–143, 1983.
[RS84]
Neil Robertson and Paul D. Seymour. Graph width and well-quasi-ordering: a survey. In Adrian J. Bondy and U.S.R. Murty, editors, Progress in Graph Theory, pages 399–406. Academic Press, 1984.
[RS84a]
Neil Robertson and Paul D. Seymour. Generalizing Kuratowski's theorem. Congressus Numerantium, 45:129–138, 1984.
[RS84b]
Neil Robertson and Paul D. Seymour. Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B, 36(1):49–64, February 1984.
[RS85]
Neil Robertson and Paul D. Seymour. Graph minors -- A survey. In Ian Anderson, editor, Surveys in Combinatorics 1985, invited papers for the 10th British Combinatorial Conference, volume 103 of London Mathematical Society Lecture Note Series, pages 153–171. Cambridge University Press, July 1985.
[RS86]
Neil Robertson and Paul D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms, 7(3):309–322, September 1986.
[RS86a]
Neil Robertson and Paul D. Seymour. Graph minors. V. Excluding a planar graph. Journal of Combinatorial Theory, Series B, 41(1):92–114, August 1986.
[RS86b]
Neil Robertson and Paul D. Seymour. Graph minors. VI. Disjoint paths across a disc. Journal of Combinatorial Theory, Series B, 41(1):115–138, August 1986.
[RS88]
Neil Robertson and Paul D. Seymour. Graph minors. VII. Disjoint paths on a surface. Journal of Combinatorial Theory, Series B, 45(2):212–254, October 1988.
[RS90]
Neil Robertson and Paul D. Seymour. Graph minors. IV. Tree-width and well-quasi-ordering. Journal of Combinatorial Theory, Series B, 48(2):227–254, April 1984.
[RS90a]
Neil Robertson and Paul D. Seymour. Graph minors. IX. Disjoint crossed paths. Journal of Combinatorial Theory, Series B, 49(1):70–77, June 1990.
[RS90b]
Neil Robertson and Paul D. Seymour. Graph minors. VIII. A Kuratowski theorem for general surfaces. Journal of Combinatorial Theory, Series B, 48(2):255–288, April 1990.
[RS91]
Neil Robertson and Paul D. Seymour. Graph minors. X. Obstructions to tree-decompositions. Journal of Combinatorial Theory, Series B, 52(2):153–190, July 1991.
[RS91a]
Jim Ruppert and Raimund Seidel. Approximating the d-dimensional complete Euclidean graph. In 3rd Canadian Conference on Computational Geometry (CCCG), pages 207–210, 1991.
[RS93]
Neil Robertson and Paul D. Seymour. Excluding a graph with one crossing. In Neil Robertson and Paul D. Seymour, editors, Graph Structure Theory, volume 147 of Contemporary Mathematics, chapter 6, pages 669–675. American Mathematical Society, Providence, Rhode Island, 1993.
[RS94]
Neil Robertson and Paul D. Seymour. Graph minors. XI. Circuits on a surface. Journal of Combinatorial Theory, Series B, 60(1):72–106, January 1994.
[RS95a]
Neil Robertson and Paul D. Seymour. Graph minors. XII. Distance on a surface. Journal of Combinatorial Theory, Series B, 64(2):240–272, July 1995.
[RS95b]
Neil Robertson and Paul D. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory, Series B, 63(1):65–110, January 1995.
[RS95c]
Neil Robertson and Paul D. Seymour. Graph minors. XIV. Extending an embedding. Journal of Combinatorial Theory, Series B, 65(1):23–50, September 1995.
[RS96]
Neil Robertson and Paul D. Seymour. Graph minors. XV. Giant steps. Journal of Combinatorial Theory, Series B, 68(1):112–148, September 1996.
[RS97]
Peter Ružička and Daniel Štefankovič. On the complexity of multi-dimensional interval routing schemes. Technical report, Comenius University, September 1997.
[RS98]
Carsten Rössner and Jean-Pierre Seifert. Hardness of approximating shortest integer relations among rational numbers. Theoretical Computer Science, 209(1-2):287–297, December 1998.
[RS98a]
Satish B. Rao and Warren D. Smith. Approximating geometrical graphs via ``spanners'' and ``banyans''. In 30th Annual ACM Symposium on Theory of Computing (STOC), pages 540–550. ACM Press, May 1998.
[RS99]
Neil Robertson and Paul D. Seymour. Graph minors. XVII. Taming a vortex. Journal of Combinatorial Theory, Series B, 77(1):162–210, September 1999.
[RSG20]
Fatemeh Salehi Rizi, Joerg Schloetterer, and Michael Granitzer. Shortest path distance approximation using deep learning techniques. Technical Report 2002.05257v1 [cs.LG], arXiv, February 2020.
[RSL77]
Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis II. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing, 6(3):563–581, September 1977.
[RSS93]
Bruce Reed, Neil Robertson, Alexander Schrijver, and Paul D. Seymour. Finding disjoint trees in planar graphs in linear time. In Graph Structure Theory, volume 147 of Contemporary Mathematics, pages 295–301. American Mathematical Society, 1993.
[RSST97]
Neil Robertson, Daniel Preston Sanders, Paul D. Seymour, and Robin Thomas. The four-colour theorem. Journal of Combinatorial Theory, Series B, 70(1):2–44, May 1997.
[RST10]
Juanjo Rué, Ignasi Sau, and Dimitrios M. Thilikos. Dynamic programming for graphs on surfaces. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 372–383. Springer, July 2010.
[RST89]
Neil Robertson, Paul D. Seymour, and Robin Thomas. Quickly excluding a planar graph. Technical Report TR89-16, DIMACS, 1989.
[RST93]
Neil Robertson, Paul D. Seymour, and Robin Thomas. Hadwiger's conjecture for K6-free graphs. Combinatorica, 13(3):279–361, September 1993.
[RST94]
Neil Robertson, Paul D. Seymour, and Robin Thomas. Quickly excluding a planar graph. Journal of Combinatorial Theory, Series B, 62(2):323–348, November 1994.
[RST95]
Neil Robertson, Paul D. Seymour, and Robin Thomas. Sachs' linkless embedding conjecture. Journal of Combinatorial Theory, Series B, 64(2):185–227, July 1995.
[RT12]
Lyle Ramshaw and Robert Endre Tarjan. A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs. Technical Report HPL-2012-72, HP Laboratories, June 2012.
[RT12a]
Lyle Ramshaw and Robert Endre Tarjan. A weight-scaling algorithm for min-cost imperfect matchings in bipartite graphs. In 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 581–590. IEEE Computer Society Press, October 2012.
[RT15]
Liam Roditty and Roei Tov. New routing techniques and their applications. In 34th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 23–32. ACM Press, July 2015.
[RT81]
Edward M. Reingold and Robert Endre Tarjan. On a greedy heuristic for complete matching. SIAM Journal on Computing, 10(4):676–681, November 1981.
[RTL76]
Donald J. Rose, Robert Endre Tarjan, and George S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5(2):266–283, 1976.
[RTZ02]
Liam Roditty, Mikkel Thorup, and Uri Zwick. Roundtrip spanners and roundtrip routing in directed graphs. In 13th Symposium on Discrete Algorithms (SODA), pages 844–851. ACM-SIAM, January 2002.
[RTZ05]
Liam Roditty, Mikkel Thorup, and Uri Zwick. Deterministic constructions of approximate distance oracles and spanners. In 32nd International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of Lecture Notes in Computer Science, pages 261–272, 2005.
[RTZ08]
Liam Roditty, Mikkel Thorup, and Uri Zwick. Roundtrip spanners and roundtrip routing in directed graphs. ACM Transactions on Algorithms, 3(4):Article No. 29, pp. 1–17, June 2008.
[Ru01]
Peter Ružička. On efficiency of path systems induced by routing and communication schemes. Computing and Informatics, 20(2):181–205, 2001.
[Ru88]
Peter Ružička. On efficiency of interval routing algorithms. In M.P. Chytil, L. Janiga, and V. Koubek, editors, 13th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 324 of Lecture Notes in Computer Science, pages 492–500. Springer-Verlag, August 1988.
[Ru91]
Peter Ružička. A short note: A note on the efficiency of an interval routing algorithm. The Computer Journal, 34(5):475–476, 1991.
[Rumeur94]
Jean de Rumeur. Communications dans les réseaux de processeurs. Études et Recherches en Informatique (ERI). MASSON, 1994.
[Rusu03]
Adrian Rusu. Area-efficient grid drawings of graphs. PhD thesis, State University of New York at Buffalo, August 2003.
[RW02]
R. Ravi and David P. Williamson. Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 34(1):98–107, March 2002.
[RW08]
Bruce A. Reed and David R. Wood. Polynomial treewidth forces a large grid-like-minor. Technical Report 0809.0724v3 [math.CO], arXiv, September 2008.
[RW09]
Bruce A. Reed and David R. Wood. A linear-time algorithm to find a separator in a graph excluding a minor. ACM Transactions on Algorithms, 5(4):Article No. 39, pp. 1–16, October 2009.
[RW10]
Olivier Riordan and Nicholas C. Wormald. The diameter of sparse random graphs. Combinatorics, Probability and Computing, 19(5-6):835–926, October 2010.
[RW12]
Bruce A. Reed and David R. Wood. Polynomial treewidth forces a large grid-like-minor. European Journal of Combinatorics, 33(3):374–379, April 2012.
[RW14]
Bruce A. Reed and David R. Wood. Forcing a sparse minor. Technical Report 1402.0272v2 [math.CO], arXiv, November 2014.
[RW16]
Bruce A. Reed and David R. Wood. Forcing a sparse minor. Combinatorics, Probability and Computing, 25(2):300–322, March 2016.
[RW24]
Dieter Rautenbach and Florian Werner. Induced subforests and superforests. Technical Report 2403.14492v1 [cs.DS], arXiv, March 2024.
[RW26]
Dieter Rautenbach and Florian Werner. Maximum common induced subforests and minimum common induced superforests of a set of forests. Discussiones Mathematicae Graph Theory, 46(1):299–316, 2026.
[RW90]
Daniel Ratner and Manfred Warmuth. The (n2-1)-puzzle and related relocation problems. Journal of Symbolic Computation, 10(2):111–137, August 1990.
[RW94]
Robert W. Robinson and Nicholas C. Wormald. Almost all regular graphs are hamiltonian. Random Structures and Algorithms, 5(2):363–374, April 1994.
[RW97]
R. Ravi and David P. Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 18(1):21–43, May 1997.
[Rybicki11]
Joel Rybicki. Exact bounds for distributed graph colouring. PhD thesis, University of Helsinki, Dept. of Computer Science, May 2011.
[Ryser69]
Herbert John Ryser. Combinatorial configurations. SIAM Journal on Applied Mathematics, 17(3):593–602, May 1969.
[RZ04a]
Liam Roditty and Uri Zwick. Dynamic approximate all-pairs shortest paths in undirected graphs. In 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 499–508. IEEE Computer Society Press, October 2004.
[RZ04b]
Liam Roditty and Uri Zwick. A fully dynamic reachability algorithm for directed graphs with an almost linear update time. In 31st Annual ACM Symposium on Theory of Computing (STOC), pages 184–191. ACM Press, June 2004.
[RZ04c]
Liam Roditty and Uri Zwick. On dynamic shortest paths problems. In 12th Annual European Symposium on Algorithms (ESA), volume 3221 of Lecture Notes in Computer Science, pages 580–591. Springer, September 2004.
[RZ11]
Wei Ren and Qing Zhang. A note on 'algorithms for connected set cover problem and fault-tolerant connected set cover problem'. Theoretical Computer Science, 412(45):6451–6454, October 2011.
[SA00]
Raimund Seidel and Udo Adamy. On the exact worst case query complexity of planar point location. Journal of Algorithms, 37(1):189–217, October 2000.
[SABM02]
Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, and Joseph S.B. Mitchell. Analysis of heuristics for the freeze-tag problem. In 9th Scandinavian Workshop on Algorithm Theory (SWAT), volume 2368 of Lecture Notes in Computer Science, pages 270–279. Springer, 2002.
[SABM04]
Marcelo O. Sztainberg, Esther M. Arkin, Michael A. Bender, and Joseph S.B. Mitchell. Theoretical and experimental analysis of heuristics for the "freeze-tag" robot awakening problem. IEEE Transactions on Robotics, 20(4):691–701, August 2004.
[Sachs81]
Horst Sachs. On spatial representation of finite graphs. In András Hajnal, László Lovász, and Vera T. Sós, editors, Finite and Infinite Sets, volume 37 of Colloquia Mathematica Societatis János Bolyai, pages 649–662. North-Holland, 1981.
[Sachs83]
Horst Sachs. On a spatial analogue of Kuratowski's Theorem on planar graphs -- An open problem. In Mieczysław Borowiecki, John W. Kennedy, and Maciej M. Sysło, editors, Graph Theory: Proceedings of a Conference held in Łagów, Poland, February 10-13, 1981, volume 1018 of Lecture Notes in Mathematics, pages 230–241. Springer-Verlag, 1983.
[Sagdeev19]
A.A. Sagdeev. On the partition of an odd number into three primes in a prescribed proportion. Mathematical Notes, 106(1):98–107, 2019.
[Sallows14]
Lee Sallows. A triangle theorem. Mathematics Magazine, 85(5):381, December 2014.
[Salowe94]
Jeffrey S. Salowe. Euclidean spanner graphs with degree four. Discrete Applied Mathematics, 54(1):55–66, September 1994.
[Sandberg06]
Oskar Sandberg. Distributed routing in small-world networks. In 8th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 144–155. SIAM, January 2006.
[Sanders93]
Daniel Preston Sanders. Linear algorithms for graphs of tree-width at most four. PhD thesis, Georgia Institute of Technology, Atlanta, Georgia, USA, August 1993.
[Sanna15]
Carlo Sanna. On the number of arithmetic formulas. International Journal of Number Theory, 11(4):1099–1106, 2015.
[Santoro07]
Nicola Santoro. Design and analysis of distributed algorithms. Wiley Series on Parallel and distributed computing. Wiley-Interscience, 2007.
[Sauer72]
Norbert Sauer. On the density of families of sets. Journal of Combinatorial Theory, Series A, 13(1):145–147, July 1972.
[Sauermann19]
Lisa Sauermann. On the speed of algebraically defined graph classes. Technical Report 1908.11575v1 [math.CO], arXiv, August 2019.
[Savery24]
Michael Savery. Planar graphs with the maximum number of induced 4-cycles or 5-cycles. Graphs and Combinatorics, 40(46), 2024.
[SB77]
Saul Stahl and Lowell W. Beineke. Blocks and the nonorientable genus of graphs. Journal of Graph Theory, 1(1):75–78, 1977.
[SB97]
Sergey Sevast'janov and Wojciech Banaszczyk. To the Steinitz lemma in coordinate form. Discrete Mathematics, 169(1-3):145–152, May 1997.
[SBBGZ08]
Daniel Salart, Augustin Baas, Cyril Branciard, Nicolas Gisin, and Hugo Zbinden. Testing the speed of 'spooky action at a distance'. Nature, 454:861–864, August 2008.
[SBLT12]
Gerth Stølting Bordal, George Lagogiannis, and Robert Endre Tarjan. Strict Fibonacci heaps. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 1177–1184. ACM Press, May 2012.
[SBS87]
Jeremy P. Spinrad, Andreas Brandstädt, and Lorna Stewart. Bipartite permutation graphs. Discrete Applied Mathematics, 18(3):279–292, December 1987.
[SCH81]
Peter J. Slater, Ernest J. Cockayne, and Stephen T. Hedetniemi. Information dissemination in trees. SIAM Journal on Computing, 10(4):692–701, 1981.
[Schaeffer98]
Gilles Schaeffer. Conjugaison d'arbres et cartes combinatoires aléatoires. PhD thesis, Université Bordeaux 1, Talence, France, December 1998.
[Schaeffer99]
Gilles Schaeffer. Random sampling of large planar maps and convex polyhedra. In 31st Annual ACM Symposium on Theory of Computing (STOC), pages 760–769. ACM Press, May 1999.
[Schaffer76]
Juan Jorge Schäffer. Geometry of spheres in normed spaces, volume 20 of Lecture Notes in Pure and Applied Mathematics. Dekker, Marcel, 1976.
[Scheffler90]
Petra Scheffler. A linear algorithm for the pathwidth of trees. In Rainer Bodendiek and Rudolf Henn, editors, Topics in Combinatorics and Graph Theory, pages 613–620. Physica-Verlag HD, 1990.
[Scheffler92]
Petra Scheffler. Optimal embedding of a tree into an interval graph in linear time. In Jaroslav Nešetřil and Miroslav Fiedler, editors, 4th Czechoslovakian Symposium on Combinatorics, Graph and Complexity, Annals of Discrete Mathematics, pages 287–291, 1992.
[Scheideler98]
Christian Scheideler. Universal routing strategies for interconnection networks, volume 1390 of Lecture Notes in Computer Science. Springer, 1998.
[Scheinerman16]
Edward R. Scheinerman. Efficient local representations of graphs. In Ralucca Gera, Stephen Hedetniemi, and Craig Larson, editors, Graph Theory, Problem Books in Mathematics, chapter 6, pages 83–94. Springer, Cham, 2016.
[Scheinerman99]
Edward R. Scheinerman. Local representations using very short label. Discrete Mathematics, 203(1):287–290, May 1999.
[Schindel00]
Christian Schindelhauer. Broadcasting time cannot be approximated with a factor of 57/56-ε. Technical Report TR-00-02, International Computer Science Institute (ISI), Berkeley, California, USA, March 2000.
[Schmidt09]
Jens M. Schmidt. Interval stabbing problems in small integer ranges. In 20th Annual International Symposium on Algorithms and Computation (ISAAC), volume 5878 of Lecture Notes in Computer Science, pages 163–172. Springer, December 2009.
[Schmidt10]
Jens M. Schmidt. Point sets with planar embeddings of cubic, connected graphs. Technical Report 959, KAM-DIMATIA Series, Charles University, Praha, 2010.
[Schnyder89]
Walter Schnyder. Planar graphs and poset dimension. Order, 5(4):323–343, December 1989.
[Schnyder90]
Walter Schnyder. Embedding planar graphs on the grid. In 1st Symposium on Discrete Algorithms (SODA), pages 138–148. ACM-SIAM, January 1990.
[Schom97]
H. Schomberg. Chord and shuffle augmented mesh topologies for messages-passing multicomputers. Manuscript, 1997.
[Schoning99]
Uwe Schöning. A probabilistic algorithm for k-SAT and constraint satisfaction problems. In 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 410–414. IEEE Computer Society Press, October 1999.
[Schorer18]
Peter Schorer. A solution to the 3x+1 problem, June 2018.
[Seidel06]
Raimund Seidel. Understanding the inverse Ackermann function. In 22nd European Workshop on Computational Geometry (EuroCG), page 37, March 2006.
[Seidel98]
Raimund Seidel. Note -- On the number of triangulations of planar point sets. Combinatorica, 18(2):297–299, February 1998.
[Sekanina63]
Milan Sekanina. On an ordering of the vertices of a graph. Časopis pro pěstování matematiky, 88(3):265–282, 1963.
[Sekanina71]
Milan Sekanina. On an algorithm for ordering of graphs. Canadian Mathematical Bulletin, 14(2):221–224, 1971.
[Seston08]
Morgan Seston. Dissimilarités de Robinson : algorithmes de reconnaissance et d'approximation. PhD thesis, Université de la Méditerranée, Luminy, December 2008.
[Sevastjanov78]
Sergey V. Sevast'janov. Approximate solution of some problems of scheduling theory. Metody Diskretnogo Analiza v Sinteze Realizacij Bulevyh Funkcij, 32:66–75, 1978.
[Seweryn22]
Michał T. Seweryn. Dimension of posets with cover graphs in minor-closed classes. PhD thesis, Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland, June 2022.
[Seymour06]
Paul D. Seymour. Disjoint paths in graphs. Discrete Mathematics, 306:979–991, 2006.
[Seymour16]
Paul D. Seymour. Hadwiger's conjecture, April 2016. preprint.
[Seymour23]
Paul D. Seymour. A shorter proof of the path-width theorem. Technical Report 2309.05100v1 [math.CO], arXiv, September 2023.
[SGFIR10]
Ankit Singla, Philip Brighten Godfrey, Kevin Fall, Gianluca Iannaccone, and Sylvia Ratnasamy. Scalable routing on flat names. In 6th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), page Article No. 20. ACM Press, November 2010.
[SGM13]
Vladimir Shevelev, Charles R. Greathouse IV, and Peter J.C. Moses. On intervals (kn,(k+1)n) containing a prime for all n>1. Journal of Integer Sequences, 16(Article 13.7.3), 2013.
[Shannon48]
Claude E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379–423, July 1949.
[Shannon49]
Claude E. Shannon. The synthesis of two-terminal switching circuits. The Bell System Technical Journal, 28(1):59–98, 1949.
[Sharp07]
Alexa Sharp. Distance coloring. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 510–521. Springer, October 2007.
[Shelah72]
Saharon Shelah. A combinatorial problem; stability and order for models and theories in infinitary languages. Pacific Journal of Mathematics, 41(1):247–261, 1972.
[Sherstov12]
Alexander A. Sherstov. The multiparty communication complexity of set disjointness. In 44th Annual ACM Symposium on Theory of Computing (STOC), page 525. ACM Press, May 2012.
[Sherstov14]
Alexander A. Sherstov. Communication complexity theory: Thirty-five years of set disjointness. In 39th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 8634 of Lecture Notes in Computer Science, pages 24–43. Springer, August 2014.
[Shiloach76]
Yossi Shiloach. Linear and planar arrangements of graphs. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, February 1976.
[Shiloach80]
Yossi Shiloach. A polynomial solution to the undirected two paths problem. Journal of the ACM, 27(3):445–456, July 1980.
[Shimony84]
Abner Shimony. Controllable and uncontrollable nonlocality. In International Symposium on the Foundations of Quantum Mechanics, pages 130–139. The Physical Society of Japan, 1984.
[SHM05]
Chaoming Song, Shlomo Havlin, and Hernán A. Makse. Self-similarity of complex networks. Nature, 433:392–395, January 2005.
[Shor94]
Peter W. Shor. Algorithms for quantum computation: Discrete log and factoring. In 35th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 124–134. IEEE Computer Society Press, November 1994.
[Shor97]
Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484–1509, 1997.
[Sidiropoulos10]
Anastasios Sidiropoulos. Optimal stochastic planarization. In 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 163–170. IEEE Computer Society Press, October 2010.
[Siegel02a]
Alan Siegel. A historical review of the isoperimetric theorem in 2-D, and its place in elementary plane geometry, 2002. Preprint.
[Siegel02b]
Alan Siegel. An isoperimetric theorem in plane geometry, 2002. Preprint.
[Simonovits68]
Miklós Simonovits. A method for solving extremal problems in graph theory, stability problems. In Theory of Graphs, Proc. Colloq., Tihany (Hungary), 1966, pages 279–319. Academic Press, 1968.
[Simonovits83]
Miklós Simonovits. Extremal graph theory. In Lowell W. Beineke and R.J. Wilson, editors, Selected topics in Graph Theory, 2, chapter 2, pages 161–200. Academic Press, London, 1983.
[Singer38]
James Singer. A theorem in finite projective geometry and some applications to number theory. Transactions of the American Mathematical Society, 43(3):377–385, 1938.
[SK82]
Nicola Santoro and Ramez Khatib. Routing without routing tables. Technical Report SCS-TR-6, School of Computer Science, Carleton University, Ottawa, 1982.
[SK85]
Nicola Santoro and Ramez Khatib. Labelling and implicit routing in networks. The Computer Journal, 28(1):5–8, February 1985.
[Skiena08]
Steven S. Skiena. The algorithm design manual. Springer, 2008.
[Skodinis03]
Konstantin Skodinis. Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. Journal of Algorithms, 47(1):40–59, April 2003.
[SKP04]
Sudhir Kumar Singh, Somesh Kumar, and Sudebkumar Prasant Pal. Characterizing the combinatorics of distributed EPR pairs for multi-partite entanglement. Technical Report 0306049v2 [quant-ph], arXiv, January 2004.
[SKR00]
Andrzej Szymczak, Davis King, and Jarek Rossignac. An edgebreaker-based efficient compression scheme for regular meshes. In 12th Canadian Conference on Computational Geometry (CCCG), pages 257–265, 2000.
[SL07]
Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. In 39th Annual ACM Symposium on Theory of Computing (STOC), pages 661–670. ACM Press, June 2007.
[SL15]
Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. Journal of the ACM, 62(1):Article No. 1, pp. 1–19, February 2015.
[Slavik96]
Petr Slavík. A tight analysis of the greedy algorithm for set cover. In 28th Annual ACM Symposium on Theory of Computing (STOC), pages 435–441. ACM Press, May 1996.
[Slavik97]
Petr Slavík. A tight analysis of the greedy algorithm for set cover. Journal of Algorithms, 25(2):237–254, November 1997.
[Slivkins05]
Aleksandrs Slivkins. Distance estimation and object location via rings of neighbors. In 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 41–50. ACM Press, July 2005. Appears earlier as Cornell CIS technical report TR2005-1977.
[Slivkins05a]
Aleksandrs Slivkins. Distributed approaches to triangulation and embedding. In 16th Symposium on Discrete Algorithms (SODA), pages 640–649. ACM-SIAM, January 2005.
[Slivkins07]
Aleksandrs Slivkins. Distance estimation and object location via rings of neighbors. Distributed Computing, 19(4):313–333, 2007.
[Slivkins07a]
Aleksandrs Slivkins. Towards fast decentralized construction of locality-aware overlay networks. In 26th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 89–98. ACM Press, August 2007.
[Smid03]
Michiel Smid. Computing the diameter of a point set: sequentiel and parallel algorithms, November 2003.
[SML94]
Ibrahima Sakho, Léon Mugwaneza, and Y. Langue. Routing with compact tables: interval labelling scheme for generalized meshes. In C. Girault, editor, IFIP Transactions: Applications in Parallel and Distributed Computing (APDC), pages 297–308. Elsevier Science B.V. (North-Holland), April 1994.
[SMSH23]
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, and Marc Hellmuth. Planar median graphs and cubesquare-graphs. Discrete Applied Mathematics, 331:38–58, May 2023.
[Soares92]
José Soares. Graphs spanners: a survey. Congressus Numerantium, 89:225–238, 1992.
[Soares94]
José Soares. Approximating Euclidean distances by small degree graphs. Discrete & Computational Geometry, 11(1):213–233, December 1994.
[Sodin08]
Sasha Sodin. An isoperimetric inequality on the ℓp balls. Annales de l'Institut Henri Poincaré Probabilité et Statistiques, 44(2):362–373, 2008.
[soft:Gav22]
Cyril Gavoille. An optimal algorithm for the Freeze-Tag Problem in 2D. Software, LaBRI, Université Bordeaux, March 2022.
[Solomon10]
Shay Solomon. An optimal-time construction of euclidean sparse spanners with tiny diameter. Technical Report 1005.4155v1 [cs.CG], arXiv, May 2010.
[Sommer10]
Christian Sommer. Approximate shortest path and distance queries in networks. PhD thesis, University of Tokyo, January 2010.
[Sommer11]
Christian Sommer. Exact and approximate shortest-path queries for planar graphs (slides), February 2011. NII Shonan Workshop, Japan.
[Sommer14]
Christian Sommer. Shortest-path queries in static networks. ACM Computing Surveys, 45(4):Article No. 45, pp. 1–31, April 2014.
[SP85]
Maheswara Rao Samathan and Dhiraj Kumar Pradhan. The de Bruijn multiprocessor network: A versatile sorting network. In 12th IEEE International Symposium on Computer Architecture (ISCA), pages 360–367, June 1985.
[Spencer75]
Joel H. Spencer. Ramsey's Theorem -- A new lower bound. Journal of Combinatorial Theory, Series A, 18(1):108–115, January 1975.
[Spielman96]
Daniel A. Spielman. Faster isomorphism testing of strongly regular graphs. In 28th Annual ACM Symposium on Theory of Computing (STOC), pages 576–584. ACM Press, May 1996.
[Spinrad03]
Jeremy P. Spinrad. Efficient graph representations, volume 19 of Fields Institute Monographs. American Mathematical Society, 2003.
[Spirkl14]
Sophie Theresa Spirkl. The Guillotine approach for TSP with neighborhoods revisited. Technical Report 1312.0378v2 [cs.CG], arXiv, April 2014.
[SR24]
Arseny M. Shur and Mikhail Rubinchik. Distance labeling for families of cycles. In 49th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), volume 14519 of Lecture Notes in Computer Science, pages 471–484. Springer, February 2024.
[SR95]
G. Srikrishna and C. Pandu Rangan. Optimal parallel algorithms for path problems on planar graphs. Theoretical Computer Science, 145:27–43, July 1994.
[SS00]
Farhad Shahrokhi and Weiping Shi. On crossing sets, disjoint sets, and pagenumber. Journal of Algorithms, 34(1):40–53, January 2000.
[SS05]
Christian Schindelhauer and Gunnar Schomaker. Weighted distributed hash tables. In 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 218–227. ACM Press, July 2005.
[SS71]
Arnold Schönhage and Volker Strassen. Schnelle Multiplikation großer Zahlen. Computing, 7(3):281–292, September 1971.
[SS78]
James A. Storer and Thomas G. Szymanski. The macro model for data compression. In 10th Annual ACM Symposium on Theory of Computing (STOC), pages 30–39. ACM Press, May 1978.
[SSG07]
Sundar Subramanian, Sanjay Shakkottai, and Piyush Gupta. On optimal geographic routing in wireless networks with holes and non-uniform traffic. In 26th Annual IEEE Conference on Computer Communications (INFOCOM), May 2007.
[SSS19]
Manfred Scheucher, Hendrik Schrezenmaier, and Raphael Steiner. A note on universal point sets for planar graphs. In 27th International Symposium on Graph Drawing and Network Visualization (GD), volume 11904 of Lecture Notes in Computer Science, pages 350–362. Springer, September 2019.
[SSS20]
Manfred Scheucher, Hendrik Schrezenmaier, and Raphael Steiner. A note on universal point sets for planar graphs. Journal of Graph Algorithms and Applications, 24(3):247–267, 2020.
[SSS21]
Alex Scott, Paul D. Seymour, and Sophie Theresa Spirkl. Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. Technical Report 2104.07927v2 [math.CO], arXiv, July 2021.
[SSSV00]
Farhad Shahrokhi, Ondreij Sýkora, László A. Székely, and Imrich Vrt'o. A new lower bound for the bipartite crossing number with applications. Theoretical Computer Science, 245(2):281–294, August 2000. Appears also as Graph Drawing '94, LNCS 894, pp. 131-142.
[SST20]
Ignasi Sau, Giannos Stamoulis, and Dimitrios M. Thilikos. An FPT-algorithm for recognizing k-apices of minor-closed graph classes. In Artur Czumaj, Anuj Dawar, and Emanuela Merelli, editors, 47th International Colloquium on Automata, Languages and Programming (ICALP), volume 168 of LIPIcs, pages 95:1–95:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2020.
[SSW03]
Subhash Suri, Tuomas Sandholm, and Priyank Warkhede. Compressing two-dimensional routing tables. Algorithmica, 35(4):287–300, April 2003.
[SSW10]
Lanzhen Song, William Staton, and Bing Wei. Independence polynomials of k-tree related graphs. Discrete Applied Mathematics, 158(8):943–950, April 2010.
[ST01]
Mark Steyvers and Josh Tenenbaum. Small worlds in semantic networks, 2001.
[ST01a]
Aravind Srinivasan and Chung-Piaw Teo. A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM Journal on Computing, 30(6):2051–2068, 2001.
[ST04]
Daniel A. Spielman and Shang-Hua Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In 36th Annual ACM Symposium on Theory of Computing (STOC), pages 81–90. ACM Press, June 2004.
[ST07]
Karol Suchan and Ioan Todinca. Pathwidth of circular-arc graphs. In 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 4769 of Lecture Notes in Computer Science, pages 258–269. Springer, 2007.
[ST13]
Sushant Sachdeva and Madhur Tulsiani. Cuts in cartesian products of graphs. Technical Report 1105.3383v2 [cs.DM], arXiv, September 2013.
[ST22]
Francisco J. Soulignac and Pablo Terlisky. Loop unrolling of UCA models: distance labeling. Technical Report 2202.10527v1 [cs.DM], arXiv, February 2022.
[ST83]
Daniel D. Sleater and Robert Endre Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362–391, June 1983.
[ST84]
J.W. Suurballe and Robert Endre Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14(2):325–336, 1984.
[ST86]
Neil Sarnak and Robert Endre Tarjan. Planar point location using persistent search trees. Communications of the ACM, 29(7):669–679, July 1986.
[ST94]
Paul D. Seymour and Robin Thomas. Call routing and the ratcatcher. Combinatorica, 14(2):217–241, June 1994.
[Standley10]
Trevor Standley. Finding optimal solutions to cooperative pathfinding problems. In 24th AAAI Conference on Artificial Intelligence (AAAI), volume 24, pages 173–178. AAAI Press, July 2010.
[Stanley02]
Richard P. Stanley. Enumerative combinatorics volume I, volume 49 of Cambridge Studies in Advanced Mathematics. The Wadsworth & Brooks / Cole, Chapman and Hall, 2002.
[Steiner85]
George Steiner. A compact labeling scheme for series parallel graphs. Discrete Applied Mathematics, 11(3):281–297, July 1985.
[Steinerberger14]
Stefan Steinerberger. A short note on integer complexity. Contributions to Discrete Mathematics, 9(1):63–69, 2014.
[Steinerberger23]
Stefan Steinerberger. The boundary of a graph and its isoperimetric inequality. Discrete Applied Mathematics, 338(30):125–134, October 2023.
[Stillwell93]
John Stillwell. Classical topology and combinatorial group theory, volume 72 of Graduate Texts in Mathematics. Springer, 1993.
[Stodolsky08]
B.Y. Stodolsky. On domination in 2-connected cubic graphs. The Electronic Journal of Combinatorics, 15:#N38, 2008.
[Stojakovic59]
Mirko Stojaković. Über die Konstruktion der ebenen Graphen. Univ. Beograd. Godišnjak Filozofslog fakulteta u Novom Sadu, 4:375–378, 1959.
[Stone71]
Harald S. Stone. Parallel processing with the perfect shuffle. IEEE Transactions on Computers, C-20(2):153–161, February 1971.
[Straka23]
Adam Straka. Stack number and queue number of graphs. Technical Report 2305.09700v1 [cs.DM], arXiv, February 2023.
[Strassen69]
Volker Strassen. Gaussian elimination is not optimal. Numerische Mathematik, 13:354–356, 1969.
[Streater07]
Ray F. Streater. Quantum probability. In Lost Causes in and Beyond Physics, chapter 4, pages 35–63. Springer-Verlag, 2007.
[Su15]
Hsin-Hao Su. Algorithms for fundamental problems in computer networks. PhD thesis, University of Michigan, Ann Arbor, USA, 2015.
[Subramanian93]
Sairam Subramanian. A fully dynamic data structure for reachability in planar digraphs. In 1st Annual European Symposium on Algorithms (ESA), volume 726 of Lecture Notes in Computer Science, pages 372–383. Springer, 1993.
[Suderman02]
Matthew Suderman. Pathwidth and layered drawings of trees. Technical Report SOCS-02.8, School of Computer Science, McGill University, Montréal, Québec, Canada, October 2002.
[Suderman04]
Matthew Suderman. Pathwidth and layered drawings of trees. International Journal of Computational Geometry and Applications, 14(3):203–225, 2004.
[Sunshine81]
Carl A. Sunshine. Addressing problems in multi-network systems. Internet Experiment Notes, 178, April 1981. Appears also in INFOCOM '82.
[Suomela10]
Jukka Suomela. Distributed algorithms for edge dominating sets. In 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 365–374. ACM Press, July 2010.
[Suomela13]
Jukka Suomela. Survey of local algorithms. ACM Computing Surveys, 45(2):Article No. 24, pp. 1–40, February 2013.
[Suomela14]
Jukka Suomela. A course on deterministic distributed algorithms. Online textbook, 2014.
[Suomela19]
Jukka Suomela. Distributed algorithms. Online textbook, 2019.
[Suzuki10]
Yusuke Suzuki. Optimal 1-planar graphs which triangulate other surfaces. Discrete Mathematics, 310(1):6–11, January 2010.
[SV12]
Jens M. Schmidt and Pavel Valtr. Cubic plane graphs on a given point set. In 28th Annual ACM Symposium on Computational Geometry (SoCG), pages 201–208. ACM, June 2012.
[SV12a]
Jack Snoeyink and Vishal Verma. Transformations to critical arcgons: progress on tighter bounds for Delaunay stretch. In 22nd Annual Fall Workshop on Computational Geometry (FWCG), November 2012.
[SV14]
Andras Sebö and Jens Vygen. Shorter tours by nicer ears: 7/5-Approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica, 34(5):597–629, October 2014.
[SV88]
Baruch Schieber and Uzi Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM Journal on Computing, 17(6):1253–1262, December 1988.
[SV93]
Márió Szegedy and Sundar Vishwanathan. Locality based graph coloring. In 25th Annual ACM Symposium on Theory of Computing (STOC), pages 201–207. ACM Press, May 1993.
[SVS19]
Jiawei Su, Danilo Vasconcellos Vargas, and Kouichi Sakurai. One pixel attack for fooling deep neural networks. IEEE Transactions on Evolutionary Computation, 23(5):828–841, October 2019.
[SVY09]
Christian Sommer, Elad Verbin, and Wei Yu. Distance oracles for sparse graphs. In 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 703–712. IEEE Computer Society Press, October 2009.
[SW08]
Johannes Schneider and Roger Wattenhofer. A log-star distributed maximal independent set algorithm for growth-bounded graphs. In 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 35–44. ACM Press, August 2008.
[SW10]
Johannes Schneider and Roger Wattenhofer. A new technique for distributed symmetry breaking. In 29th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 257–266. ACM Press, July 2010.
[SW11]
Johannes Schneider and Roger Wattenhofer. Distributed coloring depending on the chromatic number or the neighborhood growth. In 18th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 6796 of Lecture Notes in Computer Science, pages 246–257. Springer, June 2011.
[SW11a]
Johannes Schneider and Roger Wattenhofer. Trading bit, message, and time complexity of distributed algorithms. In 25th International Symposium on Distributed Computing (DISC), volume 6950 of Lecture Notes in Computer Science (ARCoSS), pages 51–65. Springer, September 2011.
[SW11b]
Robert Sedgewick and Kevin Wayne. Algorithms. Addison-Wesley, 2011.
[SW25]
Borna Šimić and Roger Wattenhofer. Labeling embeddings of planar graphs for face-adjacency. In Ulrich Schmid and Roman Kuznets, editors, 32nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 15671 of Lecture Notes in Computer Science, pages 401–415. Springer, June 2025.
[SW49]
Claude E. Shannon and Warren Weaver. The mathematical theory of communication. Urbana, The University of Illinois Press, July 1949.
[SW83]
Edward R. Scheinerman and Douglas B. West. Interval number of a planar graph: Three intervals suffice. Journal of Combinatorial Theory, Series B, 35(3):224–239, December 1983.
[SW84]
P. Scheuermann and G. Wu. Heuristic algorithms for broadcasting in point-to-point computer networks. IEEE Transactions on Computers, C-33(9):804–811, September 1984.
[SY10]
Noah Streib and Stephen J. Young. Dimension and structure for a poset of graph minors, October 2010. Preprint in preparation.
[SY22]
Thatchaphol Saranurak and Sorrachai Yingchareonthawornchai. Deterministic small vertex connectivity in almost linear time. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 789–800. IEEE Computer Society Press, October 2022.
[Syslo79]
Maciej M. Sysło. Characterizations of outerplanar graphs. Discrete Mathematics, 26(1):47–53, 1979.
[SYZ25]
Sihong Shao, Chuan Yang, and Dong Zhang. Dual Cheeger constants, signless 1-laplacians and maxcut. Technical Report 1607.00489v2 [math.SP], arXiv, January 2025.
[SZ94]
Edward R. Scheinerman and Jennifer Zito. On the size of hereditary classes of graphs. Journal of Combinatorial Theory, Series B, 61(1):16–39, May 1994.
[Szymczak03]
Andrzej Szymczak. Optimized edgebreaker encoding for large and regular triangle meshes. The Visual Computer, 19(4):271–278, July 2003.
[TACGx11]
Konstantin Tretyakov, Abel Armas-Cervantes, Luciano García-Bañuelos, Jaak Vilo, and Marlon Dumas. Fully dynamic landmark-based estimation of shortest path distances in very large graphs. In 20th ACM Conference on Information and Knowledge Management (CIKM), pages 1785–1794. ACM Press, October 2011.
[Tait19]
Michael Tait. The Colin de Verdière parameter, excluded minors, and the spectral radius. Journal of Combinatorial Theory, Series A, 166:42–58, August 2019.
[Tal14]
Avishay Tal. Shrinkage of de morgan formulae by spectral techniques. In 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 551–560. IEEE Computer Society Press, October 2014.
[talk:Gav02]
Cyril Gavoille. À propos du nombre de graphes planaires. In GT Combinatoire et Algorithmique, April 2002.
[talk:Gav04]
Cyril Gavoille. Routage avec indépendance des noms. In ACI PairApair Meeting, January 2004.
[talk:Gav08]
Cyril Gavoille. On sparse spanners. In ANR Aladdin Meeting, May 2008.
[talk:Gav11]
Cyril Gavoille. Spanner, distance oracle, and compact routing for unweighted graphs. In ANR Aladdin Meeting, May 2011.
[talk:Gav11b]
Cyril Gavoille. A quick overview on name-independent compact routing schemes. In Euler Project Meeting, November 2011.
[talk:Gav15]
Cyril Gavoille. Computing distances in a graph in constant time and with 0.793n-bit labels. In ANR Displexity Meeting, March 2015.
[talk:Gav18]
Cyril Gavoille. Introduction à la complexité de communication. In GT Algorithmique Distribuée, November 2018.
[talk:Gav19]
Cyril Gavoille. Shorter implicit representation for planar graphs. In GT Graphes et Optimisation, September 2019.
[talk:Gav20]
Cyril Gavoille. Adjacency labelling for planar graphs (and beyond). In GT Algorithmique Distribuée, November 2020.
[talk:Gav21]
Cyril Gavoille. Universal graph and implicit representation of planar graphs. In Séminaire du Laboratoire d'Informatique Gaspard-Monge (LIGM), November 2021.
[talk:Gav22]
Cyril Gavoille. On the freeze-tag problem. In ANR TEMPOGRAL Meeting, November 2022.
[talk:Gav22b]
Cyril Gavoille. Smaller universal graphs for caterpillars and graphs of bounded path-width (part I & II). In GT Graphes et Optimisation, December 2022.
[talk:Gav23]
Cyril Gavoille. On the freeze-tag problem. In GT Graphes et Optimisation, April 2023.
[talk:Gav96]
Cyril Gavoille. Routage compact. In Séminaire du LaBRI, November 1996.
[talk:Gav99]
Cyril Gavoille. Tables compactes de routage pour graphe de genre borné. In Séminaire du Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier (LIRMM), 1999.
[Talwar04]
Kunal Talwar. Bypassing the embedding: Algorithms for low dimensional metrics. In 36th Annual ACM Symposium on Theory of Computing (STOC), pages 281–290. ACM Press, June 2004.
[Tamaki22]
Hisao Tamaki. Heuristic computation of exact treewidth. In 20th International Symposium on Experimental Algorithms (SEA), volume 233 of LIPIcs, pages 17:1–17:16. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2022.
[Taneja15]
Inder J. Taneja. Single digit representations of natural numbers. Technical Report Article 15, RGMIA, Research Report Collection, March 2015.
[Tao20]
Terence Tao. Almost all orbits of the Collatz map attain almost bounded values. Technical Report 1909.03562v3 [math.PR], arXiv, June 2020.
[Tao22]
Terence Tao. Almost all orbits of the Collatz map attain almost bounded values. Forum of Mathematics, Pi, 10:e12, 2022.
[Tarjan72]
Robert Endre Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146–160, June 1972.
[Tarjan79]
Robert Endre Tarjan. Applications of path compression on balanced trees. Journal of the ACM, 26(4):690–715, October 1979.
[Tarjan79a]
Robert Endre Tarjan. A class of algorithms which require nonlinear time to maintain disjoint sets. Journal of Computer and System Sciences, 18(2):110–127, April 1979.
[Tarjan85]
Robert Endre Tarjan. Decomposition by clique separators. Discrete Mathematics, 55(2):221–232, July 1985.
[Taubenfeld18]
Gadi Taubenfeld. Distributed computing pearls, volume #14 of Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool, May 1998.
[TB97]
Dimitrios M. Thilikos and Hans Leo Bodlaender. Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters, 61(5):227–232, March 1997.
[TdSPx21]
Leonardo Tortoro Pereira, Paulo Victor de Souza Prado, Rafael Miranda Lopes, and Claudio Fabiano Motta Toledo. Procedural generation of dungeons' maps and locked-door missions through an evolutionary algorithm validated with players. Expert Systems With Applications, 180:115009, October 2021.
[Tedford11]
Steven J. Tedford. Combinatorial interpretations of convolutions of the Catalan numbers. Integers, 11(1):35–45, 2011.
[Tel94]
Gérard Tel. Introduction to distributed algorithms. Cambridge University Press, 1994.
[Teodorani16]
Massimo Teodorani. Entanglement: l'intrication quantique, des particules à la conscience. Macro Edition, 2016.
[Terry18]
Caroline Terry. VCℓ-dimension and the jump to the fastest speed of a hereditary l-property. Proceedings of the American Mathematical Society, 146(7):3111–3126, July 2018.
[Theis08]
Dirk Oliver Theis. The cops & robber game on series-parallel graphs. Technical Report 0712.2908v2 [math.CO], arXiv, January 2008.
[Thilikos00]
Dimitrios M. Thilikos. Algorithms and obstructions for linear-width and related search parameters. Discrete Applied Mathematics, 105(1-3):239–271, October 2000.
[Thilikos99]
Dimitrios M. Thilikos. Quickly excluding a K2,r from planar graphs. In 6th Twente Workshop on Graphs and Combinatorial Optimization, volume 3 of Electronic Notes in Discrete Mathematics, pages 189–194. Elsevier, May 1999.
[Thomas06]
Robin Thomas. Large 6-connected graphs with no K6 minor, 2006.
[Thomason01]
Andrew Thomason. The extremal function for complete minors. Journal of Combinatorial Theory, Series B, 81(2):318–338, March 2001.
[Thomassen86]
Carsten Thomassen. Interval representations of planar graphs. Journal of Combinatorial Theory, Series B, 40(1):9–20, February 1986.
[Thomassen89]
Carsten Thomassen. The graph genus problem is NP-complete. Journal of Algorithms, 10(4):568–576, December 1989.
[Thomassen97]
Carsten Thomassen. A simpler proof of the excluded minor theorem for higher surfaces. Journal of Combinatorial Theory, Series B, 70(2):306–311, July 1997.
[Thorup01]
Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. In 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 242–251. IEEE Computer Society Press, October 2001.
[Thorup02]
Mikkel Thorup. Randomized sorting in O(nloglogn) time and linear space using addition, shift, and bit-wise boolean operations. Journal of Algorithms, 42(2):205–230, February 2002.
[Thorup04]
Mikkel Thorup. Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM, 51(6):993–1024, November 2004.
[Thorup04a]
Mikkel Thorup. Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles. In Torben Hagerup and Jyrki Katajainen, editors, 9th Scandinavian Workshop on Algorithm Theory (SWAT), volume 3111 of Lecture Notes in Computer Science, pages 384–396. Springer, July 2004.
[Thorup04b]
Mikkel Thorup. Integer priority queues with decrease key in constant time and the single source shortest paths problem. Journal of Computer and System Sciences, 69(3):330–353, November 2004.
[Thorup05]
Mikkel Thorup. Worst-case update times for fully-dynamic all-pairs shortest paths. In 37th Annual ACM Symposium on Theory of Computing (STOC), pages 112–119. ACM Press, May 2005.
[Thorup07]
Mikkel Thorup. Compact oracles for approximate distances around obstacles in the plane. In Lars Arge and Emo Welzl, editors, 15th Annual European Symposium on Algorithms (ESA), volume 4698 of Lecture Notes in Computer Science, pages 383–394. Springer, October 2007.
[Thorup07a]
Mikkel Thorup. Equivalence between priority queues and sorting. Journal of the ACM, 54(6):Article No. 28, pp. 1–27, December 2007.
[Thorup97]
Mikkel Thorup. Structured programs have small tree-width and good register allocation. In 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1335 of Lecture Notes in Computer Science, pages 318–332. Springer, June 1997.
[Thorup97a]
Mikkel Thorup. Undirected single source shortest paths in linear time. In 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 12–21. IEEE Computer Society Press, October 1997.
[Thorup97b]
Mikkel Thorup. Randomized sorting in O(nloglogn) time and linear space using addition, shift, and bit-wise boolean operations. In 8th Symposium on Discrete Algorithms (SODA), pages 352–359. ACM-SIAM, January 1997.
[Thorup98]
Mikkel Thorup. All structured programs have small tree-width and good register allocation. Information and Computation, 142(2):159–181, May 1998.
[Thorup99]
Mikkel Thorup. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM, 46(3):362–394, May 1999.
[Thurimella95]
Ramakrishna Thurimella. Sub-linear distributed algorithms for sparse certificates and biconnected components. In 14th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 28–37. ACM Press, August 1995.
[Tikhomirov22]
Konstantin Tikhomirov. A remark on the Ramsey number of the hypercube. Technical Report 2208.14568v2 [math.CO], arXiv, August 2022.
[Tillich00]
Jean-Pierre Tillich. Edge isoperimetric inequalities for product graphs. Discrete Mathematics, 213(1-3):291–320, February 2000.
[Timnat15]
Shahar Timnat. Practical parallel data structures. PhD thesis, Technion -- Israel Institute of Technology, Haifa, Israel, June 2015.
[Tiskin15]
Alexander Tiskin. Fast distance multiplication of unit-Monge matrices. Algorithmica, 71:859–888, 2015.
[TKM05]
Seiichiro Tani, Hirotada Kobayashi, and Keiji Matsumoto. Exact quantum algorithms for the leader election problem. In 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3404 of Lecture Notes in Computer Science, pages 581–592. Springer, February 2005.
[TL02a]
Savio Siu-Hong Tse and Francis C.M. Lau. Upper bound results for multi-label interval routing on planar graphs. Technical Report TR-2002-17, Department of Computer Science, The University of Hong Kong, December 2002.
[TL02b]
Savio Siu-Hong Tse and Francis C.M. Lau. An optimal lower bound for interval routing in general networks. Technical Report TR-2002-18, Department of Computer Science, The University of Hong Kong, December 2002.
[TL04]
Savio Siu-Hong Tse and Francis C.M. Lau. New bounds for multi-label interval routing. Theoretical Computer Science, 310(1-3):61–77, January 2004.
[TL05]
Savio Siu-Hong Tse and Francis C.M. Lau. A short note on the lower bound of dilation for O(logn)-label interval routing. Information Processing Letters, 95(2):351–353, July 2005.
[TL94]
Savio Siu-Hong Tse and Francis C.M. Lau. A lower bound for interval routing in general networks. Technical Report TR-94-09, Department of Computer Science, The University of Hong Kong, July 1994.
[TL95]
Savio Siu-Hong Tse and Francis C.M. Lau. Lower bounds for multi-label interval routing. In Lefteris M. Kirousis and Evangelos Kranakis, editors, 2nd International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 123–134. Carleton University Press, June 1995.
[TL96a]
Savio Siu-Hong Tse and Francis C.M. Lau. Two lower bounds for multi-interval routing. Technical Report TR-96-05, Department of Computer Science, The University of Hong Kong, August 1996.
[TL96b]
Savio Siu-Hong Tse and Francis C.M. Lau. On two-label interval routing. Technical Report TR-96-04, Department of Computer Science, The University of Hong Kong, July 1996.
[TL96c]
Savio Siu-Hong Tse and Francis C.M. Lau. On the space requirement of interval routing. Technical Report TR-96-11, Department of Computer Science, The University of Hong Kong, December 1996.
[TL97]
Savio Siu-Hong Tse and Francis C.M. Lau. Two lower bounds for multi-interval routing. In Proceedings of Computing: The Australasian Theory Symposium (CATS), February 1997. In Asutralian Computer Science Communication, 19(2):36-43.
[TL97a]
Savio Siu-Hong Tse and Francis C.M. Lau. A lower bound for interval routing in general networks. Networks, 29(1):49–53, January 1997.
[TL97b]
Savio Siu-Hong Tse and Francis C.M. Lau. An optimal lower bound for interval routing in general networks. In Danny Krizanc and Peter Widmayer, editors, 4th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 112–124. Carleton Scientific, July 1997.
[TL97c]
Savio Siu-Hong Tse and Francis C.M. Lau. Some lower-bound results on interval routing in planar graphs. Technical Report TR-97-05, Department of Computer Science, The University of Hong Kong, April 1997.
[TL97d]
Savio Siu-Hong Tse and Francis C.M. Lau. More on the efficiency of interval routing. Technical Report TR-97-04, Department of Computer Science, The University of Hong Kong, April 1997.
[TL98]
Savio Siu-Hong Tse and Francis C.M. Lau. More on the efficiency of interval routing. The Computer Journal, 41(4):238–242, 1998.
[TL99]
Savio Siu-Hong Tse and Francis C.M. Lau. Some results on the space requirement of interval routing. In Jean-Claude Bermond, Cyril Gavoille, and André Raspaud, editors, 6th International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 264–279. Carleton Scientific, July 1999.
[TL99a]
Savio Siu-Hong Tse and Francis C.M. Lau. On the space requirement of interval routing. IEEE Transactions on Computers, 48(7):752–757, July 1999.
[TMH08]
Siamak Tazari and Matthias Müller-Hannemann. A faster shortest-paths algorithm for minor-closed graph classes. In 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 5344 of Lecture Notes in Computer Science, pages 360–371. Springer, 2008.
[Todinca06]
Ioan Todinca. Décomposition arborescentes de graphes : calcul, approximations, heuristiques, December 2006. Thèse d'habilitation à diriger les recherches, Université d'Orléan.
[Tofan10]
Radu Tofan. Bordures : de la sélection de vues dans un cube de données au calcul parallèle de fréquents maximaux. PhD thesis, Université Bordeaux 1, Talence, France, September 2011.
[Togni07]
Olivier Togni. Strong chromatic index of products of graphs. Discrete Mathematics & Theoretical Computer Science, 9(1):47–56, January 2007.
[Tovey84]
Craig A. Tovey. A simplified NP-complete satisfiability problem. Discrete Applied Mathematics, 8(1):85–89, April 1984.
[Trehan25]
Amitabh Trehan. Amnesiac flooding and the curious case of unique algorithms. Bulletin of the EATCS (The Distributed Computing Column), 147:74–88, October 2025.
[Trimble21]
James Trimble. Induced universal graphs for families of small graphs. Technical Report 2109.00075v2 [math.CO], arXiv, October 2021.
[Trivisan01]
Luca Trivisan. Non-approximability results for optimization problems on bounded degree instances. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 453–461. ACM Press, July 2001.
[Trotter92]
William T. Trotter. Combinatorics and partially ordered sets: Dimension theory. The Johns Hopkins University Press, 1992.
[Trus84]
Miroslaw Truszczyáski. Note on vertex degrees of planar graphs. Journal of Graph Theory, 8(1):171–176, 1984.
[TS95]
John N. Tsitsiklis and George D. Stamoulis. On the average communication complexity of asynchronous distributed algorithms. Journal of the ACM, 42(2):382–400, March 1995.
[Tse97]
Savio Siu-Hong Tse. The performance of interval routing in general networks. PhD thesis, The University of Hong Kong, March 1997.
[Tsin07]
Yung H. Tsin. A simple 3-edge-connected component algorithm. Theory of Computing Systems, 40(2):125–142, February 2007.
[Tsuchiya88]
Paul F. Tsuchiya. The landmark hierarchy: a new hierarchy for routing in very large networks. ACM SIGCOMM Computer Communication Review, 18(4):35–42, August 1988. Symposium on Communications Architectures and Protocols.
[TT89]
Roberto Tamassia and Ioannis G. Tollis. Planar grid embedding in linear time. IEEE Transactions on Circuits and Systems, 36(9):1230–1234, September 1989.
[TTV09]
Sebastiaan A. Terwijn, Leen Torenvliet, and Paul M.B. Vitányi. Nonapproximablity of the normalized information distance. Technical Report 0910.4353v2 [cs.CC], arXiv, October 2009.
[TTV91]
Roberto Tamassia, Ioannis G. Tollis, and Jeffrey Scott Vitter. Lower bounds for planar orthogonal drawings of graphs. Information Processing Letters, 39(1):35–40, July 1991.
[TUK94]
Atsushi Takahashi, Shuichi Ueno, and Yoji Kajitani. Minimal acyclic forbidden minors for the family of graphs with bounded path-width. Discrete Mathematics, 127(1-3):293–304, March 1994.
[Turan84]
György Turán. On the succinct representation of graphs. Discrete Applied Mathematics, 8(3):289–294, July 1984.
[Turing50]
Alan M. Turing. Computing machinery and intelligence. Mind, New Series, 59(236):433–460, October 1950.
[Tutte56]
William T. Tutte. A theorem on planar graphs. Transactions of the American Mathematical Society, 82(1):99–116, 1956.
[Tutte62]
William T. Tutte. A census of planar triangulations. Canadian Journal of Mathematics, 14:21–38, 1962.
[TV12]
Jan Arne Telle and Yngve Villanger. FPT algorithms for domination in biclique-free graphs. In 20th Annual European Symposium on Algorithms (ESA), volume 7501 of Lecture Notes in Computer Science, pages 802–812. Springer-Verlag, September 2012.
[TV98]
Maurizio Talamo and Paola Vocca. Compact implicit representation of graphs. In J. Hromkovič and O. Sýkora, editors, 24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 1517 of Lecture Notes in Computer Science, pages 164–176. Springer, June 1998.
[TV99]
Maurizio Talamo and Paola Vocca. An efficient data structure for lattice operations. SIAM Journal on Computing, 28(5):1783–1805, 1999.
[TvL84]
Robert Endre Tarjan and Jan van Leeuwen. Worst-case analysis of set union algorithms. Journal of the ACM, 31(2):245–281, March 1984.
[TVZ20]
Vera Traub, Jens Vygen, and Rico Zenklusen. Reducing path TSP to TSP. In 52nd Annual ACM Symposium on Theory of Computing (STOC), pages 14–27. ACM Press, June 2020.
[TW22]
Andrew Thomason and Matthew Wales. On the extremal function for graph minors. Journal of Graph Theory, 101(1):66–78, September 2022.
[TW22a]
Dimitrios M. Thilikos and Sebastian Wiederrecht. Killing a vortex. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1069–1080. IEEE Computer Society Press, October 2022.
[TW24]
Dimitrios M. Thilikos and Sebastian Wiederrecht. Excluding surfaces as minors in graphs. Technical Report 2306.01724v4 [math.CO], arXiv, December 2024.
[TW24a]
Dimitrios M. Thilikos and Sebastian Wiederrecht. Killing a vortex. Journal of the ACM, 71(4):Article No. 27, pp. 1–56, August 2024.
[Twigg06]
David Andrew Twigg. Forbidden-set routing. PhD thesis, University of Cambridge (King's College), December 2006.
[TWZ20]
Konstantinos Tsakalidis, Sebastian Wild, and Viktor Zamaraev. Succinct permutation graphs. Technical Report 2010.04108v1 [cs.DS], arXiv, October 2020.
[TYZ09]
Mingdong Tang, Jing Yang, and Guoqing Zhang. Compact routing on random power law graphs. In 8th IEEE International Conference on Dependable, Autonomic and Secure Computing (DASC), pages 575–578. IEEE, December 2009.
[TZ01]
Mikkel Thorup and Uri Zwick. Compact routing schemes. In 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 1–10. ACM Press, July 2001.
[TZ01a]
Mikkel Thorup and Uri Zwick. Approximate distance oracles. In 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 183–192. ACM Press, July 2001.
[TZ05]
Mikkel Thorup and Uri Zwick. Approximate distance oracles. Journal of the ACM, 52(1):1–24, January 2005.
[TZ06]
Mikkel Thorup and Uri Zwick. Spanners and emulators with sublinear distance errors. In 17th Symposium on Discrete Algorithms (SODA), pages 802–809. ACM-SIAM, January 2006.
[TZ24]
Robert Endre Tarjan and Uri Zwick. Optimal resizable arrays. SIAM Journal on Computing, 53(5):1354–1380, 2024.
[TZ97]
Gábor Tardos and Uri Zwick. The communication complexity of the universal relation. In 12th Annual IEEE Conference on Computational Complexity (CCC), pages 247–259. IEEE Computer Society, June 1997.
[TZH17]
Andrew Tomkins, Min Zhang, and William D. Heavlin. Reviewer bias in single- versus double-blind peer review. Proceedings of the National Academy of Sciences of the USA (PNAS), 114(48):12708–12713, November 2017.
[TZLL13]
Mingdong Tang, Guoqiang Zhang, Tao Lin, and Jianxun Liu. HDLBR: A name-independent compact routing scheme for power-law networks. Computer Communications, 36(3):351–359, February 2013.
[Uehara98]
Ryuhei Uehara. Tractable and intractable problems on generalized chordal graphs. IEICE Technical Report, COMP98-83(685):1–8, March 1999.
[UL97]
Christopher Umans and William Lenhart. Hamiltonian cycles in solid grid graphs. In 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 496–505. IEEE Computer Society Press, October 1997.
[UWY21]
Torsten Ueckerdt, David R. Wood, and Wendy Yi. An improved planar graph product structure theorem. Technical Report 2108.00198v1 [math.CO], arXiv, July 2021.
[UY09]
Kaori Umezawa and Koichi Yamazaki. Tree-length equals branch-length. Discrete Mathematics, 309(13):4656–4660, July 2009.
[Valiant81]
Leslie G. Valiant. Universality considerations in VLSI circuits. IEEE Transactions on Computers, 30(2):135–140, February 1981.
[Valtr95]
Pavel Valtr. Probability that n random points are in convex position. Discrete & Computational Geometry, 13(3-4):637–643, June 1995.
[Valtr96]
Pavel Valtr. Probability that n random points in a triangle are in convex position. Combinatorica, 16(4):567–573, December 1996.
[Vassilevska12]
Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd. In 44th Annual ACM Symposium on Theory of Computing (STOC), pages 887–898. ACM Press, May 2012.
[Vassilevska14]
Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd, January 2014.
[Vazirani06]
Vijay V. Vazirani. Algorithmes d'approximation. Springer, 2006.
[vBHJR19]
Wouter Cames van Batenburg, Tony Huynh, Gwenaël Joret, and Jean-Florent Raymond. A tight Erdős-Pósa function for planar minors. In 30th Symposium on Discrete Algorithms (SODA), pages 1485–1500. ACM Press, January 2019.
[vCott16]
Cornelia A. van Cott. A pi day of the century every year. Math Horizons, 23(3):24–27, February 2016.
[vdBFN22]
Jan van den Brand, Sebastian Forster, and Yasamin Nazari. Fast deterministic fully dynamic distance approximation. In 63rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1011–1022. IEEE Computer Society Press, October 2022.
[VDCL95]
Johan Vounckx, Geert Deconinck, R. Cuyvers, and Rudy Lauwereins. Minimal deadlock-free compact routing in wormhole stwitching based injured meshes. In 2nd Reconfigurable Architectures Workshop (RAW), pages 1–14, 1995.
[VDCLP93]
Johan Vounckx, Geert Deconinck, R. Cuyvers, Rudy Lauwereins, and Jean A. Peperstraete. A survey of compact routing techniques. Manuscript, 1993.
[VDCLP93a]
Johan Vounckx, Geert Deconinck, R. Cuyvers, Rudy Lauwereins, and Jean A. Peperstraete. Network fault-tolerance with interval routing devices. In 11th IASTED International Symposium on Applied Informatics, pages 293–296, May 1993.
[vdH14]
Joris van der Hoeven. Faster relaxed multiplication. In 39th International Symposium on Symbolic and Algebraic Computation (ISSAC), pages 405–412. ACM Press, July 2014.
[VDLP94]
Johan Vounckx, Geert Deconinck, Rudy Lauwereins, and Jean A. Peperstraete. Fault-tolerant compact routing based on reduced structural information in wormhole-switching based networks. In Paola Flocchini, Bernard Mans, and Nicola Santoro, editors, 1st International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 125–147. Carleton University Press, May 1994.
[VDLP94a]
Johan Vounckx, Geert Deconinck, Rudy Lauwereins, and Jean A. Peperstraete. Deadlock-free fault tolerant wormhole routing in mesh based massively parallel systems. Technical Committee on Computer Architecture (TCCA Newsletter), pages 49–54, Summer-Fall 1994.
[vdNdM05]
Maarten van den Nest and Bart de Moor. Edge-local equivalence of graphs. Technical Report math/0510246v1 [math.CO], arXiv, October 2005.
[vEmdeBoas77]
Peter van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters, 6(3):80–82, June 1977.
[Verbitsky95]
Oleg Verbitsky. On the largest common subgraph problem. Technical Report Nr. 95-01, Universität Ulm, Fakultät für Informatik, January 1995.
[vHHM05]
Remco van der Hofstad, Gerard Hooghiemstra, and Piet Van Mieghem. Distances in random graphs with finite variance degrees. Random Structures and Algorithms, 27(1):76–123, August 2005.
[Vigna07]
Sebastiano Vigna. Broadword implementation of rank/select queries, November 1996.
[Vikas96]
Narayan Vikas. An O(n) algorithm for abelian p-group isomorphism and an O(nlogn) algorithm for abelian group isomorphism. Journal of Computer and System Sciences, 53(1):1–9, August 1996.
[vKdB89]
Marc J. van Kreveld and Marc T. de Berg. Finding squares and rectangles in sets of points. Technical Report RUU-CS-89-10, Department of Computer Science, University of Utrecht, Utrecht, April 1989.
[vKdB91]
Marc J. van Kreveld and Marc T. de Berg. Finding squares and rectangles in sets of points. BIT Numerical Mathematics, 31(2):202–219, June 1991.
[vLeeuwen90]
Jan van Leeuwen. Graph algorithms. Handbook of Theoretical Computer Science. A: Algorithm and Complexity Theory. Elsevier, MIT Press, 1990.
[vLT83]
Jan van Leeuwen and Richard B. Tan. Routing with compact routing tables. Technical Report RUU-CS-83-16, Department of Computer Science, University of Utrecht, Utrecht, November 1983.
[vLT85]
Jan van Leeuwen and Richard B. Tan. Interval routing. Technical Report RUU-CS-85-16, Department of Computer Science, University of Utrecht, Utrecht, 1985.
[vLT86]
Jan van Leeuwen and Richard B. Tan. Computer networks with compact routing tables. In G. Rozemberg and A. Salomaa, editors, The Book of L, pages 259–273. Springer-Verlag, 1986.
[vLT87]
Jan van Leeuwen and Richard B. Tan. Interval routing. The Computer Journal, 30(4):298–307, 1987.
[vLT94]
Jan van Leeuwen and Richard B. Tan. Compact routing methods: A survey. In Paola Flocchini, Bernard Mans, and Nicola Santoro, editors, 1st International Colloquium on Structural Information & Communication Complexity (SIROCCO), pages 99–110. Carleton University Press, May 1994.
[vLT95]
Jan van Leeuwen and Richard B. Tan. Compact routing methods: A survey. Technical Report UU-CS-1995-05, Utrecht University, February 1995.
[VPSV02]
Alexei Vázquez, Romualdo Pastor-Satorras, and Alessandro Vespignani. Internet topology at the router and autonomous system level. Technical Report 0206084v1 [cond-mat.dis-nn], arXiv, June 2002.
[vRB08]
Johan M.M. van Rooij and Hans Leo Bodlaender. Design by measure and conquer, a faster exact algorithm for dominating set. In 25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume hal-00255946, pages 657–668. HAL, February 2008.
[vRBR09]
Johan M.M. van Rooij, Hans Leo Bodlaender, and Peter Rossmanith. Dynamic programming on tree decompositions using generalised fast subset convolution. In 17th Annual European Symposium on Algorithms (ESA), volume 5757 of Lecture Notes in Computer Science, pages 566–577. Springer, September 2009.
[vRNvD09]
Johan M.M. van Rooij, Jesper Nederlof, and Thomas C. van Dijk. Inclusion/exclusion meets measure and conquer -- Exact algorithms for counting dominating sets. In 17th Annual European Symposium on Algorithms (ESA), volume 5757 of Lecture Notes in Computer Science, pages 554–565. Springer, September 2009.
[vRSSW23]
André van Renssen, Yuan Sha, Yucheng Sun, and Sampson Wong. The tight spanning ratio of the rectangle Delaunay triangulation. In Inge Li Gørtz, Martín Farach-Colton, Simon J. Puglisi, and Grzegorz Herman, editors, 31st Annual European Symposium on Algorithms (ESA), volume 274 of LIPIcs, pages 99:1–99:15. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, September 2023.
[VTL82]
Jacobo Valdes, Robert Endre Tarjan, and Eugene L. Lawler. The recognition of series parallel diagraphs. SIAM Journal on Computing, 11(2):298–313, May 1982.
[VV05]
Mario Valencia-Pabon and Vera Juan-Carlos. On the diameter of Kneser graphs. Discrete Mathematics, 305(1-3):383–385, 2005.
[VY90]
Gert Vegter and Chee K. Yap. Computational complexity of combinatorial surfaces. In 6th Annual ACM Symposium on Computational Geometry (SoCG), pages 102–111. ACM, 1990.
[WAD09]
Walter Willinger, David Alderson, and John C. Doyle. Mathematics and the internet: A source of enormous confusion and great potential. Notices of the American Mathematical Society, 56(5):586–599, May 2009.
[WAF02]
Peng-Jun Wan, Khaled M. Alzoubi, and Ophir Frieder. Distributed construction of connected dominating set in wireless ad hoc networks. In 21st Annual Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 3, pages 1597–1604, June 2002.
[Wagner36]
Kurt Wagner. Bermerkungen zum Vierfarbenprobleme. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26–32, 1936.
[Wagner37]
Kurt Wagner. Über eine Eigenschaft der ebenen Komplexe. Mathematische Annalen, 114(1):570–590, December 1937.
[Walczak15]
Bartosz Walczak. Minors and dimension. In 26th Symposium on Discrete Algorithms (SODA), pages 1698–1707. ACM-SIAM, January 2015.
[Walczak17]
Bartosz Walczak. Minors and dimension. Journal of Combinatorial Theory, Series B, 122:668–689, January 2017.
[Walden03]
David Walden. The bellman-ford algorithm and ``distributed bellman-ford'', May 2007.
[Walsh98]
Timothy R. Walsh. Generation of well-formed parenthesis strings in constant worst-case time. Journal of Algorithms, 29(1):165–173, October 1998.
[Wan23]
Liangxia Wan. The genus of a graph: A survey. Symmetry, 15(2:322), 2023.
[Wang08]
Xinhui Wang. Exact algorithms for the Steiner tree problem. PhD thesis, CTIT, University of Twente, Netherlands, June 2008.
[Wang25]
Haitao Wang. Shortest paths on convex polyhedral surfaces. In 66th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 2309–2330. IEEE Computer Society Press, December 2025.
[Warlimont93]
Richard Warlimont. Factorisatio numerorum with constraints. Journal of Number Theory, 45(2):186–199, October 1993.
[Warshall62]
Stephen Warshall. A theorem on boolean matrices. Journal of the ACM, 9(1):11–12, January 1962.
[Watkins90]
Mark E. Watkins. Vertex-transitive graphs that are not Cayley graphs. In Gena Hahn, Gert Sabidussi, and Robert E. Woodrow, editors, Cycles and Rays, volume 301 of NATO ASI Series, pages 243–256. Kluwer Academic Publishers, Dordrecht, 1990.
[Wawrzyniak13]
Wojciech Wawrzyniak. Brief announcement: A local approximation algorithm for MDS problem in anonymous planar networks. In 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 406–408. ACM Press, July 2013.
[Wawrzyniak14]
Wojciech Wawrzyniak. A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Information Processing Letters, 114(3):94–98, March 2014.
[Wawrzyniak25]
Wojciech Wawrzyniak. A local 6-approximation distributed algorithm for minimum dominating set problem in planar triangle-free graphs. Algorithms, 18(5):280, 2014.
[WCPHM10]
Anita Williams Woolley, Christopher F. Chabris, Alex Pentland, Nada Hashmi, and Thomas W. Malone. Evidence for a collective intelligence factor in the performance of human groups. Science, 330(6004):686–688, October 2010.
[Wegner67]
G. Wegner. Eigenschaften der Neven homologish-einfacher Familien im Rn. PhD thesis, University of Göttingen, 1967.
[Wei10]
Fang Wei. Efficient graph reachability query answering using tree decomposition. In 4th International Workshop on Reachability Problems (RP), volume 6227 of Lecture Notes in Computer Science, pages 183–197. Springer, August 2010.
[Wei10a]
Fang Wei. TEDI: Efficient shortest path query answering on graphs. In ACM International Conference on Management of Data (SIGMOD), pages 99–110. ACM Press, June 2010.
[Welzl92]
Emo Welzl. On spanning trees with low crossing numbers. In Burkhard Monien and Th. Ottmann, editors, Data structures and efficient algorithms, volume 594 of Lecture Notes in Computer Science, pages 233–249. Springer, 1992.
[Wenger91]
Rephael Wenger. Extremal graphs with no C4's, C6's, or C10's. Journal of Combinatorial Theory, Series B, 52(1):113–116, May 1991.
[West01]
Douglas B. West. Introduction to graph theory. Prentice Hall, 2001.
[West92]
Jeffery R. Westbrook. Fast incremental planarity testing. In 19th International Colloquium on Automata, Languages and Programming (ICALP), volume 623 of Lecture Notes in Computer Science, pages 342–353. Springer-Verlag, July 1992.
[Westera11]
Wim Westera. Phenomenology of sprinting and endurance: Toward a uniform performance assessment model. New Studies in Athletics, 26(1/2):87–99, 2011.
[WH10]
Senlin Wu and Chan He. On the ratios of arc lengths to chord lengths in real Banach spaces. Quaestiones Mathematicae, 33(3):347–367, 2010.
[Whitesides81]
Sue Hays Whitesides. An algorithm for finding clique cut-sets. Information Processing Letters, 12(1):31–32, February 1981.
[Whitney31]
Hassler Whitney. A theorem on graphs. Annals of Mathematics, 32(2):378–390, April 1931.
[Wichmann63]
Brian A. Wichmann. On the representation of 1, 2, ..., n by differences. Journal of the London Mathematical Society, 38(1):465–466, January 1963.
[Wiegers86]
Manfred Wiegers. Recognizing outerplanar graphs in linear time. In Gottfried Tinhofer and Gunther Schmidt, editors, International Workshop on Graph-Theoretic Concepts in Computer Science (WG), volume 246 of Lecture Notes in Computer Science, pages 165–176. Springer, June 1986.
[Wielonsky99]
Franck Wielonsky. Hermite-Padé approximants to exponential functions and an inequality of Mahler. Journal of Number Theory, 74(2):230–249, February 1999.
[Wigderson19]
Avi Wigderson. Mathematics and computation. Princeton University Press, Princeton and Oxford, 2019.
[Wilf82]
Herbert S. Wilf. What is an answer?The American Mathematical Monthly, 89(5):289–292, May 1982.
[Willard00]
Dan E. Willard. Examining computational geometry, Van Emde Boas trees, and hashing from the perspective of the fusion tree. SIAM Journal on Computing, 29(3):1030–1049, 2000.
[Willard83]
Dan E. Willard. Log-logarithmic worst-case range queries are possible in space Θ(n). Information Processing Letters, 17(2):81–84, August 1983.
[Williams09]
R. Ryan Williams. Finding paths of length k in O*(2k) time. Information Processing Letters, 109(6):315–318, February 2009.
[Williams10]
R. Ryan Williams. Alternation-trading proofs, linear programming, and lower bounds. In 27th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 669–680. HAL Inria-00456011, March 2010.
[Williams14]
R. Ryan Williams. Faster all-pairs shortest paths via circuit complexity. In 46th Annual ACM Symposium on Theory of Computing (STOC), pages 664–673. ACM Press, May 2014.
[Williams14a]
R. Ryan Williams. Algorithms for circuits and circuits for algorithms: Connecting the tractable and intractable. In International Congress of Mathematicians (ICM), volume IV, pages 659–682, August 2014.
[Williams19]
R. Ryan Williams. Some estimated likelihoods for computational complexity. In Bernhard Steffen and Gerhard Woeginger, editors, Computing and Software Science: State of the Art and Perspectives, volume 10000 of Lecture Notes in Computer Science, pages 9–26. Springer, Cham, 2019.
[Williams25]
R. Ryan Williams. Simulating time with square-root space. In 57th Annual ACM Symposium on Theory of Computing (STOC), pages 13–23. ACM Press, June 2025.
[Williamson84]
S. Gill Williamson. Depth-first search and Kuratowski subgraphs. Journal of the ACM, 31(4):681–693, October 1984.
[Wilton03]
Henry Wilton. Paulin's theorem, April 2003. Preprint.
[Wing06]
Jeannette M. Wing. Computational thinking. Communications of the ACM, 49(3):33–35, March 2006.
[Winkler83]
Peter Winkler. Proof of the squashed cube conjecture. Combinatorica, 3(1):135–139, March 1983.
[WL06]
Yu Wang and Xiang-Yang Li. Localized construction of bounded degree and planar spanner for wireless ad hoc networks. Mobile Networks & Applications, 11(2):161–175, 2006.
[WL07]
Rui Wang and Francis C.M. Lau. Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices. Discrete Applied Mathematics, 155(17):2312–2320, October 2007.
[WL99]
Jie Wu and Hailan Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM), pages 7–14. ACM Press, 1999.
[WLL04]
Rui Wang, Francis C.M. Lau, and Yan Yan Liu. NP-Completeness results for all-shortest paths interval routing. In 11th International Colloquium on Structural Information & Communication Complexity (SIROCCO), volume 3104 of Lecture Notes in Computer Science, pages 267–278. Springer, June 2004.
[Wollan22]
Paul Wollan. Explicit bounds for graph minors. In Anthony Nixon and Sean Prendiville, editors, Surveys in Combinatorics 2022, volume 481 of London Mathematical Society Lecture Note Series, chapter 7, pages 215–236. Cambridge University Press, 2022.
[Wood02]
David R. Wood. Degree constrained book embeddings. Journal of Algorithms, 45(2):144–154, November 2002.
[Wood02a]
David R. Wood. Queue layouts, tree-width, and three-dimensional graph drawing. In 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS), volume 2556 of Lecture Notes in Computer Science, pages 348–359. Springer, December 2002.
[Wood05]
David R. Wood. Drawing a graph in a hypercube. Technical Report 0509455 [math], arXiv, September 2005.
[Wood08]
David R. Wood. Clique minors in cartesian products of graphs. Technical Report 0711.1189v2, arXiv, January 2008.
[Wood09]
David R. Wood. On tree-partition-width. European Journal of Combinatorics, 30(5):1245–1253, July 2009.
[Wood12]
David R. Wood. Treewidth of cartesian products of highly connected graphs. Journal of Graph Theory, 73(3):318–321, 2012.
[Woodburn89]
R. Louise Woodburn. A 4-color theorem for the Klein bottle. Discrete Mathematics, 76(3):271–276, 1989.
[Woodruff06]
David P. Woodruff. Lower bounds for additive spanners, emulators, and more. In 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 389–398. IEEE Computer Society Press, October 2006.
[Woodruff10]
David P. Woodruff. Additive spanners in nearly quadratic time. In 37th International Colloquium on Automata, Languages and Programming (ICALP), volume 6198 of Lecture Notes in Computer Science (ARCoSS), pages 463–474. Springer, July 2010.
[Wormald18]
Nicholas C. Wormald. Asymptotic enumeration of graphs with given degree sequence. In International Congress of Mathematicians (ICM), volume 4, pages 3263–3282, 2018.
[Wormald99]
Nicholas C. Wormald. Models of random regular graphs. In J.D. Lamb and D.A. Preece, editors, Surveys in Combinatorics, volume 276 of London Mathematical Society Lecture Note Series, pages 239–298. Cambridge University Press, July 1999.
[WP11]
Oren Weimann and David Peleg. A note on exact distance labeling. Information Processing Letters, 111(14):671–673, July 2011.
[Wright71]
Edward M. Wright. Graphs on unlabelled nodes with a given number of edges. Acta Mathematica, 126(1):1–9, 1971.
[Wright72]
Edward M. Wright. The number of unlabelled graphs with many nodes and edges. Bulletin of the American Mathematical Society, 78(6):1032–1034, November 1972.
[WSL19]
Ronald L. Wasserstein, Allen L. Schirm, and Nicole A. Lazar. Moving to a world beyond ''p < 0.05''. The American Statistician, 73(S1):1–19, 2019.
[WT07]
David R. Wood and Jan Arne Telle. Planar decompositions and the crossing number of graphs with an excluded minor. New York Journal of Mathematics, 13:117–146, 2007.
[WTGLS12]
Anduo Wang, Carolyn Talcott, Alexander Gurney, Boon Thau Loo, and Andre Scedrov. Brief announcement: a calculus of policy-based routing systems. In 31st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 343–344. ACM Press, July 2012.
[Wulff11]
Christian Wulff-Nilsen. Separator theorems for minor-free and shallow minor-free graphs with applications. In 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 37–46. IEEE Computer Society Press, October 2011.
[Wulff11a]
Christian Wulff-Nilsen. Separator theorems for minor-free and shallow minor-free graphs with applications. Technical Report 1107.1292v1 [cs.DM], arXiv, July 2011.
[Wulff13]
Christian Wulff-Nilsen. Approximate distance oracles with improved query time. In 24th Symposium on Discrete Algorithms (SODA), pages 539–549. ACM-SIAM, January 2013.
[Wulff13a]
Christian Wulff-Nilsen. Faster deterministic fully-dynamic graph connectivity. In 24th Symposium on Discrete Algorithms (SODA), pages 1757–1769. ACM-SIAM, January 2013.
[Wulff16]
Christian Wulff-Nilsen. Approximate distance oracles for planar graphs with improved query time-space tradeoff. In 27th Symposium on Discrete Algorithms (SODA), pages 351–362. ACM-SIAM, January 2016.
[WVZ21]
Gendi Wang, Matti Vuorinen, and Xiaohui Zhang. On cyclic quadrilaterals in euclidean and hyperbolic geometries. Publicationes Mathematicae Debrecen, 99(1-2):123–140, July 2021.
[WW13]
Christoph Werle and Oliver P. Waldhorst. Everything is better with sprinkles: Greedy routing with bounded stretch. In 2nd International Conference on Future Generation Communication Technology (FGCT), volume 1665 of Lecture Notes in Computer Science, pages 169–177. IEEE, December 2013.
[WW91]
Douglas B. West and Tood G. Will. Vertex degrees in planar graphs. In William T. Trotter, editor, DIMACS Workshop on Planar Graphs, Discrete Mathematics & Theoretical Computer Science, pages 139–149. American Mathematical Society, November 1991.
[WWKC07]
Bang Ye Wua, Hung-Lung Wang, Shih Ta Kuan, and Kun-Mao Chao. On the uniform edge-partition of a tree. Discrete Applied Mathematics, 155(10):1213–1223, May 2007.
[WWL10]
Kai Wang, Rui Wang, and Yan Yan Liu. All-shortest-path 2-interval routing is NP-complete. Journal of Applied Mathematics and Computing, 32(2):479–489, 2010.
[WY07]
Peng-jun Wan and Chih-wei Yi. On the longest edge of gabriel graphs in wireless ad hoc networks. IEEE Transactions on Parallel and Distributed Systems, 18(1):111–125, January 2007.
[WYHW22]
Maoze Wang, Yongbao Yang, Zhenxiang He, and Meiyi Wang. The proof of the 3X+1 Conjecture. Advances in Pure Mathmatics, 12(1):10–28, January 2022.
[WZ00]
Wei Fan Wang and Ke Min Zhang. Equitable colorings of line graphs and complete r-partite graphs. Journal of Systems Science and Mathematical Sciences, 13(2):190–194, April 2000.
[WZ11]
Yaokun Wu and Chengpeng Zhang. Hyperbolicity and chordality of a graph. The Electronic Journal of Combinatorics, 18(1):#P43, 2011.
[WZ13]
David P. Woodruff and Qin Zhang. When distributed computation is communication expensive. In 27th International Symposium on Distributed Computing (DISC), volume 8205 of Lecture Notes in Computer Science, pages 16–30. Springer, October 2013.
[Xia08]
Donglin Xia. Compact routing design in networks of low doubling dimension. PhD thesis, Arizona State University, February 2008.
[Xia11]
Ge Xia. Improved upper bound on the stretch factor of delaunay triangulations. In 27th Annual ACM Symposium on Computational Geometry (SoCG), pages 264–273. ACM, June 2011.
[Xia11a]
Ge Xia. The stretch factor of the Delaunay triangulation is less than 1.998. Technical Report 1103.4361v1 [cs.CG], arXiv, March 2011.
[Xia13]
Ge Xia. The stretch factor of the Delaunay triangulation is less than 1.998. SIAM Journal on Computing, 42(4):1620–1659, 2013.
[XW05]
Baogang Xua and Lusheng Wang. Decomposing toroidal graphs into circuits and edges. Discrete Applied Mathematics, 148(2):147–159, May 2005.
[XZ11]
Ge Xia and Liang Zhang. Toward the tight bound of the stretch factor of Delaunay triangulations. In 23rd Canadian Conference on Computational Geometry (CCCG), August 2011.
[YAK14]
Atsuko Yamaguchi and Kiyoko F. Aoki-Kinoshita. Chemical compound complexity in biological pathways. In Matthias Dehmer and Franck Emmert-Streib, editors, Quantitative Graph Theory: Mathematical Foundations and Applications, Discrete Mathematics and Its Applications, chapter 16, pages 471–493. CRC Press, 2014.
[Yan20]
Mihalis Yannakakis. Planar graphs that need four pages. Journal of Combinatorial Theory, Series B, 145:241–263, November 2020.
[Yan82]
Mihalis Yannakakis. The complexity of the parital order dimension problem. SIAM Journal on Algebraic and Discrete Methods, 3(3):351–358, September 1982.
[Yan86]
Mihalis Yannakakis. Four pages are necessary and sufficient for planar graphs. In 18th Annual ACM Symposium on Theory of Computing (STOC), pages 104–108. ACM Press, May 1986.
[Yan89]
Mihalis Yannakakis. Embedding planar graphs in four pages. Journal of Computer and System Sciences, 38(1):36–67, February 1989.
[Yang92]
Yuan Sheng Yang. On the minimum graphs which contain all small trees. Ars Combinatoria, 34:344–350, January 1992.
[Yao79]
Andrew Chi-Chih Yao. Some complexity questions related to distributive computing. In 11th Annual ACM Symposium on Theory of Computing (STOC), pages 209–213. ACM Press, April 1979.
[Yao82]
Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal on Computing, 11(4):721–736, 1982.
[YBMK15]
Ehsan Najafi Yazdia, Alireza Bagheri, Zahra Moezkarimia, and Hamidreza Keshavarz. An O(1)-approximation algorithm for the 2-dimensional geometric freeze-tag problem. Information Processing Letters, 115(6-8):618–622, June 2015.
[YCW99]
Fung Young Young, Chris C.N. Chu, and Martin D.F. Wong. Generation of universal series-parallel boolean functions. Journal of the ACM, 46(3):416–435, May 1999.
[YLT04]
Aimei Yu, Mei Lu, and Feng Tian. On the spectral radius of graphs. Linear Algebra and its Applications, 387:41–49, August 2004.
[Young08]
Neal E. Young. Greedy set-cover algorithms, pages 379–381. Springer, 2008.
[YR14]
Bernard Ycart and Joel Ratsaby. VC-dimensions of random function classes. Discrete Mathematics & Theoretical Computer Science, 10(1):113–128, January 2014.
[Yuster10]
Raphael Yuster. Single source shortest paths in H-minor free graphs. Theoretical Computer Science, 411(34-36):3042–3047, July 2010.
[YYH04]
Xifeng Yan, Philip S. Yu, and Jiawei Han. Graph indexing: a frequent structure-based approach. In ACM International Conference on Management of Data (SIGMOD), pages 335–346. ACM Press, June 2004.
[YZ05]
Raphael Yuster and Uri Zwick. Answering distance queries in directed graphs using fast matrix multiplication. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 389–396. IEEE Computer Society Press, October 2005.
[YZ24]
Pei Yuan and Shengyu Zhang. Full characterization of the depth overhead for quantum circuit compilation with arbitrary qubit connectivity constraint. Technical Report 2402.02403v1 [quant-ph], arXiv, February 2024.
[Zamir21]
Or Zamir. Breaking the 2n barrier for 5-coloring and 6-coloring. In 48th International Colloquium on Automata, Languages, and Programming (ICALP), volume 198 of LIPIcs, pages 113:1–113:20. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, July 2021.
[ZBG94]
Belkacem Zerrouk, J.M. Blin, and Alain Greiner. Encapsulating networks and routing. In ILLIAD, pages 105–112, 1994.
[ZBG94a]
Belkacem Zerrouk, J.M. Blin, and Alain Greiner. Encapsulating networks and routing. In 8th International Parallel Processing Symposium (IPPS), pages 546–553. IEEE, April 1994.
[Zemmari97]
Akka Zemmari. Routage compact et adaptatif. Rapport de stage de DEA, Université de Bordeaux, 351 cours de la Libération, 33405 Talence cedex, France, June 1997.
[Zemor97]
Gilles Zémor. An upper bound on the size of the snake-in-the-box. Combinatorica, 17(2):287–298, June 1997.
[ZGW09]
Zhao Zhang, Xiafeng Gao, and Weili Wu. Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Theoretical Computer Science, 410(8-10):812–817, March 2009.
[ZH03]
Huaming Zhang and Xin He. Compact visibility representation and straight-line grid embedding of plane graphs. In 8th International Workshop on Algorithms and Data Structures (WADS), volume 2748 of Lecture Notes in Computer Science, pages 493–504. Springer, July 2003.
[ZH06]
Huaming Zhang and Xin He. On simultaneous straight-line grid embedding of a planar graph and its dual. Information Processing Letters, 99(1):1–6, July 2006.
[ZH09]
Rong Zhou and Eric A. Hansen. Combining breadth-first and depth-first strategies in searching for treewidth. In 21st International Joint Conference on Artificial Intelligence (IJCAI), pages 640–645. Morgan Kaufmann Publishers Inc., July 2009.
[Zhang14]
Yitang Zhang. Bounded gaps between primes. Annals of Mathematics, 179(3):1121–1174, May 2014.
[Zhou15]
Hang Zhou. Graph algorithms: Network inference and planar graph optimization. PhD thesis, École Normale Supérieure, Paris, July 2015.
[ZL17]
Chun Jiang Zhu and Kam-Yiu Lam. Source-wise round-trip spanners. Information Processing Letters, 124:42–45, August 2017.
[ZL18]
Chun Jiang Zhu and Kam-Yiu Lam. Deterministic improved round-trip spanners. Information Processing Letters, 129:57–60, January 2018.
[ZM25]
Jieyu Zheng and Markus Meister. The unbearable slowness of being: Why do we live at 10 bits/s?Neuron, 113(2):192–204, January 2025.
[ZN20]
Xin Zhang and Bei Niu. Equitable partition of graphs into induced linear forests. Journal of Combinatorial Optimization, 39(2):581–588, 2020.
[ZP93]
Janez Žerovnik and Tomaž Pisanski. Computing the diameter in multiple-loop networks. Journal of Algorithms, 14(2):226–243, March 1993.
[ZRPGD96]
Belkacem Zerrouk, Vincent Reibaldi, Frédéric Potter, Alain Greiner, and Anne Derieux. RCube: A gigabit serial links low latency adaptive router. In The Records of the IEEE Hot Interconnects IV, Palo Alto CA, U.S.A, August 1996.
[ZSW20]
Yiqing Zhou, E. Miles Stoudenmire, and Xavier Waintal. What limits the simulation of quantum computers?Technical Report 2002.07730v2 [quant-ph], arXiv, March 2020.
[ZTRP94]
Belkacem Zerrouk, S. Tricot, B. Rottembourg, and Lalit M. Patnaik. Proper linear interval routing schemes. Technical Report No 94-29, IBP-MASI, October 1994.
[Zukowski08]
Marek Żukowski. On Bell's Theorem, quantum communication, and entanglement detection. In Foundations of Probability and Physics 5, August 2008.
[ZWDCx20]
Han-Sen Zhong, Hui Wang, Yu-Hao Deng, Ming-Cheng Chen, Li-Chao Peng, Yi-Han Luo, Jian Qin, Dian Wu, Xing Ding, Yi Hu, Peng Hu, Xiao-Yan Yang, Wei-Jun Zhang, Hao Li, Yuxuan Li, Xiao Jiang, Lin Gan, Guangwen Yang, Lixing You, Zhen Wang, Li Li, Nai-Le Liu, Chao-Yang Lu, and Jian-Wei Pan. Quantum computational advantage using photons. Science, 370(6523):1460–1463, December 2020.
[Zwick01]
Uri Zwick. Exact and approximate distances in graphs -- A survey. In Friedhelm Meyer auf der Heide, editor, 9th Annual European Symposium on Algorithms (ESA), volume 2161 of Lecture Notes in Computer Science, pages 33–48. Springer, August 2001.
[Zwick95]
Uri Zwick. The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate. Theoretical Computer Science, 148(1):165–170, August 1995.
[ZZ20]
Doron Zeilberger and Wadim Zudilin. The irrationality measure of 𝜋 is at most 7.103205334137.... Technical Report 1912.06345v2 [math.NT], arXiv, January 2020.
22. Abraham, Ittai 2. Goldberg, Andrew V. 3. Neiman, Ofer 1. Abramsky, Samson 1. Gossa, Julien 2. Nisan, Noam 2. Akitaya, Hugo A. 2. Groenland, Carla 1. Ochem, Pascal 2. Aloupis, Greg 3. Gupta, Anupam 1. Odak, Saeed 5. Alstrup, Stephen 3. Guévremont, Eric 1. Patt-Shamir, Boaz 2. Barenboim, Leonid 2. Halftermeyer, Pierre 13. Paul, Christophe 1. Barillot, Christian 2. Halvorsen, Esben Bistrup 3. Pelc, Andrzej 2. Barrière, Lali 34. Hanusse, Nicolas 26. Peleg, David 4. Baucher, Edgar 1. Herzig, Andreas 6. Perković, Ljubomir 5. Bazzaro, Fabrice 5. Hilaire, Claire 2. Petersen, Holger 1. Beaudouin-Lafon, Michel 2. Iacono, John 6. Picavet, Timothé 1. Bermond, Jean-Claude 11. Ilcinkas, David 5. Pilipczuk, Michał 5. Biniaz, Ahmad 5. Jacques, Amaury 3. Poulalhon, Dominique 11. Bonamy, Marthe 2. Jargot, Bruno 2. Pourzandi, Makan 27. Bonichon, Nicolas 4. Joret, Gwenaël 1. Pykacz, Jarosław 5. Bose, Prosenjit 1. Kachigar, Ghazal 8. Pérennès, Stéphane 3. Cam, Tristan 6. Kanté, Mamadou Moustapha 1. Queinnec, Isabelle 1. Cani, Marie-Paule 3. Kaplan, Haim 3. Raspaud, André 2. Castanet, Richard 2. Katz, Michal 3. Rauhe, Theis 2. Casteigts, Arnaud 2. Katz, Nir A. 3. Raz, Ran 1. Censor-Hillel, Keren 1. Kirchner, Claude 1. Robson, John Michael 1. Chaumette, François 4. Klasing, Ralf 3. Schaeffer, Gilles 3. Chechik, Shiri 2. Kleist, Linda 1. Scheideler, Christian 3. Cohen, Johanne 10. Kosowski, Adrian 1. Seinturier, Lionel 1. Conreur, Gérald 1. Krivine, Jean 5. Smid, Michiel 1. Cortier, Véronique 3. Kuszner, Łukasz 1. Sommer, Christian 6. Courcelle, Bruno 10. Labourel, Arnaud 2. Sopena, Eric 2. Das, Avinandan 1. Lamarre, Philippe 2. Souvaine, Diane 5. de Carufel, Jean-Lou 1. Lamnabhi, Françoise 1. Spirakis, Paul G. 8. Derbel, Bilel 3. Le Borgne, Yvan 2. Suomela, Jukka 2. Desprez, Frédéric 5. Le Bouder, Gabriel 3. Talwar, Kunal 6. Dieng, Youssou 3. Lebhar, Emmanuelle 1. Tellier, Isabelle 5. Diot, Émilie 1. Letournel, Anne-Catherine 2. Theocharous, Leonidas 9. Dourisboure, Yon 3. Lotker, Zvi 2. Thorup, Mikkel 1. Dragan, Feodor F. 1. Ly, Olivier 1. Théoleyre, Fabrice 4. Dross, François 3. Maheshwari, Anil 1. Torres, Serge 4. Dujmović, Vida 1. Majorczyk, Frédéric 1. Touzet, Hélène 3. Duong, Vu 13. Malkhi, Dahlia 1. Truchet, Charlotte 4. Eilam, Tamar 5. Mans, Bernard 1. Tsoukias, Alexandros 2. Elkin, Michael 5. Marcé, Taïssir 3. Twigg, David Andrew 5. Esperet, Louis 3. Markiewicz, Marcin 1. Tylec, Tomasz 6. Ferchaud, Frédéric 3. Martiel, Simon 1. Verleysen, Michel 1. Fijalkow, Inbar 1. Meyer auf der Heide, Friedh 9. Viennot, Laurent 38. Fraigniaud, Pierre 4. Micek, Piotr 6. Wesolek, Alexandra 3. Gengler, Marc 2. Morawietz, Nils 3. Wieder, Udi 1. Gilbert, Seth 4. Morin, Pat 1. Wood, David R. 5. Glacet, Christian 6. Mosbah, Mohamed 1. Yan, Chenyu 5. Godfroy, Quentin 4. Navarra, Alfredo 3. Zemmari, Akka 1. Gogniat, Guy 4. Nehéz, Martin 1. Zémor, Gilles