Referece (349 papers)

  1. [Abel1982] Abel, U. and Bicker, R., "Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph," IEEE Transactions on Reliability, R-31(2): 167--171, 1982.
    DOI: 10.1109/TR.1982.5221285. Bibtex: Abel1982. Problems:437  .
  2. [Acuna2012] Acu\~{n}a, Vicente and Birmel\'{e}, Etienne and Cottret, Ludovic and Crescenzi, Pierluigi and Jourdan, Fabien and Lacroix, Vincent and Marchetti-Spaccamela, Alberto and Marino, Andrea and Milreu, Paulo Vieira and Sagot, Marie-France and Stougie, Leen, "Telling Stories: Enumerating Maximal Directed Acyclic Graphs With a Constrained Set of Sources and Targets," Theoretical Computer Science, 457(0): 1--9, 2012.
    DOI: 10.1016/j.tcs.2012.07.023. Bibtex: Acuna2012. Problems:200  .
  3. [Aichholzer2007] Aichholzer, O. and Aurenhammer, F. and Huemer, C. and Vogtenhuber, B., "Gray Code Enumeration of Plane Straight-Line Graphs," Graphs and Combinatorics, 23(5): 467--479, 2007.
    DOI: 10.1007/s00373-007-0750-z. Bibtex: Aichholzer2007. Problems:255  256  257  .
  4. [Akkoyunlu1973] Akkoyunlu, E. A., "The Enumeration of Maximal Cliques of Large Graphs," SIAM Journal on Computing, 2(1): 1--6, 1973.
    DOI: 10.1137/0202001. Bibtex: Akkoyunlu1973. Problems:33  .
  5. [Alon1997] Alon, N and Yuster, R. and Zwick, U., "Finding and counting given length cycles," Algorithmica, 17(3): 209--223, 1997.
    DOI: 10.1007/BF02523189. Bibtex: Alon1997. Problems:317  .
  6. [Altherr1975] Altherr, W., "An algorithm for enumerating all vertices of a convex polyhedron," Computing, 15(3): 181--193, 1975.
    DOI: 10.1007/BF02242366. Bibtex: Altherr1975. Problems:481  .
  7. [Aringhieri2003] Aringhieri, Roberto and Hansen, Pierre and Malucelli, Federico, "Chemical trees enumeration algorithms," 4OR, 1(1): 67--83, 2003.
    DOI: 10.1007/s10288-002-0008-9. Bibtex: Aringhieri2003. Problems:289  .
  8. [Avis1996] Avis, David and Fukuda, Komei, "Reverse search for enumeration," Discrete Applied Mathematics, 65(1-3): 21--46, 1996.
    DOI: 10.1016/0166-218X(95)00026-N. Bibtex: Avis1996. Problems:322  323  324  325  326  327  .
  9. [Avis1996b] Avis, David, "Generating Rooted Triangulations Without Repetitions," Algorithmica, 16(6): 618--632, 1996.
    DOI: 10.1007/BF01944353. Bibtex: Avis1996b. Problems:320  321  .
  10. [Azevedo1993] Azevedo, Jos\'{e}Augusto and {Santos Costa}, Maria Em\'{\i}lia O. and {Silvestre Madeira}, Joaquim Jo\~{a}o E.R. and {Vieira Martins}, Ernesto Q., "An algorithm for the ranking of shortest paths," European Journal of Operational Research, 69(1): 97--106, 1993.
    DOI: 10.1016/0377-2217(93)90095-5. Bibtex: Azevedo1993. Problems:56  .
  11. [Babic1993] Babi\'{c}, Darko and Graovac, Ante, "Enumeration of Acyclic Walks in a Graph," Discrete Applied Mathematics, 45(2): 117--123, 1993.
    DOI: 10.1016/0166-218X(93)90055-S. Bibtex: Babic1993. Problems:45  .
  12. [Bagan2007a] Bagan, Guillaume and Durand, Arnaud and Grandjean, Etienne, "On Acyclic Conjunctive Queries and Constant Delay Enumeration," In: Duparc, Jacques and Henzinger, Thomas A., CSL 2007: the 21st International Workshop on Computer Science Logic, Vol. 4646 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 208--222, Lausanne, Switzerland, sep, 2007.
    DOI: 10.1007/978-3-540-74915-8_18. Bibtex: Bagan2007a. Problems:259  .
  13. [Balinski1961] Balinski, M. L., "An Algorithm for Finding All Vertices of Convex Polyhedral Sets," Journal of the Society for Industrial and Applied Mathematics, 9(1): 72--88, 1961.
    DOI: 10.1137/0109008. Bibtex: Balinski1961. Problems:467  .
  14. [Bapiraju1994] Bapiraju, Vinnakota and Rao, V.V.Bapeswara, "Enumeration of binary trees," Information Processing Letters, 51(3): 125--127, 1994.
    DOI: 10.1016/0020-0190(94)00083-2. Bibtex: Bapiraju1994. Problems:333  .
  15. [Barbosa1999] Barbosa, Valmir C. and Szwarcfiter, Jayme L., "Generating all the acyclic orientations of an undirected graph," Information Processing Letters, 72(1-2): 71--74, 1999.
    DOI: 10.1016/S0020-0190(99)00120-9. Bibtex: Barbosa1999. Problems:304  .
  16. [Basavaraju2014] Basavaraju, Manu and Heggernes, Pinar and {van ’t Hof}, Pim and Saei, Reza and Villanger, Yngve, "Maximal Induced Matchings in Triangle-Free Graphs," In: Kratsch, Dieter and Todinca, Ioan, WG 2014: the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 8747 of Lecture Notes in Computer Science, Springer International Publishing, pp. 93--104, Nouan-le-Fuzelier, France, jun, 2014.
    DOI: 10.1007/978-3-319-12340-0_8. Bibtex: Basavaraju2014. Problems:423  .
  17. [Bauer2010a] Bauer, Reinhard and Krug, M and Wagner, D, "Enumerating and Generating Labeled k-degenerate Graphs," In: Sedgewick, Robert and Golin, Mordecai, ANALCO 2010: the 7th Workshop on Analytic Algorithmics and Combinatorics, Vol. None of None, Society for Industrial and Applied Mathematics, pp. 90--98, Austin, Texas, USA, jan, 2010.
    DOI: 10.1137/1.9781611973006.12. Bibtex: Bauer2010a. Problems:30  31  .
  18. [Beigel1999] Beigel, Richard, "Finding maximum independent sets in sparse and general graphs," In: Tarjan, Robert E. and Warnow, Tandy, SODA 1999: the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. None of None, Society for Industrial and Applied Mathematics, pp. 856--857, Omni Inner Harbor Hotel, Baltimore, Maryland, USA, jan, 1999.
    URI: http://dl.acm.org/citation.cfm?id=314500.314969. Bibtex: Beigel1999. Problems:305  306  307  308  .
  19. [Bellert1962] Bellert, S., "Topological analysis and synthesis of linear systems," Journal of the Franklin Institute, 274(6): 425--443, 1962.
    DOI: 10.1016/0016-0032(62)90042-X. Bibtex: Bellert1962. Problems:478  .
  20. [Bereg2005] Bereg, Sergey, "Enumerating pseudo-triangulations in the plane," Computational Geometry, 30(3): 207--222, 2005.
    DOI: 10.1016/j.comgeo.2004.09.002. Bibtex: Bereg2005. Problems:279  .
  21. [Berry2000] Berry, Anne and Bordat, Jean-Paul and Cogis, Olivier, "Generating All the Minimal Separators of a Graph," International Journal of Foundations of Computer Science, 11(03): 397--403, 2000.
    DOI: 10.1142/S0129054100000211. Bibtex: Berry2000. Problems:301  .
  22. [Bespamyatnikh2002] Bespamyatnikh, Sergei, "An efficient algorithm for enumeration of triangulations," Computational Geometry, 23(3): 271--279, 2002.
    DOI: 10.1016/S0925-7721(02)00111-6. Bibtex: Bespamyatnikh2002. Problems:19  .
  23. [Beyer1980] Beyer, Terry and Hedetniemi, Sandra Mitchell, "Constant Time Generation of Rooted Trees," SIAM Journal on Computing, 9(4): 706--712, 1980.
    DOI: 10.1137/0209055. Bibtex: Beyer1980. Problems:378  .
  24. [Birmele2012] Birmel\'{e}, E and Crescenzi, Pierluigi and Ferreira, Rui, "Efficient bubble enumeration in directed graphs," In: Calder\'{o}n-Benavides, Liliana and Gonz\'{a}lez-Caro, Cristina and Ch\'{a}vez, Edgar and Ziviani, Nivio, SPIRE 2012: the 19th International Symposium String Processing and Information Retrieval, Vol. 7608 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 118--129, Cartagena de Indias, Colombia, oct, 2012.
    DOI: 10.1007/978-3-642-34109-0_13. Bibtex: Birmele2012. Problems:9  .
  25. [Bitner1976] Bitner, James R. and Ehrlich, Gideon and Reingold, Edward M., "Efficient generation of the binary reflected gray code and its applications," Communications of the ACM, 19(9): 517--521, 1976.
    DOI: 10.1145/360336.360343. Bibtex: Bitner1976. Problems:387  .
  26. [Bonamy2019] Bonamy, Marthe and Defrain, Oscar and Heinrich, Marc and Raymond, Jean-Florent, "{Enumerating Minimal Dominating Sets in Triangle-Free Graphs}," In: Niedermeier, Rolf and Paul, Christophe, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Vol. 126 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 16:1----16:12, Dagstuhl, Germany, None, 2019.
    DOI: 10.4230/LIPIcs.STACS.2019.16. Bibtex: Bonamy2019. Problems:502  .
  27. [Borassi2013] Borassi, Michele and Crescenzi, Pierluigi and Lacroix, Vincent and Marino, Andrea and Sagot, Marie-France and Milreu, Paulo Vieira, "Telling stories fast: Via linear-time delay pitch enumeration," In: Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto, SEA 2013: the 12th International Symposium on Experimental Algorithms, Vol. 7933 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 200--211, Rome, Italy, jun, 2013.
    DOI: 10.1007/978-3-642-38527-8_19. Bibtex: Borassi2013. Problems:16  .
  28. [Boros2000a] Boros, E. and Gurvich, V. and Elbassioni, K. and Khachiyan, L., "An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension," Parallel Processing Letters, 10(04): 253--266, 2000.
    DOI: 10.1142/S0129626400000251. Bibtex: Boros2000a. Problems:299  .
  29. [Boros2004] Boros, Endre and Elbassioni, Khaled, "Generating maximal independent sets for hypergraphs with bounded edge-intersections," In: Farach-Colton, Mart\'{\i}n, LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics, Vol. 2976 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 488--498, Aires, Argentina, apr, 2004.
    DOI: 10.1007/978-3-540-24698-5_52. Bibtex: Boros2004. Problems:139  140  141  .
  30. [Boros2004a] Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir, "Generating paths and cuts in multi-pole (di) graphs," In: Fiala, Jiř\'{\i} and Koubek, V\'{a}clav and Kratochv\'{\i}l, Jan, MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science, Vol. 3153 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 298--309, Prague, Czech Republic, aug, 2004.
    DOI: 10.1007/978-3-540-28629-5_21. Bibtex: Boros2004a. Problems:286  287  .
  31. [Boros2004b] Boros, E and Elbassioni, K and Gurvich, V and Khachiyan, L, "Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems," In: Bienstock, Daniel and Nemhauser, George, ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization, Vol. 3064 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 152--162, New York, NY, USA, jun, 2004.
    DOI: 10.1007/978-3-540-25960-2_12. Bibtex: Boros2004b. Problems:129  .
  32. [Boros2006] Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir, "Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms," Journal of Graph Theory, 53(3): 209--232, 2006.
    DOI: 10.1002/jgt.20180. Bibtex: Boros2006. Problems:132  133  134  .
  33. [Boros2007] Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa and Rudolf, Gabor, "Generating Minimal k-Vertex Connected Spanning Subgraphs," In: Lin, Guohui, COCOON 2007: the 13th Annual International Conference on Computing and Combinatorics, Vol. 4598 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 222--231, Banff, Canada, jul, 2007.
    DOI: 10.1007/978-3-540-73545-8_23. Bibtex: Boros2007. Problems:138  .
  34. [Bouchitte2002] Bouchitt{\'e}, Vincent and Todinca, Ioan, "Listing all potential maximal cliques of a graph," Theoretical Computer Science, 276(1): 17--32, 2002.
    DOI: 10.1016/S0304-3975(01)00007-X. Bibtex: Bouchitte2002. Problems:448  .
  35. [Bowen1967a] Bowen, Robert and Fisk, Stephen, "Generations of triangulations of the sphere," Mathematics of Computation, 21(98): 250--250, 1967.
    DOI: 10.1090/S0025-5718-1967-0223277-3. Bibtex: Bowen1967a. Problems:394  .
  36. [Bowen1967b] Bowen, Robert, "The generation of minimal triangle graphs," Mathematics of Computation, 21(98): 248--248, 1967.
    DOI: 10.1090/S0025-5718-1967-0223276-1. Bibtex: Bowen1967b. Problems:395  .
  37. [Brinkmann2011] Brinkmann, Gunnar and Goedgebeur, Jan and McKay, BD, "Generation of cubic graphs," Discrete Mathematics and Theoretical Computer Science, 13(2): 69--80, 2011.
    URI: http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/viewArticle/1801. Bibtex: Brinkmann2011. Problems:426  .
  38. [Bron1973] Bron, Coen and Kerbosch, Joep, "Algorithm 457: finding all cliques of an undirected graph," Communications of the ACM, 16(9): 575--577, 1973.
    DOI: 10.1145/362342.362367. Bibtex: Bron1973. Problems:188  .
  39. [Bronnimann2006a] Br\"{o}nnimann, Herv\'{e} and Kettner, Lutz and Pocchiola, Michel and Snoeyink, Jack, "Counting and Enumerating Pointed Pseudotriangulations With the Greedy Flip Algorithm," SIAM Journal on Computing, 36(3): 721--739, 2006.
    DOI: 10.1137/050631008. Bibtex: Bronnimann2006a. Problems:265  .
  40. [Bulo2007] Bulo, Sr and Torsello, Andrea and Pelillo, Marcello, "A continuous-based approach for partial clique enumeration," In: Escolano, Francisco and Vento, Mario, GbRPR 2007: the 6th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, Vol. 4538 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 61--70, Alicante, Spain, jun, 2007.
    DOI: 10.1007/978-3-540-72903-7_6. Bibtex: Bulo2007. Problems:260  .
  41. [Burdet1974] Burdet, Claude-Alain, "Generating All the Faces of a Polyhedron," SIAM Journal on Applied Mathematics, 26(3): 479--489, 1974.
    DOI: 10.1137/0126045. Bibtex: Burdet1974. Problems:464  .
  42. [Bussieck1998] Bussieck, Michael R and L\"{u}bbecke, Marco E, "The vertex set of a 1/2-polytope is strongly P-enumerable," Computational Geometry, 11(2): 103--109, 1998.
    DOI: 10.1016/S0925-7721(98)00021-2. Bibtex: Bussieck1998. Problems:142  .
  43. [Byskov2004] Byskov, Jesper Makholm, "Enumerating maximal independent sets with applications to graph colouring," Operations Research Letters, 32(6): 547--556, 2004.
    DOI: 10.1016/j.orl.2004.03.002. Bibtex: Byskov2004. Problems:451  452  453  .
  44. [Canfield1995] Canfield, E. Rodney and Williamson, S. Gill, "A loop-free algorithm for generating the linear extensions of a poset," Order, 12(1): 57--75, 1995.
    DOI: 10.1007/BF01108590. Bibtex: Canfield1995. Problems:330  .
  45. [Cattell2000] Cattell, Kevin and Ruskey, Frank and Sawada, Joe and Serra, Micaela and Miers, C.Robert, "Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials Over GF(2)," Journal of Algorithms, 37(2): 267--282, 2000.
    DOI: 10.1006/jagm.2000.1108. Bibtex: Cattell2000. Problems:303  .
  46. [Chandran2001] Chandran, LS, "A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph," In: Wang, Jie, COCOON 2001: the 7th Annual International Conference Computing and Combinatorics, Vol. 2108 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 308--317, Guilin, China, aug, 2001.
    DOI: 10.1007/3-540-44679-6_34. Bibtex: Chandran2001. Problems:296  .
  47. [Chandran2003] Chandran, L.S. and Ibarra, L. and Ruskey, F. and Sawada, J., "Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph," Theoretical Computer Science, 307(2): 303--317, 2003.
    DOI: 10.1016/S0304-3975(03)00221-4. Bibtex: Chandran2003. Problems:290  .
  48. [Chang1994a] Chang, Y.H. and Wang, J.S. and Lee, R.C.T., "Generating all maximal independent sets on trees in lexicographic order," Information Sciences, 76(3-4): 279--296, 1994.
    DOI: 10.1016/0020-0255(94)90013-2. Bibtex: Chang1994a. Problems:334  .
  49. [Chang2013] Chang, Lijun and Yu, Jeffrey Xu and Qin, Lu, "Fast Maximal Cliques Enumeration in Sparse Graphs," Algorithmica, 66(1): 173--186, 2013.
    DOI: 10.1007/s00453-012-9632-8. Bibtex: Chang2013. Problems:34  .
  50. [Char1968] Char, J., "Generation of Trees, Two-Trees, and Storage of Master Forests," IEEE Transactions on Circuit Theory, 15(3): 228--238, 1968.
    DOI: 10.1109/TCT.1968.1082817. Bibtex: Char1968. Problems:468  469  .
  51. [Char1970] Char, J.P., "Master circuit matrix," Proceedings of the Institution of Electrical Engineers, 117(8): 1655, 1970.
    DOI: 10.1049/piee.1970.0292. Bibtex: Char1970. Problems:429  .
  52. [Chegireddy1987] Chegireddy, Chandra R. and Hamacher, Horst W., "Algorithms for finding K-best perfect matchings," Discrete Applied Mathematics, 18(2): 155--165, 1987.
    DOI: 10.1016/0166-218X(87)90017-5. Bibtex: Chegireddy1987. Problems:57  .
  53. [Cheng2011] Cheng, James and Ke, Yiping and Fu, Ada Wai-Chee and Yu, Jeffrey Xu and Zhu, Linhong, "Finding maximal cliques in massive networks," ACM Transactions on Database Systems, 36(4): 1--34, 2011.
    DOI: 10.1145/2043652.2043654. Bibtex: Cheng2011. Problems:207  .
  54. [Cheng2012b] Cheng, James and Zhu, Linhong and Ke, Yiping and Chu, Shumo, "Fast algorithms for maximal clique enumeration with limited memory," In: Yang, Qiang, KDD 2012: the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, Vol. None of None, ACM Press, pp. 1240, Beijing, China, aug, 2012.
    DOI: 10.1145/2339530.2339724. Bibtex: Cheng2012b. Problems:201  .
  55. [Chiba1985] Chiba, Norishige and Nishizeki, Takao, "Arboricity and Subgraph Listing Algorithms," SIAM Journal on Computing, 14(1): 210--223, 1985.
    DOI: 10.1137/0214017. Bibtex: Chiba1985. Problems:182  183  184  185  .
  56. [Cohen2006] Cohen, Sara and Fadida, Itzhak and Kanza, Yaron and Kimelfeld, Benny and Sagiv, Yehoshua, "Full disjunctions: polynomial-delay iterators in action," In: Dayal, Umeshwar and Whang, Khu-Yong and Lomet David and Alonso Gustavo and Lohman Guy and Kersten Martin and K. Cha Sang and Kim Young-Kuk, VLDB 2006: the 32nd international conference on Very Large Data Bases, Vol. None of None, VLDB Endowment, pp. 739--750, COEX, Seoul, Korea, sep, 2006.
    URI: http://dl.acm.org/citation.cfm?id=1182635.1164191. Bibtex: Cohen2006. Problems:266  .
  57. [Cohen2008] Cohen, Sara and Kimelfeld, Benny and Sagiv, Yehoshua, "Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties," Journal of Computer and System Sciences, 74(7): 1147--1159, 2008.
    DOI: 10.1016/j.jcss.2008.04.003. Bibtex: Cohen2008. Problems:253  .
  58. [Conte2016] Conte, Alessio and Grossi, Roberto and Marino, Andrea and Versari, Luca, "Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques," In: {Ioannis Chatzigiannakis Michael Mitzenmacher}, Yuval Rabani and Sangiorgi, Davide, ICALP 2016: the 43rd International Colloquium on Automata, Languages, and Programming, Vol. 55 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, pp. 148:1----148:15, Dagstuhl, Germany, None, 2016.
    DOI: 10.4230/LIPIcs.ICALP.2016.148. Bibtex: Conte2016. Problems:470  .
  59. [Conte2017] Conte, Alessio and Kant{\'{e}}, Mamadou Moustapha and Otachi, Yota and Uno, Takeaki and Wasa, Kunihiro, "Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph," In: Cao, Yixin and Chen, Jianer, COCOON 2017: the 23rd Annual International Computing and Combinatorics Conference, Vol. 10392 of Lecture Notes in Computer Science, Springer International Publishing, pp. 150--161, None, None, 2017.
    DOI: 10.1007/978-3-319-62389-4_13. Bibtex: Conte2017. Problems:439  .
  60. [Conte2018] Conte, Alessio and Grossi, Roberto and Marino, Andrea and Rizzi, Romeo, "{Efficient enumeration of graph orientations with sources}," Discrete Applied Mathematics, 246(None): 22--37, 2018.
    DOI: 10.1016/j.dam.2017.08.002. Bibtex: Conte2018. Problems:513  514  515  516  517  .
  61. [Conte2019] Conte, Alessio and Uno, Takeaki, "{New polynomial delay bounds for maximal subgraph enumeration by proximity search}," In: None, Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, Vol. None of None, ACM Press, pp. 1179--1190, New York, New York, USA, None, 2019.
    DOI: 10.1145/3313276.3316402. Bibtex: Conte2019. Problems:503  504  505  506  507  508  509  510  511  512  .
  62. [Courcelle2009c] Courcelle, Bruno, "Linear delay enumeration and monadic second-order logic," Discrete Applied Mathematics, 157(12): 2675--2700, 2009.
    DOI: 10.1016/j.dam.2008.08.021. Bibtex: Courcelle2009c. Problems:223  .
  63. [Couturier2013a] Couturier, Jean-Fran{\c{c}}ois and Heggernes, Pinar and {van 't Hof}, Pim and Kratsch, Dieter, "Minimal dominating sets in graph classes: Combinatorial bounds and enumeration," Theoretical Computer Science, 487(None): 82--94, 2013.
    DOI: 10.1016/j.tcs.2013.03.026. Bibtex: Couturier2013a. Problems:457  458  459  460  461  462  463  .
  64. [Creignou2011] Creignou, Nadia and Olive, Fr\'{e}d\'{e}ric and Schmidt, Johannes, "Enumerating all solutions of a Boolean CSP by non-decreasing weight," In: Sakallah, Karem A. and Simon, Laurent, SAT 2011: the 14th International Conference Theory and Applications of Satisfiability Testing, Vol. 6695 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 120--133, Ann Arbor, MI, USA,, jun, 2011.
    DOI: 10.1007/978-3-642-21581-0_11. Bibtex: Creignou2011. Problems:205  .
  65. [DOGRUSOZ1996] DO\bar{G}RUS\"OZ, U. and KRISHNAMOORTHY, M. S., "ENUMERATING ALL CYCLES OF A PLANAR GRAPH," Parallel Algorithms and Applications, 10(1-2): 21--36, 1996.
    DOI: 10.1080/10637199608915603. Bibtex: DOGRUSOZ1996. Problems:489  .
  66. [Daigo2009] Daigo, Taishin and Hirata, Kouichi, "On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay," In: Nielsen, Mogens and Ku\v{c}era, Anton\'{\i}n and Miltersen, Peter Bro and Palamidessi, Catuscia and Tůma, Petr and Valencia, Frank, SOFSEM 2009: the 35th Conference on Current Trends in Theory and Practice of Computer Science, Vol. 5404 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 181--192, \v{S}pindlerův Ml\'{y}n, Czech Republic, jan, 2009.
    DOI: 10.1007/978-3-540-95891-8_19. Bibtex: Daigo2009. Problems:40  .
  67. [Damaschke2006] Damaschke, Peter, "Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction," Theoretical Computer Science, 351(3): 337--350, 2006.
    DOI: 10.1016/j.tcs.2005.10.004. Bibtex: Damaschke2006. Problems:267  268  269  .
  68. [Danielson1968] Danielson, G., "On finding the simple paths and circuits in a graph," IEEE Transactions on Circuit Theory, 15(3): 294--295, 1968.
    DOI: 10.1109/TCT.1968.1082837. Bibtex: Danielson1968. Problems:414  415  .
  69. [Dershowitz1975] Dershowitz, Nachum, "A simplified loop-free algorithm for generating permutations," BIT, 15(2): 158--164, 1975.
    DOI: 10.1007/BF01932689. Bibtex: Dershowitz1975. Problems:404  .
  70. [Deza1993] Deza, Antoine and Fukuda, K and Rosta, Vera, "Wagner's theorem and combinatorial enumeration of 3-polytopes," Research reports on information sciences. Ser. B, Operations research, 271(-): 1--5, 1993.
    URI: http://ci.nii.ac.jp/naid/110000025461/. Bibtex: Deza1993. Problems:339  .
  71. [Dias2005] Dias, V\^{a}nia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L., "Generating Bicliques of a Graph in Lexicographic Order," Theoretical Computer Science, 337(1-3): 240--248, 2005.
    DOI: 10.1016/j.tcs.2005.01.014. Bibtex: Dias2005. Problems:280  .
  72. [Dickerson1992] Dickerson, Matthew T. and Drysdale, R.L. Scot and Sack, J\"{o}rg-R\"{u}diger, "Simple Algorithms for Enumerating Interpoint Distances and Finding K Nearest Neighbors," International Journal of Computational Geometry \& Applications, 02(03): 221--239, 1992.
    DOI: 10.1142/S0218195992000147. Bibtex: Dickerson1992. Problems:46  .
  73. [Dourado2014] Dourado, Mitre C. and Oliveira, Rodolfo A. and Protti, F\'{a}bio, "Algorithmic Aspects of Steiner Convexity and Enumeration of Steiner Trees," Annals of Operations Research, 223(1): 155--171, 2014.
    DOI: 10.1007/s10479-014-1607-5. Bibtex: Dourado2014. Problems:263  .
  74. [Du2009] Du, Nan and Wu, Bin and Xu, Liutong and Wang, Bai and Pei, Xin, "A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network," In: None, ICDMW 2006: the 6th IEEE International Conference on Data Mining - Workshops, Vol. None of None, IEEE, pp. 320--324, Hong Kong, China, dec, 2006.
    DOI: 10.1109/ICDMW.2006.17. Bibtex: Du2009. Problems:222  .
  75. [Dumitrescu2001] Dumitrescu, Adrian and G\"{a}rtner, Bernd and Pedroni, Samuele and Welzl, Emo, "Enumerating triangulation paths," Computational Geometry, 20(1-2): 3--12, 2001.
    DOI: 10.1016/S0925-7721(01)00031-1. Bibtex: Dumitrescu2001. Problems:297  .
  76. [Durand2007] Durand, Arnaud and Grandjean, Etienne, "First-order queries on structures of bounded degree are computable with constant delay," ACM Transactions on Computational Logic, 8(4): 18, 2005.
    DOI: 10.1145/1276920.1276923. Bibtex: Durand2007. Problems:262  .
  77. [Durand2011] Durand, Arnaud and Strozecki, Yann, "Enumeration Complexity of Logical Query Problems with Second-order Variables," In: Bezem, Marc, CSL 2011: the 25th International Workshop/20th Annual Conference of the EACSL - Computer Science Logic, Vol. 12 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 189--202, Dagstuhl, Germany, aug, 2011.
    DOI: 10.4230/LIPIcs.CSL.2011.189. Bibtex: Durand2011. Problems:206  .
  78. [Dyer1977] Dyer, M. E. and Proll, L. G., "An algorithm for determining all extreme points of a convex polytope," Mathematical Programming, 12(1): 81--96, 1977.
    DOI: 10.1007/BF01593771. Bibtex: Dyer1977. Problems:482  .
  79. [Ehrenfeucht1973] Ehrenfeucht, Andrzej and Fosdick, Lloyd D. and Osterweil, Leon J., "An algorithm for finding the elementary circuits of a directed graph," CU-CS-024-23 of Dept. of Computer Sci., Univ. of Colorado, Boulder, 1973.
    URI: http://scholar.colorado.edu/csci_techreports/23. Bibtex: Ehrenfeucht1973. Problems:430  .
  80. [Ehrlich1973a] Ehrlich, Gideon, "Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations," Journal of the ACM, 20(3): 500--513, 1973.
    DOI: 10.1145/321765.321781. Bibtex: Ehrlich1973a. Problems:405  .
  81. [Eppstein1992] Eppstein, David, "Finding the k smallest spanning trees," BIT, 32(2): 237--248, 1992.
    DOI: 10.1007/BF01994879. Bibtex: Eppstein1992. Problems:47  48  49  50  .
  82. [Eppstein1997] Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon, "Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms," Journal of the ACM, 44(5): 669--696, 1997.
    DOI: 10.1145/265910.265914. Bibtex: Eppstein1997. Problems:59  60  .
  83. [Eppstein1998] Eppstein, David, "Finding the K Shortest Paths," SIAM Journal on Computing, 28(2): 652--673, 1998.
    DOI: 10.1137/S0097539795290477. Bibtex: Eppstein1998. Problems:58  .
  84. [Eppstein2003a] Eppstein, David, "Small Maximal Independent Sets and Faster Exact Graph Coloring," Journal of Graph Algorithms and Applications, 7(2): 131--140, 2003.
    DOI: 10.7155/jgaa.00064. Bibtex: Eppstein2003a. Problems:291  .
  85. [Eppstein2010] Eppstein, David and L\"{o}ffler, M and Strash, Darren, "Listing all maximal cliques in sparse graphs in near-optimal time," In: Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo, ISAAC 2010: the 21st International Symposium on Algorithms and Computation, Vol. 6506 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 403--414, Jeju Island, Korea, dec, 2010.
    DOI: 10.1007/978-3-642-17517-6_36. Bibtex: Eppstein2010. Problems:210  .
  86. [Eppstein2014] Eppstein, David, "$K$-Best Enumeration," None, None(arXiv ID: 1412.5075): None, 2014.
    URI: http://arxiv.org/abs/1412.5075. Bibtex: Eppstein2014. Problems:338  .
  87. [Er1983] Er, M. C., "A Note on Generating Well-Formed Parenthesis Strings Lexicographically," The Computer Journal, 26(3): 205--207, 1983.
    DOI: 10.1093/comjnl/26.3.205. Bibtex: Er1983. Problems:372  .
  88. [Er1985] Er, M. C., "Enumerating Ordered Trees Lexicographically," The Computer Journal, 28(5): 538--542, 1985.
    DOI: 10.1093/comjnl/28.5.538. Bibtex: Er1985. Problems:365  .
  89. [Er1987] Er, M. C., "Lexicographic Listing and Ranking of T-Ary Trees," The Computer Journal, 30(6): 569--572, 1987.
    DOI: 10.1093/comjnl/30.6.569. Bibtex: Er1987. Problems:355  .
  90. [Er1992] Er, M. C., "Efficient Generation of K-Ary Trees in Natural Order," The Computer Journal, 35(3): 306--308, 1992.
    DOI: 10.1093/comjnl/35.3.306. Bibtex: Er1992. Problems:344  .
  91. [Fenner1980] Fenner, T. I., "A binary tree representation and related algorithms for generating integer partitions," The Computer Journal, 23(4): 332--337, 1980.
    DOI: 10.1093/comjnl/23.4.332. Bibtex: Fenner1980. Problems:396  .
  92. [Fernau2006] Fernau, Henning, "Edge dominating set: Efficient enumeration-based exact algorithms," In: Bodlaender, Hans L. and Langston, Michael A., IWPEC 2006: the 2nd International Workshop on Parameterized and Exact Computation, Vol. 4169 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 142--153, Z\"{u}rich, Switzerland, sep, 2006.
    DOI: 10.1007/11847250_13. Bibtex: Fernau2006. Problems:264  .
  93. [Ferreira2011] Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo, "Output-sensitive listing of bounded-size trees in undirected graphs," In: Demetrescu, Camil and Halld\'{o}rsson, Magn\'{u}s M., ESA 2011: the 19th Annual European Symposium on Algorithms, Vol. 6942 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 275--286, Saarbr\"{u}cken, Germany, sep, 2011.
    DOI: 10.1007/978-3-642-23719-5_24. Bibtex: Ferreira2011. Problems:2  .
  94. [Ferreira2012] Birmel\'{e}, Etienne and Ferreira, Rui and Grossi, Roberto and Marino, Andrea and Pisanti, Nadia and Rizzi, Romeo and Sacomoto, Gustavo, "Optimal Listing of Cycles and st-Paths in Undirected Graphs," In: Khanna, Sanjeev, SODA 2012: the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, Vol. None of None, None, pp. 1884--1896, New Orleans, LA, USA, jan, 2012.
    DOI: 10.1137/1.9781611973105.134. Bibtex: Ferreira2012. Problems:5  10  .
  95. [Ferreira2014] Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo and Sacomoto, Gustavo and Marie-France, Sagot, "Amortized $\tilde\{O\}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs," In: Schulz, Andreas S. and Wagner, Dorothea, ESA 2014: the 22th Annual European Symposium on Algorithms, Vol. 8737 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 418--429, Wroclaw, Poland, sep, 2014.
    DOI: 10.1007/978-3-662-44777-2_35. Bibtex: Ferreira2014. Problems:11  13  .
  96. [Florian1981] Florian, M. and Nguyen, S. and Pallottino, S., "A dual simplex algorithm for finding all shortest paths," Networks, 11(4): 367--378, 1981.
    DOI: 10.1002/net.3230110406. Bibtex: Florian1981. Problems:178  .
  97. [Fomin2008] Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A., "Combinatorial bounds via measure and conquer," ACM Transactions on Algorithms, 5(1): 1--17, 2008.
    DOI: 10.1145/1435375.1435384. Bibtex: Fomin2008. Problems:240  .
  98. [Frangakis1981] Frangakis, C.N., "A backtracking algorithm to generate all kernels of a directed graph," International Journal of Computer Mathematics, 10(1): 35--41, 1981.
    DOI: 10.1080/00207168108803264. Bibtex: Frangakis1981. Problems:487  .
  99. [Frederickson1985] Frederickson, Greg N., "Data Structures for On-Line Updating of Minimum Spanning Trees, With Applications," SIAM Journal on Computing, 14(4): 781--798, 1985.
    DOI: 10.1137/0214055. Bibtex: Frederickson1985. Problems:53  54  .
  100. [Fredricksen1978a] Fredricksen, Harold and Maiorana, James, "Necklaces of beads in k colors and k-ary de Bruijn sequences," Discrete Mathematics, 23(3): 207--210, 1978.
    DOI: 10.1016/0012-365X(78)90002-X. Bibtex: Fredricksen1978a. Problems:401  .
  101. [Fredricksen1986b] Fredricksen, Harold and {J. Kessler}, Irving, "An algorithm for generating necklaces of beads in two colors," Discrete Mathematics, 61(2-3): 181--188, 1986.
    DOI: 10.1016/0012-365X(86)90089-0. Bibtex: Fredricksen1986b. Problems:360  .
  102. [Fujisawa1959] Fujisawa, T., "On a Problem of Network Topology," IRE Transactions on Circuit Theory, 6(3): 261--266, 1959.
    DOI: 10.1109/TCT.1959.1086556. Bibtex: Fujisawa1959. Problems:472  .
  103. [Fukuda1991] Fukuda, Komei and Saito, Shigemasa and Tamura, Akihisa, "Combinatorial face enumeration in arrangements and oriented matroids," Discrete Applied Mathematics, 31(2): 141--149, 1991.
    DOI: 10.1016/0166-218X(91)90066-6. Bibtex: Fukuda1991. Problems:66  .
  104. [Fukuda1992] Fukuda, Komei and Matsui, Tomomi, "Finding all minimum-cost perfect matchings in Bipartite graphs," Networks, 22(5): 461--468, 1992.
    DOI: 10.1002/net.3230220504. Bibtex: Fukuda1992. Problems:63  .
  105. [Fukuda1994] Fukuda, K. and Matsui, T., "Finding All the Perfect Matchings in Bipartite Graphs," Applied Mathematics Letters, 7(1): 15--18, 1994.
    DOI: 10.1016/0893-9659(94)90045-0. Bibtex: Fukuda1994. Problems:64  .
  106. [Fukuda1995] Fukuda, Komei and Namiki, Makoto, "Finding all common bases in two matroids," Discrete Applied Mathematics, 56(2-3): 231--243, 1995.
    DOI: 10.1016/0166-218X(94)00088-U. Bibtex: Fukuda1995. Problems:65  .
  107. [Fukuda1997] Fukuda, Komei and Liebling, Thomas M. and Margot, Fran\c{c}ois, "Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron," Computational Geometry, 8(1): 1--12, 1997.
    DOI: 10.1016/0925-7721(95)00049-6. Bibtex: Fukuda1997. Problems:61  62  .
  108. [Gabow1977] Gabow, Harold N., "Two Algorithms for Generating Weighted Spanning Trees in Order," SIAM Journal on Computing, 6(1): 139--150, 1977.
    DOI: 10.1137/0206011. Bibtex: Gabow1977. Problems:51  52  .
  109. [Gabow1978] Gabow, Harold N. and Myers, Eugene W., "Finding All Spanning Trees of Directed and Undirected Graphs," SIAM Journal on Computing, 7(3): 280--287, 1978.
    DOI: 10.1137/0207024. Bibtex: Gabow1978. Problems:67  68  .
  110. [Gabow1986a] Gabow, Harold N. and Galil, Zvi and Spencer, Thomas and Tarjan, Robert E., "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs," Combinatorica, 6(2): 109--122, 1986.
    DOI: 10.1007/BF02579168. Bibtex: Gabow1986a. Problems:361  362  .
  111. [Garey1978] Garey, Michael R. and Tarjan, Robert E., "A linear-time algorithm for finding all feedback vertices," Information Processing Letters, 7(6): 274--276, 1978.
    DOI: 10.1016/0020-0190(78)90015-7. Bibtex: Garey1978. Problems:177  .
  112. [Gely2009] G\'{e}ly, Alain and Nourine, Lhouari and Sadi, Bachir, "Enumeration aspects of maximal cliques and bicliques," Discrete Applied Mathematics, 157(7): 1447--1459, 2009.
    DOI: 10.1016/j.dam.2008.10.010. Bibtex: Gely2009. Problems:224  225  226  .
  113. [Gen-Huey1994] Gen-Huey, Chen and Yung-Chen, Hung, "Algorithms for the Constrained Quickest Path Problem and the Enumeration of Quickest Paths," Computers \& Operations Research, 21(2): 113--118, 1994.
    DOI: 10.1016/0305-0548(94)90045-0. Bibtex: Gen-Huey1994. Problems:335  .
  114. [Gerhards1979] Gerhards, L. and Lindenberg, W., "Clique detection for nondirected graphs: Two new algorithms," Computing, 21(4): 295--322, 1979.
    DOI: 10.1007/BF02248731. Bibtex: Gerhards1979. Problems:386  .
  115. [Gilbert1958] Gilbert, E. N., "Gray Codes and Paths on the n-Cube," Bell System Technical Journal, 37(3): 815--826, 1958.
    DOI: 10.1002/j.1538-7305.1958.tb03887.x. Bibtex: Gilbert1958. Problems:427  .
  116. [Goldberg1993b] Goldberg, Leslie Ann, "Polynomial space polynomial delay algorithms for listing families of graphs," In: Kosaraju, Rao and Johnson, David and Aggarwal, Alok, STOC 1993: the 25th annual ACM symposium on Theory of computing, Vol. None of None, ACM Press, pp. 218--225, San Diego, CA, USA, jun, 1993.
    DOI: 10.1145/167088.167160. Bibtex: Goldberg1993b. Problems:340  .
  117. [Golovach2013a] Golovach, PA and Heggernes, Pinar, "An incremental polynomial time algorithm to enumerate all minimal edge dominating sets," In: Fomin, Fedor V. and Freivalds, Rūsiņ\v{s} and Kwiatkowska, Marta and Peleg, David, ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming, Vol. 7965 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 485--496, Riga, Latvia, jul, 2013.
    DOI: 10.1007/978-3-642-39206-1_41. Bibtex: Golovach2013a. Problems:124  125  126  127  128  .
  118. [Golovach2015] Golovach, Petr A. and Heggernes, Pinar and Kant\'{e}, Mamadou M. and Kratsch, Dieter and Villanger, Yngve, "Enumerating minimal dominating sets in chordal bipartite graphs," Discrete Applied Mathematics, 199(None): 30-36, 2015.
    DOI: 10.1016/j.dam.2014.12.010. Bibtex: Golovach2015. Problems:424  .
  119. [Gusfield1989]
    DOI: 10.978.0262515/528. Bibtex: Gusfield1989. Problems:69  .
  120. [Hakimi1961] Hakimi, S.L., "On trees of a graph and their generation," Journal of the Franklin Institute, 272(5): 347--359, 1961.
    DOI: 10.1016/0016-0032(61)90036-9. Bibtex: Hakimi1961. Problems:391  .
  121. [Hakimi1964] Hakimi, S. and Green, D., "Generation and Realization of Trees and k-Trees," IEEE Transactions on Circuit Theory, 11(2): 247--255, 1964.
    DOI: 10.1109/TCT.1964.1082276. Bibtex: Hakimi1964. Problems:431  .
  122. [Hamacher1984a] Hamacher, Horst W. and Picard, Jean-Claude and Queyranne, Maurice, "On Finding the K Best Cuts in a Network," Operations Research Letters, 2(6): 303--305, 1984.
    DOI: 10.1016/0167-6377(84)90083-X. Bibtex: Hamacher1984a. Problems:70  371  .
  123. [Harary1957] Frank Harary and Ian C. Ross, "A Procedure for Clique Detection Using the Group Matrix," Sociometry, 20(3): 205-215, 1957.
    DOI: 10.2307/2785673. Bibtex: Harary1957. Problems:438  .
  124. [Hariharan1995] Hariharan, Ramesh and Kapoor, Sanjiv and Kumar, Vijay, "Faster enumeration of all spanning trees of a directed graph," In: Akl, Selim G. and Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola, WADS 1995: the 4th International Workshop on Algorithms and Data Structures, Vol. 955 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 428--439, Kingston, Canada, aug, 1995.
    DOI: 10.1007/3-540-60220-8_82. Bibtex: Hariharan1995. Problems:300  .
  125. [HeejongSuh2000] {Heejong Suh} and Chang, C.K., "Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition," In: None, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000, Vol. None of None, IEEE Comput. Soc, pp. 100--107, None, None, 2000.
    DOI: 10.1109/LCN.2000.891015. Bibtex: HeejongSuh2000. Problems:436  .
  126. [Henry2013] Henry, CJ and Ramanna, Sheela, "Maximal clique enumeration in Finding Near Neighbourhoods," In: Peters, James F. and Skowron, Andrzej and Ramanna, Sheela and Suraj, Zbigniew and Wang, Xin, Transactions on Rough Sets XVI, Vol. 7736 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 103--124, Banff, Canada, oct, 2013.
    DOI: 10.1007/978-3-642-36505-8_7. Bibtex: Henry2013. Problems:190  .
  127. [Hikita1983] Hikita, Teruo, "Listing and counting subtrees of equal size of a binary tree," Information Processing Letters, 17(4): 225--229, 1983.
    DOI: 10.1016/0020-0190(83)90046-7. Bibtex: Hikita1983. Problems:373  .
  128. [Hoang2013] Ho\`{a}ng, Ch\'{\i}nh T. and Kamiński, Marcin and Sawada, Joe and Sritharan, R., "Finding and listing induced paths and cycles," Discrete Applied Mathematics, 161(4-5): 633--641, 2013.
    DOI: 10.1016/j.dam.2012.01.024. Bibtex: Hoang2013. Problems:192  193  194  .
  129. [Hu1967] Hu, T. C., "Revised Matrix Algorithms for Shortest Paths," SIAM Journal on Applied Mathematics, 15(1): 207--218, 1967.
    DOI: 10.1137/0115017. Bibtex: Hu1967. Problems:441  .
  130. [Huffner2009] H\"{u}ffner, Falk and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf, "Isolation Concepts for Clique Enumeration: Comparison and Computational Experiments," Theoretical Computer Science, 410(52): 5384--5397, 2009.
    DOI: 10.1016/j.tcs.2009.05.008. Bibtex: Huffner2009. Problems:232  233  .
  131. [Ishida2008] Ishida, Yusuke and Zhao, Liang and Nagamochi, Hiroshi and Akutsu, Tatsuya, "Improved Algorithms for Enumerating Tree-like Chemical Graphs with Given Path Frequency," In: Arthur, Jonathan and Ng, See-Kiong, the 19th International Conference on Genome Informatics 2008, Vol. 21 of Genome Informatics Series, Imperial College Press, pp. 53--64, Gold Coast, Queensland, Australia, dec, 2008.
    DOI: 10.1142/9781848163324_0005. Bibtex: Ishida2008. Problems:242  .
  132. [Ito2009] Ito, Hiro and Iwama, Kazuo, "Enumeration of isolated cliques and pseudo-cliques," ACM Transactions on Algorithms, 5(4): 1--21, 2009.
    DOI: 10.1145/1597036.1597044. Bibtex: Ito2009. Problems:229  230  .
  133. [Jayakumar1984] Jayakumar, R. and Thulasiraman, K. and Swamy, M., "Complexity of computation of a spanning tree enumeration algorithm," IEEE Transactions on Circuits and Systems, 31(10): 853--860, 1984.
    DOI: 10.1109/TCS.1984.1085435. Bibtex: Jayakumar1984. Problems:370  .
  134. [Johnson1963] Johnson, Selmer M., "Generation of permutations by adjacent transposition," Mathematics of Computation, 17(83): 282--282, 1963.
    DOI: 10.1090/S0025-5718-1963-0159764-2. Bibtex: Johnson1963. Problems:382  .
  135. [Johnson1975] Johnson, Donald B., "Finding All the Elementary Circuits of a Directed Graph," SIAM Journal on Computing, 4(1): 77--84, 1975.
    DOI: 10.1137/0204007. Bibtex: Johnson1975. Problems:7  .
  136. [Johnson1988] Johnson, David S. and Yannakakis, Mihalis and Papadimitriou, Christos H., "On generating all maximal independent sets," Information Processing Letters, 27(3): 119--123, 1988.
    DOI: 10.1016/0020-0190(88)90065-8. Bibtex: Johnson1988. Problems:29  .
  137. [Johnston1976] Johnston, H. C., "Cliques of a graph-variations on the Bron-Kerbosch algorithm," International Journal of Computer \& Information Sciences, 5(3): 209--238, 1976.
    DOI: 10.1007/BF00991836. Bibtex: Johnston1976. Problems:403  .
  138. [Kamae1967] Kamae, T., "A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected Paths," IEEE Transactions on Circuit Theory, 14(2): 166--171, 1967.
    DOI: 10.1109/TCT.1967.1082699. Bibtex: Kamae1967. Problems:419  420  .
  139. [Kanevsky1993] Kanevsky, Arkady, "Finding all minimum-size separating vertex sets in a graph," Networks, 23(6): 533--541, 1993.
    DOI: 10.1002/net.3230230604. Bibtex: Kanevsky1993. Problems:71  .
  140. [Kante2011] Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L, "Enumeration of minimal dominating sets and variants," In: Owe, Olaf and Steffen, Martin and Telle, Jan Arne, FCT 2011: the 18th International Symposium on Fundamentals of Computation Theory, Vol. 6914 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 298--309, Oslo, Norway, aug, 2011.
    DOI: 10.1007/978-3-642-22953-4_26. Bibtex: Kante2011. Problems:454  455  456  .
  141. [Kante2012] Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L, "On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets," In: Chao, Kun-Mao and Hsu, Tsan-sheng and Lee, Der-Tsai, ISAAC 2012: the 23rd International Symposium on Algorithms and Computation, Vol. 7676 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 289--298, Taipei, Taiwan, dec, 2012.
    DOI: 10.1007/978-3-642-35261-4_32. Bibtex: Kante2012. Problems:202  203  204  .
  142. [Kante2013] Kant\'{e}, MamadouMoustapha MM and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari and Uno, Takeaki, "On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs," In: Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak-Wah, ISAAC 2013: the 24th International Symposium on Algorithms and Computation, Vol. 8283 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 339--349, Hong Kong, China, dec, 2013.
    DOI: 10.1007/978-3-642-45030-3_32. Bibtex: Kante2013. Problems:35  36  .
  143. [Kante2014] Kant\'{e}, Mamadou Moustapha and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari, "On the Enumeration of Minimal Dominating Sets and Related Notions," SIAM Journal on Discrete Mathematics, 28(4): 1916--1929, 2014.
    DOI: 10.1137/120862612. Bibtex: Kante2014. Problems:347  .
  144. [Kapoor1991] Kapoor, Sanjiv and Ramesh, H, "Algorithms for generating all spanning trees of undirected, directed and weighted graphs," In: Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola, WADS 1991: the 2nd Workshop on Algorithms and Data Structures, Vol. 519 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 461--472, Ottawa, Canada, aug, 1991.
    DOI: 10.1007/BFb0028284. Bibtex: Kapoor1991. Problems:73  74  75  .
  145. [Kapoor1995] Kapoor, Sanjiv and Ramesh, H, "Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs," SIAM Journal on Computing, 24(2): 247--265, 1995.
    DOI: 10.1137/S009753979225030X. Bibtex: Kapoor1995. Problems:446  447  .
  146. [Kapoor2000] Kapoor, S. and Ramesh, H., "An Algorithm for Enumerating All Spanning Trees of a Directed Graph," Algorithmica, 27(2): 120--130, 2000.
    DOI: 10.1007/s004530010008. Bibtex: Kapoor2000. Problems:485  .
  147. [Kashiwabara1992] Kashiwabara, Toshinobu and Masuda, Sumio and Nakajima, Kazuo and Fujisawa, Toshio, "Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph," Journal of Algorithms, 13(1): 161--174, 1992.
    DOI: 10.1016/0196-6774(92)90012-2. Bibtex: Kashiwabara1992. Problems:76  77  346  .
  148. [Katoh1981] Katoh, N. and Ibaraki, T. and Mine, H., "Minimum Spanning Trees," SIAM Journal on Computing, 10(2): 247--255, 1981.
    DOI: 10.1137/0210017. Bibtex: Katoh1981. Problems:55  .
  149. [Katoh2009a] Katoh, Naoki and Tanigawa, Shin-ichi, "Fast enumeration algorithms for non-crossing geometric graphs," Discrete and Computational Geometry, 42(3): 443--468, 2009.
    DOI: 10.1007/s00454-009-9164-4. Bibtex: Katoh2009a. Problems:248  249  250  251  252  .
  150. [Kawano2005a] Kawano, Shin-ichiro and Nakano, Shin-ichi, "Generating all series-parallel graphs," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(5): 1129--1135, 2005.
    DOI: 10.1093/ietfec/e88-a.5.1129. Bibtex: Kawano2005a. Problems:165  .
  151. [Kawano2005b] Kawano, Shin-ichiro and Nakano, Shin-ichi, "Constant time generation of set partitions," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E88-A(4): 930--934, 2005.
    DOI: 10.1093/ietfec/e88-a.4.930. Bibtex: Kawano2005b. Problems:159  .
  152. [Kazana2013b] Kazana, Wojciech and Segoufin, Luc, "Enumeration of first-order queries on classes of structures with bounded expansion," In: Hull, Richard, PODS 2013: the 32nd symposium on Principles of database systems, Vol. None of None, ACM Press, pp. 297, New York, New York, USA, jun, 2013.
    DOI: 10.1145/2463664.2463667. Bibtex: Kazana2013b. Problems:195  .
  153. [Kazana2013d] Kazana, Wojciech and Segoufin, Luc, "Enumeration of monadic second-order queries on trees," ACM Transactions on Computational Logic, 14(4): 25:1--25:12, 2013.
    DOI: 10.1145/2528928. Bibtex: Kazana2013d. Problems:196  .
  154. [Khachiyan2005] Khachiyan, L and Boros, E and Borys, K, "Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs," In: Deng, Xiaotie and Du, Ding-Zhu, ISAAC 2005: the 16th International Symposium on Algorithms and Computation, Vol. 3827 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 156--165, Sanya, Hainan, China, dec, 2005.
    DOI: 10.1007/11602613_17. Bibtex: Khachiyan2005. Problems:281  .
  155. [Khachiyan2006a] Khachiyan, L and Boros, E and Borys, K, "Enumerating spanning and connected subsets in graphs and matroids," In: Azar, Yossi and Erlebach, Thomas, ESA 2006: the 14th Annual European Symposium on Algorithms, Vol. 4168 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 444--455, Zurich, Switzerland, sep, 2006.
    DOI: 10.1007/11841036_41. Bibtex: Khachiyan2006a. Problems:130  131  .
  156. [Khachiyan2007] Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa, "Enumerating disjunctions and conjunctions of paths and cuts in reliability theory," Discrete Applied Mathematics, 155(2): 137--149, 2007.
    DOI: 10.1016/j.dam.2006.04.032. Bibtex: Khachiyan2007. Problems:494  495  496  497  498  499  500  .
  157. [Khachiyan2008a] Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa, "Generating cut conjunctions in graphs and related problems," Algorithmica, 51(3): 239--263, 2008.
    DOI: 10.1007/s00453-007-9111-9. Bibtex: Khachiyan2008a. Problems:135  136  137  .
  158. [Kijima2010] Kijima, Shuji and Kiyomi, Masashi and Okamoto, Yoshio and Uno, Takeaki, "On Listing, Sampling, and Counting the Chordal Graphs With Edge Constraints," Theoretical Computer Science, 411(26-28): 2591--2601, 2010.
    DOI: 10.1016/j.tcs.2010.03.024. Bibtex: Kijima2010. Problems:213  .
  159. [Kiyomi2006] Kiyomi, Masashi and Takeaki, Uno, "Generating Chordal Graphs Included in Given Graphs," IEICE Transactions on Information and Systems, E89-D(2): 763--770, 2006.
    DOI: 10.1093/ietisy/e89-d.2.763. Bibtex: Kiyomi2006. Problems:270  271  .
  160. [Kiyomi2006a] Kiyomi, Masashi and Kijima, Shuji and Uno, Takeaki, "Listing chordal graphs and interval graphs," In: Fomin, Fedor V., WG 2006: the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 4271 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 68--77, Bergen, Norway, jun, 2006.
    DOI: 10.1007/11917496_7. Bibtex: Kiyomi2006a. Problems:272  273  274  .
  161. [Kiyomi2012] Kiyomi, Masashi and Okamoto, Yoshio and Saitoh, Toshiki, "Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data," In: Klasing, Ralf, SEA 2012: the 11th International Symposium on Experimental Algorithms, Vol. 7276 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 248--259, Bordeaux, France, jun, 2012.
    DOI: 10.1007/978-3-642-30850-5_22. Bibtex: Kiyomi2012. Problems:218  .
  162. [Kloks1994] Kloks, T and Kratsch, D, "Finding all minimal separators of a graph," In: Enjalbert, Patrice and Mayr, Ernst W. and Wagner, Klaus W., STACS 1994: the 11th Annual Symposium on Theoretical Aspects of Computer Science, Vol. 775 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 759--768, France, feb, 1994.
    DOI: 10.1007/3-540-57785-8_188. Bibtex: Kloks1994. Problems:181  .
  163. [Kloks1998] Kloks, T. and Kratsch, D., "Listing All Minimal Separators of a Graph," SIAM Journal on Computing, 27(3): 605--613, 1998.
    DOI: 10.1137/S009753979427087X. Bibtex: Kloks1998. Problems:315  .
  164. [Knop1981] Knop, J. V. and Mueller, W. R. and Jericevic, Z. and Trinajstic, N., "Computer enumeration and generation of trees and rooted trees," Journal of Chemical Information and Modeling, 21(2): 91--99, 1981.
    DOI: 10.1021/ci00030a009. Bibtex: Knop1981. Problems:442  .
  165. [Knuth1974] Knuth, Donald E. and Szwarcfiter, Jayme L., "A structured program to generate all topological sorting arrangements," Information Processing Letters, 2(6): 153--157, 1974.
    DOI: 10.1016/0020-0190(74)90001-5. Bibtex: Knuth1974. Problems:78  .
  166. [Knuth1979] Knuth, Donald E, "Lexicographic permutations with restrictions," Discrete Applied Mathematics, 1(1-2): 117--125, 1979.
    DOI: 10.1016/0166-218X(79)90018-0. Bibtex: Knuth1979. Problems:385  .
  167. [Koch2001] Koch, Ina, "Enumerating All Connected Maximal Common Subgraphs in Two Graphs," Theoretical Computer Science, 250(1-2): 1--30, 2001.
    DOI: 10.1016/S0304-3975(00)00286-3. Bibtex: Koch2001. Problems:298  .
  168. [Koda1993] Koda, Y. and Ruskey, F., "A Gray Code for the Ideals of a Forest Poset," Journal of Algorithms, 15(2): 324--340, 1993.
    DOI: 10.1006/jagm.1993.1044. Bibtex: Koda1993. Problems:341  .
  169. [Komusiewicz2009] Komusiewicz, Christian and H{\"{u}}ffner, Falk and Moser, Hannes and Niedermeier, Rolf, "Isolation concepts for efficiently enumerating dense subgraphs," Theoretical Computer Science, 410(38-40): 3640--3654, 2009.
    DOI: 10.1016/j.tcs.2009.04.021. Bibtex: Komusiewicz2009. Problems:434  .
  170. [Komusiewicz2019] Komusiewicz, Christian and Sommer, Frank, "Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison," In: None, SOFSEM 2019: the 45th International Conference on Current Trends in Theory and Practice of Computer Science, Vol. 7147 of None, Springer International Publishing, pp. 272--284, None, None, 2019.
    DOI: 10.1007/978-3-030-10801-4_22. Bibtex: Komusiewicz2019. Problems:501  .
  171. [Korsh1994] Korsh, James F., "Loopless generation of k-ary tree sequences," Information Processing Letters, 52(5): 243--247, 1994.
    DOI: 10.1016/0020-0190(94)00149-9. Bibtex: Korsh1994. Problems:336  .
  172. [Korsh1998] Korsh, James F. and Lipschutz, Seymour, "Shifts and loopless generation of k-ary trees," Information Processing Letters, 65(5): 235--240, 1998.
    DOI: 10.1016/S0020-0190(97)00215-9. Bibtex: Korsh1998. Problems:312  .
  173. [Kroft1967b] Kroft, D., "All paths through a maze," Proceedings of the IEEE, 55(1): 88--90, 1967.
    DOI: 10.1109/PROC.1967.5389. Bibtex: Kroft1967b. Problems:422  .
  174. [Krzywkowski2013] Krzywkowski, Marcin, "An algorithm for listing all minimal 2-dominating sets of a tree," In: Fellows, Michael and Tan, Xuehou and Zhu, Binhai, FAW-AAIM 2013: the 3rd Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, Vol. 7924 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 12--16, Dalian, China, jun, 2013.
    DOI: 10.1007/978-3-642-38756-2_4. Bibtex: Krzywkowski2013. Problems:189  .
  175. [Laumond1985] Laumond, Jean-Paul, "Enumeration of articulation pairs of a planar graph," Information Processing Letters, 21(4): 173--179, 1985.
    DOI: 10.1016/0020-0190(85)90055-9. Bibtex: Laumond1985. Problems:364  .
  176. [Lawler1972] Lawler, E. L., "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem," Management Science, 18(7): 401--405, 1972.
    DOI: 10.1287/mnsc.18.7.401. Bibtex: Lawler1972. Problems:79  .
  177. [Leung1984] Leung, Joseph Y.-T., "Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs," Journal of Algorithms, 5(1): 22--35, 1984.
    DOI: 10.1016/0196-6774(84)90037-3. Bibtex: Leung1984. Problems:366  367  368  .
  178. [Li2003] Li, Zhang-Jian and Nakano, Shin-ichi, "Generating Biconnected Plane Quadrangulations," IEICE transactions on information and systems, E86-D(4): 698--703, 2003.
    DOI: MY/ietisy/e86-d.4.698. Bibtex: Li2003. Problems:168  .
  179. [Loizou1982] Loizou, G. and Thanisch, P., "Enumerating the cycles of a digraph: A new preprocessing strategy," Information Sciences, 27(3): 163--182, 1982.
    DOI: 10.1016/0020-0255(82)90023-8. Bibtex: Loizou1982. Problems:444  .
  180. [Loukakis1981] Loukakis, E. and Tsouros, C., "A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically," Computing, 27(4): 349--366, 1981.
    DOI: 10.1007/BF02277184. Bibtex: Loukakis1981. Problems:375  .
  181. [Lucas1987] Lucas, Joan M., "The Rotation Graph of Binary Trees Is Hamiltonian," Journal of Algorithms, 8(4): 503--535, 1987.
    DOI: 10.1016/0196-6774(87)90048-4. Bibtex: Lucas1987. Problems:356  .
  182. [Lucas1993] Lucas, Joan M. and Vanbaronaigien, D.R. and Ruskey, Frank, "On Rotations and the Generation of Binary Trees," Journal of Algorithms, 15(3): 343--366, 1993.
    DOI: 10.1006/jagm.1993.1045. Bibtex: Lucas1993. Problems:342  .
  183. [MacWilliams1958] MacWilliams, J., "Topological Network Analysis as a Computer Program," IRE Transactions on Circuit Theory, 5(3): 228--229, 1958.
    DOI: 10.1109/TCT.1958.1086460. Bibtex: MacWilliams1958. Problems:490  .
  184. [Mai1984] Mai, Shao-Wen and Evans, D.J., "A parallel algorithm for the enumeration of the spanning trees of a graph," Parallel Computing, 1(3-4): 275--286, 1984.
    DOI: 10.1016/S0167-8191(84)90197-2. Bibtex: Mai1984. Problems:483  .
  185. [Makino2004] Makino, Kazuhisa and Uno, Takeaki, "New algorithms for enumerating all maximal cliques," In: Hagerup, Torben and Katajainen, Jyrki, SWAT 2004: the 9th Scandinavian Workshop on Algorithm Algorithm Theory, Vol. 3111 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 260--272, Humleb\ae k, Denmark, jul, 2004.
    DOI: 10.1007/978-3-540-27810-8_23. Bibtex: Makino2004. Problems:20  21  .
  186. [Manas1968] Maňas, Miroslav and Nedoma, Josef, "Finding all vertices of a convex polyhedron," Numerische Mathematik, 12(3): 226--229, 1968.
    DOI: 10.1007/BF02162916. Bibtex: Manas1968. Problems:450  .
  187. [Martelli1976a] Martelli, Alberto, "A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph," Journal of the ACM, 23(1): 58--73, 1976.
    DOI: 10.1145/321921.321928. Bibtex: Martelli1976a. Problems:398  .
  188. [Martello1983] Martello, Silvano, "Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph," ACM Transactions on Mathematical Software, 9(1): 131--138, 1983.
    DOI: 10.1145/356022.356030. Bibtex: Martello1983. Problems:466  .
  189. [Martins1984] Martins, Ernesto de Queir\'{o}s Vieira, "An algorithm for ranking paths that may contain cycles," European Journal of Operational Research, 18(1): 123--130, 1984.
    DOI: 10.1016/0377-2217(84)90269-8. Bibtex: Martins1984. Problems:80  .
  190. [Masada1996] Masada, Tomonari and Imai, Hiroshi and Imai, Keiko, "Enumeration of regular triangulations," In: Whitesides, Sue, SCG 1996: the 12th annual symposium on Computational geometry, Vol. None of None, ACM Press, pp. 224--233, Philadelphia, PA, USA, may, 1996.
    DOI: 10.1145/237218.237373. Bibtex: Masada1996. Problems:81  82  .
  191. [Mateti1976a] Mateti, Prabhaker and Deo, Narsingh, "On Algorithms for Enumerating All Circuits of a Graph," SIAM Journal on Computing, 5(1): 90--99, 1976.
    DOI: 10.1137/0205007. Bibtex: Mateti1976a. Problems:399  .
  192. [Matsui1994] Matsui, Tomomi and Tamura, Akihisa and Ikebe, Yoshiko, "Algorithms for finding a Kth best valued assignment," Discrete Applied Mathematics, 50(3): 283--296, 1994.
    DOI: 10.1016/0166-218X(92)00175-L. Bibtex: Matsui1994. Problems:85  .
  193. [Matsui1996a] Matsui, Yasuko and Uno, Takeaki, "A simple and fast algorithm for enumerating all edge colorings of a bipartite graph," In: None, Korea-Japan Joint Workshop on Algorithms and Computation, Vol. None of None, None, pp. 81--87, KAIST,Taejon,Korea, aug, 1996.
    URI: http://homepage3.nifty.com/yasuko835/. Bibtex: Matsui1996a. Problems:87  .
  194. [Matsui1996b]
    DOI: 10.1007/3-540-61576-8_69. Bibtex: Matsui1996b. Problems:86  .
  195. [Matsui1997] Matsui, T., "A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs," Algorithmica, 18(4): 530--543, 1997.
    DOI: 10.1007/PL00009171. Bibtex: Matsui1997. Problems:83  84  .
  196. [Matsui2008] Matsui, Yasuko and Uehara, Ryuhei and Uno, Takeaki, "Enumeration of Perfect Sequences of Chordal Graph," In: Hong, Seok-Hee and Nagamochi, Hiroshi and Fukunaga, Takuro, ISAAC 2008: the 19th International Symposium on Algorithms and Computation, Vol. 5369 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 859--870, Gold Coast, Australia, dec, 2008.
    DOI: 10.1007/978-3-540-92182-0_75. Bibtex: Matsui2008. Problems:241  .
  197. [Matsui2010] Matsui, Yasuko and Uehara, Ryuhei and Uno, Takeaki, "Enumeration of the Perfect Sequences of a Chordal Graph," Theoretical Computer Science, 411(40-42): 3635--3641, 2010.
    DOI: 10.1016/j.tcs.2010.06.007. Bibtex: Matsui2010. Problems:38  .
  198. [Mattheiss1973] Mattheiss, T. H., "An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities," Operations Research, 21(1): 247--260, 1973.
    DOI: 10.1287/opre.21.1.247. Bibtex: Mattheiss1973. Problems:479  .
  199. [Mattheiss1980] Mattheiss, T. H. and Schmidt, Brian K., "{Computational results on an algorithm for finding all vertices of a polytope}," Mathematical Programming, 18(1): 308--329, 1980.
    DOI: 10.1007/BF01588326. Bibtex: Mattheiss1980. Problems:518  .
  200. [Maxwell1966] Maxwell, L.M. and Cline, J.M., "Topological network analysis by algebraic methods," Proceedings of the Institution of Electrical Engineers, 113(8): 1344, 1966.
    DOI: 10.1049/piee.1966.0224. Bibtex: Maxwell1966. Problems:474  475  476  477  .
  201. [Mayeda1965a] Mayeda, W. and Seshu, S., "Generation of Trees without Duplications," IEEE Transactions on Circuit Theory, 12(2): 181--185, 1965.
    DOI: 10.1109/TCT.1965.1082432. Bibtex: Mayeda1965a. Problems:383  .
  202. [Mayr1992] Mayr, Ernst W and Plaxton, C Greg, "On the spanning trees of weighted graphs," Combinatorica, 12(4): 433--447, 1992.
    DOI: 10.1007/BF01305236. Bibtex: Mayr1992. Problems:88  .
  203. [Mazoit2006] Mazoit, F., "Listing all the minimal separators of a 3-connected planar graph," Discrete Mathematics, 306(3): 372--380, 2006.
    DOI: 10.1016/j.disc.2005.12.007. Bibtex: Mazoit2006. Problems:275  .
  204. [McIlroy1969] McIlroy, M. Douglas, "Algorithm 354: generator of spanning trees [H]," Communications of the ACM, 12(9): 511, 1969.
    DOI: 10.1145/363219.363229. Bibtex: McIlroy1969. Problems:484  .
  205. [McKay1970] McKay, J. K. S., "Algorithm 371: Partitions in natural order [A1]," Communications of the ACM, 13(1): 52, 1970.
    DOI: 10.1145/361953.361980. Bibtex: McKay1970. Problems:410  .
  206. [McKay1998] McKay, Brendan D., "Isomorph-Free Exhaustive Generation," Journal of Algorithms, 26(2): 306--324, 1998.
    DOI: 10.1006/jagm.1997.0898. Bibtex: McKay1998. Problems:313  .
  207. [Megiddo1981] Megiddo, N. and Tamir, A. and Zemel, E. and Chandrasekaran, R., "An $O(n\log^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems," SIAM Journal on Computing, 10(2): 328--337, 1981.
    DOI: 10.1137/0210023. Bibtex: Megiddo1981. Problems:89  .
  208. [Minty1965] Minty, George J., "A Simple Algorithm for Listing All the Trees of a Graph," IEEE Transactions on Circuit Theory, 12(1): 120, 1965.
    DOI: 10.1109/TCT.1965.1082385. Bibtex: Minty1965. Problems:1  .
  209. [Minty1980] Minty, George J., "On maximal independent sets of vertices in claw-free graphs," Journal of Combinatorial Theory, Series B, 28(3): 284--304, 1980.
    DOI: 10.1016/0095-8956(80)90074-X. Bibtex: Minty1980. Problems:380  .
  210. [Mulligan1972] Mulligan, Gordon D. and Corneil, D. G., "Corrections to Bierstone's Algorithm for Generating Cliques," Journal of the ACM, 19(2): 244--247, 1972.
    DOI: 10.1145/321694.321698. Bibtex: Mulligan1972. Problems:409  .
  211. [Murty1968] Murty, K. G., "Letter to the Editor--An Algorithm for Ranking All the Assignments in Order of Increasing Cost," Operations Research, 16(3): 682--687, 1968.
    DOI: 10.1287/opre.16.3.682. Bibtex: Murty1968. Problems:90  .
  212. [Nagamochi1997] Nagamochi, Hiroshi and Nishimura, Kazuhiro and Ibaraki, Toshihide, "Computing All Small Cuts in an Undirected Network," SIAM Journal on Discrete Mathematics, 10(3): 469--481, 1997.
    DOI: 10.1137/S0895480194271323. Bibtex: Nagamochi1997. Problems:435  .
  213. [Nakano2001] Nakano, Shin-ichi, "Efficient Generation of Triconnected Plane Triangulations," In: Wang, Jie, COCOON 2001: the 7th Annual International Conference on Computing and Combinatorics, Vol. 2108 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 131--141, Guilin, China, aug, 2001.
    DOI: 10.1007/3-540-44679-6_15. Bibtex: Nakano2001. Problems:160  161  162  .
  214. [Nakano2001a] Nakano, Shin-ichi, "Enumerating Floorplans with n Rooms," In: Eades, Peter and Takaoka, Tadao, ISAAC 2001: the 12th International Symposium on Algorithms and Computation, Vol. 2223 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 107--115, Christchurch, New Zealand,, dec, 2001.
    DOI: 10.1007/3-540-45678-3_10. Bibtex: Nakano2001a. Problems:155  156  157  .
  215. [Nakano2002] Nakano, Shin-ichi, "Efficient generation of plane trees," Information Processing Letters, 84(3): 167--172, 2002.
    DOI: 10.1016/S0020-0190(02)00240-5. Bibtex: Nakano2002. Problems:149  150  151  152  153  .
  216. [Nakano2003] Nakano, Shin-ichi and Uno, Takeaki, "Efficient generation of rooted trees," Tech. Rep. NII-2003-005E of National Institute for Infomatics, 2003.
    URI: http://www.nii.ac.jp/TechReports/03-005E.pdf. Bibtex: Nakano2003. Problems:154  .
  217. [Nakano2004] Nakano, Shin-ichi and Uno, Takeaki, "Constant TIme Generation of Trees with Specified Diameter," In: Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard, WG 2004: the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 3353 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 33--45, Honnef, Germany, jun, 2004.
    DOI: 10.1007/978-3-540-30559-0_3. Bibtex: Nakano2004. Problems:148  .
  218. [Nakano2004a] Li, Zhangjian and Nakano, Shin-ichi, "Efficient Generation of Plane Triangulations without Repetitions," In: Orejas, Fernando and Spirakis, Paul G. and van Leeuwen, Jan, ICALP 2001: the 28th International Colloquium on Automata, Languages and Programming, Vol. 2076 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 433--443, Crete, Greece, jul, 2001.
    DOI: 10.1007/3-540-48224-5_36. Bibtex: Nakano2004a. Problems:144  145  146  147  .
  219. [Nakano2004b] Nakano, Shin-ichi and Uno, Takeaki, "More Efficient Generation of Plane Triangulations," In: Liotta, Giuseppe, the11th International Symposium on Graph Drawing - GD 2004, Vol. 2912 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 273--282, Perugia, Italy, sep, 2004.
    DOI: 10.1007/978-3-540-24595-7_25. Bibtex: Nakano2004b. Problems:170  .
  220. [Nakano2005a] Nakano, Shin-ichi and Uno, Takeaki, "Generating colored trees," In: Kratsch, Dieter, WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 3787 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 249--260, Metz, France, jun, 2005.
    DOI: 10.1007/11604686_22. Bibtex: Nakano2005a. Problems:158  .
  221. [Nakano2009] Nakano, Shin-ichi, "Listing All Trees with Specified Degree Sequence (Acceleration and Visualization of Computation for Enumeration Problems)," 数理解析研究所講究録, 1644(-): 55--62, 2009.
    URI: http://ci.nii.ac.jp/naid/110007089589/. Bibtex: Nakano2009. Problems:166  .
  222. [Narayana1971] Narayana, T.V and Mathsen, R.M and Sarangi, J, "An algorithm for generating partitions and its applications," Journal of Combinatorial Theory, Series A, 11(1): 54--61, 1971.
    DOI: 10.1016/0097-3165(71)90007-0. Bibtex: Narayana1971. Problems:407  408  .
  223. [Nutov2009] Nutov, Zeev, "Listing minimal edge-covers of intersecting families with applications to connectivity problems," Discrete Applied Mathematics, 157(1): 112--117, 2009.
    DOI: 10.1016/j.dam.2008.04.026. Bibtex: Nutov2009. Problems:234  235  236  237  238  239  .
  224. [Okamoto2005a] Okamoto, Y and Uno, T and Uehara, R, "Linear time counting algorithms for independent sets in chordal graphs," In: Kratsch, Dieter, WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, Vol. 3787 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 433--444, Metz, France, jun, 2005.
    DOI: 10.1007/11604686_38. Bibtex: Okamoto2005a. Problems:282  283  284  .
  225. [Okamoto2008] Okamoto, Yoshio and Uno, Takeaki and Uehara, Ryuhei, "Counting the number of independent sets in chordal graphs," Journal of Discrete Algorithms, 6(2): 229--242, 2008.
    DOI: 10.1016/j.jda.2006.07.006. Bibtex: Okamoto2008. Problems:26  27  28  .
  226. [Ono2005] Ono, Akimitsu and Nakano, Shin-ichi, "Constant Time Generation of Linear Extensions," In: Li\'{s}kiewicz, Maciej and Reischuk, R\"{u}diger, FCT 2005: the 15th International Symposium on Fundamentals of Computation Theory, Vol. 3623 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 445--453, L{\"{u}}beck, Germany, aug, 2005.
    DOI: 10.1007/11537311_39. Bibtex: Ono2005. Problems:39  .
  227. [Pallo1986] Pallo, J. M., "Enumerating, Ranking and Unranking Binary Trees," The Computer Journal, 29(2): 171--175, 1986.
    DOI: 10.1093/comjnl/29.2.171. Bibtex: Pallo1986. Problems:480  .
  228. [Pallo1987] Pallo, J., "Generating Trees With N Nodes and M Leaves," International Journal of Computer Mathematics, 21(2): 133--144, 1987.
    DOI: 10.1080/00207168708803562. Bibtex: Pallo1987. Problems:359  .
  229. [Pan2008] Pan, Long and Santos, Eunice E., "An anytime-anywhere approach for maximal clique enumeration in social network analysis," In: None, the IEEE International Conference on Systems, Man and Cybernetics - SMC 2008, Vol. None of None, IEEE, pp. 3529--3535, Singapore, oct, 2008.
    DOI: 10.1109/ICSMC.2008.4811845. Bibtex: Pan2008. Problems:247  .
  230. [Pardalos1994] Pardalos, Panos M. and Xue, Jue, "The maximum clique problem," Journal of Global Optimization, 4(3): 301--328, 1994.
    DOI: 10.1007/BF01098364. Bibtex: Pardalos1994. Problems:337  .
  231. [Parvez2009] Parvez, Mohammad Tanvir and Rahman, Md Saidur and Nakano, Shin-ichi, "Generating all triangulations of plane graphs : Extended abstract," In: Das, Sandip and Uehara, Ryuhei, WALCOM 2009: the 3rd International Workshop on Algorithms and Computation, Vol. 5431 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 151--164, Kolkata, India, feb, 2009.
    DOI: 10.1007/978-3-642-00202-1_14. Bibtex: Parvez2009. Problems:171  172  173  .
  232. [Percival1953] Percival, W S, "The solution of passive electrical networks by means of mathematical trees," Proceedings of the IEE - Part III: Radio and Communication Engineering, 100(65): 143--150, 1953.
    DOI: 10.1049/pi-3.1953.0033. Bibtex: Percival1953. Problems:471  .
  233. [Piekarski1965] Piekarski, M., "Listing of All Possible Trees of a Linear Graph," IEEE Transactions on Circuit Theory, 12(1): 124--125, 1965.
    DOI: 10.1109/TCT.1965.1082388. Bibtex: Piekarski1965. Problems:473  .
  234. [Ponstein1966] Ponstein, J., "Self-Avoiding Paths and the Adjacency Matrix of a Graph," SIAM Journal on Applied Mathematics, 14(3): 600--609, 1966.
    DOI: 10.1137/0114051. Bibtex: Ponstein1966. Problems:392  393  .
  235. [Proskurowski1980] Proskurowski, Andrzej, "On the Generation of Binary Trees," Journal of the ACM, 27(1): 1--2, 1980.
    DOI: 10.1145/322169.322170. Bibtex: Proskurowski1980. Problems:379  .
  236. [Proskurowski1985] Proskurowski, Andrzej and Ruskey, Frank, "Binary Tree Gray Codes," Journal of Algorithms, 6(2): 225--238, 1985.
    DOI: 10.1016/0196-6774(85)90040-9. Bibtex: Proskurowski1985. Problems:363  .
  237. [Proskurowski1998] Proskurowski, Andrzej and Ruskey, Frank and Smith, Malcolm, "Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings," SIAM Journal on Discrete Mathematics, 11(1): 94--109, 1998.
    DOI: 10.1137/S0895480192234009. Bibtex: Proskurowski1998. Problems:316  .
  238. [Provan1996] Provan, J. S. and Shier, D. R., "A paradigm for listing (s, t)-cuts in graphs," Algorithmica, 15(4): 351--372, 1996.
    DOI: 10.1007/BF01961544. Bibtex: Provan1996. Problems:91  92  93  94  95  96  97  98  99  100  .
  239. [Pruesse1991a] Pruesse, Gara and Ruskey, Frank, "Generating the Linear Extensions of Certain Posets by Transpositions," SIAM Journal on Discrete Mathematics, 4(3): 413--422, 1991.
    DOI: 10.1137/0404037. Bibtex: Pruesse1991a. Problems:348  .
  240. [Pruesse1994] Pruesse, Gara and Ruskey, Frank, "Generating Linear Extensions Fast," SIAM Journal on Computing, 23(2): 373--386, 1994.
    DOI: 10.1137/S0097539791202647. Bibtex: Pruesse1994. Problems:101  .
  241. [Ramon2007] Ramon, Jan and Nijssen, Siegfried, "General Graph Refinement with Polynomial Delay," In: None, Mining and Learning with Graphs - MLG 2007, Vol. None of None, None, pp. 4, Florence, Italy, aug, 2007.
    URI: http://eprints.pascal-network.org/archive/00003617/. Bibtex: Ramon2007. Problems:261  .
  242. [Ramon2009] Ramon, Jan and Nijssen, Siegfried, "Polynomial-Delay Enumeration of Monotonic Graph Classes," The Journal of Machine Learning Research, 10(-): 907--929, 2009.
    URI: http://dl.acm.org/citation.cfm?id=1577069.1577102. Bibtex: Ramon2009. Problems:231  .
  243. [Rao1969] {Bapeswara Rao}, V.V. and Murti, V.G.K., "Enumeration of all circuits of a graph," Proceedings of the IEEE, 57(4): 700--701, 1969.
    DOI: 10.1109/PROC.1969.7032. Bibtex: Rao1969. Problems:413  .
  244. [Rasmussen1995] Rasmussen, David and Savage, Carla D and West, Douglas B, "Gray code enumeration of families of integer partitions," Journal of Combinatorial Theory, Series A, 70(2): 201--229, 1995.
    DOI: 10.1016/0097-3165(95)90090-X. Bibtex: Rasmussen1995. Problems:331  332  .
  245. [Read1975] Read, Ronald C. and Tarjan, Robert Endre, "Bounds on backtrack algorithms for listing cycles, paths, and spanning trees," Networks, 5(3): 237--252, 1975.
    URI: http://scholar.google.com/scholar?hl=en{&}btnG=Search{&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0. Bibtex: Read1975. Problems:102  103  104  105  106  .
  246. [Read1987] Read, Ronald C. and Hu, Guanzhang, "On the construction and enumeration of minimal blocks," Journal of Graph Theory, 11(4): 539--553, 1987.
    DOI: 10.1002/jgt.3190110412. Bibtex: Read1987. Problems:492  .
  247. [Rosen1991] Rosen, J.B. and Sun, S.-Z. and Xue, G.-L., "Algorithms for the Quickest Path Problem and the Enumeration of Quickest Paths," Computers \& Operations Research, 18(6): 579--584, 1991.
    DOI: 10.1016/0305-0548(91)90063-W. Bibtex: Rosen1991. Problems:349  .
  248. [Rotem1978a] Rotem, Doron and Varol, Y. L., "Generation of Binary Trees from Ballot Sequences," Journal of the ACM, 25(3): 396--404, 1978.
    DOI: 10.1145/322077.322082. Bibtex: Rotem1978a. Problems:402  .
  249. [Rotem1981] Rotem, Doron and Urrutia, Julia, "Finding Maximum Cliques In Circle Graphs," Networks, 11(3): 269--278, 1981.
    DOI: 10.1002/net.3230110305. Bibtex: Rotem1981. Problems:107  .
  250. [Ruskey1977] Ruskey, F. and Hu, T. C., "Generating Binary Trees Lexicographically," SIAM Journal on Computing, 6(4): 745--758, 1977.
    DOI: 10.1137/0206055. Bibtex: Ruskey1977. Problems:388  .
  251. [Ruskey1978a] Ruskey, Frank, "Generating T -Ary Trees Lexicographically," SIAM Journal on Computing, 7(4): 424--439, 1978.
    DOI: 10.1137/0207034. Bibtex: Ruskey1978a. Problems:389  .
  252. [Ruskey1981] Ruskey, Frank, "Listing and Counting Subtrees of a Tree," SIAM Journal on Computing, 10(1): 141--150, 1981.
    DOI: 10.1137/0210011. Bibtex: Ruskey1981. Problems:3  .
  253. [Ruskey1988] Ruskey, Frank, "Adjacent Interchange Generation of Combinations," Journal of Algorithms, 9(2): 162--180, 1988.
    DOI: 10.1016/0196-6774(88)90036-3. Bibtex: Ruskey1988. Problems:354  .
  254. [Ruskey1990] Ruskey, Frank and Proskurowski, Andrzej, "Generating Binary Trees by Transpositions," Journal of Algorithms, 11(1): 68--84, 1990.
    DOI: 10.1016/0196-6774(90)90030-I. Bibtex: Ruskey1990. Problems:351  .
  255. [Ruskey1992] Ruskey, Frank and Savage, Carla and {Min Yih Wang}, Terry, "Generating Necklaces," Journal of Algorithms, 13(3): 414--430, 1992.
    DOI: 10.1016/0196-6774(92)90047-G. Bibtex: Ruskey1992. Problems:41  .
  256. [Ruskey1992a] Ruskey, Frank, "Generating linear extensions of posets by transpositions," Journal of Combinatorial Theory, Series B, 54(1): 77--101, 1992.
    DOI: 10.1016/0095-8956(92)90067-8. Bibtex: Ruskey1992a. Problems:345  .
  257. [Ruskey1993] Ruskey, Frank, "Simple combinatorial Gray codes constructed by reversing sublists," In: Ng, K. W. and Raghavan, P. and Balasubramanian, N. V. and Chin, F. Y. L., ISAAC 1993: the 4th International Symposium on Algorithms and Computation, Vol. 762 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 201--208, Hong Kong, China, dec, 1993.
    DOI: 10.1007/3-540-57568-5_250. Bibtex: Ruskey1993. Problems:343  .
  258. [Ruskey1999] Ruskey, Frank and Sawada, Joe, "An Efficient Algorithm for Generating Necklaces With Fixed Density," SIAM Journal on Computing, 29(2): 671--684, 1999.
    DOI: 10.1137/S0097539798344112. Bibtex: Ruskey1999. Problems:42  .
  259. [Ruskey2000a] Ruskey, Frank and Sawada, Joe, "Generating necklaces and strings with forbidden substrings," In: Du, Ding-Zhu and Eades, Peter and Estivill-Castro, Vladimir and Lin, Xuemin and Sharma, Arun, COCOON 2000: the 6th Annual International Conference on Computing and Combinatorics, Vol. 1858 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 330--339, Sydney, Australia, jul, 2000.
    DOI: 10.1007/3-540-44968-X_33. Bibtex: Ruskey2000a. Problems:309  310  311  .
  260. [Sacomoto2013b] Sacomoto, Gustavo and Lacroix, Vincent and Sagot, Marie-france, "A Polynomial Delay Algorithm for the Enumeration of Bubbles with Length Constraints in Directed Graphs and Its Application to the Detection of Alternative Splicing in RNA-seq Data," In: Darling, Aaron and Stoye, Jens, WABI 2013: the 13th International Workshop on Algorithms in Bioinformatics, Vol. 8126 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 99--111, Sophia Antipolis, France, sep, 2013.
    DOI: 10.1007/978-3-642-40453-5_9. Bibtex: Sacomoto2013b. Problems:191  .
  261. [Saitoh2010a] Saitoh, Toshiki and Yamanaka, Katsuhisa and Kiyomi, Masashi and Uehara, Ryuhei, "Random generation and enumeration of proper interval graphs," IEICE Transactions on Information and Systems, E93-D(7): 1816--1823, 2010.
    DOI: 10.1587/transinf.E93.D.1816. Bibtex: Saitoh2010a. Problems:123  .
  262. [Saitoh2010b] Saitoh, Toshiki and Otachi, Yota and Yamanaka, Katsuhisa and Uehara, Ryuhei, "Random generation and enumeration of bipartite permutation graphs," Journal of Discrete Algorithms, 10(1): 84--97, 2012.
    DOI: 10.1016/j.jda.2011.11.001. Bibtex: Saitoh2010b. Problems:37  .
  263. [Saruwatari1993] Saruwatari, Yasufumi and Matsui, Tomomi, "A Note on \$K\$-Best Solutions to the Chinese Postman Problem," SIAM Journal on Optimization, 3(4): 726--733, 1993.
    DOI: 10.1137/0803037. Bibtex: Saruwatari1993. Problems:108  .
  264. [Savage1989] Savage, Carla D, "Gray Code Sequences of Partitions," Journal of Algorithms, 10(4): 577--595, 1989.
    DOI: 10.1016/0196-6774(89)90007-2. Bibtex: Savage1989. Problems:352  .
  265. [Savage1997] Savage, Carla, "A Survey of Combinatorial Gray Codes," SIAM Review, 39(4): 605--629, 1997.
    DOI: 10.1137/S0036144595295272. Bibtex: Savage1997. Problems:329  .
  266. [Sawada2001] Sawada, Joe, "Generating Bracelets in Constant Amortized Time," SIAM Journal on Computing, 31(1): 259--268, 2001.
    DOI: 10.1137/S0097539700377037. Bibtex: Sawada2001. Problems:43  .
  267. [Sawada2002a] Sawada, Joe, "A Fast Algorithm for Generating Nonisomorphic Chord Diagrams," SIAM Journal on Discrete Mathematics, 15(4): 546--561, 2002.
    DOI: 10.1137/S0895480100377970. Bibtex: Sawada2002a. Problems:295  .
  268. [Sawada2003] Sawada, Joe and Ruskey, Frank, "Generating Lyndon Brackets.," Journal of Algorithms, 46(1): 21--26, 2003.
    DOI: 10.1016/S0196-6774(02)00286-9. Bibtex: Sawada2003. Problems:292  .
  269. [Sawada2003a] Sawada, Joe, "A Fast Algorithm to Generate Necklaces With Fixed Content," Theoretical Computer Science, 301(1-3): 477--489, 2003.
    DOI: 10.1016/S0304-3975(03)00049-5. Bibtex: Sawada2003a. Problems:293  .
  270. [Sawada2006] Sawada, Joe, "Generating rooted and free plane trees," ACM Transactions on Algorithms, 2(1): 1--13, 2006.
    DOI: 10.1145/1125994.1125995. Bibtex: Sawada2006. Problems:276  277  .
  271. [Sawada2013] Sawada, Joe and Williams, Aaron, "A Gray code for fixed-density necklaces and Lyndon words in constant amortized time," Theoretical Computer Science, 502(None): 46--54, 2013.
    DOI: 10.1016/j.tcs.2012.01.013. Bibtex: Sawada2013. Problems:449  .
  272. [Schank2005] Schank, Thomas and Wagner, Dorothea, "Finding, counting and listing all triangles in large graphs, an experimental study," Experimental and Efficient Algorithms, 001907(None): 606--609, 2005.
    DOI: 10.1007/11427186_54. Bibtex: Schank2005. Problems:493  .
  273. [Schmidt2009] Schmidt, Matthew C. and Samatova, Nagiza F. and Thomas, Kevin and Park, Byung-Hoon, "A Scalable, Parallel Algorithm for Maximal Clique Enumeration," Journal of Parallel and Distributed Computing, 69(4): 417--428, 2009.
    DOI: 10.1016/j.jpdc.2009.01.003. Bibtex: Schmidt2009. Problems:227  .
  274. [Schultz1982] Schultz, Phillip, "Enumerations of rooted trees with an application to group presentations," Discrete Mathematics, 41(2): 199--214, 1982.
    DOI: 10.1016/0012-365X(82)90207-2. Bibtex: Schultz1982. Problems:443  .
  275. [Schwikowski2002] Schwikowski, Benno and Speckenmeyer, Ewald, "On enumerating all minimal solutions of feedback problems," Discrete Applied Mathematics, 117(1-3): 253--265, 2002.
    DOI: 10.1016/S0166-218X(00)00339-5. Bibtex: Schwikowski2002. Problems:22  23  24  .
  276. [Segoufin2013] Segoufin, Luc, "Enumerating with constant delay the answers to a query," In: Tan, Wang Chiew, ICDT 2013: the 16th International Conference on Database Theory, Vol. None of None, ACM Press, pp. 10--20, Genoa, Italy, mar, 2013.
    DOI: 10.1145/2448496.2448498. Bibtex: Segoufin2013. Problems:197  .
  277. [Seidel1990] Seidel, Raimund, "Small-dimensional linear programming and convex hulls made easy," Discrete \& Computational Geometry, 6(1): 423--434, 1991.
    DOI: 10.1007/BF02574699. Bibtex: Seidel1990. Problems:111  .
  278. [Semba1984] Semba, Ichiro, "An Efficient Algorithm for Generating all Partitions of the Set\{1, 2, ..., n\}," Journal of information processing, 7(1): 41--42, 1984.
    URI: http://ci.nii.ac.jp/naid/110002673365/. Bibtex: Semba1984. Problems:369  .
  279. [Setiawan2011] Setiawan, Andry and Nakano, Shin-ichi, "Listing all st-orientations," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E94-A(10): 1965--1970, 2011.
    DOI: 10.1587/transfun.E94.A.1965. Bibtex: Setiawan2011. Problems:174  .
  280. [Shen1997] Shen, Hong and Liang, Weifa, "Efficient Enumeration of All Minimal Separators in a Graph," Theoretical Computer Science, 180(1-2): 169--180, 1997.
    DOI: 10.1016/S0304-3975(97)83809-1. Bibtex: Shen1997. Problems:72  319  .
  281. [Shier1979] Shier, D. R., "On algorithms for finding the k shortest paths in a network," Networks, 9(3): 195--214, 1979.
    DOI: 10.1002/net.3230090303. Bibtex: Shier1979. Problems:109  .
  282. [Shioura1995] Shioura, Akiyoshi and Tamura, Akihisa, "Efficiently Scanning all Spanning Trees of an Undirected Graph," Journal of the Operations Research Society of Japan, 38(3): 331--344, 1995.
    DOI: 10.1.1.30.4555. Bibtex: Shioura1995. Problems:110  .
  283. [Shioura1997] Shioura, Akiyoshi and Tamura, Akihisa and Uno, Takeaki, "An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs," SIAM Journal on Computing, 26(3): 678--692, 1997.
    DOI: 10.1137/S0097539794270881. Bibtex: Shioura1997. Problems:15  .
  284. [Sorensen2005] S\"{o}rensen, Kenneth and Janssens, Gerrit K., "An algorithm to generate all spanning trees of a graph in order of increasing cost," Pesquisa Operacional, 25(2): 219--229, 2005.
    DOI: 10.1590/S0101-74382005000200004. Bibtex: Sorensen2005. Problems:285  .
  285. [Srimani1979] Srimani, Pradip K., "Generation of directed circuits in a directed graph," Proceedings of the IEEE, 67(9): 1361--1362, 1979.
    DOI: 10.1109/PROC.1979.11455. Bibtex: Srimani1979. Problems:440  .
  286. [Stix2004] Stix, Volker, "Finding All Maximal Cliques in Dynamic Graphs," Computational Optimization and Applications, 27(2): 173--186, 2004.
    DOI: 10.1023/B:COAP.0000008651.28952.b6. Bibtex: Stix2004. Problems:180  288  .
  287. [Stojmenovic2007] Stojmenovi\'{c}, Ivan and Zoghbi, Antoine, "Fast Algorithms for Genegrating Integer Partitions," International Journal of Computer Mathematics, 70(2): 319--332, 2007.
    DOI: 10.1080/00207169808804755. Bibtex: Stojmenovic2007. Problems:258  .
  288. [Strozecki2010a] Strozecki, Yann, "Enumeration of the Monomials of a Polynomial and Related Complexity Classes," In: Hlin\v{e}n\'{y}, Petr and Ku\v{c}era, Anton\'{\i}n, MFCS 2010: the 35th International Symposium on Mathematical Foundations of Computer Science, Vol. 6281 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 629--640, Brno, Czech Republic, aug, 2010.
    DOI: 10.1007/978-3-642-15155-2_55. Bibtex: Strozecki2010a. Problems:211  212  .
  289. [Syso1981] Sys{\l}o, Maciej M., "An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph," SIAM Journal on Computing, 10(4): 797--808, 1981.
    DOI: 10.1137/0210062. Bibtex: Syso1981. Problems:8  .
  290. [Szwarcfiter1976] Szwarcfiter, Jayme L. and Lauer, Peter E., "A search strategy for the elementary cycles of a directed graph," BIT, 16(2): 192--204, 1976.
    DOI: 10.1007/BF01931370. Bibtex: Szwarcfiter1976. Problems:465  .
  291. [Szwarcfiter1994] Szwarcfiter, Jayme L. and Chaty, Guy, "Enumerating the kernels of a directed graph with no odd circuits," Information Processing Letters, 51(3): 149--153, 1994.
    DOI: 10.1016/0020-0190(94)00072-7. Bibtex: Szwarcfiter1994. Problems:486  .
  292. [Szwarcfiter2003b] Szwarcfiter, JL, "Generating all forest extensions of a partially ordered set," In: Petreschi, Rossella and Persiano, Giuseppe and Silvestri, Riccardo, CIAC 2003: the 5th Italian Conference on Algorithms and Complexity, Vol. 2653 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 132--139, Rome, Italy, may, 2003.
    DOI: 10.1007/3-540-44849-7_19. Bibtex: Szwarcfiter2003b. Problems:294  .
  293. [Takagi2004] Takagi, Masahiro and Nakano, Shin-ichi, "Listing all rectangular drawings with certain properties," Systems and Computers in Japan, 35(4): 1--8, 2004.
    DOI: 10.1002/scj.10563. Bibtex: Takagi2004. Problems:167  .
  294. [Takeuchi] Takeuchi, Fumihiko and Imai, Hiroshi, "Enumerating triangulations for products of two simplices and for arbitrary configurations of points," In: Jiang, Tao and Lee, D. T., COCOON 1997: the 3rd Annual International Conference on Computing and Combinatorics, Vol. 1276 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 470--481, Shanghai, China, aug, 1997.
    DOI: 10.1007/BFb0045114. Bibtex: Takeuchi. Problems:112  113  .
  295. [Tamaki2000] Tamaki, Hisao, "Space-efficient enumeration of minimal transversals of a hypergraph (in Japanese)," In: None, SIGAL reports, Vol. None of None, Information Processing Society of Japan, pp. 29--36, None, nov, 2000.
    DOI: MY/Tamaki_2000_110002812417. Bibtex: Tamaki2000. Problems:302  .
  296. [Tarjan1973] Tarjan, Robert, "Enumeration of the Elementary Circuits of a Directed Graph," SIAM Journal on Computing, 2(3): 211--216, 1973.
    DOI: 10.1137/0202017. Bibtex: Tarjan1973. Problems:6  .
  297. [Tiernan1970] Tiernan, James C., "An efficient search algorithm to find the elementary circuits of a graph," Communications of the ACM, 13(12): 722--726, 1970.
    DOI: 10.1145/362814.362819. Bibtex: Tiernan1970. Problems:390  .
  298. [Tomita2006] Tomita, Etsuji and Tanaka, Akira and Takahashi, Haruhisa, "The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments," Theoretical Computer Science, 363(1): 28--42, 2006.
    DOI: 10.1016/j.tcs.2006.06.015. Bibtex: Tomita2006. Problems:278  .
  299. [Trojanowski1978] Trojanowski, Anthony E., "Ranking and Listing Algorithms for k -Ary Trees," SIAM Journal on Computing, 7(4): 492--509, 1978.
    DOI: 10.1137/0207039. Bibtex: Trojanowski1978. Problems:400  .
  300. [Tsukiyama1977a] Tsukiyama, Shuji and Ide, Mikio and Ariyoshi, Hiromu and Shirakawa, Isao, "A New Algorithm for Generating All the Maximal Independent Sets," SIAM Journal on Computing, 6(3): 505--517, 1977.
    DOI: 10.1137/0206036. Bibtex: Tsukiyama1977a. Problems:25  .
  301. [Tsukiyama1980] Tsukiyama, S. and Shirakawa, I. and Ozaki, H. and Ariyoshi, H., "An Algorithm to Enumerate All Cutsets of a Graph in Linear Time Per Cutset," Journal of the ACM, 27(4): 619--632, 1980.
    DOI: 10.1145/322217.322220. Bibtex: Tsukiyama1980. Problems:114  .
  302. [Uno1996] Uno, Takeaki, "An algorithm for enumerating all directed spanning trees in a directed graph," In: Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash, ISAAC 1996: the 7th International Symposium on Algorithms and Computation, Vol. 1178 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 166--173, Osaka, Japan, dec, 1996.
    DOI: 10.1007/BFb0009492. Bibtex: Uno1996. Problems:115  .
  303. [Uno1997] Uno, Takeaki, "Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs," In: Leong, Hon Wai and Imai, Hiroshi and Jain, Sanjay, ISAAC 1997: the 8th International Symposium on Algorithms and Computation, Vol. 1350 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 92--101, Singapore, dec, 1997.
    DOI: 10.1007/3-540-63890-3_11. Bibtex: Uno1997. Problems:32  .
  304. [Uno1998] Uno, Takeaki, "A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases," In: Asano, Takano and Imai, Hideki and Lee, D. T. and Nakano, Shin-ichi and Tokuyama, Takeshi, COCOON 1999: the 5th Annual International Conference on Computing and Combinatorics, Vol. 1627 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 349--359, Tokyo, Japan, jul, 1999.
    DOI: 10.1007/3-540-48686-0_35. Bibtex: Uno1998. Problems:117  118  119  .
  305. [Uno1998a] Uno, Takeaki, "New Approach for Speeding Up Enumeration Algorithms," In: Chwa, Kyung-Yong and Ibarra, Oscar H., ISAAC 1998: the 9th International Symposium on Algorithms and Computation, Vol. 1533 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 287--296, Taejon, Korea, dec, 1998.
    DOI: 10.1007/3-540-49381-6_31. Bibtex: Uno1998a. Problems:120  .
  306. [Uno2001] Uno, Takeaki, "A Fast Algorithm for Enumeration of Maximal Matchings in General Graphs," Journal of National Institute of Informatics, 3(-): 89--97, 2001.
    URI: http://research.nii.ac.jp/~uno/papers/enummat_nii.pdf. Bibtex: Uno2001. Problems:116  .
  307. [Uno2008a] Uno, Takeaki, "An efficient algorithm for solving pseudo clique enumeration problem," Algorithmica, 56(1): 3--16, 2010.
    DOI: 10.1007/s00453-008-9238-3. Bibtex: Uno2008a. Problems:254  .
  308. [Unoc] Uno, Takeaki and Satoh, Hiroko, "An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths," In: D\v{z}eroski, Sa\v{s}o and Panov, Pan\v{c}e and Kocev, Dragi and Todorovski, Ljup\v{c}o, DS 2014: the 17th International Conference on Discovery Science, Vol. 8777 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 313--324, Bled, Slovenia, oct, 2014.
    DOI: 10.1007/978-3-319-11812-3_27. Bibtex: Unoc. Problems:12  14  .
  309. [VanBaronaigien1988] van Baronaigien, D.Roelants and Ruskey, Frank, "Generating t-ary trees in A-order," Information Processing Letters, 27(4): 205--213, 1988.
    DOI: 10.1016/0020-0190(88)90027-0. Bibtex: VanBaronaigien1988. Problems:353  488  .
  310. [VanBaronaigien1991] van Baronaigien, D.Roelants, "A loopless algorithm for generating binary tree sequences," Information Processing Letters, 39(4): 189--194, 1991.
    DOI: 10.1016/0020-0190(91)90178-K. Bibtex: VanBaronaigien1991. Problems:350  .
  311. [Varol1981] Varol, Y. L., "An Algorithm to Generate All Topological Sorting Arrangements," The Computer Journal, 24(1): 83--84, 1981.
    DOI: 10.1093/comjnl/24.1.83. Bibtex: Varol1981. Problems:377  .
  312. [Walsh1998] Walsh, Timothy R., "Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time," Journal of Algorithms, 29(1): 165--173, 1998.
    DOI: 10.1006/jagm.1998.0960. Bibtex: Walsh1998. Problems:314  .
  313. [Wang1996] Wang, Terry Min Yih and Savage, Carla D., "A Gray Code for Necklaces of Fixed Density," SIAM Journal on Discrete Mathematics, 9(4): 654--673, 1996.
    DOI: 10.1137/S089548019528143X. Bibtex: Wang1996. Problems:328  .
  314. [Wang2009] Wang, Jianxin and Chen, B and Feng, Qilong and Chen, Jianer, "An efficient fixed-parameter enumeration algorithm for weighted edge dominating set," In: Deng, Xiaotie and Hopcroft, John E. and Xue, Jinyun, FAW 2009: the 3rd International Workshop on Frontiers in Algorithmics, Vol. 5598 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 237--250, Hefei, China, jun, 2009.
    DOI: 10.1007/978-3-642-02270-8_25. Bibtex: Wang2009. Problems:228  .
  315. [Wasa2012b] Wasa, Kunihiro and Kaneta, Yusaku and Uno, Takeaki and Arimura, Hiroki, "Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application," In: Gudmundsson, Joachim and Mestre, Juli\'{a}n and Viglas, Taso, COCOON 2012: the 18th Annual International Conference on Computing and Combinatorics, Vol. 7434 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 347--359, Sydney, Australia, aug, 2012.
    DOI: 10.1007/978-3-642-32241-9_30. Bibtex: Wasa2012b. Problems:4  .
  316. [Wasa2013] Wasa, Kunihiro and Uno, Takeaki and Hirata, Kouichi and Arimura, Hiroki, "Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph," In: F\"{u}rnkranz, Johannes and H\"{u}llermeier, Eyke and Higuchi, Tomoyuki, DS 2013: the 16th International Conference on Discovery Science, Vol. 8140 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 308--323, Singapore, oct, 2013.
    DOI: 10.1007/978-3-642-40897-7_21. Bibtex: Wasa2013. Problems:176  .
  317. [Wasa2014] Wasa, Kunihiro and Arimura, Hiroki and Uno, Takeaki, "Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph," In: Ahn, Hee-Kap and Shin, Chan-Su, ISAAC 2014: the 25th International Symposium on Algorithms and Computation, Vol. 6506 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 488, Jeonju, Korea, dec, 2014.
    DOI: 10.1007/978-3-319-13075-0_8. Bibtex: Wasa2014. Problems:376  .
  318. [Watanabe1960] Watanabe, H., "A Computational Method for Network Topology," IRE Transactions on Circuit Theory, 7(3): 296--302, 1960.
    DOI: 10.1109/TCT.1960.1086675. Bibtex: Watanabe1960. Problems:491  .
  319. [Watanabe1981] Watanabe, Osamu, "A fast algortihm for finding all shortest paths," Information Processing Letters, 13(1): 1--3, 1981.
    DOI: 10.1016/0020-0190(81)90139-3. Bibtex: Watanabe1981. Problems:179  .
  320. [Weinblatt1972] Weinblatt, Herbert, "A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph," Journal of the ACM, 19(1): 43--56, 1972.
    DOI: 10.1145/321679.321684. Bibtex: Weinblatt1972. Problems:406  412  .
  321. [Welch1965] Welch, J T, "Cycle Algorithms for Undirected Linear Graphs and Some immediate Applications," In: , Proceedings of the 1965 20th national conference, Vol. None of None, ACM Press, pp. 296--301, New York, New York, USA, aug, 1965.
    DOI: 10.1145/800197.806053. Bibtex: Welch1965. Problems:428  .
  322. [Welch1966] Welch, John T., "A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs," Journal of the ACM, 13(2): 205--210, 1966.
    DOI: 10.1145/321328.321331. Bibtex: Welch1966. Problems:421  .
  323. [Wells1961] Wells, Mark B., "Generation of permutations by transposition," Mathematics of Computation, 15(74): 192--195, 1961.
    DOI: 10.1090/S0025-5718-1963-0159764-2. Bibtex: Wells1961. Problems:381  .
  324. [Wettstein2014] Wettstein, Manuel, "Counting and Enumerating Crossing-free Geometric Graphs," In: , Annual Symposium on Computational Geometry - SOCG'14, Vol. None of None, ACM Press, pp. 1--10, New York, New York, USA, jun, 2014.
    DOI: 10.1145/2582112.2582145. Bibtex: Wettstein2014. Problems:425  .
  325. [White1970] White, John S., "Algorithm 374: Restricted partition generator [A1]," Communications of the ACM, 13(2): 120, 1970.
    DOI: 10.1145/362007.362046. Bibtex: White1970. Problems:411  .
  326. [Wild2008] Wild, Marcel, "Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion," Journal of Discrete Algorithms, 6(1): 93--102, 2008.
    DOI: 10.1016/j.jda.2007.01.005. Bibtex: Wild2008. Problems:243  244  245  246  .
  327. [Wild2013] Wild, Marcel, "Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree," Order, 31(1): 121--135, 2013.
    DOI: 10.1007/s11083-013-9292-6. Bibtex: Wild2013. Problems:198  199  .
  328. [Winter1986] Winter, Pawel, "An algorithm for the enumeration of spanning trees," BIT, 26(1): 44--62, 1986.
    DOI: 10.1007/BF01939361. Bibtex: Winter1986. Problems:445  .
  329. [Wright1986] Wright, Robert Alan and Richmond, Bruce and Odlyzko, Andrew and McKay, Brendan D., "Constant Time Generation of Free Trees," SIAM Journal on Computing, 15(2): 540--548, 1986.
    DOI: 10.1137/0215039. Bibtex: Wright1986. Problems:357  .
  330. [Xiang1997] Xiang, L., "Grammar-Oriented Enumeration of Binary Trees," The Computer Journal, 40(5): 278--291, 1997.
    DOI: 10.1093/comjnl/40.5.278. Bibtex: Xiang1997. Problems:318  .
  331. [Yamada2010] Yamada, Takeo and Kataoka, Seiji and Watanabe, Kohtaro, "Listing All the Minimum Spanning Trees in an Undirected Graph," International Journal of Computer Mathematics, 87(14): 3175--3185, 2010.
    DOI: 10.1080/00207160903329699. Bibtex: Yamada2010. Problems:214  .
  332. [Yamanaka2006] Yamanaka, Katsuhisa and Nakano, Shin-ichi, "Generating all realizers," Electronics and Communications in Japan (Part II: Electronics), 89(7): 40--47, 2006.
    DOI: 10.1002/ecjb.20276. Bibtex: Yamanaka2006. Problems:175  .
  333. [Yamanaka2007] Yamanaka, Katsuhisa and Kawano, Shin-ichiro and Kikuchi, Yosuke and Nakano, Shin-ichi, "Constant time generation of integer partitions," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A(5): 888--895, 2007.
    DOI: 10.1093/ietfec/e90-a.5.888. Bibtex: Yamanaka2007. Problems:164  .
  334. [Yamanaka2009] Yamanaka, Katsuhisa and Nakano, Shin-ichi, "Listing All Plane Graphs," Journal of Graph Algorithms and Applications, 13(1): 5--18, 2009.
    DOI: 10.7155/jgaa.00174. Bibtex: Yamanaka2009. Problems:17  18  .
  335. [Yamanaka2009a] Yamanaka, Katsuhisa and Otachi, Yota and Nakano, Shin-ichi, "Efficient Enumeration of Ordered Trees with k Leaves," In: Das, Sandip and Uehara, Ryuhei, WALCOM 2009: the 3rd International Workshop on Algorithms and Computation, Vol. 5431 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 141--150, Kolkata, India, feb, 2009.
    DOI: 10.1007/978-3-642-00202-1_13. Bibtex: Yamanaka2009a. Problems:163  .
  336. [Yamanaka2010] Yamanaka, Katsuhisa and Nakano, Shin-ichi and Matsui, Yasuko and Uehara, Ryuhei and Nakada, Kento, "Efficient Enumeration of All Ladder Lotteries and Its Application," Theoretical Computer Science, 411(16-18): 1714--1722, 2010.
    DOI: 10.1016/j.tcs.2010.01.002. Bibtex: Yamanaka2010. Problems:44  .
  337. [Yamanaka2014] Yamanaka, Katsuhisa and Nakano, Shin-ichi, "Efficient Enumeration of All Ladder Lotteries with k Bars," IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E97.A(6): 1163--1170, 2014.
    DOI: 10.1587/transfun.E97.A.1163. Bibtex: Yamanaka2014. Problems:169  .
  338. [Yasuko1994] Yasuko, Yoshida and Matsui, Tomomi, "Finding All the Edge Colorings in Bipartite Graphs (in Japanese)," IEEJ Transactions on Electronics, Information and Systems, 114(4): 444--449, 1994.
    URI: https://www.jstage.jst.go.jp/article/ieejeiss1987/114/4/114_4_444/_article/references/-char/ja/. Bibtex: Yasuko1994. Problems:122  .
  339. [Yau1967] Yau, S., "Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems," IEEE Transactions on Circuit Theory, 14(1): 79--81, 1967.
    DOI: 10.1109/TCT.1967.1082662. Bibtex: Yau1967. Problems:416  417  418  432  433  .
  340. [Yeh2010] Yeh, Li Pu and Wang, Biing Feng and Su, Hsin Hao, "Efficient algorithms for the problems of enumerating cuts by non-decreasing weights," Algorithmica, 56(3): 297--312, 2010.
    DOI: 10.1007/s00453-009-9284-5. Bibtex: Yeh2010. Problems:186  187  .
  341. [Yen1971] Yen, J. Y., "Finding the K Shortest Loopless Paths in a Network," Management Science, 17(11): 712--716, 1971.
    DOI: 10.1287/mnsc.17.11.712. Bibtex: Yen1971. Problems:121  .
  342. [Zaks1979] Zaks, Shumel and Richards, D., "Generating Trees and Other Combinatorial Objects Lexicographically," SIAM Journal on Computing, 8(1): 73--81, 1979.
    DOI: 10.1137/0208006. Bibtex: Zaks1979. Problems:397  .
  343. [Zaks1980] Zaks, Shmuel, "Lexicographic generation of ordered trees," Theoretical Computer Science, 10(1): 63--82, 1980.
    DOI: 10.1016/0304-3975(80)90073-0. Bibtex: Zaks1980. Problems:384  .
  344. [Zaks1982] Zaks, Shmuel, "Generation and ranking of K-ary trees," Information Processing Letters, 14(1): 44--48, 1982.
    DOI: 10.1016/0020-0190(82)90140-5. Bibtex: Zaks1982. Problems:374  .
  345. [Zerling1985] Zerling, David, "Generating Binary Trees Using Rotations," Journal of the ACM, 32(3): 694--701, 1985.
    DOI: 10.1145/3828.214141. Bibtex: Zerling1985. Problems:358  .
  346. [Zhuang2010] Zhuang, Bingbing and Nagamochi, Hiroshi, "Listing triconnected rooted plane graphs," In: Wu, Weili and Daescu, Ovidiu, COCOA 2010: the 4th International Conference on Combinatorial Optimization and Applications, Vol. 6509 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 347--361, Kailua-Kona, HI, USA, dec, 2010.
    DOI: 10.1007/978-3-642-17461-2_28. Bibtex: Zhuang2010. Problems:208  209  .
  347. [Zhuang2010a] Zhuang, Bingbing and Nagamochi, Hiroshi, "Generating Internally Triconnected rooted plane graphs," In: Kratochv{\'i}l, Jan and Li, Angsheng and Fiala, Ji{\v{r}}{\'i} and Kolman, Petr, TAMC 2010: the 7th Annual Conference on Theory and Applications of Models of Computation, Vol. 6108 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 467--478, Prague, Czech Republic, jun, 2010.
    DOI: 10.1007/978-3-642-13562-0_42. Bibtex: Zhuang2010a. Problems:219  220  .
  348. [Zhuang2010b] Zhuang, Bingbing and Nagamochi, Hiroshi, "Enumerating rooted graphs with reflectional block structures," In: Calamoneri, Tiziana and Diaz, Josep, CIAC 2010: the 7th International Conference on Algorithms and Complexity, Vol. 6078 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 49--60, Rome, Italy, may, 2010.
    DOI: 10.1007/978-3-642-13073-1_6. Bibtex: Zhuang2010b. Problems:221  .
  349. [Zhuang2010c] Zhuang, Bingbing and Nagamochi, Hiroshi, "Constant Time Generation of Biconnected Rooted Plane Graphs," In: Lee, Der-Tsai and Chen, Danny Z. and Ying, Shi, FAW 2010: the 4th International Workshop on Frontiers in Algorithmics, Vol. 6213 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, pp. 113--123, Wuhan, China, aug, 2010.
    DOI: 10.1007/978-3-642-14553-7_13. Bibtex: Zhuang2010c. Problems:215  216  217  .