TODO list(1243 - 344 = 899)

1205: , Luigi Fratta, Ugo Montanari, A Vertex Elimination Algorithm for Enumerating all Simple Paths in a Graph, 1975.
DOI: 10.1002/net.1975.5.2.151.
1206: , Ronald C. Read, Robert E. Tarjan, Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees, 1975.
DOI: 10.1002/net.1975.5.3.237.
798: R. C. Read, Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations, 1978.
DOI: 10.1016/S0167-5060(08)70325-X.
807: T. H. Matheiss, David S. Rubin, A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets, 1980.
DOI: 10.1287/moor.5.2.167.
1187: Jean-Claude Picard and Maurice Queyranne, On the structure of all minimum cuts in a network and applications, 1980.
DOI: 10.1007/BFb0120902.
1000: V.K. Bansal and K.B. Misra and M.P. Jain, Minimal pathset and minimal cutsets using search technique, 1982.
DOI: 10.1016/s0026-2714(82)80559-3.
758: Martin E. Dyer, The Complexity of Vertex Enumeration Methods, 1983.
DOI: 10.1287/moor.8.3.381.
1004: J. Scott Provan and Michael O. Ball, Computing Network Reliability in Time Polynomial in the Number of Cuts, 1984.
DOI: 10.1287/opre.32.3.516.
1064: R. Johnson, Network reliability and acyclic orientations, 1984.
DOI: 10.1002/net.3230140402.
734: Vladimir Kvasnicka, Jiri Pospichal, Canonical indexing and constructive enumeration of molecular graphs, 1990.
DOI: 10.1021/ci00066a001.
727: David Avis, Komei Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra, 1991.
DOI: 10.1145/109648.109659.
729: Dalit Naor, Vijay V. Vazirani, Representing and Enumerating Edge Connectivity Cuts in RNC, 1991.
DOI: 10.1007/BFb0028269.
1031: Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard, On-line and off-line vertex enumeration by adjacency lists, 1991.
DOI: 10.1016/0167-6377(91)90042-N.
722: David Avis, Komei Fukuda, A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra, 1992.
DOI: 10.1007/BF02293050.
723: Harald Gropp, Enumeration of regular graphs 100 years ago, 1992.
DOI: 10.1016/0012-365X(92)90592-4.
724: Leslie Ann Goldberg, Efficient Algorithms for Listing Unlabeled Graphs, 1992.
DOI: 10.1016/0196-6774(92)90009-2.
1108: , Sudeep Sarkar, Kim L. Boyer, Computing perceptual organization using voting methods and graphical enumeration, 1992.
DOI: 10.1109/ICPR.1992.201554.
200: Henning Spruth, Frank M. Johannes, Architectures for Parallel Slicing Enumeration in VLSI Layout, 1993.
DOI: 10.1007/3-540-57307-0_37.
914: Ferdinand Geue, An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex, 1993.
DOI: 10.1007/BF02023105.
1003: Dan Gusfield and Dalit Naor, Extracting maximal information about sets of minimum cuts, 1993.
DOI: 10.1007/bf01908632.
707: Takeo Yamada, J. Yoruzuya, Seiji Kataoka, Enumerating extreme points of a highly degenerate polytope, 1994.
DOI: 10.1016/0305-0548(94)90027-2.
710: David Eppstein, Arboricity and Bipartite Subgraph Listing Algorithms, 1994.
DOI: 10.1016/0020-0190(94)90121-X.
712: Leslie Ann Goldberg, Listing Graphs That Satisfy First-Order Sentences, 1994.
DOI: 10.1016/S0022-0000(05)80057-1.
53: Musiri M. Balakrishnarajan, Ponnambalam Venuvanalingam, A Fast Graph Traversal Algorithm for the Computer Enumeration of P-V Paths of Benzenoid Graphs, 1995.
DOI: 10.1016/0097-8485(94)00056-K.
697: Lawrence E. Widman, D. A. Tong, An algorithm for complete enumeration of the mechanisms of supraventricular tachycardias that use multiple atrioventricular, AV nodal, and/or Mahaim pathways, 1995.
DOI: 10.1016/0933-3657(95)00010-4.
701: Nader Bagherzadeh, Martin Dowd, Shahram Latifi, A Well-Behaved Enumeration of Star Graphs, 1995.
DOI: 10.1109/71.382321.
702: Ranga Vemuri, R. Kalyanaraman, Generation of design verification tests from behavioral VHDL programs using path enumeration and constraint programming, 1995.
DOI: 10.1109/92.386221.
703: Francisco Corella, Michel Langevin, Eduard Cerny, Zijian Zhou, Xiaoyu Song, State enumeration with abstract descriptions of state machines, 1995.
DOI: 10.1007/3-540-60385-9_9.
868: Noga Alon, Raphael Yuster, and Uri Zwick, Color-coding, 1995.
DOI: 10.1145/210332.210337.
1154: Thomas Eiter and Georg Gottlob, Identifying the Minimal Transversals of a Hypergraph and Related Problems, 1995.
DOI: 10.1137/S0097539793250299.
187: Jiri Pospichal, Vladimir Kvasnicka, Pruning the Search Tree in the Constructive Enumeration of Molecular Graphs, 1996.
DOI: 10.1016/0166-218X(95)00019-N.
689: Z. Zhang, B. He, Webb C. Miller, Local Multiple Alignment Via Subgraph Enumeration, 1996.
DOI: 10.1016/S0166-218X(96)00072-8.
692: Sylvain Petitjean, The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs, 1996.
DOI: 10.1007/BF00055147.
693: David Bryant, Hunting for Trees in Binary Character Sets - Efficient Algorithms for Extraction, Enumeration and Optimization, 1996.
DOI: 10.1089/cmb.1996.3.275.
694: Marwan A. Gharaybeh, Michael L. Bushnell, Vishwani D. Agrawal, An Exact Non-Enumerative Fault Simulator for Path-Delay Faults, 1996.
DOI: 10.1109/TEST.1996.556972.
1059: T. M. Chan, Optimal output-sensitive convex hull algorithms in two and three dimensions, 1996.
DOI: 10.1007/BF02712873.
676: Theodore A. Slaman, W. Hugh Woodin, Definability in the enumeration degrees, 1997.
DOI: 10.1007/s001530050064.
681: Yau-Tsun Steven Li, Sharad Malik, Performance analysis of embedded software using implicit path enumeration, 1997.
DOI: 10.1109/43.664229.
684: Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin, Enumerative Sequences of Leaves in Rational Trees, 1997.
DOI: 10.1007/3-540-63165-8_166.
185: Anne Bottreau, Yves Métivier, Minor Searching, Normal Forms of Graph Relabelling - Two Applications Based on Enumerations by Graph Relabelling, 1998.
DOI: 10.1007/BFb0053545.
666: David Bremner, Komei Fukuda, Ambros Marzetta, Primal - Dual Methods for Vertex and Facet Enumeration, 1998.
DOI: 10.1007/PL00009389.
673: Jin Ho Kwak, Jang-Ho Chun, Jaeun Lee, Enumeration of Regular Graph Coverings Having Finite Abelian Covering Transformation Groups, 1998.
DOI: 10.1137/S0895480196304428.
674: Nozomu Togawa, Takafumi Hisaki, Masao Yanagisawa, Tatsuo Ohtsuki, A High-Level Synthesis System for Digital Signal Processing Based on Enumerating Data-Flow Graphs, 1998.
DOI: 10.1109/ASPDAC.1998.669463.
675: Carlos G. Parodi, Vishwani D. Agrawal, Michael L. Bushnell, Shianling Wu, A non-enumerative path delay fault simulator for sequential circuits, 1998.
DOI: 10.1109/TEST.1998.743287.
1063: Matthew B Squire, Generating the Acyclic Orientations of a Graph, 1998.
DOI: 10.1006/jagm.1997.0891.
184: Frédérique Bassino, Marie-Pierre Béal, Dominique Perrin, Enumerative Sequences of Leaves and Nodes in Rational Trees, 1999.
DOI: 10.1016/S0304-3975(99)00026-2.
655: David Bedford, Roger M. Whitaker, Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8, 1999.
DOI: 10.1016/S0012-365X(99)90043-2.
658: Jürg Nievergelt, Narsingh Deo, Ambros Marzetta, Memory-Efficient Enumeration of Constrained Spanning Trees, 1999.
DOI: 10.1016/S0020-0190(99)00117-9.
659: Laimutis Bytautas, Douglas J. Klein, Alkane Isomer Combinatorics - Stereostructure Enumeration and Graph-Invariant and Molecular-Property Distributions, 1999.
DOI: 10.1021/ci990021g.
660: Shinsaku Fujita, Benzene Derivatives with Achiral and Chiral Substituents and Relevant Derivatives Derived from D6h Skeletons. Symmetry-Itemized Enumeration and Symmetry Characterization by the Unit-Subduced Cycle Index Approach, 1999.
DOI: 10.1021/ci980127w.
664: Kengo R. Azegami, Atsushi Takahashi, Y. Kajitan, Enumerating the min-cuts for applications to graph extraction under size constraints, 1999.
DOI: 10.1109/ISCAS.1999.780123.
651: Guang Gong, Zong-Duo Dai, Solomon W. Golomb, Enumeration and criteria for cyclically shift-distinct GMW sequences, 2000.
DOI: 10.1109/18.825810.
181: Maria K. Michael, Spyros Tragoudas, ATPG for Path Delay Faults without Path Enumeration, 2001.
DOI: 10.1109/ISQED.2001.915260.
641: Ambros Marzetta, Jürg Nievergelt, Enumerating the k best plane spanning trees, 2001.
DOI: 10.1016/S0925-7721(00)00029-8.
642: Bruno Courcelle, Johann A. Makowsky, Udi Rotics, On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic, 2001.
DOI: 10.1016/S0166-218X(00)00221-3.
646: Pankaj Pant, Yuan-Chieh Hsu, Sandeep K. Gupta, Abhijit Chatterjee, Path delay fault diagnosis in combinational circuits with implicitfault enumeration, 2001.
DOI: 10.1109/43.952739.
177: Virginie Gabrel, Daniel Vanderpooten, Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite, 2002.
DOI: 10.1016/S0377-2217(01)00188-6.
179: Nagiza F. Samatova, Al Geist, George Ostrouchov, Anatoli V. Melechko, Parallel Out-of-Core Algorithm for Genome-Scale Enumeration of Metabolic Systemic Pathways, 2002.
DOI: 10.1109/IPDPS.2002.1016588.
638: Joshua D. Knowles, David W. Corne, Enumeration of Pareto optimal multi-criteria spanning trees - a proof of the incorrectness of Zhou and Gen's proposed algorithm, 2002.
DOI: 10.1016/S0377-2217(01)00346-0.
639: Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke, Enumerating Foldings and Unfoldings Between Polygons and Polytopes, 2002.
DOI: 10.1007/s003730200005.
1002: Norman D. Curet and Jason DeVinney and Matthew E. Gaston, An efficient network flow code for finding all minimum cost s{\textendash}t cutsets, 2002.
DOI: 10.1016/s0305-0548(00)00058-7.
621: Takao Kato, Non-degenerate Linear Codes Determined by their Weight Enumerators, 2003.
DOI: 10.1007/s00200-002-0111-3.
625: Jonathan David Farley, Quasi-Differential Posets and Cover Functions of Distributive Lattices II - A Problem in Stanley's Enumerative Combinatorics, 2003.
DOI: 10.1007/s00373-003-0525-0.
626: Shigeru Owada, Yoshihisa Shinagawa, Frank Nielsen, Enumeration of Contour Correspondence, 2003.
DOI: 10.1142/S0219467803001214.
627: Joseph E. Bonin, Anna de Mier, Marc Noy, Lattice path matroids - enumerative aspects and Tutte polynomials, 2003.
DOI: 10.1016/S0097-3165(03)00122-5.
632: Nadia Takki-Chebihi, Takeshi Tokuyama, Enumerating Global Roundings of an Outerplanar Graph, 2003.
DOI: 10.1007/978-3-540-24587-2_44.
905: Thomas Eiter and Georg Gottlob and Kazuhisa Makino, New Results on Monotone Dualization and Generating Hypergraph Transversals, 2003.
DOI: 10.1137/S009753970240639X.
1001: Endre Boros and Khaled Elbassioni and Vladimir Gurvich and Leonid Khachiyan, Algorithms for Enumerating Circuits in Matroids, 2003.
DOI: 10.1007/978-3-540-24587-2_50.
1058: Jennifer D. Wagner, The permutation enumeration of wreath products Ck§Sn of cyclic and symmetric groups, 2003.
DOI: 10.1016/S0196-8858(02)00539-0.
608: Martin Klazar, Extremal problems for ordered hypergraphs - small patterns and some enumeration, 2004.
DOI: 10.1016/j.dam.2004.02.004.
612: Claudia Malvenuto, Francesco Pappalardi, Enumerating permutation polynomials II - k-cycles with minimal degree, 2004.
DOI: 10.1016/S1071-5797(03)00044-3.
616: Eric Kuo, Applications of graphical condensation for enumerating matchings and tilings, 2004.
DOI: 10.1016/j.tcs.2004.02.022.
618: J. B. Wells, Boris Yakobowski, Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis, 2004.
DOI: 10.1007/11506676_17.
1057: Weigen Yan, Fuji Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, 2004.
DOI: 10.1016/S0196-8858(03)00097-6.
1135: Pan Yu and Tulika Mitra, Scalable custom instructions identification for instruction-set extensible processors, 2004.
DOI: 10.1145/1023833.1023844.
50: Michel Bousquet, Cédric Lamathe, Enumeration of solid 2-trees according to edge number and edge degree distribution, 2005.
DOI: 10.1016/j.disc.2004.11.015.
170: Sean Barrett, Efficient Polygon Edge Enumeration, 2005.
DOI: 10.1080/2151237X.2005.10129193.
171: Hiro Ito, Kazuo Iwama, Tsuyoshi Osumi, Linear-Time Enumeration of Isolated Cliques, 2005.
DOI: 10.1007/11561071_13.
591: Lusine Yepremyan, James E. Falk, Delaunay partitions in Rn applied to non-convex programs and vertex/facet enumeration problems, 2005.
DOI: 10.1016/j.cor.2003.08.018.
594: Xiang-Dong Hou, Enumeration of certain affine invariant extended cyclic codes, 2005.
DOI: 10.1016/j.jcta.2004.10.002.
595: Weigen Yan, Fuji Zhang, Graphical condensation for enumerating perfect matchings, 2005.
DOI: 10.1016/j.jcta.2004.10.005.
597: Rongquan Feng, Jin Ho Kwak, Young Soo Kwon, Enumerating Typical Circulant Covering Projections Onto a Circulant Graph, 2005.
DOI: 10.1137/S0895480103431861.
598: Jin Ho Kwak, Alexander Mednykh, Valery A. Liskovets, Enumeration of Branched Coverings of Nonorientable Surfaces With Cyclic Branch Points, 2005.
DOI: 10.1137/S0895480103424043.
600: Jie Han, Yong Yu, Guowei Liu, Gui-Rong Xue, An Algorithm for Enumerating SCCs in Web Graph, 2005.
DOI: 10.1007/978-3-540-31849-1_64.
601: Tun Li, Yang Guo, GongJie Liu, Sikun Li, Functional Vectors Generation for RT-Level Verilog Descriptions Based on Path Enumeration and Constraint Logic Programming, 2005.
DOI: 10.1109/DSD.2005.43.
602: Richard Black, Austin Donnelly, Alexandru Gavrilescu, David Thaler, Fast Scalable Robust Node Enumeration, 2005.
DOI: 10.1007/11422778_21.
603: Jerry M. Couretas, Doohwan Kim, Enterprise architectures - documentation views, evaluation tools and design alternative enumeration, 2005.
DOI: 10.1109/ICSMC.2005.1571715.
1056: Meera Sitharam, Miklós Bóna, Counting and Enumeration of Self-assembly pathways for Symmetric macromolecular Structures, 2005.
DOI: 10.1142/9789812702098_0039.
49: Linfan Mao, Yanpei Liu, Erling Wei, The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration, 2006.
DOI: 10.1007/s00373-006-0637-4.
165: Li Wan, Bin Wu, Nan Du, Qi Ye, Ping Chen, A New Algorithm for Enumerating All Maximal Cliques in Complex Network, 2006.
DOI: 10.1007/11811305_67.
166: Hongbo Liu, Jiaxin Wang, A new way to enumerate cycles in graph, 2006.
DOI: 10.1109/AICT-ICIW.2006.22.
167: Daniel Mölle, Stefan Richter, Peter Rossmanith, Enumerate and Expand - Improved Algorithms for Connected Vertex Cover and Tree Cover, 2006.
DOI: 10.1007/11753728_28.
578: Andrei Gagarin, Gilbert Labelle, Pierre Leroux, The structure and unlabelled enumeration of toroidal graphs with no K3, 3's, 2006.
DOI: 10.1016/j.endm.2006.06.012.
580: Babak Taati, Michael A. Greenspan, Kamal Gupta, A Dynamic Load-Balancing Parallel Search for Enumerative Robot Path Planning, 2006.
DOI: 10.1007/s10846-006-9067-z.
582: Daniel Mölle, Stefan Richter, Peter Rossmanith, Enumerate and Expand - New Runtime Bounds for Vertex Cover Variants, 2006.
DOI: 10.1007/11809678_29.
584: D. Kebbal, Automatic Flow Analysis Using Symbolic Execution and Path Enumeration, 2006.
DOI: 10.1109/ICPPW.2006.26.
48: A. S. Bavan, A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph, 2007.
DOI: 10.1007/978-1-4020-8741-7_14.
163: Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizhong Xu, A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration, 2007.
DOI: 10.1109/ICC.2007.376.
164: Takeaki Uno, An Efficient Algorithm for Enumerating Pseudo Cliques, 2007.
DOI: 10.1007/978-3-540-77120-3_36.
554: Benjamin A. Burton, Enumeration of Non-Orientable 3-Manifolds Using Face-Pairing Graphs and Union-Find, 2007.
DOI: 10.1007/s00454-007-1307-x.
556: Emeric Gioan, Enumerating degree sequences in digraphs and a cycle-cocycle reversing system, 2007.
DOI: 10.1016/j.ejc.2005.11.006.
558: David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa, Enumerating Non-crossing Minimally Rigid Frameworks, 2007.
DOI: 10.1007/s00373-007-0709-0.
559: Shmuel Onn, Uriel G. Rothblum, The use of edge-directions and linear programming to enumerate vertices, 2007.
DOI: 10.1007/s10878-007-9063-7.
560: Michael J. Schlosser, Elliptic enumeration of nonintersecting lattice paths, 2007.
DOI: 10.1016/j.jcta.2006.07.002.
561: Seunghyun Seo, Heesung Shin, A generalized enumeration of labeled trees and reverse Prüfer algorithm, 2007.
DOI: 10.1016/j.jcta.2007.01.010.
562: Elmar Teufl, Stephan G. Wagner, Enumeration problems for classes of self-similar graphs, 2007.
DOI: 10.1016/j.jcta.2007.01.007.
563: Rongquan Feng, Jin Ho Kwak, Young Soo Kwon, Erratum - Enumerating Typical Circulant Covering Projections onto a Circulant Graph, 2007.
DOI: 10.1137/060653020.
564: Markus Behle, Friedrich Eisenbrand, 0/1 Vertex and Facet Enumeration with BDDs, 2007.
DOI: 10.1137/1.9781611972870.15.
565: Zareen Alamgir, Sarmad Abbasi, Combinatorial Algorithms for Listing Paths in Minimal Change Order, 2007.
DOI: 10.1007/978-3-540-77294-1_11.
566: Naoki Katoh, Shin-ichi Tanigawa, Enumerating Constrained Non-crossing Geometric Spanning Trees, 2007.
DOI: 10.1007/978-3-540-73545-8_25.
567: Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier, Isolation Concepts for Enumerating Dense Subgraphs, 2007.
DOI: 10.1007/978-3-540-73545-8_16.
569: Jian Yin, Zhilan Huang, Yubao Liu, Jiarong Cai, Jian Chen, An Effective Maximal Subspace Clustering Algorithm Based on Enumeration Tree, 2007.
DOI: 10.1109/FSKD.2007.149.
570: Dong (Haoyuan) Li, Anne Laurent, Maguelonne Teisseire, On Transversal Hypergraph Enumeration in Mining Sequential Patterns, 2007.
DOI: 10.1109/IDEAS.2007.4318119.
572: Joshua A. Grochow, Manolis Kellis, Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking, 2007.
DOI: 10.1007/978-3-540-71681-5_7.
948: Bia Kim, Jaesik Lee, Analysis of Enumeration Strategy Use in the ACT-R Cognitive Architecture, 2007.
DOI: 10.1109/ICNC.2007.235.
949: Hua Xiao, Amir H. Banihashemi, Error Rate Estimation of Finite-Length Low-Density Parity-Check Codes on Binary Symmetric Channels Using Cycle Enumeration, 2007.
DOI: 10.1109/ISIT.2007.4557138.
1138: Ajay K. Verma and Philip Brisk and Paolo Ienne, Rethinking custom {ISE} identification, 2007.
DOI: 10.1145/1289881.1289905.
45: Hiroki Fujiwara, Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Treelike Chemical Graphs with Given Path Frequency, 2008.
DOI: 10.1021/ci700385a.
153: Stephen J. Curran, Further results on the enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groups, 2008.
DOI: 10.1016/j.disc.2007.04.036.
154: Daniel Mölle, Stefan Richter, Peter Rossmanith, Enumerate and Expand - Improved Algorithms for Connected Vertex Cover and Tree Cover, 2008.
DOI: 10.1007/s00224-007-9089-3.
155: Ghazi Al-Naymat, Enumeration of maximal clique for mining spatial co-location patterns, 2008.
DOI: 10.1109/AICCSA.2008.4493526.
156: Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier, Enumerating Isolated Cliques in Synthetic and Financial Networks, 2008.
DOI: 10.1007/978-3-540-85097-7_38.
157: Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno, On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints, 2008.
DOI: 10.1007/978-3-540-69733-6_45.
534: Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon, On the Minimum Feedback Vertex Set Problem - Exact and Enumeration Algorithms, 2008.
DOI: 10.1007/s00453-007-9152-0.
535: Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, On Enumerating Minimal Dicuts and Strongly Connected Subgraphs, 2008.
DOI: 10.1007/s00453-007-9074-x.
536: Maria L. Affatato, Thomas F. Kent, Andrea Sorbi, Branching in the S02{Sigma02}-enumeration degrees - a new perspective, 2008.
DOI: 10.1007/s00153-008-0081-7.
537: Paul Brodhead, Douglas A. Cenzer, Effectively closed sets and enumerations, 2008.
DOI: 10.1007/s00153-008-0065-7.
538: Enrique F. Castillo, José María Menéndez, Santos Sánchez-Cambronero, Traffic Estimation and Optimal Counting Location Without Path Enumeration Using Bayesian Networks, 2008.
DOI: 10.1111/j.1467-8667.2008.00526.x.
539: Edy Tri Baskoro, Yus Mochamad Cholily, Mirka Miller, Enumerations of vertex orders of almost Moore digraphs with selfrepeats, 2008.
DOI: 10.1016/j.disc.2007.03.035.
540: Benny Kimelfeld, Yehoshua Sagiv, Efficiently enumerating results of keyword search over data graphs, 2008.
DOI: 10.1016/j.is.2008.01.002.
541: W. Matthew Carlyle, Johannes O. Royset, R. Kevin Wood, Lagrangian relaxation and enumeration for solving constrained shortest-path problems, 2008.
DOI: 10.1002/net.20247.
542: Kubilay Atasu, Oskar Mencer, Wayne Luk, Can C. Özturan, Günhan Dündar, Fast custom instruction identification by convex subgraph enumeration, 2008.
DOI: 10.1109/ASAP.2008.4580145.
544: Min Li, Bruno Bougard, Eduardo Lopez-Estraviz, André Bourdoux, David Novo, Liesbet Van der Perre, Francky Catthoor, Selective Spanning with Fast Enumeration - A Near Maximum-Likelihood MIMO Detector Designed for Parallel Programmable Baseband Architectures, 2008.
DOI: 10.1109/ICC.2008.144.
546: Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger, Enumerative coding for tree sources, 2008.
DOI: 10.1109/ISIT.2008.4595433.
547: Katsuhisa Yamanaka, Shin-Ichi Nakano, Listing All Plane Graphs, 2008.
DOI: 10.1007/978-3-540-77891-2_20.
548: Jeong Woo Son, Seong-Bae Park, Se-Young Park, An Ontology Alignment Basedon Parse Tree Kernel for Combining Structural and Semantic Information without Explicit Enumeration of Features, 2008.
DOI: 10.1109/WIIAT.2008.239.
988: Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger, Enumerative coding for tree sources, 2008.
DOI: 10.1109/ITW.2008.4578664.
42: Naoki Katoh, Shin-ichi Tanigawa, Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees, 2009.
DOI: 10.1016/j.dam.2009.04.019.
143: Øystein J. Rødseth, James A. Sellers, Helge Tverberg, Enumeration of the degree sequences of non-separable graphs and connected graphs, 2009.
DOI: 10.1016/j.ejc.2008.10.006.
144: Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo, A game-theoretic approach to partial clique enumeration, 2009.
DOI: 10.1016/j.imavis.2008.10.003.
145: Fuji Zhang, Weigen Yan, Enumerating spanning trees of graphs with an involution, 2009.
DOI: 10.1016/j.jcta.2008.10.004.
149: Bin Wu, Shengqi Yang, Haizhou Zhao, Bai Wang, A Distributed Algorithm to Enumerate All Maximal Cliques in MapReduce, 2009.
DOI: 10.1109/FCST.2009.30.
150: Tomoyuki Uchida, Kayo Kawamoto, Algorithm for Enumerating All Maximal Frequent Tree Patterns among Words in Tree-Structured Documents and Its Application, 2009.
DOI: 10.1007/978-3-642-10583-8_14.
151: Nan Du, Bin Wu, Liutong Xu, Bai Wang, Pei Xin, Parallel Algorithm for Enumerating Maximal Cliques in Complex Network, 2009.
DOI: 10.1007/978-3-540-88067-7_12.
500: Wassim Ayadi, Mourad Elloumi, Jin-Kao Hao, A biclustering algorithm based on a Bicluster Enumeration Tree - application to DNA microarray data, 2009.
DOI: 10.1186/1756-0381-2-9.
501: Jiun-Rung Chen, Ye-In Chang, A Condition-Enumeration Tree method for mining biclusters from DNA microarray data sets, 2009.
DOI: 10.1016/j.biosystems.2009.04.003.
502: YunMei Dong, Linear algorithm for lexicographic enumeration of CFG parse trees, 2009.
DOI: 10.1007/s11432-009-0132-7.
504: Alun Thomas, Peter J. Green, Enumerating the decomposable neighbors of a decomposable graph under a simple perturbation scheme, 2009.
DOI: 10.1016/j.csda.2008.10.029.
505: Aygul Mamut, Qiongxiang Huang, Fenjin Liu, Enumeration of 2-regular circulant graphs and directed double networks, 2009.
DOI: 10.1016/j.dam.2008.03.019.
508: Rongquan Feng, Jin Ho Kwak, Young Soo Kwon, Enumerating typical abelian prime-fold coverings of a circulant graph, 2009.
DOI: 10.1016/j.disc.2008.04.045.
509: Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras, Enumeration of strings in Dyck paths - A bijective approach, 2009.
DOI: 10.1016/j.disc.2008.08.005.
512: Jan Kyncl, Enumeration of simple complete topological graphs, 2009.
DOI: 10.1016/j.ejc.2009.03.005.
513: David G. Wagner, Weighted enumeration of spanning subgraphs with degree constraints, 2009.
DOI: 10.1016/j.jctb.2008.07.007.
515: N. S. Bhagat, Efficient Spanning Tree Enumeration Using Loop Domain, 2009.
DOI: 10.1109/JSYST.2009.2037287.
516: Hua Xiao, Amir H. Banihashemi, Error rate estimation of low-density parity-check codes on binary symmetric channels using cycle enumeration, 2009.
DOI: 10.1109/TCOMM.2009.06.070048.
518: Yang Xiang, Zoe Jingyu Zhu, Yu Li, Enumerating Unlabeled and Root Labeled Trees for Causal Model Acquisition, 2009.
DOI: 10.1007/978-3-642-01818-3_17.
522: Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf, Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs, 2009.
DOI: 10.1007/978-3-642-04128-0_13.
525: Jonathan Widger, Daniel Grosu, Computing Equilibria in Bimatrix Games by Parallel Vertex Enumeration, 2009.
DOI: 10.1109/ICPP.2009.11.
526: Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Stereoisomers of Tree Structured Molecules Using Dynamic Programming, 2009.
DOI: 10.1007/978-3-642-10631-6_4.
527: Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara, Random Generation and Enumeration of Bipartite Permutation Graphs, 2009.
DOI: 10.1007/978-3-642-10631-6_111.
530: Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara, Random Generation and Enumeration of Proper Interval Graphs, 2009.
DOI: 10.1007/978-3-642-00202-1_16.
987: Marko Petkovsek, Helena Zakrajsek, Enumeration of I-graphs - Burnside does it again, 2009.
DOI: 10.26493/1855-3974.113.3dc.
990: Mitre Costa Dourado and Rodolfo Alves de Oliveira and F{\'{a}}bio Protti, Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals, 2009.
DOI: 10.1016/j.endm.2009.11.053.
1055: Andrei Gagarin, Gilbert Labelle, Pierre Leroux, Timothy Walsh 0001, Structure and enumeration of two-connected graphs with prescribed three-connected components, 2009.
DOI: 10.1016/j.aam.2009.01.002.
1134: P. Balister and S. Gerke and G. Gutin and A. Johnstone and J. Reddington and E. Scott and A. Soleimanfallah and A. Yeo, Algorithms for generating convex sets in acyclic digraphs, 2009.
DOI: 10.1016/j.jda.2008.07.008.
1136: Tao Li and Zhigang Sun and Wu Jigang and Xicheng Lu, Fast enumeration of maximal valid subgraphs for custom-instruction identification, 2009.
DOI: 10.1145/1629395.1629402.
1178: , Ghassan Shobaki, Kent D. Wilken, Mark Heffernan, Optimal trace scheduling using enumeration, 2009.
DOI: 10.1145/1498690.1498694.
2: Li Lu, Yunhong Gu, Robert L. Grossman, dMaximalCliques - A Distributed Algorithm for Enumerating All Maximal Cliques and Maximal Clique Distribution, 2010.
DOI: 10.1109/ICDMW.2010.13.
37: Yusuke Ishida, Yuki Kato, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu, Branch-and-Bound Algorithms for Enumerating Treelike Chemical Graphs with Given Path Frequency Using Detachment-Cut, 2010.
DOI: 10.1021/ci900447z.
38: William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova, Theoretical underpinnings for maximal clique enumeration on perturbed graphs, 2010.
DOI: 10.1016/j.tcs.2010.03.011.
136: Tai Hyo Kim, Hojung Bang, Sung Deok Cha, A systematic representation of path constraints for implicit path enumeration technique, 2010.
DOI: 10.1002/stvr.406.
137: Ajay K. Verma, Philip Brisk, Paolo Ienne, Fast, Nearly Optimal ISE Identification With I/O Serialization Through Maximal Clique Enumeration, 2010.
DOI: 10.1109/TCAD.2010.2041849.
141: Kyriakos Christou, Maria K. Michael, Stelios Neophytou, Identification of critical primitive path delay faults without any path enumeration, 2010.
DOI: 10.1109/VTS.2010.5469629.
479: Charles M. Harris, Goodness in the enumeration and singleton degrees, 2010.
DOI: 10.1007/s00153-010-0192-9.
480: Mariya Ivanova Soskova, The limitations of cupping in the local structure of the enumeration degrees, 2010.
DOI: 10.1007/s00153-009-0171-1.
482: Elmar Teufl, Stephan G. Wagner, Enumeration of matchings in families of self-similar graphs, 2010.
DOI: 10.1016/j.dam.2010.05.006.
484: Markus Kuba, Alois Panholzer, Enumeration results for alternating tree families, 2010.
DOI: 10.1016/j.ejc.2010.03.001.
485: Zhicheng Gao, Han Ren, Enumerative Properties of Rooted Circuit Maps, 2010.
DOI: 10.1007/s00373-010-0937-6.
487: Xiang-Dong Hou, Enumeration of AGL(m/3, double struck capital Fp³)-invariant extended cyclic codes, 2010.
DOI: 10.1504/IJICOT.2010.032137.
489: Jens Hermans, Michael Schneider 0002, Johannes A. Buchmann, Frederik Vercauteren, Bart Preneel, Parallel Shortest Lattice Vector Enumeration on Graphics Cards, 2010.
DOI: 10.1007/978-3-642-12678-9_4.
493: Zhao Zhao, Maleq Khan, V. S. Anil Kumar, Madhav V. Marathe, Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming, 2010.
DOI: 10.1109/ICPP.2010.67.
494: Reinhard Pichler, Stefan Rümmele, Stefan Woltran, Counting and Enumeration Problems with Bounded Treewidth, 2010.
DOI: 10.1007/978-3-642-17511-4_22.
33: Masaaki Shimizu, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies, 2011.
DOI: 10.1186/1471-2105-12-S14-S3.
35: David Eppstein, Darren Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, 2011.
DOI: 10.1007/978-3-642-20662-7_31.
122: Taoyang Wu, Louxin Zhang, Structural properties of the reconciliation space and their applications in enumerating nearly-optimal reconciliations between a gene tree and a species tree, 2011.
DOI: 10.1186/1471-2105-12-S9-S7.
123: Peter Tittmann, Ilya Averbouch, Johann A. Makowsky, The enumeration of vertex induced subgraphs with respect to the number of components, 2011.
DOI: 10.1016/j.ejc.2011.03.017.
124: Prabhakar Tiwari, Ibraheem, N. K. Sharma, Enumeration of spanning trees of graph - alternative methods, 2011.
DOI: 10.1504/IJMOR.2011.038909.
126: Heidi Gebauer, Finding and enumerating Hamilton cycles in 4-regular graphs, 2011.
DOI: 10.1016/j.tcs.2011.04.038.
128: Stelios Neophytou, Kyriakos Christou, Maria K. Michael, An Approach for Quantifying Path Correlation in Digital Circuits without any Path or Segment Enumeration, 2011.
DOI: 10.1109/ETS.2011.44.
129: Xiao Yang, Jaroslaw Zola, Srinivas Aluru, Parallel Metagenomic Sequence Clustering Via Sketching and Maximal Quasi-clique Enumeration on Map-Reduce Clouds, 2011.
DOI: 10.1109/IPDPS.2011.116.
130: John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston, The Maximum Clique Enumeration Problem - Algorithms, Applications and Implementations, 2011.
DOI: 10.1007/978-3-642-21260-4_30.
131: Rafael A. Arce-Nazario, José R. Ortiz-Ubarri, Enumeration of Costas Arrays Using GPUs and FPGAs, 2011.
DOI: 10.1109/ReConFig.2011.36.
132: René Schott, G. Stacey Staples, On the Complexity of Cycle Enumeration for Simple Graphs, 2011.
DOI: 10.1007/978-0-85729-811-9_12.
453: Yonglin Cao, Generalized quasi-cyclic codes over Galois rings - structural properties and enumeration, 2011.
DOI: 10.1007/s00200-011-0145-5.
456: Yonglin Cao, Structural properties and enumeration of 1-generator generalized quasi-cyclic codes, 2011.
DOI: 10.1007/s10623-010-9417-5.
458: Tomoki Imada, Shunsuke Ota, Hiroshi Nagamochi, Tatsuya Akutsu, Efficient Enumeration of Stereoisomers of Outerplanar Chemical Graphs Using Dynamic Programming, 2011.
DOI: 10.1021/ci200084b.
459: Pu Liu, Dimitris K. Agrafiotis, Dmitrii N. Rassokhin, Power Keys - A Novel Class of Topological Descriptors Based on Exhaustive Subgraph Enumeration and their Application in Substructure Searching, 2011.
DOI: 10.1021/ci200282z.
460: Wanli Zuo, Yongheng Chen, Fengling He, Kerui Chen, Optimization Strategy of Top-Down Join Enumeration on Modern Multi-Core CPUs, 2011.
DOI: 10.4304/jcp.6.10.2004-2012.
462: Ira M. Gessel, Ji Li, Enumeration of point-determining graphs, 2011.
DOI: 10.1016/j.jcta.2010.03.009.
463: Heesung Shin, Jiang Zeng, A bijective enumeration of labeled trees with given indegree sequence, 2011.
DOI: 10.1016/j.jcta.2010.07.001.
464: Changli Ma, Liwei Zeng, Yang Liu, Dengguo Feng, Cunsheng Ding, The Weight Enumerator of a Class of Cyclic Codes, 2011.
DOI: 10.1109/TIT.2010.2090272.
467: Minghao Piao, Jong Bum Lee, Ho-Sun Shon, Unil Yun, Keun Ho Ryu, Enumeration Tree Based Emerging Patterns Mining by Using Two Different Supports, 2011.
DOI: 10.1007/978-3-642-24082-9_86.
469: Tobias Nipkow, Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism, 2011.
DOI: 10.1007/978-3-642-22863-6_21.
470: Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger, Enumerating Minimal Subset Feedback Vertex Sets, 2011.
DOI: 10.1007/978-3-642-22300-6_34.
471: David Robert Martin Thompson, Samantha Leung, Kevin Leyton-Brown, Computing Nash Equilibria of Action-Graph Games via Support Enumeration, 2011.
DOI: 10.1007/978-3-642-25510-6_29.
985: Alexander Mednykh, Alain Giorgetti, Enumeration of genus-four maps by number of edges, 2011.
DOI: 10.26493/1855-3974.132.fe2.
991: Mohammad Tanvir Parvez and Md. Saidur Rahman and Shin-ichi Nakano, Generating All Triangulations of Plane Graphs, 2011.
DOI: 10.7155/jgaa.00234.
116: Tobias Marschall, Ivan G. Costa, Stefan Canzar, Markus Bauer, Gunnar W. Klau, Alexander Schliep, Alexander Schönhuth, CLEVER - clique-enumerating variant finder, 2012.
DOI: 10.1093/bioinformatics/bts566.
117: John D. Eblen, Charles A. Phillips, Gary L. Rogers, Michael A. Langston, The maximum clique enumeration problem - algorithms, applications, and implementations, 2012.
DOI: 10.1186/1471-2105-13-S10-S5.
118: Seunghyun Seo, Heesung Shin, On the enumeration of rooted trees with fixed size of maximal decreasing trees, 2012.
DOI: 10.1016/j.disc.2011.10.001.
119: Rafael A. Arce-Nazario, José R. Ortiz-Ubarri, Multidimensional Costas Arrays and Their Enumeration Using GPUs and FPGAs, 2012.
DOI: 10.1155/2012/196761.
419: Daniele Marsibilio, Andrea Sorbi, Bounded enumeration reducibility and its degree structure, 2012.
DOI: 10.1007/s00153-011-0259-2.
420: Pablo Carbonell, Davide Fichera, Shashi Bhushan Pandit, Jean-Loup Faulon, Enumerating metabolic pathways for the production of heterologous target chemicals in chassis organisms, 2012.
DOI: 10.1186/1752-0509-6-10.
421: Dror Marcus, Yuval Shavitt, RAGE - A rapid graphlet enumerator for large networks, 2012.
DOI: 10.1016/j.comnet.2011.08.019.
425: Sajid Siraj, Ludmil Mikhailov, John A. Keane, Enumerating all spanning trees for pairwise comparisons, 2012.
DOI: 10.1016/j.cor.2011.03.010.
426: Sajid Siraj, Ludmil Mikhailov, John A. Keane, Corrigendum to "Enumerating all spanning trees for pairwise comparisons", 2012.
DOI: 10.1016/j.cor.2011.11.010.
427: Valentin Féray, Ekaterina A. Vassilieva, Bijective enumeration of some colored permutations given by the product of two long cycles, 2012.
DOI: 10.1016/j.disc.2011.09.010.
428: Timothy R. S. Walsh, Alain Giorgetti, Alexander Mednykh, Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices, 2012.
DOI: 10.1016/j.disc.2011.11.027.
429: Bodo Lass, The algebra of set functions II - An enumerative analogue of Hall's theorem for bipartite graphs, 2012.
DOI: 10.1016/j.ejc.2011.09.037.
430: Marta M. B. Pascoal, Antonio Sedeño-Noda, Enumerating K best paths in length order in DAGs, 2012.
DOI: 10.1016/j.ejor.2012.04.001.
431: Stelios Neophytou, Kyriakos Christou, Maria K. Michael, A Non-Enumerative Technique for Measuring Path Correlation in Digital Circuits, 2012.
DOI: 10.1007/s10836-012-5333-0.
433: Siamak Haji Yakhchali, A path enumeration approach for the analysis of critical activities in fuzzy networks, 2012.
DOI: 10.1016/j.ins.2012.01.025.
435: Vadlamudi Ch. Venkaiah, T. Aaron Gulliver, Quasi-cyclic codes over F13 and enumeration of defining polynomials, 2012.
DOI: 10.1016/j.jda.2012.04.006.
437: Oliver Serang, William Stafford Noble, Faster Mass Spectrometry-Based Protein Inference - Junction Trees Are More Efficient than Sampling and Marginalization by Enumeration, 2012.
DOI: 10.1109/TCBB.2012.26.
439: Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano, Efficient enumeration of ordered trees with k leaves, 2012.
DOI: 10.1016/j.tcs.2011.01.017.
440: Andrey V. Savchenko, Face Recognition in Real-Time Applications - A Comparison of Directed Enumeration Method and K-d Trees, 2012.
DOI: 10.1007/978-3-642-33281-4_15.
443: Arpan Roy, Dong Seong Kim, Kishor S. Trivedi, Scalable optimal countermeasure selection using implicit enumeration on attack countermeasure trees, 2012.
DOI: 10.1109/DSN.2012.6263940.
444: Ahish Mysore Somashekar, Spyros Tragoudas, Sreenivas Gangadhar, Rathish Jayabharathi, Non-enumerative generation of statistical path delays for ATPG, 2012.
DOI: 10.1109/ICCD.2012.6378700.
446: ManWo Ng, Link observability without path enumeration - A revisit, 2012.
DOI: 10.1109/ITSC.2012.6338622.
447: Mohamed Larbi Rebaiaia, Daoud Ait-Kadi, An Efficient Algorithm for Enumerating Minimal PathSets in Communication Networks, 2012.
DOI: 10.1007/978-3-642-30507-8_38.
448: Adam Betts, Reducing the Size of the Constraint Model in Implicit Path Enumeration Using Super Blocks, 2012.
DOI: 10.1109/RTSS.2012.88.
1137: Kubilay Atasu and Wayne Luk and Oskar Mencer and Can Ozturan and Günhan Dundar, {FISH}: Fast Instruction {SyntHesis} for Custom Processors, 2012.
DOI: 10.1109/TVLSI.2010.2090543.
30: Justin Salez, Weighted enumeration of spanning subgraphs in locally tree-like graphs, 2013.
DOI: 10.1002/rsa.20436.
109: Stéphane Bessy, Frédéric Havet, Enumerating the edge-colourings and total colourings of a regular graph, 2013.
DOI: 10.1007/s10878-011-9448-5.
113: Srinivas Aluru, Large-scale metagenomic clustering via quasi clique enumeration and read assignment ambiguity resolution, 2013.
DOI: 10.1109/ICCABS.2013.6629239.
114: Abhijin Adiga, Anil Kumar S. Vullikanti, Dante Wiggins, Subgraph Enumeration in Dynamic Graphs, 2013.
DOI: 10.1109/ICDM.2013.157.
382: Enrique F. Castillo, Aida Calvino, Santos Sánchez-Cambronero, María Nogal, Ana Rivas, A percentile system optimization approach with and without path enumeration, 2013.
DOI: 10.1016/j.cor.2013.05.004.
383: Jan Kyncl, Improved Enumeration of Simple Topological Graphs, 2013.
DOI: 10.1007/s00454-013-9535-8.
384: Haimiao Chen, Enumerating typical abelian coverings of Cayley graphs, 2013.
DOI: 10.1016/j.disc.2013.03.021.
386: Yang Zhao, Morihiro Hayashida, Jira Jindalertudomdee, Hiroshi Nagamochi, Tatsuya Akutsu, Breadth-First Search Approach to Enumeration of Tree-like Chemical Compounds, 2013.
DOI: 10.1142/S0219720013430075.
387: Masahiko Taniguchi, Hai Du, Jonathan S. Lindsey, Enumeration of Virtual Libraries of Combinatorial Modular Macrocyclic (Bracelet, Necklace) Architectures and Their Linear Counterparts, 2013.
DOI: 10.1021/ci400175f.
392: Zhengchun Zhou, Cunsheng Ding, Jinquan Luo, Aixian Zhang, A Family of Five-Weight Cyclic Codes and Their Weight Enumerators, 2013.
DOI: 10.1109/TIT.2013.2267722.
393: Zhengchun Zhou, Aixian Zhang, Cunsheng Ding, Maosheng Xiong, The Weight Enumerator of Three Families of Cyclic Codes, 2013.
DOI: 10.1109/TIT.2013.2262095.
397: David Avis, Gary Roumanis, A Portable Parallel Implementation of the lrs Vertex Enumeration Code, 2013.
DOI: 10.1007/978-3-319-03780-6_36.
398: Ethan K. Jackson, Gabor Simko, Janos Sztipanovits, Diversely enumerating system-level architectures, 2013.
DOI: 10.1109/EMSOFT.2013.6658589.
400: Kefei Liu, Hing-Cheung So, João Paulo C. Lustosa da Costa, Lei Huang, Core consistency diagnostic aided by reconstruction error for accurate enumeration of the number of components in parafac models, 2013.
DOI: 10.1109/ICASSP.2013.6638945.
401: Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman, Enumerating subgraph instances using map-reduce, 2013.
DOI: 10.1109/ICDE.2013.6544814.
402: George M. Slota, Kamesh Madduri, Fast Approximate Subgraph Counting and Enumeration, 2013.
DOI: 10.1109/ICPP.2013.30.
404: Behzad Amiri, Jörg Kliewer, Lara Dolecek, Analysis and enumeration of absorbing sets for non-binary graph-based codes, 2013.
DOI: 10.1109/ISIT.2013.6620739.
405: Stefan Granlund, Liang Liu, Chenxin Zhang, Viktor Öwall, Implementation of a highly-parallel soft-output MIMO detector with fast node enumeration, 2013.
DOI: 10.1109/NORCHIP.2013.6702034.
407: Kunihiro Wasa, Kouichi Hirata, Takeaki Uno, Hiroki Arimura, Faster Algorithms for Tree Similarity Based on Compressed Enumeration of Bounded-Sized Ordered Subtrees, 2013.
DOI: 10.1007/978-3-642-41062-8_8.
408: Amro M. Farid, An Axiomatic Design Approach to Production Path Enumeration in Reconfigurable Manufacturing Systems, 2013.
DOI: 10.1109/SMC.2013.659.
409: Roberto Grossi, Pattern Discovery and Listing in Graphs, 2013.
DOI: 10.1007/978-3-319-02432-5_2.
910: Jan Arne Telle and Yngve Villanger, Connecting Terminals and 2-Disjoint Connected Subgraphs, 2013.
DOI: 10.1007/978-3-642-45043-3_36.
25: Maciej Dziemianczuk, Enumerations of plane trees with multiple edges and Raney lattice paths, 2014.
DOI: 10.1016/j.disc.2014.07.024.
26: Hans Raj Tiwary, Khaled M. Elbassioni, Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism, 2014.
DOI: 10.1007/s00373-013-1299-7.
86: Sergey Kitaev, Anna de Mier, Enumeration of Fixed Points of an Involution on β(1, 0)-Trees, 2014.
DOI: 10.1007/s00373-013-1336-6.
87: Makoto Ueno, Shinsei Tazawa, Enumeration of Bipartite Self-Complementary Graphs, 2014.
DOI: 10.1007/s00373-012-1275-7.
88: Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura, Constant Time Enumeration of Subtrees with Exactly k Nodes in a Tree, 2014.
DOI: 10.1587/transinf.E97.D.421.
89: Masaki Suzuki, Hiroshi Nagamochi, Tatsuya Akutsu, Efficient enumeration of monocyclic chemical graphs with given path frequencies, 2014.
DOI: 10.1186/1758-2946-6-31.
90: Armin Töpfer, Tobias Marschall, Rowena A. Bull, Fabio Luciani, Alexander Schönhuth, Niko Beerenwinkel, Viral Quasispecies Assembly via Maximal Clique Enumeration, 2014.
DOI: 10.1371/journal.pcbi.1003515.
93: Naga Shailaja Dasari, Desh Ranjan, Mohammad Zubair, pbitMCE - A bit-based approach for maximal clique enumeration on multicore processors, 2014.
DOI: 10.1109/PADSW.2014.7097844.
97: Armin Töpfer, Tobias Marschall, Rowena A. Bull, Fabio Luciani, Alexander Schönhuth, Niko Beerenwinkel, Viral Quasispecies Assembly via Maximal Clique Enumeration, 2014.
DOI: 10.1007/978-3-319-05269-4_25.
339: Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger, Enumerating Minimal Subset Feedback Vertex Sets, 2014.
DOI: 10.1007/s00453-012-9731-6.
340: Niklas Zechner, Andrzej Lingas, Efficient Algorithms for Subgraph Listing, 2014.
DOI: 10.3390/a7020243.
341: Akshay Deepak, David Fernández-Baca, Enumerating all maximal frequent subtrees in collections of phylogenetic trees, 2014.
DOI: 10.1186/1748-7188-9-16.
344: Erkan Gunpinar, Masaki Moriguchi, Hiromasa Suzuki, Yutaka Ohtake, Motorcycle graph enumeration from quadrilateral meshes for reverse engineering, 2014.
DOI: 10.1016/j.cad.2014.05.007.
347: Rodrigo de Castro, Andrés L. Ramírez, José L. Ramírez, Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs, 2014.
DOI: 10.7561/SACS.2014.1.137.
348: Jianguo Qian, Enumeration of unlabeled uniform hypergraphs, 2014.
DOI: 10.1016/j.disc.2014.03.005.
351: Peter Damaschke, Enumerating maximal bicliques in bipartite graphs with favorable degree sequences, 2014.
DOI: 10.1016/j.ipl.2014.02.001.
353: Behzad Amiri, Jörg Kliewer, Lara Dolecek, Analysis and Enumeration of Absorbing Sets for Non-Binary Graph-Based Codes, 2014.
DOI: 10.1109/TCOMM.2013.122113.130465.
354: Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger, Universal Enumerative Coding for Tree Models, 2014.
DOI: 10.1109/TIT.2013.2295217.
355: Sean Maxwell, Mark R. Chance, Mehmet Koyutürk, Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network, 2014.
DOI: 10.1007/978-3-319-07953-0_14.
356: Carsten Binnig, Abdallah Salama, Erfan Zamanian, Harald Kornmayer, Sven Listing, Alexander C. Müller, XDB - A Novel Database Architecture for Data Analytics as a Service, 2014.
DOI: 10.1109/BigData.Congress.2014.23.
357: Arko Provo Mukherjee, Srikanta Tirthapura, Enumerating Maximal Bicliques from a Large Graph Using MapReduce, 2014.
DOI: 10.1109/BigData.Congress.2014.105.
363: Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Efficiently Listing Bounded Length st-Paths, 2014.
DOI: 10.1007/978-3-319-19315-1_28.
365: Patricio Pinto, Nataly Cruces, Cecilia Hernández, Listing Dense Subgraphs in Small Memory, 2014.
DOI: 10.1109/LAWeb.2014.16.
366: F. Liu, Paulo Vilaça, Isabel Rocha, Miguel Rocha, Evaluating Pathway Enumeration Algorithms in Metabolic Engineering Case Studies, 2014.
DOI: 10.1007/978-3-319-07581-5_26.
817: Kimelfeld, Benny and Kolaitis, Phokion G., The Complexity of Mining Maximal Frequent Subgraphs, 2014.
DOI: 10.1145/2629550.
867: Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams, and Uri Zwick., Listing triangles, 2014.
DOI: 10.1007/978-3-662-43948-7_19.
869: Andreas Björklund, Rasmus Pagh, Virginia Vassilevska Williams,Uri Zwick, Listing Triangles, 2014.
DOI: 10.1007/978-3-662-43948-7_19.
931: Yi-Jen Su, Wei-Lin Hsu, Jian-Cheng Wun, Overlapping Community Detection with a Maximal Clique Enumeration Method in MapReduce, 2014.
DOI: 10.1007/978-3-319-07776-5_38.
1008: Sean Maxwell and Mark R. Chance and Mehmet Koyutürk, Efficiently Enumerating All Connected Induced Subgraphs of a Large Molecular Network, 2014.
DOI: 10.1007/978-3-319-07953-0_14.
1132: , Mounir Bahtat, Said Belkouch, Philippe Elleaume, Phillipe Le Gall, Fast enumeration-based modulo scheduling heuristic for VLIW architectures, 2014.
DOI: 10.1109/ICM.2014.7071820.
1: Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, Enumerating Maximal Clique Sets with Pseudo-Clique Constraint, 2015.
DOI: 10.1007/978-3-319-24282-8_28.
21: Chia-Wei Lee, Pin-Liang Chen, Sun-Yuan Hsieh, Weight-constrained and density-constrained paths in a tree - Enumerating, counting, and k-maximum density paths, 2015.
DOI: 10.1016/j.dam.2014.07.024.
75: Rosena R. X. Du, Yingying Nie, Xuezhi Sun, Enumerations of humps and peaks in (k, a)-paths and (n, m)-Dyck paths via bijective proofs, 2015.
DOI: 10.1016/j.dam.2015.04.005.
77: Min Ju, Fen Zhou, Zuqing Zhu, Shilin Xiao, p-Cycle design without candidate cycle enumeration in mixed-line-rate optical networks, 2015.
DOI: 10.1109/HPSR.2015.7483110.
78: Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Enumerating Cyclic Orientations of a Graph, 2015.
DOI: 10.1007/978-3-319-29516-9_8.
79: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs, 2015.
DOI: 10.1007/978-3-319-29516-9_20.
81: Hiroyuki Hanada, Shuhei Denzumi, Yuma Inoue, Hiroshi Aoki, Norihito Yasuda, Shogo Takeuchi, Shin-ichi Minato, Enumerating Eulerian Trails via Hamiltonian Path Enumeration, 2015.
DOI: 10.1007/978-3-319-15612-5_15.
294: Shudi Yang, Zheng-An Yao, Chang-An Zhao, The weight enumerator of the duals of a class of cyclic codes with three zeros, 2015.
DOI: 10.1007/s00200-015-0255-6.
295: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger, An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets, 2015.
DOI: 10.1007/s00453-014-9875-7.
296: Ting Kuo, From Enumerating to Generating - A Linear Time Algorithm for Generating 2D Lattice Paths with a Given Number of Turns, 2015.
DOI: 10.3390/a8020190.
297: Beatrice Donati, Christian Baudet, Blerina Sinaimeri, Pierluigi Crescenzi, Marie-France Sagot, EUCALYPT - efficient tree reconciliation enumerator, 2015.
DOI: 10.1186/s13015-014-0031-3.
298: Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot, A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs, 2015.
DOI: 10.1186/s13015-015-0046-4.
299: F. Liu, Paulo Vilaça, Isabel Rocha, Miguel Rocha, Development and application of efficient pathway enumeration algorithms for metabolic engineering applications, 2015.
DOI: 10.1016/j.cmpb.2014.11.010.
302: Sunghan Bae, Chengju Li, Qin Yue, On the complete weight enumerators of some reducible cyclic codes, 2015.
DOI: 10.1016/j.disc.2015.05.016.
303: Yonglin Cao, Jian Gao, Fang-Wei Fu, Yuan Cao, Enumeration and construction of additive cyclic codes over Galois rings, 2015.
DOI: 10.1016/j.disc.2015.01.012.
304: Dabin Zheng, Xiaoqiang Wang, Long Yu, Hongwei Liu, The weight enumerators of several classes of p-ary cyclic codes, 2015.
DOI: 10.1016/j.disc.2015.02.005.
305: Jane Y. X. Yang, Michael X. X. Zhong, Robin D. P. Zhou, On the enumeration of (s, s+1, s+2)-core partitions, 2015.
DOI: 10.1016/j.ejc.2015.03.012.
306: Juan Eloy Arco, Juan Manuel Górriz, Javier Ramírez, Ignacio Álvarez, Carlos García Puntonet, Digital image analysis for automatic enumeration of malaria parasites using morphological operations, 2015.
DOI: 10.1016/j.eswa.2014.11.037.
307: Wei-Chang Yeh, A novel node-based sequential implicit enumeration method for finding all d-MPs in a multistate flow network, 2015.
DOI: 10.1016/j.ins.2014.11.007.
310: Thuy Tuong Nguyen, David C. Slaughter, Bradley D. Hanson, Andrew Barber, Amy Freitas, Daniel Robles, Erin Whelan, Automated Mobile System for Accurate Outdoor Tree Crop Enumeration Using an Uncalibrated Camera, 2015.
DOI: 10.3390/s150818427.
311: Saeed Shahrivari, Saeed Jalili, Fast Parallel All-Subgraph Enumeration Using Multicore Machines, 2015.
DOI: 10.1155/2015/901321.
312: Yu Yang, Hongbo Liu, Hua Wang, Scott Makeig, Enumeration of BC-subtrees of trees, 2015.
DOI: 10.1016/j.tcs.2015.02.028.
313: Vartika Verma, Paul Park Kwon, Wooyoung Kim, Iterative Hadoop MapReduce-Based Subgraph Enumeration in Network Motif Analysis, 2015.
DOI: 10.1109/CLOUD.2015.122.
316: Benjamin A. Burton, William Pettersson, An Edge-Based Framework for Enumerating 3-Manifold Triangulations, 2015.
DOI: 10.4230/LIPIcs.SOCG.2015.270.
317: Ahish Mysore Somashekar, Spyros Tragoudas, Rathish Jayabharathi, Non-enumerative correlation-aware path selection, 2015.
DOI: 10.1109/ICCD.2015.7357174.
318: Ilias Giechaskiel, George Panagopoulos, Eiko Yoneki, PDTL - Parallel and Distributed Triangle Listing for Massive Graphs, 2015.
DOI: 10.1109/ICPP.2015.46.
319: Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger, Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width, 2015.
DOI: 10.1007/978-3-662-48971-0_22.
320: Kotaro Terada, Masao Yanagisawa, Nozomu Togawa, A floorplan-driven high-level synthesis algorithm with multiple-operation chainings based on path enumeration, 2015.
DOI: 10.1109/ISCAS.2015.7169100.
321: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality, 2015.
DOI: 10.4230/LIPIcs.IPEC.2015.307.
322: Abhimanyu Venkatraman Sheshashayee, Stefano Basagni, WiEnum - Node enumeration in wireless networks, 2015.
DOI: 10.1109/MILCOM.2015.7357580.
323: Mousumi Dutt, Arindam Biswas, Bhargab B. Bhattacharya, Enumeration of Shortest Isothetic Paths Inside a Digital Object, 2015.
DOI: 10.1007/978-3-319-19941-2_11.
324: Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno, A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs, 2015.
DOI: 10.1007/978-3-662-53174-7_11.
815: Kongzhe Yang, Bangning Zhang, Ye Zhan, Daoxing Guo, Design and Analysis of Efficient Algorithm for Counting and Enumerating Cycles in LDPC Codes, 2015.
DOI: 10.1007/978-3-319-38789-5_23.
968: Adam Bohn and Yuri Faenza and Samuel Fiorini and Vissarion Fisikopoulos and Marco Macchia and Kanstantsin Pashkovich, Enumeration of 2-Level Polytopes, 2015.
DOI: 10.1007%2F978-3-662-48350-3_17.
1006: Khaled Elbassioni, A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality, 2015.
DOI: 10.7155/jgaa.00357.
9: Boyi Hou, Zhuo Wang, Qun Chen, Bo Suo, Chao Fang, Zhanhuai Li, Zachary G. Ives, Efficient Maximal Clique Enumeration Over Graph Data, 2016.
DOI: 10.1007/s41019-017-0033-5.
10: Sung Sik U, Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition, 2016.
DOI: 10.5614/ejgta.2016.4.2.5.
11: Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, A fast and complete algorithm for enumerating pseudo-cliques in large graphs, 2016.
DOI: 10.1007/s41060-016-0022-1.
12: Kevin A. Naudé, Refined pivot selection for maximal clique enumeration in graphs, 2016.
DOI: 10.1016/j.tcs.2015.11.016.
13: Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Enumerating maximal cliques in temporal graphs, 2016.
DOI: 10.1109/ASONAM.2016.7752255.
14: Qun Chen, Chao Fang, Zhuo Wang, Bo Suo, Zhanhuai Li, Zachary G. Ives, Parallelizing Maximal Clique Enumeration Over Graph Data, 2016.
DOI: 10.1007/978-3-319-32049-6_16.
17: Yoshiaki Okubo, Makoto Haraguchi, Etsuji Tomita, Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound, 2016.
DOI: 10.1007/978-3-319-41920-6_45.
18: Hongjie Zhai, Makoto Haraguchi, Yoshiaki Okubo, Etsuji Tomita, A Fast and Complete Enumeration of Pseudo-Cliques for Large Graphs, 2016.
DOI: 10.1007/978-3-319-31753-3_34.
19: Roberto Grossi, Enumeration of Paths, Cycles, and Spanning Trees, 2016.
DOI: 10.1007/978-1-4939-2864-4_728.
64: Yu Yang, Hongbo Liu, Hua Wang, Shigang Feng, On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs, 2016.
DOI: 10.1016/j.dam.2015.09.025.
65: Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey, Generating and Enumerating Digitally Convex Sets of Trees, 2016.
DOI: 10.1007/s00373-015-1604-8.
68: Esther P. Adeva, Gerhard P. Fettweis, Efficient Architecture for Soft-Input Soft-Output Sphere Detection With Perfect Node Enumeration, 2016.
DOI: 10.1109/TVLSI.2016.2526904.
69: Steve Harenberg, Ramona G. Seay, Gonzalo A. Bello, Rada Chirkova, P. Murali Doraiswamy, Nagiza F. Samatova, Knowledge-Guided Maximal Clique Enumeration, 2016.
DOI: 10.1007/978-3-319-49586-6_43.
70: Fei He, Akiyoshi Hanai, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Naphthalene Isomers of Tree-like Chemical Graphs, 2016.
DOI: 10.5220/0005783902580265.
73: Etsuji Tomita, Clique Enumeration, 2016.
DOI: 10.1007/978-1-4939-2864-4_725.
243: Liliana Badillo, Caterina Bianchini, Hristo Ganchev, Thomas F. Kent, Andrea Sorbi, A note on the enumeration degrees of 1-generic sets, 2016.
DOI: 10.1007/s00153-015-0471-6.
244: Jira Jindalertudomdee, Morihiro Hayashida, Yang Zhao, Tatsuya Akutsu, Enumeration method for tree-like chemical compounds with benzene rings and naphthalene rings by breadth-first search order, 2016.
DOI: 10.1186/s12859-016-0962-4.
247: Sofiane Lagraa, Hamida Seba, An efficient exact algorithm for triangle listing in large graphs, 2016.
DOI: 10.1007/s10618-016-0451-4.
248: Chengju Li, Qin Yue, Fang-Wei Fu, Complete weight enumerators of some cyclic codes, 2016.
DOI: 10.1007/s10623-015-0091-5.
249: Fabio Enrique Brochero Martínez, Carmen Rosa Giraldo Vergara, Weight enumerator of some irreducible cyclic codes, 2016.
DOI: 10.1007/s10623-014-0026-6.
250: Haode Yan, Chunlei Liu, Two classes of cyclic codes and their weight enumerator, 2016.
DOI: 10.1007/s10623-015-0125-z.
251: Youngja Park, SeungKyung Park, Enumeration of generalized lattice paths by string types, peaks, and ascents, 2016.
DOI: 10.1016/j.disc.2016.04.024.
253: Vladimir M. Blinovsky, Catherine S. Greenhill, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, 2016.
DOI: 10.1016/j.ejc.2015.06.004.
254: Hana Kim, Richard P. Stanley, A refined enumeration of hex trees and related polynomials, 2016.
DOI: 10.1016/j.ejc.2016.01.001.
255: Bocong Chen, San Ling, Guanghui Zhang, Enumeration formulas for self-dual cyclic codes, 2016.
DOI: 10.1016/j.ffa.2016.06.007.
256: Yves Métivier, John Michael Robson, Akka Zemmari, A distributed enumeration algorithm and applications to all pairs shortest paths, diameter, 2016.
DOI: 10.1016/j.ic.2015.12.004.
257: Hossein Falsafain, Sayyed Rasoul Mousavi, Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph, 2016.
DOI: 10.1109/LCOMM.2016.2587860.
258: Faisal N. Abu-Khzam, Pinar Heggernes, Enumerating minimal dominating sets in chordal graphs, 2016.
DOI: 10.1016/j.ipl.2016.07.002.
259: Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz, Enumeration of balanced finite group valued functions on directed graphs, 2016.
DOI: 10.1016/j.ipl.2016.02.002.
260: Mostofa Kamal Rasel, Yongkoo Han, Jinseung Kim, Kisung Park, Nguyen Anh Tu, Young-Koo Lee, iTri - Index-based triangle listing in massive graphs, 2016.
DOI: 10.1016/j.ins.2015.12.006.
261: Debasish Kundu, Debasis Samanta, Enumerating message paths for interaction testing of object-oriented systems, 2016.
DOI: 10.1007/s11334-015-0264-4.
262: Michel Deza, Mathieu Dutour Sikiric, Enumeration of the facets of cut polytopes over some highly symmetric graphs, 2016.
DOI: 10.1111/itor.12194.
264: Rajesh Mishra, M. A. Saifi, Sanjay Kumar Chaturvedi, Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts, 2016.
DOI: 10.1002/qre.1772.
265: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Enumerating minimal connected dominating sets in graphs of bounded chordality, 2016.
DOI: 10.1016/j.tcs.2016.03.026.
266: Young-Hoon Moon, Ji Hong Kim, Dong Seong Kim, Huy Kang Kim, Hybrid Attack Path Enumeration System Based on Reputation Scores, 2016.
DOI: 10.1109/CIT.2016.75.
270: Hao Zhang, Yuanyuan Zhu, Lu Qin, Hong Cheng, Jeffrey Xu Yu, Efficient triangle listing for billion-scale graphs, 2016.
DOI: 10.1109/BigData.2016.7840674.
271: Bernhard Bliem, Markus Hecher, Stefan Woltran, On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions, 2016.
DOI: 10.3233/978-1-61499-686-6-107.
272: Katerina Böhmová, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot, Computing and Listing st-Paths in Public Transportation Networks, 2016.
DOI: 10.1007/978-3-319-34171-2_8.
273: Markus Kröll, Reinhard Pichler, Sebastian Skritek, On the Complexity of Enumerating the Answers to Well-designed Pattern Trees, 2016.
DOI: 10.4230/LIPIcs.ICDT.2016.22.
274: Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch, Faster Algorithms to Enumerate Hypergraph Transversals, 2016.
DOI: 10.1007/978-3-662-49529-2_23.
275: Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Listing Acyclic Orientations of Graphs with Single and Multiple Sources, 2016.
DOI: 10.1007/978-3-662-49529-2_24.
276: Balazs Vass, Erika R. Bérczi-Kovács, János Tapolcai, Shared Risk Link Group Enumeration of Node Excluding Disaster Failures, 2016.
DOI: 10.1109/NaNA.2016.87.
278: Balazs Vass, Erika R. Bérczi-Kovács, János Tapolcai, Enumerating circular disk failures covering a single node, 2016.
DOI: 10.1109/RNDM.2016.7608286.
279: Mehmet Engin Tozal, Enumerating single destination, policy-preferred paths in AS-level Internet topology maps, 2016.
DOI: 10.1109/SARNOF.2016.7846759.
282: Shin-Ichi Nakano, Tree Enumeration, 2016.
DOI: 10.1007/978-1-4939-2864-4_726.
283: Shin-ichi Tanigawa, Enumeration of Non-crossing Geometric Graphs, 2016.
DOI: 10.1007/978-1-4939-2864-4_729.
1033: Mamadou Moustapha Kant{\'{e}} and Vincent Limouzy and Arnaud Mary and Lhouari Nourine and Takeaki Uno, A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs, 2016.
DOI: 10.1007/978-3-662-53174-7_11.
1155: Kevin A. Naud{\'{e}}, Refined pivot selection for maximal clique enumeration in graphs, 2016.
DOI: 10.1016/j.tcs.2015.11.016.
5: Ting Yu, Mengchi Liu, A linear time algorithm for maximal clique enumeration in large sparse graphs, 2017.
DOI: 10.1016/j.ipl.2017.05.005.
6: Zhuo Wang, Qun Chen, Boyi Hou, Bo Suo, Zhanhuai Li, Wei Pan, Zachary G. Ives, Parallelizing maximal clique and k-plex enumeration over graph data, 2017.
DOI: 10.1016/j.jpdc.2017.03.003.
7: Arko Provo Mukherjee, Pan Xu, Srikanta Tirthapura, Enumeration of Maximal Cliques from an Uncertain Graph, 2017.
DOI: 10.1109/TKDE.2016.2527643.
59: Rafael Schmitt, Pedro Ramos, Rafael de Santiago, Luís C. Lamb, Novel Clique enumeration heuristic for detecting overlapping clusters, 2017.
DOI: 10.1109/CEC.2017.7969466.
215: Zexia Shi, Fang-Wei Fu, Complete weight enumerators of some irreducible cyclic codes, 2017.
DOI: 10.1016/j.dam.2016.11.008.
216: Sen-Peng Eu, Seunghyun Seo, Heesung Shin, Enumerations of vertices among all rooted ordered trees with levels and degrees, 2017.
DOI: 10.1016/j.disc.2017.04.007.
217: Yuanyuan Zhu, Hao Zhang, Lu Qin, Hong Cheng, Efficient MapReduce algorithms for triangle listing in billion-scale graphs, 2017.
DOI: 10.1007/s10619-017-7193-1.
218: William Kuszmaul, Signed enumeration of upper-right corners in path shuffles, 2017.
DOI: 10.1016/j.ejc.2016.09.007.
219: Shanshan Wang, Chenglong Xiao, Wanjun Liu, A Faster Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs, 2017.
DOI: 10.1109/LES.2017.2650208.
220: Ligang Zhou, Qingyang Wang, Hamido Fujita, One versus one multi-class classification fusion using optimizing decision directed acyclic graph for predicting listing status of companies, 2017.
DOI: 10.1016/j.inffus.2016.11.009.
221: Ligang Zhou, Yain-Whar Si, Hamido Fujita, Predicting the listing statuses of Chinese-listed companies using decision trees combined with an improved filter feature selection method, 2017.
DOI: 10.1016/j.knosys.2017.05.003.
222: Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang, Scalable subgraph enumeration in MapReduce - a cost-oriented approach, 2017.
DOI: 10.1007/s00778-017-0459-4.
224: Cédric Chauve, Éric Fusy, Jérémie Lumbroso, An Exact Enumeration of Distance-Hereditary Graphs, 2017.
DOI: 10.1137/1.9781611974775.3.
225: Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi, Enumeration of Maximal Irredundant Sets for Claw-Free Graphs, 2017.
DOI: 10.1007/978-3-319-57586-5_25.
227: Raphael Kimmig, Henning Meyerhenke, Darren Strash, Shared Memory Parallel Subgraph Enumeration, 2017.
DOI: 10.1109/IPDPSW.2017.133.
230: Koji Ouchi, Ryuhei Uehara, Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns, 2017.
DOI: 10.1007/978-3-319-53925-6_2.
809: Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs, 2017.
DOI: 10.1007/s13278-017-0455-0.
813: George Manoussakis, Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal Time, 2017.
DOI: 10.1007/978-3-662-55751-8_28.
819: Filippo Disanto, Noah A. Rosenberg, Enumeration of Ancestral Configurations for Matching Gene Trees and Species Trees, 2017.
DOI: 10.1089/cmb.2016.0159.
820: Dongyang Zhao, Yangyang Zhou, Jin Xu, The Enumeration of Flippable Edges in Maximal Planar Graphs, 2017.
DOI: 10.1109/CIT.2017.44.
821: Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Counting and enumerating unlabeled split-indifference graphs, 2017.
DOI: 10.1142/S1793830917500550.
824: Mario Alviano, Model enumeration in propositional circumscription via unsatisfiable core analysis, 2017.
DOI: 10.1017/S1471068417000278.
825: Arko Provo Mukherjee, Srikanta Tirthapura, Enumerating Maximal Bicliques from a Large Graph Using MapReduce, 2017.
DOI: 10.1109/TSC.2016.2523997.
826: Irith Ben-Arroyo Hartman, Luk Knapen, Tom Bellemans, Enumerating minimum path decompositions to support route choice set generation, 2017.
DOI: 10.1016/j.procs.2017.05.325.
827: Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi, Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs, 2017.
DOI: 10.1007/978-3-319-68705-6_22.
832: Alessio Conte, Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Listing Acyclic Subgraphs and Subgraphs of Bounded Girth in Directed Graphs, 2017.
DOI: 10.1007/978-3-319-71147-8_12.
854: Prabhakar R. Hampiholi, Jotiba P. Kitturkar, On Enumeration of Some Non-isomorphic Edge Complete Semigraphs, 2017.
DOI: 10.1016/j.endm.2017.11.011.
930: Qi Yang, Greg Speegle, Erich J. Baker, On using cached results to enumerate maximal k-cliques in GeneWeaver, 2017.
DOI: 10.1109/FSKD.2017.8393097.
1062: Sergei Savin, An algorithm for generating convex obstacle-free regions based on stereographic projection, 2017.
DOI: 10.1109/SIBCON.2017.7998590.
834: Aaron M. Montgomery, Asymptotic Enumeration of Difference Matrices over Cyclic Groups, 2018.
DOI: 10.1017/S0963548317000281.
835: John Asplund, N. Bradley Fox, Enumerating cycles in the graph of overlapping permutations, 2018.
DOI: 10.1016/j.disc.2017.09.010.
848: Maryam Bahrani, Jérémie Lumbroso, Split-Decomposition Trees with Prime Nodes - Enumeration and Random Generation of Cactus Graphs, 2018.
DOI: 10.1137/1.9781611975062.13.
849: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Enumeration and maximum number of minimal connected vertex covers in graphs, 2018.
DOI: 10.1016/j.ejc.2017.07.015.
850: Jérémie Lumbroso, Jessica Shi, Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations, 2018.
DOI: 10.1137/1.9781611975062.11.
853: Konstantinos Panagiotou, Leon Ramzews, Asymptotic Enumeration of Graph Classes with Many Components, 2018.
DOI: 10.1137/1.9781611975062.12.
855: Tiphaine Viard, Clémence Magnien, Matthieu Latapy, Enumerating maximal cliques in link streams with durations, 2018.
DOI: 10.1016/j.ipl.2018.01.006.
857: Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger, Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width, 2018.
DOI: 10.1007/s00453-017-0289-1.
861: Pablo San Segundo, Jorge Artieda, Darren Strash, Efficiently enumerating all maximal cliques with bit-parallelism, 2018.
DOI: 10.1016/j.cor.2017.12.006.
862: K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan, Listing all spanning trees in Halin graphs - sequential and Parallel view, 2018.
DOI: 10.1142/S1793830918500052.
863: Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara, Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs, 2018.
DOI: 10.1007/978-3-319-75172-6_2.
866: Carlo Comin, Romeo Rizzi, An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication, 2018.
DOI: 10.1007/s00453-017-0402-5.
872: Gerardo Vega, A correction on the determination of the weight enumerator polynomial of some irreducible cyclic codes, 2018.
DOI: 10.1007/s10623-017-0364-2.
873: Anuradha Sharma, Taranjot Kaur, Enumeration of complementary-dual cyclic Fq-linear Fqt-codes, 2018.
DOI: 10.1016/j.disc.2017.12.006.
874: Katerina Böhmová, Luca Häfliger, Matús Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot, Computing and Listing st-Paths in Public Transportation Networks, 2018.
DOI: 10.1007/s00224-016-9747-4.
875: Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Enumeration on Trees under Relabelings, 2018.
DOI: 10.4230/LIPIcs.ICDT.2018.5.
876: Wim Martens, Tina Trautner, Evaluation and Enumeration Problems for Regular Path Queries, 2018.
DOI: 10.4230/LIPIcs.ICDT.2018.19.
886: Mostofa Kamal Rasel, En Elena, Young-Koo Lee, Summarized bit batch-based triangle listing in massive graphs, 2018.
DOI: 10.1016/j.ins.2018.02.018.
906: Roberto Grossi, Andrea Marino, Luca Versari, Efficient Algorithms for Listing k Disjoint st-Paths in Graphs, 2018.
DOI: 10.1007/978-3-319-77404-6_40.
920: Daniel Birmajer, Juan B. Gil, Michael D. Weiner, On rational Dyck paths and the enumeration of factor-free Dyck words, 2018.
DOI: 10.1016/j.dam.2018.02.020.
922: Massimo Lauria, Cliques enumeration and tree-like resolution proofs, 2018.
DOI: 10.1016/j.ipl.2018.03.001.
923: Yisu Peng, Yuxiang Jiang, Predrag Radivojac, Enumerating consistent sub-graphs of directed acyclic graphs - an insight into biomedical ontologies, 2018.
DOI: 10.1093/bioinformatics/bty268.
924: Kunihiro Wasa, Takeaki Uno, Efficient Enumeration of Bipartite Subgraphs in Graphs, 2018.
DOI: 10.1007/978-3-319-94776-1_38.
925: Nina Narodytska, Nikolaj Bjørner, Maria-Cristina Marinescu, Mooly Sagiv, Core-Guided Minimal Correction Set and Core Enumeration, 2018.
DOI: 10.24963/ijcai.2018/188.
926: Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Takeaki Uno, Hiroki Arimura, Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth, 2018.
DOI: 10.1007/978-3-319-94667-2_17.
933: Xing Feng, Lianzhu Zhang, Mingzu Zhang, Enumeration of perfect matchings of lattice graphs by Pfaffians, 2018.
DOI: 10.1016/j.amc.2018.06.027.
935: Ademir Hujdurovic, Klavdija Kutnar, Dragan Marusic, Enumerating graphs via even/odd dichotomy, 2018.
DOI: 10.1016/j.dam.2018.03.047.
936: Éva Czabarka, Rigoberto Flórez, Leandro Junes, José L. Ramírez, Enumerations of peaks and valleys on non-decreasing Dyck paths, 2018.
DOI: 10.1016/j.disc.2018.06.032.
937: Supawadee Prugsapitak, Somphong Jitman, Enumeration of self-dual cyclic codes of some specific lengths over finite fields, 2018.
DOI: 10.1142/S1793830918500313.
938: David Avis, Charles Jordan, mplrs - A scalable parallel vertex/facet enumeration code, 2018.
DOI: 10.1007/s12532-017-0129-y.
941: Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Luca Versari, Listing Subgraphs by Cartesian Decomposition, 2018.
DOI: 10.4230/LIPIcs.MFCS.2018.84.
942: Mamadou Moustapha Kanté, Kaveh Khoshkhah, Mozhgan Pourmoradnasseri, Enumerating Minimal Transversals of Hypergraphs without Small Holes, 2018.
DOI: 10.4230/LIPIcs.MFCS.2018.55.
943: Jaroslav Bendík, Elaheh Ghassabani, Michael W. Whalen, Ivana Cerná, Online Enumeration of All Minimal Inductive Validity Cores, 2018.
DOI: 10.1007/978-3-319-92970-5_12.
944: Yu Nakahata, Jun Kawahara, Shoji Kasahara, Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams, 2018.
DOI: 10.4230/LIPIcs.SEA.2018.21.
951: Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura, Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four, 2018.
DOI: 10.1587/transfun.E101.A.1383.
952: Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shoji Kasahara, Enumerating All Spanning Shortest Path Forests with Distance and Capacity Constraints, 2018.
DOI: 10.1587/transfun.E101.A.1363.
953: Ian F. Blake, Shu Lin, On Short Cycle Enumeration in Biregular Bipartite Graphs, 2018.
DOI: 10.1109/TIT.2017.2784839.
954: Marija Maksimovic, Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group, 2018.
DOI: 10.3390/sym10060212.
955: Carlo Comin, Romeo Rizzi, An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication, 2018.
DOI: 10.1007/s00453-017-0402-5.
960: Pierre-Louis Giscard, Paul Rochet, Enumerating Simple Paths from Connected Induced Subgraphs, 2018.
DOI: 10.1007/s00373-018-1966-9.
961: Kunihiro Wasa, Takeaki Uno, An Efficient Algorithm for Enumerating Induced Subgraphs with Bounded Degeneracy, 2018.
DOI: 10.1007/978-3-030-04651-4_3.
962: Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Efficient Enumeration of Dominating Sets for Sparse Graphs, 2018.
DOI: 10.4230/LIPIcs.ISAAC.2018.8.
975: Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura, Enumerating Top-k Quasi-Cliques, 2018.
DOI: 10.1109/BigData.2018.8622352.
976: Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura, Shared-Memory Parallel Maximal Clique Enumeration, 2018.
DOI: 10.1109/HiPC.2018.00016.
977: Keren Censor-Hillel, Dean Leitersdorf, Elia Turner, Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model, 2018.
DOI: 10.4230/LIPIcs.OPODIS.2018.4.
1007: Mohammed Alokshiya and Saeed Salem and Fidaa Abed, A Linear Delay Linear Space Algorithm for Enumeration of All Connected Induced Subgraphs, 2018.
DOI: 10.1145/3233547.3233695.
1022: Katsuhisa Yamanaka and Yasuko Matsui and Shin-ichi Nakano, More Routes for Evacuation, 2018.
DOI: 10.1007/978-3-319-94776-1_7.
1054: Bogdan Eduard-Madalin Mursa, Anca Andreica, Laura Diosan, Parallel Acceleration of Subgraph Enumeration in the Process of Network Motif Detection, 2018.
DOI: 10.1109/SYNASC.2018.00039.
969: Charles A. Phillips, Kai Wang, Erich J. Baker, Jason A. Bubier, Elissa J. Chesler, Michael A. Langston, On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs, 2019.
DOI: 10.3390/a12010023.
972: Yuhei Nishiyama, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu, Resource Cut, a New Bounding Procedure to Algorithms for Enumerating Tree-Like Chemical Graphs, 2019.
DOI: 10.1109/TCBB.2018.2832061.
973: Suman Banerjee, Bithika Pal, On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network, 2019.
DOI: 10.1145/3297001.3297015.
979: Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi, Enumeration of maximal irredundant sets for claw-free graphs, 2019.
DOI: 10.1016/j.tcs.2018.02.014.
980: Thomas Bläsius, Tobias Friedrich 0001, Julius Lischeid, Kitty Meeks, Martin Schirneck, Efficiently Enumerating Hitting Sets of Hypergraphs Arising in Data Profiling, 2019.
DOI: 10.1137/1.9781611975499.11.
993: Shanshan Wang, Chenglong Xiao, Wanjun Liu, Parallel Enumeration of Custom Instructions Based on Multidepth Graph Partitioning, 2019.
DOI: 10.1109/LES.2018.2812784.
1009: Ahmar Rashid, Muhammad Kamran, Zahid Halim, A top down approach to enumerate α-maximal cliques in uncertain graphs, 2019.
DOI: 10.3233/JIFS-18263.
1010: George Manoussakis, A new decomposition technique for maximal clique enumeration for sparse graphs, 2019.
DOI: 10.1016/j.tcs.2018.10.014.
1011: Yinuo Li, Zhiyuan Shao, Dongxiao Yu, Xiaofei Liao, Hai Jin 0001, Fast Maximal Clique Enumeration for Real-World Graphs, 2019.
DOI: 10.1007/978-3-030-18576-3_38.
1012: Oskar Skibski, Talal Rahwan, Tomasz P. Michalak, Michael J. Wooldridge, Enumerating Connected Subgraphs and Computing the Myerson and Shapley Values in Graph-Restricted Games, 2019.
DOI: 10.1145/3235026.
1014: Xiu-Zhen Xu, Yi-Feng Niu, Qing Li, Efficient Enumeration of d-Minimal Paths in Reliability Evaluation of Multistate Networks, 2019.
DOI: 10.1155/2019/4561845.
1015: Tsuyoshi Miezaki, Manabu Oura, On the cycle index and the weight enumerator, 2019.
DOI: 10.1007/s10623-018-0518-x.
1016: Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian, Enumeration of Łukasiewicz paths modulo some patterns, 2019.
DOI: 10.1016/j.disc.2018.12.005.
1018: Sergi Elizalde, Justin M. Troyka, Exact and asymptotic enumeration of cyclic permutations according to descent set, 2019.
DOI: 10.1016/j.jcta.2019.02.012.
1019: Khaled M. Elbassioni, Imran Rauf, Saurabh Ray, A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs, 2019.
DOI: 10.1016/j.tcs.2018.09.027.
1020: Petra Mutzel, Lutz Oettershagen, On the Enumeration of Bicriteria Temporal Paths, 2019.
DOI: 10.1007/978-3-030-14812-6_32.
1023: Dong Wen, Lu Qin, Ying Zhang 0001, Lijun Chang, Ling Chen, Enumerating k-Vertex Connected Components in Large Graphs, 2019.
DOI: 10.1109/ICDE.2019.00014.
1024: Chen Zhang, Ying Zhang, Wenjie Zhang, Lu Qin, Jianye Yang, Efficient Maximal Spatial Clique Enumeration, 2019.
DOI: 10.1109/ICDE.2019.00083.
1025: Johanna Björklund, Frank Drewes, Niklas Zechner, Efficient enumeration of weighted tree languages over the tropical semiring, 2019.
DOI: 10.1016/j.jcss.2017.03.006.
1026: Ozan Kahramanogullari, Enumerating Dominant Pathways in Biological Networks by Information Flow Analysis, 2019.
DOI: 10.1007/978-3-030-18174-1_3.
1027: Shixuan Sun, Yulin Che, Lipeng Wang, Qiong Luo 0001, Efficient Parallel Subgraph Enumeration on a Single Machine, 2019.
DOI: 10.1109/ICDE.2019.00029.
1028: Zhaokang Wang, Rong Gu, Weiwei Hu, Chunfeng Yuan, Yihua Huang, BENU - Distributed Subgraph Enumeration with Backtracking-Based Framework, 2019.
DOI: 10.1109/ICDE.2019.00021.
1029: Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Enumeration on Trees with Tractable Combined Complexity and Efficient Updates, 2019.
DOI: 10.1145/3294052.3319702.
1034: Alessio Conte, Roberto Grossi, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Kunihiro Wasa, Listing Induced Steiner Subgraphs as a Compact Way to Discover Steiner Trees in Graphs, 2019.
DOI: 10.4230/LIPIcs.MFCS.2019.73.
1035: Noah A. Rosenberg, Enumeration of lonely pairs of gene trees and species trees by means of antipodal cherries, 2019.
DOI: 10.1016/j.aam.2018.09.001.
1036: Tuukka Korhonen, Jeremias Berg, Matti Järvisalo, Enumerating Potential Maximal Cliques via SAT and ASP, 2019.
DOI: 10.24963/ijcai.2019/156.
1037: Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura, An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs, 2019.
DOI: 10.1007/978-3-030-25005-8_28.
1038: Kaijie Zhu, George H. L. Fletcher, Nikolay Yakovets, Odysseas Papapetrou, Yuqing Wu, Scalable temporal clique enumeration, 2019.
DOI: 10.1145/3340964.3340987.
1040: Joshua Cooper, Hays Whitlatch, Uniquely pressable graphs - Characterization, enumeration, and recognition, 2019.
DOI: 10.1016/j.aam.2018.09.005.
1041: Mohammed Alokshiya, Saeed Salem, Fidaa Abed, A linear delay algorithm for enumerating all connected induced subgraphs, 2019.
DOI: 10.1186/s12859-019-2837-y.
1042: Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi, Enumeration and maximum number of maximal irredundant sets for chordal graphs, 2019.
DOI: 10.1016/j.dam.2019.03.018.
1043: Yuan Cao 0001, Yonglin Cao, Hai Q. Dinh, Somphong Jitman, An explicit representation and enumeration for self-dual cyclic codes over F2m+uF2m of length 2s, 2019.
DOI: 10.1016/j.disc.2019.04.008.
1045: Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari, Listing Maximal Subgraphs Satisfying Strongly Accessible Properties, 2019.
DOI: 10.1137/17M1152206.
1046: Petr A. Golovach, Dieter Kratsch, Mathieu Liedloff, Mohamed Yosri Sayadi, Enumeration and maximum number of minimal dominating sets for chordal graphs, 2019.
DOI: 10.1016/j.tcs.2019.03.017.
1047: Andreas Björklund, Ryan Williams 0001, Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors, 2019.
DOI: 10.4230/LIPIcs.ICALP.2019.25.
1048: Alessio Conte, Mamadou Moustapha Kanté, Andrea Marino, Takeaki Uno, Maximal Irredundant Set Enumeration in Bounded-Degeneracy and Bounded-Degree Hypergraphs, 2019.
DOI: 10.1007/978-3-030-25005-8_13.
1065: Assia Brighen, Hachem Slimani, Abdelmounaam Rezgui, Hamamache Kheddouci, Listing all maximal cliques in large graphs on vertex-centric model, 2019.
DOI: 10.1007/s11227-019-02770-4.
1066: Ting Yu, Mengchi Liu, A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation, 2019.
DOI: 10.1016/j.parco.2019.05.005.
1067: Yi Yang, Da Yan, Shuigeng Zhou, Guimu Guo, Parallel Clique-Like Subgraph Counting and Listing, 2019.
DOI: 10.1007/978-3-030-33223-5_40.
1069: Kazuya Haraguchi, Yusuke Momoi, Aleksandar Shurbevski, Hiroshi Nagamochi, COOMA - A Components Overlaid Mining Algorithm for Enumerating Connected Subgraphs with Common Itemsets, 2019.
DOI: 10.7155/jgaa.00497.
1070: Massimo Cairo, Paul Medvedev, Nidia Obscura Acosta, Romeo Rizzi, Alexandru I. Tomescu, An Optimal O(nm) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph, 2019.
DOI: 10.1145/3341731.
1071: Hendrik Molter, Rolf Niedermeier, Malte Renken, Enumerating Isolated Cliques in Temporal Networks, 2019.
DOI: 10.1007/978-3-030-36683-4_42.
1076: Mingyang Zhao, Xiaohong Jia, Changhe Tu, Bernard Mourrain, Wenping Wang, Enumerating the morphologies of non-degenerate Darboux cyclides, 2019.
DOI: 10.1016/j.cagd.2019.101776.
1077: Jie Luo, Shaofan Liu, Accelerating MUS enumeration by inconsistency graph partitioning, 2019.
DOI: 10.1007/s11432-019-9881-0.
1078: Afshin Behmaram, Cédric Boutillier, Asymptotic enumeration of perfect matchings in m-barrel fullerene graphs, 2019.
DOI: 10.1016/j.dam.2018.08.012.
1079: Yuan Cao 0001, Yonglin Cao, Steven T. Dougherty, San Ling, Construction and enumeration for self-dual cyclic codes over Z4 of oddly even length, 2019.
DOI: 10.1007/s10623-019-00629-6.
1080: Rigoberto Flórez, Leandro Junes, José L. Ramírez, Enumerating several aspects of non-decreasing Dyck paths, 2019.
DOI: 10.1016/j.disc.2019.06.018.
1081: Farley Soares Oliveira, Hidefumi Hiraishi, Hiroshi Imai, FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations, 2019.
DOI: 10.1016/j.entcs.2019.08.057.
1082: Sen-Peng Eu, Tung-Shan Fu, Yeh-Jong Pan, Chien-Tai Ting, On Enumeration of Families of Genus Zero Permutations, 2019.
DOI: 10.1007/s00373-019-02111-5.
1083: Oscar Defrain, Lhouari Nourine, Neighborhood Inclusions for Minimal Dominating Sets Enumeration - Linear and Polynomial Delay Algorithms in P7-Free and P8-Free Chordal Graphs, 2019.
DOI: 10.4230/LIPIcs.ISAAC.2019.63.
1084: Kengo Hashimoto, Ken-ichi Iwata, Hirosuke Yamamoto, Enumeration and Coding of Compact Code Trees for Binary AIFV Codes, 2019.
DOI: 10.1109/ISIT.2019.8849775.
1085: Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka, Colorful Frontier-Based Search - Implicit Enumeration of Chordal and Interval Subgraphs, 2019.
DOI: 10.1007/978-3-030-34029-2_9.
1101: Ali Gholami Rudi, Succinct enumeration of distant vertex pairs, 2019.
DOI: 10.1142/S1793830919500769.
1102: , Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher, Listing All Maximal k-Plexes in Temporal Graphs, 2019.
DOI: 10.1145/3325859.
1103: , Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho, Traversal with Enumeration of Geometric Graphs in Bounded Space, 2019.
DOI: 10.1142/S0219265919500087.
1105: , Caixia Qin, MingXue Liao, YuanYuan Liang, ChangWen Zheng, Efficient Algorithm for Maximal Biclique Enumeration on Bipartite Graphs, 2019.
DOI: 10.1007/978-3-030-32591-6_1.
1106: , Rui Wang, Mingxue Liao, Caixia Qin, An Efficient Algorithm for Enumerating Maximal Bicliques from a Dynamically Growing Graph, 2019.
DOI: 10.1007/978-3-030-32591-6_35.
1171: Sung Kwon Kim, Enumerating Subsequences of a Sequence and Paths of a Tree in the Order of Weight, 2019.
DOI: 10.5626/jcse.2019.13.1.11.
1194: , Louis Bellmann, Patrick Penner, Matthias Rarey, Connected Subgraph Fingerprints - Representing Molecules Using Exhaustive Subgraph Enumeration, 2019.
DOI: 10.1021/acs.jcim.9b00571.
1238: , Clement N. Nyirenda, Samson G. Nyirongo, Binary Search Based PSO for Master Node Enumeration and Placement in a Smart Water Metering Network, 2019.
DOI: 10.1007/978-3-030-41593-8_8.
1075: Yoshitake Sakae, Bin W. Zhang, Ronald M. Levy, Nan-Jie Deng, Absolute Protein Binding Free Energy Simulations for Ligands with Multiple Poses, a Thermodynamic Path That Avoids Exhaustive Enumeration of the Poses, 2020.
DOI: 10.1002/jcc.26078.
1087: , Zoe M. Himwich, Noah A. Rosenberg, Roadblocked monotonic paths and the enumeration of coalescent histories for non-matching caterpillar gene trees and species trees, 2020.
DOI: 10.1016/j.aam.2019.101939.
1089: , Brendan D. McKay, Fang Tian, Asymptotic enumeration of linear hypergraphs with given number of vertices and edges, 2020.
DOI: 10.1016/j.aam.2020.102000.
1090: , Keren Censor-Hillel, Dean Leitersdorf, Elia Turner, Sparse matrix multiplication and triangle listing in the Congested Clique model, 2020.
DOI: 10.1016/j.tcs.2019.11.006.
1091: , Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara, Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs, 2020.
DOI: 10.1016/j.tcs.2019.04.017.
1092: , Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato, Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration, 2020.
DOI: 10.1007/978-3-030-39881-1_18.
1097: , Shaikh Arifuzzaman, Maleq Khan, Madhav Marathe, Fast Parallel Algorithms for Counting and Listing Triangles in Big Graphs, 2020.
DOI: 10.1145/3365676.
1098: , Dat Hoang Tran, Ryuhei Uehara, Efficient Enumeration of Non-isomorphic Ptolemaic Graphs, 2020.
DOI: 10.1007/978-3-030-39881-1_25.
1110: , Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari, Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs, 2020.
DOI: 10.1007/s00453-019-00656-8.
1111: , Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa, Efficient enumeration of maximal k-degenerate induced subgraphs of a chordal graph, 2020.
DOI: 10.1016/j.tcs.2018.08.009.
1114: , Yudi Santoso, Venkatesh Srinivasan 0001, Alex Thomo, Efficient Enumeration of Four Node Graphlets at Trillion-Scale, 2020.
DOI: 10.5441/002/edbt.2020.52.
1118: , Luk Knapen, Irith Ben-Arroyo Hartman, Tom Bellemans, Using path decomposition enumeration to enhance route choice models, 2020.
DOI: 10.1016/j.future.2017.12.053.
1119: Pablo Spiga, On the existence of graphical Frobenius representations and their asymptotic enumeration, 2020.
DOI: 10.1016/j.jctb.2019.10.003.
1120: , Steven Klee, Matthew T. Stamps, Linear Algebraic Techniques for Spanning Tree Enumeration, 2020.
DOI: 10.1080/00029890.2020.1708171.
1139: , Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura, Shared-memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs, 2020.
DOI: 10.1145/3380936.
1140: Ayaka Ishikawa, An Explicit Formula Enumerating the Finely Bounded Trees Using Young Tableaux, 2020.
DOI: 10.1007/s00373-020-02138-z.
1141: , Wentian Guo, Yuchen Li, Mo Sha 0002, Bingsheng He, Xiaokui Xiao, Kian-Lee Tan, GPU-Accelerated Subgraph Enumeration on Partitioned Graphs, 2020.
DOI: 10.1145/3318464.3389699.
1142: , Zi Chen, Long Yuan, Xuemin Lin 0001, Lu Qin, Jianye Yang, Efficient Maximal Balanced Clique Enumeration in Signed Networks, 2020.
DOI: 10.1145/3366423.3380119.
1143: , Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Reza Saei, Enumeration of minimal connected dominating sets for chordal graphs, 2020.
DOI: 10.1016/j.dam.2019.07.015.
1144: , Yu Nakahata, Masaaki Nishino, Jun Kawahara, Shin-ichi Minato, Enumerating All Subgraphs Under Given Constraints Using Zero-Suppressed Sentential Decision Diagrams, 2020.
DOI: 10.4230/LIPIcs.SEA.2020.9.
1147: , Muhammad Waleed, Tai-Won Um, Aftab Khan, Zubair Ahmed Baig, An Automated Method for Detection and Enumeration of Olive Trees Through Remote Sensing, 2020.
DOI: 10.1109/ACCESS.2020.2999078.
1148: , Stanley Bak, Hoang-Dung Tran, Kerianne Hobbs, Taylor T. Johnson, Improved Geometric Path Enumeration for Verifying ReLU Neural Networks, 2020.
DOI: 10.1007/978-3-030-53288-8_4.
1149: , Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh, Families of Monotonic Trees - Combinatorial Enumeration and Asymptotics, 2020.
DOI: 10.1007/978-3-030-50026-9_11.
1156: , Jovan Blanusa, Radu Stoica, Paolo Ienne, Kubilay Atasu, Parallelizing Maximal Clique Enumeration on Modern Manycore Processors, 2020.
DOI: 10.1109/IPDPSW50202.2020.00047.
1157: , Keren Censor-Hillel, François Le Gall, Dean Leitersdorf, On Distributed Listing of Cliques, 2020.
DOI: 10.1145/3382734.3405742.
1161: Alan D. Sokal, A remark on the enumeration of rooted labeled trees, 2020.
DOI: 10.1016/j.disc.2020.111865.
1162: , Sherry H. F. Yan, Danna Yan, Hao Zhou, A bijective enumeration of tiered trees, 2020.
DOI: 10.1016/j.disc.2020.111983.
1163: , Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond, Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants, 2020.
DOI: 10.1145/3386686.
1166: Lijun Chang, Efficient maximum clique computation and enumeration over large sparse graphs, 2020.
DOI: 10.1007/s00778-020-00602-z.
1169: , Xun Jian, Yue Wang, Xiayu Lei, Yanyan Shen, Lei Chen, DDSL - Efficient Subgraph Listing on Distributed and Dynamic Graphs, 2020.
DOI: 10.1007/978-3-030-59416-9_39.
1170: , Yusuke Sano, Katsuhisa Yamanaka, Takashi Hirayama, A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs, 2020.
DOI: 10.1007/978-3-030-59901-0_2.
1172: , Gabriel Cardona, Louxin Zhang, Counting and enumerating tree-child networks and their subclasses, 2020.
DOI: 10.1016/j.jcss.2020.06.001.
1174: , Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi, On the Enumeration of Minimal Non-pairwise Compatibility Graphs, 2020.
DOI: 10.1007/978-3-030-58150-3_30.
1175: , Abir Farouzi, Ladjel Bellatreche, Carlos Ordonez 0001, Gopal Pandurangan, Mimoun Malki, A Scalable Randomized Algorithm for Triangle Enumeration on Graphs Based on SQL Queries, 2020.
DOI: 10.1007/978-3-030-59065-9_12.
1176: , Tengkai Yu, Venkatesh Srinivasan 0001, Alex Thomo, Triangle Enumeration on Massive Graphs Using AWS Lambda Functions, 2020.
DOI: 10.1007/978-3-030-57796-4_22.
1177: , Alessio Conte, Pierluigi Crescenzi, Andrea Marino, Giulia Punzi, Enumeration of s-d Separators in DAGs with Application to Reliability Analysis in Temporal Graphs, 2020.
DOI: 10.4230/LIPIcs.MFCS.2020.25.
1179: Peter Damaschke, Enumerating Grid Layouts of Graphs, 2020.
DOI: 10.7155/jgaa.00541.
1180: , Jia-Li Du, Yan-Quan Feng, Pablo Spiga, On the existence and the enumeration of bipartite regular representations of Cayley graphs over abelian groups, 2020.
DOI: 10.1002/jgt.22605.
1181: , Liron Sade, Sara Cohen, Diverse Enumeration of Maximal Cliques, 2020.
DOI: 10.1145/3340531.3417458.
1182: , Hadhemi Boubaker, Wafa Karoui, Improved Overlapping Community Detection in Networks based on Maximal Cliques Enumeration, 2020.
DOI: 10.1016/j.procs.2020.09.081.
1183: , Sarah Blind, Kolja Knauer, Petru Valicov, Enumerating k-Arc-Connected Orientations, 2020.
DOI: 10.1007/s00453-020-00738-y.
1184: , Rigoberto Flórez, José L. Ramírez, Enumerating symmetric and asymmetric peaks in Dyck paths, 2020.
DOI: 10.1016/j.disc.2020.112118.
1188: , Andrej Jursa, Mária Markosová, Boris Rudolf, About clique number estimates and exact enumeration in scale-free networks, 2020.
DOI: 10.1093/comnet/cnaa011.
1190: , Pranjal Awasthi, Bahman Kalantari, Yikai Zhang, Robust vertex enumeration for convex hulls in high dimensions, 2020.
DOI: 10.1007/s10479-020-03557-0.
1191: , Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi, Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank, 2020.
DOI: 10.3390/e22111295.
1192: , Masayuki Takeda, Nobuyuki Yamasaki, Codeword Set Selection for the Error-Correcting 4b/10b Line Code with Maximum Clique Enumeration, 2020.
DOI: 10.1587/transfun.2019DMP0019.
1197: , Vitaliy Gleyzer, Andrew J. Soszynski, Edward K. Kao, Leveraging Linear Algebra to Count and Enumerate Simple Subgraphs, 2020.
DOI: 10.1109/HPEC43674.2020.9286191.
1195: , Zhongxing Zheng, Weiming Liu, Heng Wang, Guici Fan, Yuan Dai, Real-Time Enumeration of Metro Passenger Volume Using Anchor-Free Object Detection Network on Edge Devices, 2021.
DOI: 10.1109/ACCESS.2021.3054938.
1196: , Chenglong Xiao, Shanshan Wang, Wanjun Liu, Xinlin Wang, Emmanuel Casseau, An Optimal Algorithm for Enumerating Connected Convex Subgraphs in Acyclic Digraphs, 2021.
DOI: 10.1109/TCSII.2020.3000297.
1202: , Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura, A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number, 2021.
DOI: 10.1016/j.tcs.2021.05.008.
1203: , Ali Baran Tasdemir, Lale Özkahya, Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures, 2021.
DOI: 10.1109/SIU53274.2021.9477866.
1207: , Tomohiro Koana, André Nichterlein, Detecting and enumerating small induced subgraphs in c-closed graphs, 2021.
DOI: 10.1016/j.dam.2021.06.019.
1208: , Yi-Wen Wei, Wei-Mei Chen, Hsin-Hung Tsai, Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs, 2021.
DOI: 10.1109/TPDS.2021.3067053.
1209: , Suman Banerjee, Bithika Pal, A Two-Phase Approach for Enumeration of Maximal $(\varDelta , \gamma )$-Cliques of a Temporal Network, 2021.
DOI: 10.1007/978-3-030-86475-0_33.
1210: , Bastien Sérée, Loïg Jezequel, Didier Lime, An Algorithm for Single-Source Shortest Paths Enumeration in Parameterized Weighted Graphs, 2021.
DOI: 10.1007/978-3-030-68195-1_22.
1211: , Shixuan Sun, Yuhang Chen, Bingsheng He, Bryan Hooi, PathEnum - Towards Real-Time Hop-Constrained s-t Path Enumeration, 2021.
DOI: 10.1145/3448016.3457290.
1212: , Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf, Tight Distributed Listing of Cliques, 2021.
DOI: 10.1137/1.9781611976465.171.
1213: , Xiaozhou Liu, Yudi Santoso, Venkatesh Srinivasan 0001, Alex Thomo, Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale, 2021.
DOI: 10.1145/3468791.3468805.
1214: , Kazuaki Yamazaki, Mengze Qian, Ryuhei Uehara, Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs, 2021.
DOI: 10.1007/978-3-030-68211-8_23.
1219: , Irwansyah, Intan Muchtadi-Alamsyah, Ahmad Muchlis, Aleams Barra, Djoko Suprijanto, A note on the construction and enumeration of Euclidean self-dual skew-cyclic codes, 2021.
DOI: 10.1007/s00200-021-00495-7.
1220: , Aida Abiad, Carlos A. Alfaro, Enumeration of cospectral and coinvariant graphs, 2021.
DOI: 10.1016/j.amc.2021.126348.
1221: , Lin Yang, Sheng-Liang Yang, Enumeration of Lattice paths with infinite types of steps and the Chung-Feller property, 2021.
DOI: 10.1016/j.disc.2021.112452.
1223: , Balázs Vass, János Tapolcai, Erika R. Bérczi-Kovács, Enumerating Maximal Shared Risk Link Groups of Circular Disk Failures Hitting k Nodes, 2021.
DOI: 10.1109/TNET.2021.3070100.
1224: , Zhaokang Wang, Weiwei Hu, Guowang Chen, Chunfeng Yuan, Rong Gu, Yihua Huang, Towards Efficient Distributed Subgraph Enumeration Via Backtracking-Based Framework, 2021.
DOI: 10.1109/TPDS.2021.3076246.
1225: , You Peng, Xuemin Lin 0001, Ying Zhang 0001, Wenjie Zhang 0001, Lu Qin, Jingren Zhou, Efficient Hop-constrained s-t Simple Path Enumeration, 2021.
DOI: 10.1007/s00778-021-00674-5.
1226: , Aly Ahmed, Keanelek Enns, Alex Thomo, Triangle Enumeration for Billion-Scale Graphs in RDBMS, 2021.
DOI: 10.1007/978-3-030-75075-6_13.
1227: , Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin 0001, Wenjie Zhang 0001, PEFP - Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA, 2021.
DOI: 10.1109/ICDE51399.2021.00118.
1228: , Michael Yu, Lu Qin, Ying Zhang 0001, Wenjie Zhang 0001, Xuemin Lin 0001, DPTL+ - Efficient Parallel Triangle Listing on Batch-Dynamic Graphs, 2021.
DOI: 10.1109/ICDE51399.2021.00119.
1229: , Arun Subramaniyan 0001, Jack Wadden, Kush Goliya, Nathan Ozog, Xiao Wu 0002, Satish Narayanasamy, David T. Blaauw, Reetuparna Das, Accelerated Seeding for Genome Sequence Alignment with Enumerated Radix Trees, 2021.
DOI: 10.1109/ISCA52012.2021.00038.
1230: , Zhengyi Yang, Longbin Lai, Xuemin Lin 0001, Kongzhang Hao, Wenjie Zhang 0001, HUGE - An Efficient and Scalable Subgraph Enumeration System, 2021.
DOI: 10.1145/3448016.3457237.
1241: , Egor Alimpiev, Noah A. Rosenberg, Enumeration of coalescent histories for caterpillar species trees and p-pseudocaterpillar gene trees, 2021.
DOI: 10.1016/j.aam.2021.102265.
1242: , Ben Cameron, Aaron Grubb, Joe Sawada, A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph, 2021.
DOI: 10.1007/978-3-030-89543-3_5.
1243: , Hristo Ganchev, Andrey Sariev, The automorphism group and definability of the jump operator in the ømega-enumeration degrees, 2021.
DOI: 10.1007/s00153-021-00766-7.
1244: , Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi, A method for enumerating pairwise compatibility graphs with a given number of vertices, 2021.
DOI: 10.1016/j.dam.2020.08.016.
1245: , Christian Komusiewicz, Frank Sommer, Enumerating connected induced subgraphs - Improved delay and experimental comparison, 2021.
DOI: 10.1016/j.dam.2020.04.036.
1246: , Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Efficient enumeration of dominating sets for sparse graphs, 2021.
DOI: 10.1016/j.dam.2021.06.004.
1247: , Irfan Caner Kaya, Firdevs Ulus, An iterative vertex enumeration method for objective space based vector optimization algorithms, 2021.
DOI: 10.1051/ro/2020139.
1240: , Yan Jin 0005, Bowen Xiong, Kun He 0001, Yangming Zhou, Yi Zhou 0016, On fast enumeration of maximal cliques in large graphs, 2022.
DOI: 10.1016/j.eswa.2021.115915.

No DOI

877: Mayeda, Wataru, digital determination of topological quantities and network functions, 1957.
878: Mayeda, Wataru, The application of Mathematical Logic to Network Theory, 1958.
879: H. Watanabe, Direct approximations in network synthesis, 1958.
880: H. Watanabe, Automatic computations in Network Analysis, 1959.
845: B. R. Myers and L. V. Auth, Jr.,, The number and listing of all trees in an arbitrary graph, 1965.
846: G. W. Zobrist and G. V. Lago, Method for obtaining the trees of a v vertex complete graph from the trees of a v-1 vertex complete graph, 1965.
883: Maxwell, L. and Reed, G. B., Subgraph identificationsegs, circuits and paths, 1965.
898: R.M. BURSTALL, Tree-searching methods with an application to a network design problem, 1967.
899: S. Shinoda, Finding all possible directed trees of a directed graph, 1968.
889: Silverman, G. J., Computational Considerations in Extreme Point Enumeration, 1971.
895: V. Charan Prasad, A. Prabhakar and P.C.P. Bhatt,, On the enumeration of all spanning trees of a graph, 1973.
804: G. R. Jahanshalou, G. Mitra , two algorithms for finding all the vertices of a convex polyhedra, 1974.
803: M. E. Dyer, L. G. Proll, Vertex enumeration in convex polyhedra: a comparative computational study, 1977.
896: P.C.P. Bhatt, On the enumeration of all cut sets, spanning trees and simple cycles of a given graph, 1977.
995: Marek Kubale, E. Kusz, Computer Experiences with Implicit Enumeration Algorithms for Graph Coloring, 1983.
735: Henry S. Thompson, A chart parsing realisation of dynamic programming, with best-first enumeration of paths in a lattice, 1989.
1032: Paul Dagum, On the magnification of exchange graphs with applications to enumeration problems, 1990.
728: Edward A. Bender, E. Rodney Canfield, Enumeration of Degree Restricted Rooted Maps on the Sphere, 1991.
719: Irith Pomeranz, Sudhakar M. Reddy, Prasanti Uppaluri, NEST - A Non-Enumerative Test Generation Method for Path Delay Faults in Combinational Circuits, 1993.
720: Leslie Ann Goldberg, Polynomial space polynomial delay algorithms for listing families of graphs, 1993.
696: Adrian Riskin, On the enumeration of polyhedral embeddings of Cartesian products of cycle, 1995.
705: Yau-Tsun Steven Li, Sharad Malik, Performance Analysis of Embedded Software Using Implicit Path Enumeration, 1995.
811: Yau-Tsun Steven Li, Sharad Malik, Performance Analysis of Embedded Software Using Implicit Path Enumeration, 1995.
687: R. H. Jeurissen, Th. Bezembinder, Enumerating oriented triangle graphs, 1996.
688: Luiz Henrique de Figueiredo, Jorge Stolfi, Adaptive Enumeration of Implicit Surfaces with Affine Arithmetic, 1996.
683: David Bremner, Komei Fukuda, Ambros Marzetta, Primal-Dual Methods for Vertex and Facet Enumeration (Preliminary Version), 1997.
902: Mikawa, K., & Takaoka, T, Generation of parenthesis strings by transpositions, 1997.
654: Leonid M. Koganov, Valery A. Liskovets, Timothy R. S. Walsh, Total Vertex Enumeration in Rooted Planar Maps, 1999.
652: Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl, Enumerating Triangulation Paths, 2000.
1239: Christophe Luc, Une typologie des énumérations basée sur les structures rhétoriques et architecturales du texte, 2001.
178: Nicholas Pippenger, Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs, 2002.
634: Peter J. Cameron, Cycle Index, Weight Enumerator, and Tutte Polynomial, 2002.
623: Nancy Ann Neudauer, Andrew M. Meyers, Brett Stevens, Enumeration of the bases of the bicircular matroid on a complete bipartite graph, 2003.
631: Saravanan Padmanaban, Spyros Tragoudas, Non-Enumerative Path Delay Fault Diagnosis , 2003.
633: David Renault, Enumerating planar locally finite Cayley graphs, 2003.
810: Yinglie Jin, Chunlin Liu, The enumeration of labelled spanning trees of Km, n, 2003.
172: Yinglie Jin, Chunlin Liu, Enumeration for spanning forests of complete bipartite graphs, 2004.
173: Eric R. Harley, Comparison of Clique-Listing Algorithms, 2004.
610: Richard Ehrenborg, Stephanie van Willigenburg, Enumerative Properties of Ferrers Graphs, 2004.
619: Qingshu Meng, Min Yang, Huanguo Zhang, Jingsong Cui, A novel algorithm enumerating Bent functions, 2004.
590: Seunghyun Seo, A Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees, 2005.
593: Charles Knessl, Wojciech Szpankowski, Enumeration of Binary Trees and Universal Types, 2005.
596: Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation, 2005.
599: Charles Knessl, Wojciech Szpankowski, Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal Types, 2005.
604: Ting Chen, Tulika Mitra, Abhik Roychoudhury, Vivy Suhendra, Exploiting Branch Constraints without Exhaustive Path Enumeration, 2005.
606: Tobias Nipkow, Gertrud Bauer, Towards a Verified Enumeration of All Tame Plane Graphs, 2005.
607: Qingshu Meng, Huanguo Zhang, Jingsong Cui, Min Yang, almost enumeration of 8-variable bent functions, 2005.
586: Claire Burguière, Christine Rochange, History-based Schemes and Implicit Path Enumeration, 2006.
587: Djemai Kebbal, Pascal Sainrat, Combining Symbolic Execution and Path Enumeration in Worst-Case Execution Time Analysis, 2006.
588: Benjamin A. Burton, Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find, 2006.
589: Selçuk Kavut, Subhamoy Maitra, Sumanta Sarkar, Melek Diker Yücel, Enumeration of 9-variable Rotation Symmetric Boolean Functions having Nonlinearity > 240, 2006.
568: Paolo Bonzini, Laura Pozzi, Polynomial-time subgraph enumeration for automated instruction set extension, 2007.
571: Eric Robinson, Daniel Kunkle, Gene Cooperman, A comparative analysis of parallel disk-based Methods for enumerating implicit graphs, 2007.
573: Joseph Geraci, Frank Van Bussel, A Note on Cyclotomic Cosets, an Algorithm for finding Coset Representatives and Size, and a Theorem on the Quantum evaluation of Weight Enumerators for a Certain Class of Cyclic Codes, 2007.
46: Natwar Modani, Kuntal Dey, Large maximal cliques enumeration in sparse graphs, 2008.
47: Kenneth A. Hawick, Heath A. James, Enumerating Circuits and Loops in Graphs with Self-Arcs and Multiple-Arcs, 2008.
158: Hans Raj Tiwary, Khaled M. Elbassioni, On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism, 2008.
543: Naoki Katoh, Shin-ichi Tanigawa, Fast enumeration algorithms for non-crossing geometric graphs, 2008.
549: Shaojing Fu, Chao Li, Longjiang Qu, Ping Li, Enumeration of Balanced Symmetric Functions over GF(p), 2008.
550: Shaojing Fu, Chao Li, Bing Sun, Enumeration of Homogeneous Rotation Symmetric functions over GF(p), 2008.
43: Natwar Modani, Kuntal Dey, Large Maximal Cliques Enumeration in Large Sparse Graphs, 2009.
44: William Hendrix, Matthew C. Schmidt, Paul Breimyer, Nagiza F. Samatova, On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs, 2009.
146: Katsuhisa Yamanaka, Shin-Ichi Nakano, Listing All Plane Graphs, 2009.
152: Jens Hermans, Michael Schneider 0002, Johannes A. Buchmann, Frederik Vercauteren, Bart Preneel, Parallel Shortest Lattice Vector Enumeration on Graphics Cards, 2009.
503: Feng-Gen Lin, Lian-zhu Zhang, Pfaffian Orientation and Enumeration of Perfect Matchings for some Cartesian Products of Graphs, 2009.
514: Jan Ramon, Siegfried Nijssen, Polynomial-Delay Enumeration of Monotonic Graph Classes, 2009.
519: Tao Li, Zhigang Sun, Wu Jigang, Xicheng Lu, Fast enumeration of maximal valid subgraphs for custom-instruction identification, 2009.
520: Brent ByungHoon Kang, Eric Chan-Tin, Christopher P. Lee, James Tyra, Hun Jeong Kang, Chris Nunnery, Zachariah Wadler, Greg Sinclair, Nicholas Hopper, David Dagon, Yongdae Kim, Towards complete node enumeration in a peer-to-peer botnet, 2009.
521: Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir, Enumerating all Finite Sets of Minimal Prime Extensions of Graphs, 2009.
528: Boris Villazón-Terrazas, Mari Carmen Suárez-Figueroa, Asunción Gómez-Pérez, Pattern for Re-engineering a Classification Scheme, which Follows the Path Enumeration Data Model, to a Taxonomy, 2009.
529: Joseph Bonneau, Jonathan Anderson, Ross J. Anderson, Frank Stajano, Eight friends are enough - social graph approximation via public listings, 2009.
532: Benedikt Huber, Martin Schoeberl, Comparison of Implicit Path Enumeration and Model Checking Based WCET Analysis, 2009.
134: Bolian Liu, Fengying Huang, Enumeration for no-trivial spanning forests of complete bipartite graphs, 2010.
139: Bin Wu, Kwan L. Yeung, Pin-Han Ho, ILP formulations for p-cycle design without candidate cycle enumeration, 2010.
481: Kathleen A. McKeon, Enumeration of Highly Irregular Trees by Automorphism Group, 2010.
486: Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara, Random Generation and Enumeration of Proper Interval Graphs, 2010.
492: Enver Kayaaslan, On Enumerating All Maximal Bicliques of Bipartite Graphs, 2010.
495: Michel Deza, Roman Shklyar, Enumeration of Hamiltonian Cycles in 6-cube, 2010.
496: Gianluigi Greco, Francesco Scarcello, On The Power of Tree Projections - Structural Tractability of Enumerating CSP Solutions, 2010.
497: P. Venkata Subba Reddy, K. Viswanathan Iyer, Algorithms for enumerating and counting D2CS of some graphs, 2010.
498: Özgür Dagdelen, Michael Schneider 0002, Parallel Enumeration of Shortest Lattice Vectors, 2010.
499: Guang-Pu Gao, Xi-Yong Zhang, Wen-Fen Liu, Enumerating Results of Homogeneous Rotation over GF(p), 2010.
34: Heidi Gebauer, Enumerating all Hamilton Cycles and Bounding the Number of Hamilton Cycles in 3-Regular Graphs, 2011.
454: Edward A. Bender, Zhicheng Gao, Asymptotic Enumeration of Labelled Graphs by Genus, 2011.
455: Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras, General Results on the Enumeration of Strings in Dyck Paths, 2011.
465: Khaled M. Elbassioni, Imran Rauf, Saurabh Ray, Enumerating Minimal Transversals of Geometric Hypergraphs, 2011.
466: Vladislav Bína, Enumeration of Labeled Split Graphs and Counts of Important Superclasses, 2011.
468: Benjamin A. Burton, Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations, 2011.
472: Benjamin A. Burton, Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations, 2011.
473: Martiniano Eguía, Francisco J. Soulignac, Hereditary biclique-Helly graphs - recognition and maximal biclique enumeration, 2011.
474: Keith Briggs, Asymptotic expansions for enumerating connected labelled graphs, 2011.
475: Vivek S. Nittoor, Reiji Suda, A Mathematical Approach to Balanced Tanner Graph Enumeration, 2011.
476: Vivek S. Nittoor, Reiji Suda, Algorithms for Enumerating Balanced Tanner Graphs, 2011.
477: Dongdai Lin, Jean-Charles Faugère, Ludovic Perret, Tianze Wang, On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC, 2011.
478: Nicolas Veyrat-Charvillon, Benoît Gérard, Mathieu Renauld, François-Xavier Standaert, An optimal Key Enumeration Algorithm and its Application to Side-Channel Attacks, 2011.
1133: , Mark Budden, Nicole Calkins, William Nathan Hack, Joshua Lambert, Kimberly Thompson, Enumeration of Triangles in Quartic Residue Graphs, 2011.
32: Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot, Optimal Listing of Cycles and st-Paths in Undirected Graphs, 2012.
120: James Cheng, Linhong Zhu, Yiping Ke, Shumo Chu, Fast algorithms for maximal clique enumeration with limited memory, 2012.
121: Luca Ferrari, Emanuele Munarini, Enumeration of edges in some lattices of paths, 2012.
417: Aleksander L. Owczarek, Thomas Prellberg, Enumeration of area-weighted Dyck paths with restricted height, 2012.
422: Matthias Beck, Tristram Bogart, Tu Pham, Enumeration of Golomb Rulers and Acyclic Orientations of Mixed Graphs, 2012.
423: Andrew Gainer-Dewar, Γ-Species and the Enumeration of k-Trees, 2012.
424: Michael Z. Spivey, Enumerating Lattice Paths Touching or Crossing the Diagonal at a Given Number of Lattice Points, 2012.
432: Masanobu Ishikawa, Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano, Enumerating All Rooted Trees Including k Leaves, 2012.
436: Kenro Yatake, Toshiaki Aoki, SMT-based enumeration of object graphs from UML class diagrams, 2012.
442: Vladislav Bína, Jiri Pribil, An Open Problem of Star-like Graph Enumeration, 2012.
451: Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman, Enumerating Subgraph Instances Using Map-Reduce, 2012.
452: Jan Kyncl, Improved enumeration of simple topological graphs, 2012.
913: Jean-François Couturier, Algorithmes exacts et exponentiels sur les graphes - énumération, comptage et optimisation. (Exponential and exact algorithms on graphs - enumeration, counting and optimization), 2012.
29: David Eppstein, Maarten Löffler, Darren Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, 2013.
112: Takuya Akiba, Yoichi Iwata, Yuichi Yoshida, Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction, 2013.
115: Elisângela Silva Dias, Diane Castonguay, Humberto J. Longo, Walid Abdala Rfaei Jradi, Efficient Enumeration of All Chordless Cycles in Graphs, 2013.
379: Shude Long, Junliang Cai, Enumeration of boundary cubic inner-forest maps, 2013.
380: Bertran Steinsky, Enumeration of Labelled Essential Graphs, 2013.
381: Jianguo Qian, Enumeration of Unlabeled Directed Hypergraphs, 2013.
385: Martiniano Eguía, Francisco J. Soulignac, Hereditary biclique-Helly graphs - recognition and maximal biclique enumeration, 2013.
388: Pit Fender, Guido Moerkotte, Counter Strike - Generic Top-Down Join Enumeration for Hypergraphs, 2013.
394: Wojciech Kazana, Luc Segoufin, Enumeration of monadic second-order queries on trees, 2013.
396: Carsten Binnig, Abdallah Salama, Alexander C. Müller, Erfan Zamanian, Harald Kornmayer, Sven Listing, XDB - a novel database architecture for data analytics as a service, 2013.
406: Guido Moerkotte, Pit Fender, Marius Eich, On the correct and complete enumeration of the core search space, 2013.
411: Rodrigo de Castro, Andrés L. Ramírez, José L. Ramírez, Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs, 2013.
412: Rui Ferreira, Efficiently Listing Combinatorial Patterns in Graphs, 2013.
413: Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot, 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, 2013.
414: Zhengchun Zhou, Aixian Zhang, Cunsheng Ding, Maosheng Xiong, The Weight Enumerator of Three Families of Cyclic Codes, 2013.
415: Zhengchun Zhou, Cunsheng Ding, Jinquan Luo, Aixian Zhang, A Family of Five-Weight Cyclic Codes and Their Weight Enumerators, 2013.
416: Vivek S. Nittoor, Reiji Suda, Enumeration Based Search Algorithm For Finding A Regular Bi-partite Graph Of Maximum Attainable Girth For Specified Degree And Number Of Vertices, 2013.
27: Naga Shailaja Dasari, Desh Ranjan, Mohammad Zubair, Maximal clique enumeration for large graphs on hadoop framework, 2014.
98: Yingxia Shao, Bin Cui, Lei Chen 0002, Lin Ma, Junjie Yao, Ning Xu, Parallel subgraph listing in a large-scale graph, 2014.
99: Vandhana C., S. Hima Bindhu, P. Renjith, N. Sadagopan, B. Supraja, Spanning Tree Enumeration in 2-trees - Sequential and Parallel Perspective, 2014.
100: Elisângela Silva Dias, Diane Castonguay, Humberto J. Longo, Walid Abdala Rfaei Jradi, Hugo A. D. do Nascimento, Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs, 2014.
101: Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Amortized Õ( V )-Delay Algorithm for Listing Chordless Cycles in Undirected Graphs, 2014.
338: Matthieu Josuat-Vergès, Enumeration of snakes and cycle-alternating permutations, 2014.
343: Stephan G. Wagner, Enumeration Of Highly Balanced Trees, 2014.
345: Andrew Gainer-Dewar, Ira M. Gessel, Enumeration of Bipartite Graphs and Bipartite Blocks, 2014.
346: Ville Pettersson, Enumerating Hamiltonian Cycles, 2014.
349: Andrea Marino, Algorithms for Biological Graphs - Analysis and Enumeration, 2014.
358: Manuel Wettstein, Counting and Enumerating Crossing-free Geometric Graphs, 2014.
359: Katja Losemann, Wim Martens, MSO queries on trees - enumerating answers under updates, 2014.
360: Krzysztof Pancerz, Olga Mich, Mining Real-Estate Listings Based on Decision Systems over Ontological Graphs, 2014.
361: Pascal Raymond, A general approach for expressing infeasibility in Implicit Path Enumeration Technique, 2014.
362: Andrea Marino, Algorithms for biological graphs - analysis and enumeration, 2014.
364: Martin Sevenich, Sungpack Hong, Adam Welc, Hassan Chafi, Fast In-Memory Triangle Listing for Large Real-World Graphs, 2014.
373: Dan Ding, Guizhen Zhu, Yang Yu, Zhongxiang Zheng, A Fast Phase-Based Enumeration Algorithm for SVP Challenge through y-Sparse Representations of Short Lattice Vectors, 2014.
374: Christophe Doche, On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography, 2014.
375: Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, Sachin Vasant, Asaf Ziv, NSEC5 - Provably Preventing DNSSEC Zone Enumeration, 2014.
376: Daniele Micciancio, Michael Walter, Fast Lattice Point Enumeration with Minimal Overhead, 2014.
377: Siwei Sun, Lei Hu, Meiqin Wang, Peng Wang, Kexin Qiao, Xiaoshuang Ma, Danping Shi, Ling Song, Automatic Enumeration of (Related-key) Differential and Linear Characteristics with Predefined Properties and Its Applications, 2014.
378: Michael Walter, Lattice Point Enumeration on Block Reduced Bases, 2014.
1116: , Luca Ferrari 0001, Emanuele Munarini, Enumeration of Edges in Some Lattices of Paths, 2014.
22: Taisuke Izumi, Daisuke Suzuki, Faster Enumeration of All Maximal Cliques in Unit Disk Graphs Using Geometric Structure, 2015.
76: Shohei Ando, Fumihiko Ino, Toru Fujiwara, Kenichi Hagihara, Enumerating Joint Weight of a Binary Linear Code Using Parallel Architectures - multi-core CPUs and GPUs, 2015.
300: Éva Czabarka, Rigoberto Flórez, Leandro Junes, Some Enumerations on Non-Decreasing Dyck Paths, 2015.
301: Evgeniy Krasko, Alexander Omelchenko, Brown's Theorem and its Application for Enumeration of Dissections and Planar Trees, 2015.
308: Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin, Optimal Enumeration - Efficient Top-k Tree Matching, 2015.
309: Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang, Scalable Subgraph Enumeration in MapReduce, 2015.
314: Charles A. Phillips, Kai Wang, Jason A. Bubier, Erich J. Baker, Elissa J. Chesler, Michael A. Langston, Scalable multipartite subgraph enumeration for integrative analysis of heterogeneous experimental functional genomics data, 2015.
315: Lhouari Nourine, Alain Quilliot, Hélène Toussaint, Partial Enumeration of Minimal Transversals of a Hypergraph, 2015.
335: Liron David, Avishai Wool, A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-Dimensional Side-Channel Attacks, 2015.
336: Vincent Grosso, François-Xavier Standaert, ASCA, SASCA and DPA with Enumeration - Which One Beats the Other and When?, 2015.
337: Daniel P. Martin, Jonathan F. O'Connell, Elisabeth Oswald, Martijn Stam, How to Enumerate Your Keys Accurately and Efficiently After a Side Channel Attack, 2015.
1129: , Melkamu Zeleke, Mahendra Jani, On Subsets of Ordered Trees Enumerated by a Subsequence of Fibonacci Numbers, 2015.
1130: , Christian Barrientos, Sarah M. Minion, Enumerating Families of Labeled Graphs, 2015.
1131: , Stefan Felsner, Daniel Heldt, Lattice Path Enumeration and Toeplitz Matrices, 2015.
20: Anne-Sophie Himmel, Hendrik Molter, Rolf Niedermeier, Manuel Sorge, Enumerating Maximal Cliques in Temporal Graphs, 2016.
63: Yueming Liang, Bolian Liu, Enumeration of the degree sequences of 3-connected graphs and cactus graphs, 2016.
67: Ahish Mysore Somashekar, Spyros Tragoudas, Rathish Jayabharathi, Sreenivas Gangadhar, Non-enumerative Generation of Path Delay Distributions and Its Application to Critical Path Selection, 2016.
72: Hyeonji Kim, Juneyoung Lee, Sourav S. Bhowmick, Wook-Shin Han, Jeong-Hoon Lee, Seongyun Ko, Moath H. A. Jarrah, DUALSIM - Parallel Subgraph Enumeration in a Massive Graph on a Single Machine, 2016.
74: Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs, 2016.
242: Long Yu, Hongwei Liu, A class of p-ary cyclic codes and their weight enumerators, 2016.
245: Vladimir M. Blinovsky, Catherine S. Greenhill, Asymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees, 2016.
252: Alice L. L. Gao, Emily X. L. Gao, Patxi Laborde-Zubieta, Brian Y. Sun, Enumeration of Corners in Tree-like Tableaux, 2016.
263: Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang, Scalable Distributed Subgraph Enumeration, 2016.
267: Eunice Yuh-Jie Chen, Arthur Choi, Adnan Darwiche, Enumerating Equivalence Classes of Bayesian Networks using EC Graphs, 2016.
268: Nofar Carmeli, Batya Kenig, Benny Kimelfeld, On the Enumeration of Tree Decompositions, 2016.
269: Markus Kröll, Reinhard Pichler, Sebastian Skritek, On the Complexity of Enumerating the Answers to Well-Designed Pattern Trees, 2016.
277: Daniel Zinn, Haicheng Wu, Jin Wang, Molham Aref, Sudhakar Yalamanchili, General-purpose join algorithms for large graph triangle listing on heterogeneous systems, 2016.
280: Dongqing Xiao, Mohamed Y. Eltabakh, Xiangnan Kong, Bermuda - An Efficient MapReduce Triangle Listing Algorithm for Web-Scale Graphs, 2016.
281: Bingcheng Jin, Yu Chen, Na Li, Xiaofeng Tao, Efficient node enumeration for soft-input soft-output sphere decoding, 2016.
284: Maryam Bahrani, Jérémie Lumbroso, Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition, 2016.
285: Cédric Chauve, Éric Fusy, Jérémie Lumbroso, An Exact Enumeration of Distance-Hereditary Graphs, 2016.
286: Amit Gurung, Rajarshi Ray, An Efficient Algorithm for Vertex Enumeration of Two-Dimensional Projection of Polytopes, 2016.
287: Dmitry I. Ignatov, Towards a closure operator for enumeration of maximal tricliques in tripartite hypergraphs, 2016.
288: Manuel Wettstein, Counting and Enumerating Crossing-free Geometric Graphs, 2016.
289: Sharon Goldberg, Moni Naor, Dimitrios Papadopoulos, Leonid Reyzin, NSEC5 from Elliptic Curves - Provably Preventing DNSSEC Zone Enumeration with Shorter Responses, 2016.
290: Paul Kirchner, Pierre-Alain Fouque, Time-Memory Trade-Off for Lattice Enumeration in a Ball, 2016.
291: Elena Kirshanova, Alexander May, Friedrich Wiemer, Parallel Implementation of BDD enumeration for LWE, 2016.
292: Romain Poussier, François-Xavier Standaert, Vincent Grosso, Simple Key Enumeration (and Rank Estimation) using Histograms - an Integrated Approach, 2016.
293: Zhongxiang Zheng, Xiaoyun Wang, Yang Yu, Orthogonalized Lattice Enumeration for Solving SVP, 2016.
870: Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, and Riccardo Torlone, Finding all maximal cliques in very large social networks. , 2016.
1086: Adrien Ycart, Florent Jacquemard, Jean Bresson, Slawek Staworko, A Supervised Approach for Rhythm Transcription Based on Tree Series Enumeration, 2016.
96: Claire Pennarun, Planar graphs - non-aligned drawings, power domination and enumeration of Eulerian orientations. (Graphes planaires - dessins non-alignés, domination de puissance et énumération d'orientations Eulériennes), 2017.
223: Nishant Subramani, Doug Downey, PAG2ADMG - A Novel Methodology to Enumerate Causal Graph Structures, 2017.
226: Salvatore Ruggieri, Enumerating Distinct Decision Trees, 2017.
229: Peng Jiang, Gagan Agrawal, Combining SIMD and Many/Multi-core Parallelism for Finite State Machines with Enumerative Speculation, 2017.
231: Mario Alviano, Model enumeration in propositional circumscription via unsatisfiable core analysis, 2017.
232: Shaikh Arifuzzaman, Maleq Khan, Madhav V. Marathe, Distributed-Memory Parallel Algorithms for Counting and Listing Triangles in Big Graphs, 2017.
234: Irwansyah, Intan Muchtadi-Alamsyah, Ahmad Muchlis, Aleams Barra, Djoko Suprijanto, A Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields, 2017.
235: Raphael Kimmig, Henning Meyerhenke, Darren Strash, Shared Memory Parallel Subgraph Enumeration, 2017.
236: Supawadee Prugsapitak, Somphong Jitman, Enumeration of Self-Dual Cyclic Codes of some Specific Lengths over Finite Fields, 2017.
237: Pedro Recuero, Toward an enumeration of unlabeled trees, 2017.
238: Xizhe Zhang, Jianfei Han, An efficient algorithm for enumerating all possible input nodes in controlling complex networks, 2017.
239: Yoshinori Aono, Phong Q. Nguyen, Random Sampling Revisited - Lattice Enumeration with Discrete Pruning, 2017.
240: Changhai Ou, Degang Sun, Zhu Wang, Xinping Zhou, Juan Ai, Towards Easy Key Enumeration, 2017.
818: Stephen Melczer, Analytic Combinatorics in Several Variables - Effective Asymptotics and Lattice Path Enumeration. (Combinatoire analytique en plusieurs variables - asymptotique efficace et énumération de chemin de treillis), 2017.
822: Sherry H. F. Yan, Robin D. P. Zhou, Refined Enumeration of Corners in Tree-like Tableaux, 2017.
823: Jun Kawahara, Takeru Inoue, Hiroaki Iwashita, Shin-ichi Minato, Frontier-Based Search for Enumerating All Constrained Subgraphs with Compressed Representation, 2017.
836: Brenton Lessley, Talita Perciano, Manish Mathai, Hank Childs, E. Wes Bethel, Maximal clique enumeration with data-parallel primitives, 2017.
851: Tiphaine Viard, Clémence Magnien, Matthieu Latapy, Enumerating maximal cliques in link streams with durations, 2017.
852: Yisu Peng, Yuxiang Jiang, Predrag Radivojac, Enumerating consistent subgraphs of directed acyclic graphs - an insight into biomedical ontologies, 2017.
860: George Manoussakis, An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs, 2017.
912: Manuel Wettstein, Counting and enumerating crossing-free geometric graphs, 2017.
917: Norihito Yasuda, Teruji Sugaya, Shin-ichi Minato, Fast Compilation of s-t Paths on a Graph for Counting and Enumeration, 2017.
1128: , Marcelo Firer, Karine Bobadilha Couto, Eduardo Brandani da Silva, Enumeration of Vertices, Edges and Polygons in Tessellations of the Plane, 2017.
856: Pablo San Segundo, Jorge Artieda, Darren Strash, Efficiently Enumerating all Maximal Cliques with Bit-Parallelism, 2018.
859: Ashish Kumar Upadhyay, Dipendu Maity, On the enumeration of a class of toroidal graphs, 2018.
864: Pranjal Awasthi, Bahman Kalantari, Yikai Zhang, Robust Vertex Enumeration for Convex Hulls in High Dimensions, 2018.
865: Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Efficient Enumeration of Dominating Sets for Sparse Graphs, 2018.
887: Daniel P. Martin 0001, Luke Mather, Elisabeth Oswald, Two Sides of the Same Coin - Counting and Enumerating Keys Post Side-Channel Attacks Revisited, 2018.
888: Vincent Grosso, Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys, 2018.
903: Jinghui Li, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Substituted Benzene Isomers of Tree-Like Chemical Graphs, 2018.
907: Kunihiro Wasa, Takeaki Uno, Efficient Enumeration of Bipartite Subgraphs in Graphs, 2018.
908: Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari, Listing Maximal Subgraphs in Strongly Accessible Set Systems, 2018.
909: Pranjal Awasthi, Bahman Kalantari, Yikai Zhang, Robust Vertex Enumeration for Convex Hulls in High Dimensions, 2018.
911: Maximilien Danisch, Oana Denisa Balalau, Mauro Sozio, Listing k-cliques in Sparse Real-World Graphs, 2018.
915: Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka, Enumerating All Subgraphs without Forbidden Induced Subgraphs via Multivalued Decision Diagrams, 2018.
916: Suman Banerjee, Bithika Pal, On the Enumeration of Maximal (Δ, γ)-Cliques of a Temporal Network, 2018.
918: Yu Nakahata, Jun Kawahara, Shoji Kasahara, Enumerating Graph Partitions Without Too Small Connected Components Using Zero-suppressed Binary and Ternary Decision Diagrams, 2018.
919: Vyacheslav Moklev, Vladimir Ulyantsev, BFS Enumeration for Breaking Symmetries in Graphs, 2018.
921: Nicole Schweikardt, Luc Segoufin, Alexandre Vigny, Enumeration for FO Queries over Nowhere Dense Graphs, 2018.
927: Matthias Niewerth, MSO Queries on Trees - Enumerating Answers under Updates Using Forest Algebras, 2018.
928: Kazuhiro Kurita, Kunihiro Wasa, Alessio Conte, Hiroki Arimura, Takeaki Uno, Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth, 2018.
929: Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura, Shared-Memory Parallel Maximal Clique Enumeration, 2018.
932: Rigoberto Flórez, José L. Ramírez, Some enumerations on non-decreasing Motzkin paths, 2018.
939: Rohit Kumar 0002, Toon Calders, 2SCENT - An Efficient Algorithm to Enumerate All Simple Temporal Cycles, 2018.
940: Mohammed Alokshiya, Saeed Salem, Fidaa Abed, A Linear Delay Linear Space Algorithm for Enumeration of All Connected Induced Subgraphs, 2018.
945: Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher, Listing All Maximal k-Plexes in Temporal Graphs, 2018.
946: Yoshinori Aono, Phong Q. Nguyen, Yixin Shen, Quantum Lattice Enumeration and Tweaking Discrete Pruning, 2018.
947: Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata, Lower Bounds on Lattice Enumeration with Extreme Pruning, 2018.
950: Seyed-Vahid Sanei-Mehri, Apurba Das, Srikanta Tirthapura, Enumerating Top-k Quasi-Cliques, 2018.
956: Xun Jian, Yue Wang 0012, Xiayu Lei, Lei Chen, DDSL - Efficient Subgraph Listing on Distributed and Dynamic Graphs, 2018.
957: Ha-Myung Park, Francesco Silvestri 0001, Rasmus Pagh, Chin-Wan Chung, Sung-Hyon Myaeng, U. Kang, Enumerating Trillion Subgraphs On Distributed Systems, 2018.
958: Matthias Bentert, Anne-Sophie Himmel, Hendrik Molter, Marco Morik, Rolf Niedermeier, René Saitenmacher, Listing All Maximal k-Plexes in Temporal Graphs, 2018.
959: Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond, Enumerating minimal dominating sets in triangle-free graphs, 2018.
963: Yuan Cao, Yonglin Cao, Hai Q. Dinh, Somphong Jitman, An explicit representation and enumeration for self-dual cyclic codes over F2m+uF2m of length 2s, 2018.
970: Alexandre Vigny, Query enumeration and nowhere dense graphs. (Énumération des requêtes et graphes nulle-part denses), 2018.
983: Petra Mutzel, Lutz Oettershagen, On the Enumeration of Bicriteria Temporal Paths, 2018.
984: Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth, Enumeration on Trees with Tractable Combined Complexity and Efficient Updates, 2018.
1109: , Alexander Strang, Oliver Haynes, Rigoberto Flórez, Darren A. Narayan, Enumerating shortest paths and determining edge betweenness centrality in cartesian products of paths and cycles, 2018.
1124: , Maryam Bahrani, Jérémie O. Lumbroso, Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition, 2018.
1125: Lionel Ponton, Two Trees Enumerating the Positive Rationals, 2018.
1126: , Jackson Evoniuk, Steven Klee, Van Magnan, Enumerating Minimal Length Lattice Paths, 2018.
1127: Milan Janjic, On Enumeration of Dyck Paths with Colored Hills, 2018.
982: Xuguang Ren, Junhu Wang, Wook-Shin Han, Jeffrey Xu Yu, Fast and Robust Distributed Subgraph Enumeration, 2019.
992: Chris Ying, Enumerating Unique Computational Graphs via an Iterative Graph Invariant, 2019.
1013: Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs, 2019.
1017: Koji Ouchi, Ryuhei Uehara, Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns, 2019.
1021: Günter Rote, Minimal Dominating Sets in a Tree - Counting, Enumeration, and Extremal Results, 2019.
1030: Patryk Mikos, Efficient enumeration of non-isomorphic interval graphs, 2019.
1039: Kazuhiro Kurita, Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Constant Amortized Time Enumeration of Independent Sets for Graphs with Forbidden Subgraphs on Fixed Number of Vertices, 2019.
1044: Xuguang Ren, Junhu Wang, Wook-Shin Han, Jeffrey Xu Yu, Fast and Robust Distributed Subgraph Enumeration, 2019.
1050: Yuan Cao 0001, Yonglin Cao, Hai Q. Dinh, Fang-Wei Fu, Fanghui Ma, Construction and enumeration for self-dual cyclic codes of even length over F2m + uF2m, 2019.
1051: Irfan Caner Kaya, Firdevs Ulus, An Iterative Vertex Enumeration Method for Objective Space Based Multiobjective Optimization Algorithms, 2019.
1052: Zhipeng Xu, Xiaolong Huang, Yuefan Deng, Enumeration of regular graphs by using the cluster in high efficiency, 2019.
1053: Sarah Blind, Kolja Knauer, Petru Valicov, Enumerating k-arc-connected orientations, 2019.
1068: Katsuhisa Yamanaka, Yasuko Matsui, Shin-Ichi Nakano, Enumerating Highly-Edge-Connected Spanning Subgraphs, 2019.
1072: Hendrik Molter, Rolf Niedermeier, Malte Renken, Enumerating Isolated Cliques in Temporal Networks, 2019.
1073: Marco Grassia, Juho Lauri, Sourav Dutta 0001, Deepak Ajwani, Learning Multi-Stage Sparsification for Maximum Clique Enumeration, 2019.
1074: Yu Nakahata, Jun Kawahara, Takashi Horiyama, Shin-ichi Minato, Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration, 2019.
1093: , Melissa Azouaoui, Romain Poussier, François-Xavier Standaert, Vincent Verneuil, Key Enumeration from the Adversarial Viewpoint - When to Stop Measuring and Start Enumerating?, 2019.
1104: , You Peng, Ying Zhang 0001, Xuemin Lin, Wenjie Zhang 0001, Lu Qin, Jingren Zhou, Hop-constrained s-t Simple Path Enumeration - Towards Bridging Theory and Practice, 2019.
1107: , Alessio Conte, Andrea Marino, Roberto Grossi, Takeaki Uno, Luca Versari, Proximity Search For Maximal Subgraph Enumeration, 2019.
1123: , Quang Nhat Le, Sinai Robins, Christophe Vignat, Tanay V. Wakhare, A Continuous Analogue of Lattice Path Enumeration, 2019.
1167: Sarah Blind, Output-sensitive algorithms for enumeration problems in graphs. (Algorithmes "output-sensitifs" pour les problèmes d'énumération dans les graphes), 2019.
1088: , Apurba Das, Seyed-Vahid Sanei-Mehri, Srikanta Tirthapura, Shared-Memory Parallel Maximal Clique Enumeration from Static and Dynamic Graphs, 2020.
1099: , Ravi Goyal, Victor De Gruttola, Recursive Formula for Labeled Graph Enumeration, 2020.
1100: , Yu Nakahata, Takashi Horiyama, Shin-ichi Minato, Katsuhisa Yamanaka, Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization, 2020.
1112: , Yuui Tamura, Yuhei Nishiyama, Chenxi Wang, Yanming Sun, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Chemical Graphs with Mono-block 2-Augmented Tree Structure from Given Upper and Lower Bounds on Path Frequencies, 2020.
1113: , Kyousuke Yamashita, Ryuji Masui, Xiang Zhou, Chenxi Wang, Aleksandar Shurbevski, Hiroshi Nagamochi, Tatsuya Akutsu, Enumerating Chemical Graphs with Two Disjoint Cycles Satisfying Given Path Frequency Specifications, 2020.
1115: , Suman Banerjee, Bithika Pal, First Stretch then Shrink and Bulk - A Two Phase Approach for Enumeration of Maximal $(Δ, γ)$\mbox{-}Cliques of a Temporal Network, 2020.
1117: , Mikhail Isaev, Tejas Iyer, Brendan D. McKay, Asymptotic Enumeration of Orientations of a Graph as a Function of the Out-Degree Sequence, 2020.
1121: , Florian Ingels, Romain Azaïs, Enumeration of Unordered Forests, 2020.
1122: , Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine, Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets, 2020.
1145: Yixin Cao 0001, Enumerating Maximal Induced Subgraphs, 2020.
1146: , Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger, Sieve, Enumerate, Slice, and Lift - Hybrid Lattice Algorithms for SVP via CVPP, 2020.
1150: , Zhaokang Wang, Weiwei Hu, Chunfeng Yuan, Rong Gu, Yihua Huang, Distributed Subgraph Enumeration via Backtracking-based Framework, 2020.
1151: , Anita Liebenau, Nick Wormald, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, 2020.
1152: , Caroline Brosse, Aurélie Lagoutte, Vincent Limouzy, Arnaud Mary, Lucas Pastor, Efficient enumeration of maximal split subgraphs and sub-cographs and related classes, 2020.
1153: , Martin R. Albrecht, Shi Bai, Pierre-Alain Fouque, Paul Kirchner, Damien Stehlé, Weiqiang Wen, Faster Enumeration-based Lattice Reduction - Root Hermite Factor k(1/(2k)) in Time k(k/8 + o(k)), 2020.
1158: , Suman Banerjee, Bithika Pal, An Efficient Updation Approach for Enumerating Maximal (Δ, γ)-Cliques of a Temporal Network, 2020.
1159: , Keren Censor-Hillel, François Le Gall, Dean Leitersdorf, On Distributed Listing of Cliques, 2020.
1160: , Tomohiro Koana, André Nichterlein, Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs, 2020.
1164: Andreas Löhne, Approximate Vertex Enumeration, 2020.
1165: , Jovan Blanusa, Radu Stoica, Paolo Ienne, Kubilay Atasu, Many-Core Clique Enumeration with Fast Set Intersections, 2020.
1168: , Ronghua Li, Sen Gao, Lu Qin, Guoren Wang, Weihua Yang, Jeffrey Xu Yu, Ordering Heuristics for k-clique Listing, 2020.
1173: , Peng Jiang, Yang Xia, Gagan Agrawal, Combining SIMD and Many/Multi-core Parallelism for Finite-state Machines with Enumerative Speculation, 2020.
1185: , Samer Nofal, Amani Abu Jabal, Abdullah Alfarrarjeh, Ismail Hababeh, Formal Validation of Recursive Backtracking Algorithms - The Case of Listing Stable Extensions in the Directed Graphs of Argumentation Frameworks, 2020.
1186: , Martin R. Albrecht, Shi Bai, Jianwei Li, Joe Rowell, Lattice Reduction with Approximate Enumeration Oracles - Practical Algorithms and Concrete Performance, 2020.
1189: , Keren Censor-Hillel, Yi-Jun Chang, François Le Gall, Dean Leitersdorf, Tight Distributed Listing of Cliques, 2020.
1193: , Raphaël Charbey, Cécile Bothorel, Laurent Brisson, Énumération de motifs dans un graphe d'évolution de communautés (Pattern mining in community evolution graph), 2020.
1198: Tuukka Korhonen, Listing Small Minimal Separators of a Graph, 2020.
1199: , Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin 0001, Wenjie Zhang 0001, PEFP - Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA, 2020.
1200: , Julien Bensmail, Soumen Nandi, Mithun Roy, Sagnik Sen 0001, Enumeration of edge-critical underlying absolute planar cliques for signed graphs, 2020.
1237: , Dipendu Maity, Ashish Kumar Upadhyay, Corrigendum to "On the enumeration of a class of toroidal graphs" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119], 2020.
1201: , Yasuko Matsui, Kenta Ozeki, A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs, 2021.
1204: Hisao Tamaki, A heuristic for listing almost-clique minimal separators of a graph, 2021.
1215: , Shixuan Sun, Yuhang Chen, Bingsheng He, Bryan Hooi, PathEnum - Towards Real-Time Hop-Constrained s-t Path Enumeration, 2021.
1216: , Minjia Pan, Rong-Hua Li, Qi Zhang, Yongheng Dai, Qun Tian, Guoren Wang, Fairness-aware Maximal Clique Enumeration, 2021.
1217: , Abdullah Khan, Alexei Lisitsa, Viktor Lopatkin, Alexei Vernitski, Circle graphs (chord interlacement graphs) of Gauss diagrams - Descriptions of realizable Gauss diagrams, algorithms, enumeration, 2021.
1218: , Ben Cameron, Aaron Grubb, Joe Sawada, A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph, 2021.
1222: Patryk Mikos, Efficient enumeration of non-isomorphic interval graphs, 2021.
1231: , Zhengyi Yang, Longbin Lai, Xuemin Lin 0001, Kongzhang Hao, Wenjie Zhang 0001, HUGE - An Efficient and Scalable Subgraph Enumeration System, 2021.
1232: Yuya Sasaki 0001, Cost-constrained Minimal Steiner Tree Enumeration by Binary Decision Diagram, 2021.
1233: , Satya R. T. Peddada, Nathan M. Dunfield, Lawrence E. Zeidner, Kai A. James, James T. Allison, Systematic Enumeration and Identification of Unique Spatial Topologies of 3D Systems Using Spatial Graph Representations, 2021.
1234: , Charis Papadopoulos, Athanasios Zisis, Computing and Listing Avoidable Vertices and Paths, 2021.
1235: , Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot, Lattice Enumeration for Tower NFS - a 521-bit Discrete Logarithm Computation, 2021.
1236: , Simon Pohmann, Marc Stevens 0001, Jens Zumbrägel, Lattice Enumeration on GPUs for fplll, 2021.
1248: , Aditya Potukuchi, Liana Yepremyan, Enumerating independent sets in Abelian Cayley graphs, 2021.

Checked list

839:Checked: see -> Percival1953
W.S. Percival, The Solution of Passive Electrical Networks by Means of Mathematical Trees, 1953. DOI: 10.1049/pi-3.1953.0033.
871:Counting:
E. N. Gilbert, Enumeration of labelled graphs, 1956. DOI: 10.4153/CJM-1956-046-2.
897:Checked: see -> MacWilliams1958
J. MacWilliams, Topological Network Analysis as a Computer Program, 1958. DOI: 10.1109/TCT.1958.1086460.
794:Counting:
Frank Harary, Geert Prins, The number of homeomorphically irreducible trees, and other species, 1959. DOI: 10.1007/BF02559543.
840:Checked: see -> Fujisawa1959
T. Fujisawa, On a Problem of Network Topology, 1959. DOI: 10.1109/TCT.1959.1086556.
793:Counting:
John Riordan, The Enumeration of Trees by Height and Diameter, 1960. DOI: 10.1147/rd.45.0473.
881:Checked: see -> Watanabe1960
H. Watanabe, A Computational Method for Network Topology, 1960. DOI: 10.1109/TCT.1960.1086675.
838:Checked: see -> Balinski1961
M. L. Balinski, An Algorithm for Finding All Vertices of Convex Polyhedral Sets, 1961. DOI: 10.1137/0109008.
841:Not Enum:
H. Watanabe, A Method of Tree Expansion in Network Topology, 1961. DOI: 10.1109/TCT.1961.1086737.
964:Checked: see -> Balinski1961
M. L. Balinski, An Algorithm for Finding All Vertices of Convex Polyhedral Sets, 1961. DOI: 10.1137/0109008.
882:Checked: see -> Bellert1962
S. Bellert, Topological analysis and synthesis of linear systems, 1962. DOI: 10.1016/0016-0032(62)90042-X.
842:Counting:
O. Wing, Enumeration of Trees, 1963. DOI: 10.1109/TCT.1963.1082099.
843:Checked: see -> Hakimi1964
S. Hakimi ; D. Green, Generation and Realization of Trees and k-Trees, 1964. DOI: 10.1109/TCT.1964.1082276.
966:Not Enum:
N.V Chernikova, Algorithm for finding a general formula for the non-negative solutions of a system of linear equations, 1964. DOI: 10.1016/0041-5553(64)90009-6.
844:Checked: see -> Piekarski1965
M. Piekarski, Listing of All Possible Trees of a Linear Graph, 1965. DOI: 10.1109/TCT.1965.1082388.
891:Not Enum:
N.V. Chernikova, Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities, 1965. DOI: 10.1016/0041-5553(65)90045-5.
967:Not Enum:
N.V. Chernikova, Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities, 1965. DOI: 10.1016/0041-5553(65)90045-5.
796:Counting:
Dorwin Cartwright, Terry C. Gleason, The number of paths and cycles in a digraph, 1966. DOI: 10.1007/BF02289506.
847:Checked: see -> Maxwell1966
L.M. Maxwell and J.M. Cline, Topological network analysis by algebraic methods, 1966. DOI: 10.1049/piee.1966.0224.
797:Checked: see -> Hu1967
T. C. Hu, Revised Matrix Algorithms for Shortest Paths, 1967. DOI: 10.1137/0115017.
996:Not Enum:
G.A. DIRAC, Minimally 2-connected graphs., 1967. DOI: 10.1515/crll.1967.228.204.
805:Checked: see -> Manas1968
Miroslav Maňas, Josef Nedoma, Finding all vertices of a convex polyhedron, 1968. DOI: 10.1007/BF02162916.
812:Checked: see -> Char1968
J. P. Char, Generation of Trees, Two-Trees, and Storage of Master Forests, 1968. DOI: 10.1109/TCT.1968.1082817.
998:Not Enum:
Michael D. Plummer, On minimal blocks, 1968. DOI: 10.1090/s0002-9947-1968-0228369-8.
792:Counting:
Egon Balas, Machine Sequencing Via Disjunctive Graphs - An Implicit Enumeration Algorithm, 1969. DOI: 10.1287/opre.17.6.941.
894:Checked: see -> McIlroy1969
M. Douglas McIlroy, Algorithm 354: generator of spanning trees [H], 1969. DOI: 10.1145/363219.363229.
791:Counting:
Dominique Foata, Enumerating k-trees, 1971. DOI: 10.1016/0012-365X(71)90023-9.
213:Counting:
András Ádám, J. Bagyinszki, On some enumeration questions concerning trees and tree-type networks, 1972.
790:Unavailable (other language or can not get the file):
Robert Cori, Jean Richard, Enumeration des graphes planaires a l'aide des series formelles en variables non commutatives, 1972. DOI: 10.1016/0012-365X(72)90080-5.
56:Checked: see -> Akkoyunlu1973
E. A. Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs, 1973. DOI: 10.1137/0202001.
788:Unavailable (other language or can not get the file):
Frank Harary, Edgar M. Palmer, Graphical enumeration, 1973.
789:Checked: see -> Tarjan1973
Robert Endre Tarjan, Enumeration of the Elementary Circuits of a Directed Graph, 1973. DOI: 10.1137/0202017.
806:Checked: see -> Mattheiss1973
T. H. Mattheiss, An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities, 1973. DOI: 10.1287/opre.21.1.247.
997:Not Enum:
Arthur M. Hobbs, A catalog of minimal blocks, 1973. DOI: 10.6028/jres.077b.005.
785:Counting:
C. Domb, A. J. Barrett, Enumeration of ladder graphs, 1974. DOI: 10.1016/0012-365X(74)90081-8.
786:Counting:
E. M. Wright, Two problems in the enumeration of unlabelled graphs, 1974. DOI: 10.1016/0012-365X(74)90011-9.
787:Unavailable (other language or can not get the file):
Alberto Martelli, An Application of Regular Algebra to the Enumeration of Cut Sets in a Graph, 1974.
801:Checked: see -> Burdet1974
Claude-Alain Burdet, Generating All the Faces of a Polyhedron, 1974. DOI: 10.1137/0126045.
890:Checked: see -> Burdet1974
Claude-Alain Burdet, Generating All the Faces of a Polyhedron, 1974. DOI: 10.1137/0126045.
965:Checked: see -> Burdet1974
Claude-Alain Burdet, Generating All the Faces of a Polyhedron, 1974. DOI: 10.1137/0126045.
212:Duplication:
Alfred V. Aho, Jeffrey D. Ullman, Node Listings for Reducible Flow Graphs, 1975.
782:Counting:
Svein Mossige, Translation sets of permutations - Enumeration of selfcomplementary step-cycles, 1975. DOI: 10.1007/BF02242313.
783:Counting:
John Riordan, Enumeration of Plane Trees by Branches and Endpoints, 1975. DOI: 10.1016/S0097-3165(75)80010-0.
784:Not Enum:
Ken Kennedy, Node Listings Applied to Data Flow Analysis, 1975. DOI: 10.1145/512976.512978.
800:Checked: see -> Altherr1975
W. Altherr, An algorithm for enumerating all vertices of a convex polyhedron, 1975. DOI: 10.1007/BF02242366.
892:Not Enum:
David S. Rubin, Technical Note{\textemdash}Vertex Generation and Cardinality Constrained Linear Programs, 1975. DOI: 10.1287/opre.23.3.555.
893:Not Enum:
Harold Greenberg, An algorithm for determining redundant inequalities and all solutions to convex polyhedra, 1975. DOI: 10.1007/BF01437214.
211:Not Enum:
Alfred V. Aho, Jeffrey D. Ullman, Node Listings for Reducible Flow Graphs, 1976. DOI: 10.1016/S0022-0000(76)80042-6.
780:Checked: see -> Martelli1976a
Alberto Martelli, A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph, 1976. DOI: 10.1145/321921.321928.
781:Checked: see -> Mateti1976a
Prabhaker Mateti, Narsingh Deo, On Algorithms for Enumerating All Circuits of a Graph, 1976. DOI: 10.1137/0205007.
799:Checked: see -> Szwarcfiter1976
Jayme L. SzwarcfiterPeter E. Lauer, A search strategy for the elementary cycles of a directed graph, 1976. DOI: 10.1007/BF01931370.
209:Counting:
Victor Klee, Howard Quaife, Classification and enumeration of minimum (d, 1, 3)-graphs and minimum (d, 2, 3)-graphs, 1977. DOI: 10.1016/0095-8956(77)90059-4.
210:Counting:
Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk, Enumeration of graphs with signed points and lines, 1977. DOI: 10.1002/jgt.3190010405.
802:Checked: see -> Dyer1977
M. E. DyerL. G. Proll, An algorithm for determining all extreme points of a convex polytope, 1977. DOI: 10.1007/BF01593771.
884:Not Enum:
Gary D. Knott, A numbering system for binary trees, 1977. DOI: 10.1145/359423.359434.
779:Checked: see -> Trojanowski1978
Anthony E. Trojanowski, Ranking and Listing Algorithms for k-ary Trees, 1978. DOI: 10.1137/0207039.
208:Counting:
Phil Hanlon, Enumeration of graphs by degree sequence, 1979. DOI: 10.1002/jgt.3190030313.
775:Counting:
B. R. Handa, S. G. Mohanty, Enumeration of higher-dimensional paths under restrictions, 1979. DOI: 10.1016/0012-365X(79)90118-3.
776:Counting:
Phil Hanlon, The enumeration of bipartite graphs, 1979. DOI: 10.1016/0012-365X(79)90184-5.
777:Counting:
Ronald Alter, Johnson M. Hart, Enumerating syntactical graphs and lattices of derivations, 1979. DOI: 10.1007/BF00993054.
778:Counting:
Albert Nijenhuis, Herbert S. Wilf, The Enumeration of Connected Graphs and Linked Diagrams, 1979. DOI: 10.1016/0097-3165(79)90023-2.
795:Checked: see -> Srimani1979
P.K. Srimani, Generation of directed circuits in a directed graph, 1979. DOI: 10.1109/PROC.1979.11455.
207:Counting:
Tadeusz Sozanski, Enumeration of weak isomorphism classes of signed graphs, 1980. DOI: 10.1002/jgt.3190040202.
766:Counting:
M. Gordon, John A. Torkington, Enumeration of coloured plane trees with a given type partition, 1980. DOI: 10.1016/0166-218X(80)90041-4.
767:Counting:
Nachum Dershowitz, Shmuel Zaks, Enumerations of ordered trees, 1980. DOI: 10.1016/0012-365X(80)90168-5.
768:Counting:
Nicholas C. Metropolis, P. R. Stein, The Enumeration of Graphical Partitions, 1980. DOI: 10.1016/S0195-6698(80)80048-5.
769:Not Enum:
Marvin H. Solomon, Raphael A. Finkel, A Note on Enumerating Binary Trees, 1980. DOI: 10.1145/322169.322171.
770:Checked: see -> Tsukiyama1980
Shuji Tsukiyama, Isao Shirakawa, Hiroshi Ozaki, Hiromu Ariyoshi, An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset, 1980. DOI: 10.1145/322217.322220.
771:Counting:
H. L. Abbott, A. Liu, Bjarne Toft, The enumeration problem for color critical linear hypergraphs, 1980. DOI: 10.1016/0095-8956(80)90047-7.
772:Counting:
Ira M. Gessel, A Factorization for Formal Laurent Series and Lattice Path Enumeration, 1980. DOI: 10.1016/0097-3165(80)90074-6.
773:Counting:
Victor Klee, Classification and enumeration of minimum (d, 3, 3)-graphs for odd d, 1980. DOI: 10.1016/0095-8956(80)90065-9.
774:Counting:
Edward A. Bertram, Victor K. Wei, Decomposing a Permutation into Two Large Cycles - An Enumeration, 1980. DOI: 10.1137/0601050.
808:Checked: see -> Mattheiss1980
T. H. Mattheiss, Brian K. Schmidt, Computational results on an algorithm for finding all vertices of a polytope, 1980. DOI: 10.1007/BF01588326.
885:Checked: see -> Zaks1980
S. Zaks, Lexicographic generation of ordered trees, 1980. DOI: 10.1016/0304-3975(80)90073-0.
55:Checked: see -> Syso1981
Maciej M. Syslo, An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph, 1981. DOI: 10.1137/0210062.
206:Checked: see -> Knop1981
Jan V. Knop, Wolfgang R. Mueller, Z. Jericevic, Nenad Trinajstic, Computer enumeration and generation of trees and rooted trees, 1981. DOI: 10.1021/ci00030a009.
762:Counting:
Germain Kreweras, Heinrich Niederhausen, Solution of an Enumerative Problem Connected with Lattice Paths, 1981. DOI: 10.1016/S0195-6698(81)80020-0.
763:Counting:
Valery A. Liskovets, Enumeration of nonisomorphic planar maps, 1981. DOI: 10.1002/jgt.3190050110.
764:Checked: see -> Ruskey1981
Frank Ruskey, Listing and Counting Subtrees of a Tree, 1981. DOI: 10.1137/0210011.
765:Counting:
Nachum Dershowitz, Shmuel Zaks, Applied Tree Enumerations, 1981. DOI: 10.1007/3-540-10828-9_62.
900:Checked: see -> Frangakis1981
C.N. Frangakis, A backtracking algorithm to generate all kernels of a directed graph, 1981. DOI: 10.1080/00207168108803264.
760:Checked: see -> Schultz1982
Phillip Schultz, Enumerations of rooted trees with an application to group presentations, 1982. DOI: 10.1016/0012-365X(82)90207-2.
761:Checked: see -> Loizou1982
George Loizou, Peter Thanisch, Enumerating the cycles of a digraph - A new preprocessing strategy, 1982. DOI: 10.1016/0020-0255(82)90023-8.
999:Checked: see -> Abel1982
U. Abel and R. Bicker, Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph, 1982. DOI: 10.1109/tr.1982.5221285.
753:Counting:
Malti Hedge, M. R. Sridharan, Enumeration of hypergraphs, 1983. DOI: 10.1016/0012-365X(83)90040-7.
754:Counting:
C. J. Liu, Yutze Chow, An operator approach to some graph enumeration problems, 1983. DOI: 10.1016/0012-365X(83)90193-0.
755:Checked: see -> Hikita1983
Teruo Hikita, Listing and Counting Subtrees of Equal Size of a Binary Tree, 1983. DOI: 10.1016/0020-0190(83)90046-7.
756:Counting:
Edward A. Bender, E. Rodney Canfield, Enumeration of connected invariant graphs, 1983. DOI: 10.1016/0095-8956(83)90040-0.
757:Counting:
Fred C. Holroyd, Enumeration of acyclic and unicyclic nets with four types of self-duality, 1983. DOI: 10.1002/jgt.3190070214.
759:Checked: see -> Martello1983
Silvano Martello, Algorithm 595 - An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph, 1983. DOI: 10.1145/356022.356030.
205:Checked: see -> Mai1984
Shao-Wen Mai, David J. Evans, A parallel algorithm for the enumeration of the spanning trees of a graph, 1984. DOI: 10.1016/S0167-8191(84)90197-2.
752:Counting:
J. Howard Redfield, Enumeration by frame group and range groups, 1984. DOI: 10.1002/jgt.3190080204.
54:Counting:
Nicholas C. Wormald, Enumeration of cyclically 4-connected cubic graphs, 1985. DOI: 10.1002/jgt.3190090418.
747:Not Enum:
Marek Kubale, Boguslaw Jackowski, A Generalized Implicit Enumeration Algorithm for Graph Coloring, 1985. DOI: 10.1145/3341.3350.
748:Counting:
K. Balasubramanian, Computer-assisted enumeration of walks and self-returning walks on chemical graphs, 1985. DOI: 10.1016/0097-8485(85)80018-8.
749:Checked: see -> Er1985
M. C. Er, Enumerating Ordered Trees Lexicographically, 1985. DOI: 10.1093/comjnl/28.5.538.
750:Checked: see -> Laumond1985
Jean-Paul Laumond, Enumeration of Articulation Pairs of a Planar Graph, 1985. DOI: 10.1016/0020-0190(85)90055-9.
751:Checked: see -> Chiba1985
Norishige Chiba, Takao Nishizeki, Arboricity and Subgraph Listing Algorithms, 1985. DOI: 10.1137/0214017.
204:Counting:
Edward A. Bender, L. Bruce Richmond, Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities, 1986. DOI: 10.1002/jgt.3190100107.
744:Checked: see -> Winter1986
Pawel Winter, An Algorithm for the Enumeration of Spanning Trees, 1986. DOI: 10.1007/BF01939361.
745:Checked: see -> Pallo1986
Jean Marcel Pallo, Enumerating, Ranking and Unranking Binary Trees, 1986. DOI: 10.1093/comjnl/29.2.171.
746:Counting:
Seiya Negami, Enumeration of projective-planar embeddings of graphs, 1986. DOI: 10.1016/0012-365X(86)90217-7.
203:Counting:
Janet Simpson Beissinger, Uri N. Peled, Enumeration of labelled threshold graphs and a theorem of frobenius involving eulerian polynomials, 1987. DOI: 10.1007/BF01788543.
738:Checked: see -> Er1987
M. C. Er, Lexicographic Listing and Ranking of t-Ary Trees, 1987. DOI: 10.1093/comjnl/30.6.569.
739:Counting:
Marie-Pierre Delest, Dominique Gouyou-Beauchamps, Bernard Vauquelin, Enumeration of parallelogram polyominoes with given bond and site perimeter, 1987. DOI: 10.1007/BF01788555.
740:Counting:
Shinsaku Fujita, Description of organic reactions based on imaginary transition structures. 6. Classification and enumeration of two-string reactions with one common node, 1987. DOI: 10.1021/ci00055a002.
741:Counting:
Shinsaku Fujita, Description of organic reactions based on imaginary transition structures. 7. Classification and enumeration of two-string reactions with two or more common nodes, 1987. DOI: 10.1021/ci00055a003.
742:Counting:
M. V. S. Ramanath, T. R. Walsh, Enumeration and generation of a class of regular digraphs, 1987. DOI: 10.1002/jgt.3190110404.
743:Checked: see -> Read1987
Ronald C. Read, Guanzhang Hu, On the construction and enumeration of minimal blocks, 1987. DOI: 10.1002/jgt.3190110412.
736:Counting:
Zdenek Slanina, Chemical graphs enumeration and chemical reactivity - thermodynamic and kinetic considerations, 1988. DOI: 10.1016/0166-218X(88)90024-8.
737:Counting:
Les R. Foulds, Robert W. Robinson, Enumerating phylogenetic trees with multiple labels, 1988. DOI: 10.1016/0012-365X(88)90201-4.
202:Counting:
Allen J. Schwenk, Enumeration of Hamiltonian cycles in certain generalized Petersen graphs, 1989. DOI: 10.1016/0095-8956(89)90064-6.
730:Counting:
Ivan N. Soskov, Computability by means of effectively definable schemes and definability via enumerations, 1990. DOI: 10.1007/BF01621094.
731:Not Enum:
Koichi Kondo, Collision avoidance by free space enumeration based on heuristic graph search, 1990. DOI: 10.1163/156855391X00214.
732:Counting:
Iwao Sato, Enumeration of packed graphs, 1990. DOI: 10.1016/0012-365X(90)90211-Y.
733:Counting:
Brendan D. McKay, Nicholas C. Wormald, Asymptotic Enumeration by Degree Sequence of Graphs of High Degree, 1990. DOI: 10.1016/S0195-6698(13)80042-X.
201:Checked: see -> Rosen1991
J. Ben Rosen, Shangzhi Sun, Guoliang Xue, Algorithms for the quickest path problem and the enumeration of quickest paths, 1991. DOI: 10.1016/0305-0548(91)90063-W.
726:Counting:
Brendan D. McKay, Nicholas C. Wormald, Asymptotic enumeration by degree sequence of graphs with degress o(n1/2), 1991. DOI: 10.1007/BF01275671.
721:Counting:
Alistair H. Lachlan, Richard A. Shore, Then-rea enumeration degrees are dense, 1992. DOI: 10.1007/BF01794984.
725:Not Enum:
Irith Pomeranz, Sudhakar M. Reddy, An efficient non-enumerative method to estimate path delay fault coverage, 1992. DOI: 10.1109/ICCAD.1992.279312.
816:Counting:
Xiaoji Wang, Asymptotic enumeration of Eulerian digraphs with multiple edges, 1992.
714:Counting:
Jean Conan, Gérald E. Séguin, Structural Properties and Enumeration of Quasi Cyclic Codes, 1993. DOI: 10.1007/BF01270398.
715:Checked: see -> Babic1993
Darko Babic, Ante Graovac, Enumeration of Acyclic Walks in a Graph, 1993. DOI: 10.1016/0166-218X(93)90055-S.
716:Counting:
M. D. Atkinson, Louise Walker, Enumerating k-Way Trees, 1993. DOI: 10.1016/0020-0190(93)90180-H.
717:Counting:
Kenneth R. Vollmar, Yanjun Zhang, On the Enumeration of Steiner-Tree Topologies for the Points on a Circle, 1993. DOI: 10.1137/0406026.
718:Counting:
Robert L. Ward, Weight enumerators of more irreducible cyclic binary codes, 1993. DOI: 10.1109/18.259661.
198:Checked: see -> Gen-Huey1994
Gen-Huey Chen, Yung-Chen Hung, Algorithms for the constrained quickest path problem and the enumeration of quickest paths, 1994. DOI: 10.1016/0305-0548(94)90045-0.
199:Counting:
Shinsaku Fujita, Unit subduced cycle indices for combinatorial enumeration, 1994. DOI: 10.1002/jgt.3190180407.
708:Counting:
Jin Ho Kwak, Jaeun Lee, Enumeration of graph embeddings, 1994. DOI: 10.1016/0012-365X(93)E0075-F.
709:Checked: see -> Bapiraju1994
Bapiraju Vinnakota, V. V. Bapeswara Rao, Enumeration of Binary Trees, 1994. DOI: 10.1016/0020-0190(94)00083-2.
711:Checked: see -> Szwarcfiter1994
Jayme Luiz Szwarcfiter, Guy Chaty, Enumerating the Kernels of a Directed Graph with no Odd Circuits, 1994. DOI: 10.1016/0020-0190(94)00072-7.
713:Counting:
Sylvain Petitjean, On the Enumerative Geometry of Aspect Graphs, 1994. DOI: 10.1007/3-540-57956-7_45.
901:Checked: see -> Korsh1994
James F. Korsh, Loopless generation of k-ary tree sequences, 1994. DOI: 10.1016/0020-0190(94)00149-9.
193:Counting:
Ira M. Gessel, Bruce E. Sagan, Yeong-Nan Yeh, Enumeration of trees by inversions, 1995. DOI: 10.1002/jgt.3190190402.
194:Counting:
Daniel J. Kleitman, Fernando R. Lasaga, Lenore J. Cowen, Asymptotic enumeration of full graphs, 1995. DOI: 10.1002/jgt.3190200106.
195:Checked: see -> Kapoor1995
Sanjiv Kapoor, H. Ramesh, Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs, 1995. DOI: 10.1137/S009753979225030X.
196:Checked: see -> Matsui1996b
Yasuko Matsui, Tomomi Matsui, Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs, 1995. DOI: 10.1007/3-540-61576-8_69.
197:Checked: see -> Hariharan1995
Ramesh Hariharan, Sanjiv Kapoor, Vijay Kumar, Faster Enumeration of All Spanning Trees of a Directed Graph, 1995. DOI: 10.1007/3-540-60220-8_82.
695:Counting:
Andreas Schlüter, A theory of rules for enumerated classes of functions, 1995. DOI: 10.1007/BF01269876.
698:Counting:
Charles J. Colbourn, J. Scott Provan, Dirk Vertigan, A New Approach to Solving Three Combinatorial Enumeration Problems on Planar Graphs, 1995. DOI: 10.1016/0166-218X(95)E0111-3.
699:Counting:
Uri N. Peled, Feng Sun, Enumeration of Difference Graphs, 1995. DOI: 10.1016/0166-218X(94)00061-H.
700:Counting:
Ira M. Gessel, Enumerative applications of a decomposition for graphs and digraphs, 1995. DOI: 10.1016/0012-365X(94)00135-6.
704:Counting:
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani, A Construction for Enumerating k-coloured Motzkin Paths, 1995. DOI: 10.1007/BFb0030840.
188:Unavailable (other language or can not get the file):
Dragos Radu Popescu, Une méthode d'énumération des cycles négatifs d'un graphe signé, 1996. DOI: 10.1016/0012-365X(95)00198-6.
189:Counting:
Rainer Schimming, A partition of the Catalan numbers and enumeration of genealogical trees, 1996. DOI: 10.7151/dmgt.1033.
190:Counting:
Jin Ho Kwak, Jaeun Lee, Enumeration of connected graph coverings, 1996. DOI: 10.1002/(SICI)1097-0118(199610)23:2<105::AID-JGT1>3.0.CO;2-X.
191:Checked: see -> DOGRUSOZ1996
Ugur Dogrusöz, M. S. Krishnamoorthy, Enumerating all Cycles of a Planar Graph, 1996. DOI: 10.1080/10637199608915603.
192:Checked: see -> Uno1996
Takeaki Uno, An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph, 1996. DOI: 10.1007/BFb0009492.
686:Checked: see -> Provan1996
J. Scott Provan, Douglas R. Shier, A Paradigm for Listing (s, t)-Cuts in Graphs, 1996. DOI: 10.1007/BF01961544.
690:Counting:
Gilbert Labelle, Pierre Leroux, Enumeration of (uni- or bicolored) plane trees according to their degree distribution, 1996. DOI: 10.1016/S0012-365X(96)83017-2.
691:Counting:
Taojun Lu, The enumeration of trees with and without given limbs, 1996. DOI: 10.1016/0012-365X(95)00041-T.
1005:Checked: see -> Provan1996
J. S. Provan and D. R. Shier, A paradigm for listing (s, t)-cuts in graphs, 1996. DOI: 10.1007/bf01961544.
186:Counting:
Jim Pitman, Enumerations of trees and forests related to branching processes and random walks, 1997.
677:Checked: see -> Xiang1997
Limin Xiang, Changjie Tang, Kazuo Ushijima, Grammar-Oriented Enumeration of Binary Trees, 1997. DOI: 10.1093/comjnl/40.5.278.
678:Counting:
Hirobumi Mizuno, Iwao Sato, Enumeration of finite field labels on graphs, 1997. DOI: 10.1016/S0012-365X(96)00296-8.
679:Counting:
Miklós Bóna, Exact Enumeration of 1342-Avoiding Permutations - A Close Link with Labeled Trees and Planar Maps, 1997. DOI: 10.1006/jcta.1997.2800.
680:Counting:
Mihai Ciucu, Enumeration of Perfect Matchings in Graphs with Reflective Symmetry, 1997. DOI: 10.1006/jcta.1996.2725.
682:Checked: see -> Shen1997
Hong Shen, Weifa Liang, Efficient Enumeration of all Minimal Separators in a Graph, 1997. DOI: 10.1016/S0304-3975(97)83809-1.
685:Checked: see -> Uno1997
Takeaki Uno, Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs, 1997. DOI: 10.1007/3-540-63890-3_11.
665:Counting:
Brendan D. McKay, Robert W. Robinson, Asymptotic Enumeration of Eulerian Circuits in the Complete Graph, 1998.
667:Counting:
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani, A methodology for plane tree enumeration, 1998. DOI: 10.1016/S0012-365X(97)00122-2.
668:Counting:
Chiê Nara, Shinsei Tazawa, Enumeration of unlabelled graphs with specified degree parities, 1998. DOI: 10.1016/S0012-365X(97)00058-7.
669:Counting:
Marc Noy, Enumeration of noncrossing trees on a circle, 1998. DOI: 10.1016/S0012-365X(97)00121-0.
670:Counting:
Stanley M. Selkow, The enumeration of labeled graphs by number of cutpoints, 1998. DOI: 10.1016/S0012-365X(97)00170-2.
671:Counting:
Frank K. Hwang, Gerard J. Chang, Enumerating Consecutive and Nested Partitions for Graphs, 1998. DOI: 10.1006/eujc.1997.0145.
672:Checked: see -> Kloks1998
Ton Kloks, Dieter Kratsch, Listing All Minimal Separators of a Graph, 1998. DOI: 10.1137/S009753979427087X.
183:Counting:
Bruce P. Mull, Enumerating the orientable 2-cell imbeddings of complete bipartite graphs, 1999. DOI: 10.1002/(SICI)1097-0118(199902)30:2<77::AID-JGT2>3.0.CO;2-W.
656:Counting:
Emeric Deutsch, Dyck path enumeration, 1999. DOI: 10.1016/S0012-365X(98)00371-9.
657:Counting:
Venkatesan Guruswami, Enumerative aspects of certain subclasses of perfect graphs, 1999. DOI: 10.1016/S0012-365X(99)00022-9.
661:Counting:
William Y. C. Chen, James D. Louck, Enumeration of Cubic Graphs by Inclusion-Exclusion, 1999. DOI: 10.1006/jcta.1998.2923.
662:Counting:
Mihai Ciucu, The Equivalence between Enumerating Cyclically Symmetric, Self-Complementary and Totally Symmetric, Self-Complementary Plane Partitions, 1999. DOI: 10.1006/jcta.1998.2922.
663:Counting:
Oleg Pikhurko, Enumeration of Labelled (k, m)-Trees, 1999. DOI: 10.1006/jcta.1998.2916.
52:Duplication:
Vincent Bouchitté, Ioan Todinca, Listing All Potential Maximal Cliques of a Graph, 2000. DOI: 10.1007/3-540-46541-3_42.
182:Checked: see -> Kapoor2000
Sanjiv Kapoor, H. Ramesh, An Algorithm for Enumerating All Spanning Trees of a Directed Graph, 2000. DOI: 10.1007/s004530010008.
648:Counting:
Ivan N. Soskov, A jump inversion theorem for the enumeration jump, 2000. DOI: 10.1007/s001530050156.
649:Counting:
Valery A. Liskovets, Reinhard Pöschel, Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems, 2000. DOI: 10.1016/S0012-365X(99)00139-9.
650:Checked: see -> VanBaronaigien2000
Dominique Roelants van Baronaigien, A Loopless Gray-Code Algorithm for Listing k-ary Trees, 2000. DOI: 10.1006/jagm.1999.1073.
653:Checked: see -> HeejongSuh2000
Heejong Suh, Carl K. Chang, Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition, 2000. DOI: 10.1109/LCN.2000.891015.
180:Checked: see -> Koch2001
Ina Koch, Enumerating all connected maximal common subgraphs in two graphs, 2001. DOI: 10.1016/S0304-3975(00)00286-3.
640:Checked: see -> Dumitrescu2001
Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl, Enumerating triangulation paths, 2001. DOI: 10.1016/S0925-7721(01)00031-1.
643:Counting:
Toru Ishihara, Enumeration of Hypergraphs, 2001. DOI: 10.1006/eujc.2001.0498.
644:Counting:
Cédric Chauve, Serge Dulucq, Andrew Rechnitzer, Enumerating Alternating Trees, 2001. DOI: 10.1006/jcta.2000.3121.
645:Counting:
Nicholas Pippenger, Enumeration of Equicolorable Trees, 2001. DOI: 10.1137/S0895480100368463.
647:Checked: see -> Chandran2001
L. Sunil Chandran, A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph, 2001. DOI: 10.1007/3-540-44679-6_34.
51:Checked: see -> Bouchitte2002
Vincent Bouchitté, Ioan Todinca, Listing all potential maximal cliques of a graph, 2002. DOI: 10.1016/S0304-3975(01)00007-X.
635:Counting:
Brendan D. McKay, Ian M. Wanless, Nicholas C. Wormald, Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree, 2002. DOI: 10.1017/S0963548302005229.
636:Counting:
Brian Alspach, Marni Mishna, Enumeration of Cayley graphs and digraph, 2002. DOI: 10.1016/S0012-365X(02)00319-9.
637:Counting:
Yan Liu, Jianxiu Hao, The enumeration of near-perfect matchings of factor-critical graphs, 2002. DOI: 10.1016/S0012-365X(01)00204-7.
175:Counting:
Bertran Steinsky, Enumeration of labelled chain graphs and labelled essential directed acyclic graphs, 2003. DOI: 10.1016/S0012-365X(02)00838-5.
176:Counting:
Robert Castelo, Nicholas C. Wormald, Enumeration of P 4-Free Chordal Graphs, 2003. DOI: 10.1007/s00373-002-0513-9.
620:Checked: see -> Aringhieri2003
Roberto Aringhieri, Pierre Hansen, Federico Malucelli, Chemical trees enumeration algorithms, 2003. DOI: 10.1007/s10288-002-0008-9.
622:Counting:
Evan J. Griffiths, Limit lemmas and jump inversion in the enumeration degrees, 2003. DOI: 10.1007/s00153-002-0161-z.
624:Counting:
Curtis Coker, Enumerating a class of lattice paths, 2003. DOI: 10.1016/S0012-365X(03)00037-2.
628:Counting:
Jeremy L. Martin, Victor Reiner, Factorizations of some weighted spanning tree enumerators, 2003. DOI: 10.1016/j.jcta.2003.08.003.
629:Counting:
Boris Pittel, Nicholas C. Wormald, Asymptotic enumeration of sparse graphs with a minimum degree constraint, 2003. DOI: 10.1016/S0097-3165(02)00017-1.
630:Counting:
Andreas Weiermann, An application of graphical enumeration to PA*, 2003. DOI: 10.1017/S0022481200008896.
174:Checked: see -> Makino2004
Kazuhisa Makino, Takeaki Uno, New Algorithms for Enumerating All Maximal Cliques, 2004. DOI: 10.1007/978-3-540-27810-8_23.
609:Counting:
A. L. Perezhogin, On cyclic <m,n>-enumerations, 2004. DOI: 10.1016/S0166-218X(02)00307-4.
611:Counting:
Willem H. Haemers, Edward Spence, Enumeration of cospectral graphs, 2004. DOI: 10.1016/S0195-6698(03)00100-8.
613:Counting:
V. M. Kharlamov, S. Yu. Orevkov, The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves, 2004. DOI: 10.1016/j.jcta.2003.10.007.
614:Counting:
Gilbert Labelle, Cédric Lamathe, Pierre Leroux, Labelled and unlabelled enumeration of k-gonal 2-trees, 2004. DOI: 10.1016/j.jcta.2004.01.009.
615:Checked: see -> Byskov2004
Jesper Makholm Byskov, Enumerating maximal independent sets with applications to graph colouring, 2004. DOI: 10.1016/j.orl.2004.03.002.
617:Checked: see -> Boros2004b
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems, 2004. DOI: 10.1007/978-3-540-25960-2_12.
592:Counting:
Russell Lyons, Asymptotic Enumeration of Spanning Trees, 2005. DOI: 10.1017/S096354830500684X.
605:Checked: see -> Schank2005
Thomas Schank, Dorothea Wagner, Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study, 2005. DOI: 10.1007/11427186_54.
168:Checked: see -> Du2009
Nan Du, Bin Wu, Liutong Xu, Bai Wang, Xin Pei, A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network, 2006. DOI: 10.1109/ICDMW.2006.17.
169:Checked: see -> Kiyomi2006a
Masashi Kiyomi, Shuji Kijima, Takeaki Uno, Listing Chordal Graphs and Interval Graphs, 2006. DOI: 10.1007/11917496_7.
574:Counting:
Roland Sh. Omanadze, Andrea Sorbi, Strong Enumeration Reducibilities, 2006. DOI: 10.1007/s00153-006-0012-4.
575:Counting:
Boris Solon, C-Quasi-Minimal enumeration degrees below c', 2006. DOI: 10.1007/s00153-005-0318-7.
576:Counting:
Weigen Yan, Fuji Zhang, Enumeration of perfect matchings of a type of Cartesian products of graphs, 2006. DOI: 10.1016/j.dam.2005.07.001.
577:Checked: see -> Mazoit2006
Frédéric Mazoit, Listing all the minimal separators of a 3-connected planar graph, 2006. DOI: 10.1016/j.disc.2005.12.007.
579:Not Enum:
Martin Grüttmüller, Enumeration of Super-simple Cyclic Block Designs of Small Order, 2006. DOI: 10.1016/j.endm.2006.08.048.
581:Not Enum:
Weigen Yan, Yeong-Nan Yeh, Enumeration of subtrees of trees, 2006. DOI: 10.1016/j.tcs.2006.09.002.
583:Checked: see -> Khachiyan2006a
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Enumerating Spanning and Connected Subsets in Graphs and Matroids, 2006. DOI: 10.1007/11841036_41.
585:Checked: see -> Fernau2006
Henning Fernau, edge dominating set - Efficient Enumeration-Based Exact Algorithms, 2006. DOI: 10.1007/11847250_13.
160:Checked: see -> Aichholzer2007
Oswin Aichholzer, Franz Aurenhammer, Clemens Huemer, Birgit Vogtenhuber, Gray Code Enumeration of Plane Straight-Line Graphs, 2007. DOI: 10.1007/s00373-007-0750-z.
161:Counting:
Goran Kilibarda, Enumeration of Unlabelled Mating Graphs, 2007. DOI: 10.1007/s00373-007-0692-5.
162:Checked: see -> Bulo2007
Samuel Rota Bulò, Andrea Torsello, Marcello Pelillo, A Continuous-Based Approach for Partial Clique Enumeration, 2007. DOI: 10.1007/978-3-540-72903-7_6.
551:Counting:
Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske, Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs, 2007.
552:Counting:
Miklós Bóna, Hyeong-Kwan Ju, Ruriko Yoshida, On the enumeration of certain weighted graphs, 2007. DOI: 10.1016/j.dam.2007.04.001.
553:Checked: see -> Khachiyan2007
Leonid Khachiyan, Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Enumerating disjunctions and conjunctions of paths and cuts in reliability theory, 2007. DOI: 10.1016/j.dam.2006.04.032.
555:Counting:
Manuel Bodirsky, Omer Giménez, Mihyun Kang, Marc Noy, Enumeration and limit laws for series-parallel graphs, 2007. DOI: 10.1016/j.ejc.2007.04.011.
557:Counting:
Jan Kyncl, Enumeration of simple complete topological graphs, 2007. DOI: 10.1016/j.endm.2007.07.051.
989:Checked: see -> Khachiyan2008a
Leonid Khachiyan and Endre Boros and Konrad Borys and Khaled Elbassioni and Vladimir Gurvich and Kazuhisa Makino, Generating Cut Conjunctions in Graphs and Related~Problems, 2007. DOI: 10.1007/s00453-007-9111-9.
159:Checked: see -> Pan2008
Long Pan, Eunice E. Santos, An anytime-anywhere approach for maximal clique enumeration in social network analysis, 2008. DOI: 10.1109/ICSMC.2008.4811845.
545:Checked: see -> Matsui2008
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno, Enumeration of Perfect Sequences of Chordal Graph, 2008. DOI: 10.1007/978-3-540-92182-0_75.
1060:Checked: see -> Fomin2008
Fedor V. Fomin and Fabrizio Grandoni and Artem V. Pyatkin and Alexey A. Stepanov, Combinatorial bounds via measure and conquer, 2008. DOI: 10.1145/1435375.1435384.
3:Checked: see -> Ito2009
Hiro Ito, Kazuo Iwama, Enumeration of isolated cliques and pseudo-cliques, 2009. DOI: 10.1145/1597036.1597044.
142:Checked: see -> Gely2009
Alain Gély, Lhouari Nourine, Bachir Sadi, Enumeration aspects of maximal cliques and bicliques, 2009. DOI: 10.1016/j.dam.2008.10.010.
147:Checked: see -> Schmidt2009
Matthew C. Schmidt, Nagiza F. Samatova, Kevin Thomas, Byung-Hoon Park, A scalable, parallel algorithm for maximal clique enumeration, 2009. DOI: 10.1016/j.jpdc.2009.01.003.
148:Checked: see -> Huffner2009
Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier, Isolation concepts for clique enumeration - Comparison and computational experiments, 2009. DOI: 10.1016/j.tcs.2009.05.008.
506:Checked: see -> Nutov2009
Zeev Nutov, Listing minimal edge-covers of intersecting families with applications to connectivity problems, 2009. DOI: 10.1016/j.dam.2008.04.026.
507:Checked: see -> Katoh2009a
Naoki Katoh, Shin-ichi Tanigawa, Fast Enumeration Algorithms for Non-crossing Geometric Graphs, 2009. DOI: 10.1007/s00454-009-9164-4.
510:Counting:
Elmar Teufl, Stephan G. Wagner, Exact and asymptotic enumeration of perfect matchings in self-similar graphs, 2009. DOI: 10.1016/j.disc.2009.07.009.
511:Counting:
Elmar Teufl, Stephan G. Wagner, Asymptotic enumeration on self-similar graphs with two boundary vertices, 2009.
517:Checked: see -> Komusiewicz2009
Christian Komusiewicz, Falk Hüffner, Hannes Moser, Rolf Niedermeier, Isolation concepts for efficiently enumerating dense subgraphs, 2009. DOI: 10.1016/j.tcs.2009.04.021.
523:Checked: see -> Wang2009
Jianxin Wang, Beiwei Chen, Qilong Feng, Jianer Chen, An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set, 2009. DOI: 10.1007/978-3-642-02270-8_25.
524:Counting:
Chung-Li Wang, Shu Lin, Marc P. C. Fossorier, On Asymptotic Ensemble Weight Enumerators of Multi-Edge Type Codes, 2009. DOI: 10.1109/GLOCOM.2009.5425440.
531:Checked: see -> Yamanaka2009a
Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano, Efficient Enumeration of Ordered Trees with kLeaves (Extended Abstract), 2009. DOI: 10.1007/978-3-642-00202-1_13.
533:Counting:
E. Rodney Canfield, Zhicheng Gao, Catherine S. Greenhill, Brendan D. McKay, Robert W. Robinson, Asymptotic enumeration of correlation-immune boolean functions, 2009.
1061:Checked: see -> Gely2009
Alain G{\'{e}}ly and Lhouari Nourine and Bachir Sadi, Enumeration aspects of maximal cliques and bicliques, 2009. DOI: 10.1016/j.dam.2008.10.010.
39:Checked: see -> Eppstein2010
David Eppstein, Maarten Löffler, Darren Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, 2010. DOI: 10.1007/978-3-642-17517-6_36.
40:Duplication:
David Eppstein, Maarten Löffler, Darren Strash, Listing all maximal cliques in sparse graphs in near-optimal time, 2010.
41:Duplication:
David Eppstein, Maarten Löffler, Darren Strash, Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time, 2010.
133:Checked: see -> Uno2008a
Takeaki Uno, An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem, 2010. DOI: 10.1007/s00453-008-9238-3.
135:Checked: see -> Yamada2010
Takeo Yamada, Seiji Kataoka, Kohtaro Watanabe, Listing all the minimum spanning trees in an undirected graph, 2010. DOI: 10.1080/00207160903329699.
138:Checked: see -> Kijima2010
Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno, On listing, sampling, and counting the chordal graphs with edge constraints, 2010. DOI: 10.1016/j.tcs.2010.03.024.
140:Checked: see -> Bauer2010a
Reinhard Bauer, Marcus Krug, Dorothea Wagner, Enumerating and Generating Labeled k-degenerate Graphs, 2010. DOI: 10.1137/1.9781611973006.12.
483:Counting:
Peter J. Cameron, Thomas Prellberg, Dudley Stark, Asymptotic enumeration of 2-covers and line graphs, 2010. DOI: 10.1016/j.disc.2008.09.008.
488:Checked: see -> Matsui2010
Yasuko Matsui, Ryuhei Uehara, Takeaki Uno, Enumeration of the perfect sequences of a chordal graph, 2010. DOI: 10.1016/j.tcs.2010.06.007.
490:Checked: see -> Zhuang2010b
Bingbing Zhuang, Hiroshi Nagamochi, Enumerating Rooted Graphs with Reflectional Block Structures, 2010. DOI: 10.1007/978-3-642-13073-1_6.
491:Checked: see -> Zhuang2010
Bingbing Zhuang, Hiroshi Nagamochi, Listing Triconnected Rooted Plane Graphs, 2010. DOI: 10.1007/978-3-642-17461-2_28.
986:Counting:
Alen Orbanic, Marko Petkovsek, Tomaz Pisanski, Primoz Potocnik, A note on enumeration of one-vertex maps, 2010. DOI: 10.26493/1855-3974.95.a7b.
36:Duplication:
David Eppstein, Darren Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, 2011.
125:Counting:
Weigen Yan, Fuji Zhang, Enumeration of spanning trees of graphs with rotational symmetry, 2011. DOI: 10.1016/j.jcta.2010.12.007.
127:Checked: see -> Ferreira2011
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs, 2011. DOI: 10.1007/978-3-642-23719-5_24.
457:Counting:
Richard P. Stanley, Two enumerative results on cycles of permutations, 2011. DOI: 10.1016/j.ejc.2011.01.011.
461:Not Enum:
Guillaume Chapuy, Éric Fusy, Omer Giménez, Bojan Mohar, Marc Noy, Asymptotic enumeration and limit laws for graphs of fixed genus, 2011. DOI: 10.1016/j.jcta.2010.11.014.
418:Counting:
Charles M. Harris, Badness and jump inversion in the enumeration degrees, 2012. DOI: 10.1007/s00153-012-0268-9.
434:Checked: see -> Saitoh2010b
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, Ryuhei Uehara, Random generation and enumeration of bipartite permutation graphs, 2012. DOI: 10.1016/j.jda.2011.11.001.
438:Checked: see -> Acuna2012
Vicente Acuña, Etienne Birmelé, Ludovic Cottret, Pierluigi Crescenzi, Fabien Jourdan, Vincent Lacroix, Alberto Marchetti-Spaccamela, Andrea Marino, Paulo Vieira Milreu, Marie-France Sagot, Leen Stougie, Telling stories - Enumerating maximal directed acyclic graphs with a constrained set of sources and targets, 2012. DOI: 10.1016/j.tcs.2012.07.023.
441:Checked: see -> Wasa2012b
Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno, Hiroki Arimura, Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application, 2012. DOI: 10.1007/978-3-642-32241-9_30.
445:Checked: see -> Kante2012
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets, 2012. DOI: 10.1007/978-3-642-35261-4_32.
449:Duplication:
Jean-François Couturier, Pinar Heggernes, Pim van't Hof, Dieter Kratsch, Minimal Dominating Sets in Graph Classes - Combinatorial Bounds and Enumeration, 2012. DOI: 10.1007/978-3-642-27660-6_17.
450:Checked: see -> Birmele2012
Etienne Birmelé, Pierluigi Crescenzi, Rui A. Ferreira, Roberto Grossi, Vincent Lacroix, Andrea Marino, Nadia Pisanti, Gustavo Akio Tominaga Sacomoto, Marie-France Sagot, Efficient Bubble Enumeration in Directed Graphs, 2012. DOI: 10.1007/978-3-642-34109-0_13.
28:Checked: see -> Chang2013
Lijun Chang, Jeffrey Xu Yu, Lu Qin, Fast Maximal Cliques Enumeration in Sparse Graphs, 2013. DOI: 10.1007/s00453-012-9632-8.
31:Checked: see -> Ferreira2012
Etienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto, Optimal Listing of Cycles and st-Paths in Undirected Graphs, 2013. DOI: 10.1137/1.9781611973105.134.
108:Checked: see -> Hoang2013
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan, Finding and listing induced paths and cycles, 2013. DOI: 10.1016/j.dam.2012.01.024.
110:Not Enum:
Omer Giménez, Marc Noy, Juan José Rué, Graph classes with given 3-connected components - Asymptotic enumeration and random graphs, 2013. DOI: 10.1002/rsa.20421.
111:Checked: see -> Henry2013
Christopher J. Henry, Sheela Ramanna, Maximal Clique Enumeration in Finding Near Neighbourhoods, 2013. DOI: 10.1007/978-3-642-36505-8_7.
389:Not Enum:
Graeme Kemkes, Cristiane M. Sato, Nicholas C. Wormald, Asymptotic enumeration of sparse 2-connected graphs, 2013. DOI: 10.1002/rsa.20415.
390:Not Enum:
Xavier Pérez-Giménez, Nicholas C. Wormald, Asymptotic enumeration of strongly connected digraphs by vertices and edges, 2013. DOI: 10.1002/rsa.20416.
391:Checked: see -> Couturier2013a
Jean-François Couturier, Pinar Heggernes, Pim van't Hof, Dieter Kratsch, Minimal dominating sets in graph classes - Combinatorial bounds and enumeration, 2013. DOI: 10.1016/j.tcs.2013.03.026.
395:Checked: see -> Krzywkowski2013
Marcin Krzywkowski, An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree, 2013. DOI: 10.1007/978-3-642-38756-2_4.
399:Checked: see -> Golovach2013a
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Yngve Villanger, An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets, 2013. DOI: 10.1007/978-3-642-39206-1_41.
403:Checked: see -> Kante2013
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno, On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs, 2013. DOI: 10.1007/978-3-642-45030-3_32.
410:Checked: see -> Sacomoto2013b
Gustavo Sacomoto, Vincent Lacroix, Marie-France Sagot, 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, 2013. DOI: 10.1007/978-3-642-40453-5_9.
91:Checked: see -> Unoc
Takeaki Uno, Hiroko Satoh, An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths, 2014. DOI: 10.1007/978-3-319-11812-3_27.
92:Checked: see -> Ferreira2014
Rui A. Ferreira, Roberto Grossi, Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Amortized Õ( V ) -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs, 2014. DOI: 10.1007/978-3-662-44777-2_35.
94:Checked: see -> Wasa2014
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph, 2014. DOI: 10.1007/978-3-319-13075-0_8.
102:Arxiv:
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno, Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs, 2014.
103:Arxiv:
Neal Lawton, An Important Corollary for the Fast Solution of Dynamic Maximal Clique Enumeration Problems, 2014.
104:Arxiv:
Nasr Mohamed, Enumeration of Spanning Trees Using Edge Exchange with Minimal Partitioning, 2014.
105:Arxiv:
Francesco Silvestri, Subgraph Enumeration in Massive Graphs, 2014.
106:Arxiv:
Takeaki Uno, Hiroko Satoh, An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths, 2014.
107:Duplication:
Kunihiro Wasa, Hiroki Arimura, Takeaki Uno, Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph, 2014.
342:Checked: see -> Dourado2014
Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti, Algorithmic aspects of Steiner convexity and enumeration of Steiner trees, 2014. DOI: 10.1007/s10479-014-1607-5.
350:Checked: see -> Krzywkowski2014
Marcin Krzywkowski, An Algorithm for Listing all Minimal Double Dominating Sets of a Tree, 2014. DOI: 10.3233/FI-2014-998.
352:Checked: see -> Wild2013
Marcel Wild, Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree, 2014. DOI: 10.1007/s11083-013-9292-6.
367:Arxiv:
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno, A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs, 2014.
368:Arxiv:
Fabio Enrique Brochero Martínez, Carmen Rosa Giraldo Vergara, Weight enumerator of some irreducible cyclic codes, 2014.
369:Arxiv:
Arko Provo Mukherjee, Srikanta Tirthapura, Enumerating Maximal Bicliques from a Large Graph using MapReduce, 2014.
370:Arxiv:
Arne C. Reimers, Leen Stougie, A decomposition theory for vertex enumeration of convex polyhedra, 2014.
371:Arxiv:
Romeo Rizzi, Gustavo Sacomoto, Marie-France Sagot, Efficiently listing bounded length st-paths, 2014.
372:Arxiv:
Long Yu, Hongwei Liu, A class of $p$-ary cyclic codes and their weight enumerators, 2014.
23:Arxiv:
Elisângela Silva Dias, Diane Castonguay, Polynomial enumeration of chordless cycles on cyclically orientable graphs, 2015.
24:Arxiv:
George Manoussakis, Listing all maximal cliques in sparse graphs in optimal time, 2015.
80:Checked: see -> Kante2015
Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno, Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs, 2015. DOI: 10.1007/978-3-319-21840-3_37.
82:Arxiv:
Carlo Comin, Romeo Rizzi, An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication, 2015.
83:Arxiv:
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Enumerating Cyclic Orientations of a Graph, 2015.
84:Arxiv:
Alexander Iriza, Enumeration and Random Generation of Unlabeled Classes of Graphs - A Practical Study of Cycle Pointing and the Dissymmetry Theorem, 2015.
85:Arxiv:
K. Krishna Mohan Reddy, P. Renjith, N. Sadagopan, Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view, 2015.
325:Arxiv:
David Avis, Charles Jordan, Comparative computational results for some vertex and facet enumeration codes, 2015.
326:Arxiv:
David Avis, Charles Jordan, mplrs - A scalable parallel vertex/facet enumeration code, 2015.
327:Arxiv:
David Burstein, Jonathan Rubin, Degree switching and partitioning for enumerating graphs to arbitrary orders of accuracy, 2015.
328:Arxiv:
Manfred Cochefert, Jean-François Couturier, Serge Gaspers, Dieter Kratsch, Faster algorithms to enumerate hypergraph transversals, 2015.
329:Arxiv:
David Dureisseix, An example of geometric origami design with benefit of graph enumeration algorithms, 2015.
330:Arxiv:
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Sigve Hortemo Sæther, Yngve Villanger, Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width, 2015.
331:Arxiv:
Yves Métivier, John Michael Robson, Akka Zemmari, A Distributed Enumeration Algorithm and Applications to All Pairs Shortest Paths, Diameter, 2015.
332:Arxiv:
Shudi Yang, Zheng-An Yao, The Complete Weight Enumerator of Several Cyclic Codes, 2015.
333:Arxiv:
Yan Zhuang, The Goulden-Jackson cluster method for monoid networks and an application to lattice path enumeration, 2015.
334:Arxiv:
Daniel Zinn, General-Purpose Join Algorithms for Listing Triangles in Large Graphs, 2015.
66:Counting:
James Alexander, Tim Mink, A New Method for Enumerating Independent Sets of a Fixed Size in General Graphs, 2016. DOI: 10.1002/jgt.21861.
71:Checked: see -> Conte2016
Alessio Conte, Roberto Grossi, Andrea Marino, Luca Versari, Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics - Maximal Cliques, 2016. DOI: 10.4230/LIPIcs.ICALP.2016.148.
241:Not Enum:
Stephen Melczer, Marni Mishna, Asymptotic Lattice Path Enumeration Using Diagonals, 2016. DOI: 10.1007/s00453-015-0063-1.
246:Checked: see -> Golovach2015
Petr A. Golovach, Pinar Heggernes, Mamadou Moustapha Kanté, Dieter Kratsch, Yngve Villanger, Enumerating minimal dominating sets in chordal bipartite graphs, 2016. DOI: 10.1016/j.dam.2014.12.010.
8:Checked: see -> Conte2017
Alessio Conte, Mamadou Moustapha Kanté, Yota Otachi, Takeaki Uno, Kunihiro Wasa, Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph, 2017. DOI: 10.1007/978-3-319-62389-4_13.
57:Counting:
Weigen Yan, Enumeration of spanning trees of middle graphs, 2017. DOI: 10.1016/j.amc.2017.02.040.
58:Counting:
Primoz Potocnik, Pablo Spiga, Gabriel Verret, Asymptotic enumeration of vertex-transitive graphs of fixed valency, 2017. DOI: 10.1016/j.jctb.2016.06.002.
60:Arxiv:
Ian F. Blake, Shu Lin, On short cycle enumeration in biregular bipartite graphs, 2017.
61:Arxiv:
Kazuhiro Kurita, Kunihiro Wasa, Takeaki Uno, Hiroki Arimura, Efficient Enumeration of Induced Matchings in a Graph without Cycles with Length Four, 2017.
62:Arxiv:
Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang, Enumerating k-Vertex Connected Components in Large Graphs, 2017.
214:Counting:
Suhyung An, JiYoon Jung, Sangwook Kim, Enumeration of Fuss-Schröder paths, 2017.
228:Counting:
Di Xiao, Yi Cui, Daren B. H. Cline, Dmitri Loguinov, On Asymptotic Cost of Triangle Listing in Random Graphs, 2017. DOI: 10.1145/3034786.3034790.
233:Arxiv:
Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner, Asymptotic Enumeration of Compacted Binary Trees, 2017.
814:Counting:
Marc Noy, Clément Requilé, Juanjo Rué, Enumeration of labeled 4-regular planar graphs, 2017. DOI: 10.1016/j.endm.2017.07.056.
828:Arxiv:
Stephen Melczer, Analytic Combinatorics in Several Variables - Effective Asymptotics and Lattice Path Enumeration, 2017.
829:Arxiv:
Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Enumeration on Trees under Relabelings, 2017.
830:Arxiv:
Wim Martens, Tina Trautner, Enumeration Problems for Regular Path Queries, 2017.
831:Arxiv:
M. Ammar Ben Khadra, E3Solver - decision tree unification by enumeration, 2017.
833:Arxiv:
Maryam Bahrani, Jérémie Lumbroso, Split-Decomposition Trees with Prime Nodes - Enumeration and Random Generation of Cactus Graphs, 2017.
837:Counting:
Yan Zhuang, A generalized Goulden-Jackson cluster method and lattice path enumeration, 2018. DOI: 10.1016/j.disc.2017.09.004.
858:Counting:
Anuradha Sharma, Taranjot Kaur, Enumeration formulae for self-dual, self-orthogonal and complementary-dual quasi-cyclic codes over finite fields, 2018. DOI: 10.1007/s12095-017-0228-7.
904:Counting:
Andrei Asinowski, Axel Bacher, Cyril Banderier, Bernhard Gittenberger, Analytic Combinatorics of Lattice Paths with Forbidden Patterns - Enumerative Aspects, 2018. DOI: 10.1007/978-3-319-77313-1_15.
934:Checked: see -> Conte2018
Alessio Conte, Roberto Grossi, Andrea Marino, Romeo Rizzi, Efficient enumeration of graph orientations with sources, 2018. DOI: 10.1016/j.dam.2017.08.002.
974:Counting:
Jian-Bing Liu, Jaeun Lee, Jin Ho Kwak, Enumerating regular graph coverings whose covering transformation groups are ℤ2-extensions of a cyclic group, 2018. DOI: 10.26493/1855-3974.1419.3e9.
971:Counting:
Haya S. Aldosari, Catherine S. Greenhill, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, 2019. DOI: 10.1016/j.ejc.2018.11.002.
978:Counting:
Yansheng Wu, Qin Yue, Xiaomeng Zhu, Shudi Yang, Weight enumerators of reducible cyclic codes and their dual codes, 2019. DOI: 10.1016/j.disc.2018.10.035.
981:Checked: see -> Komusiewicz2019
Christian Komusiewicz, Frank Sommer, Enumerating Connected Induced Subgraphs - Improved Delay and Experimental Comparison, 2019. DOI: 10.1007/978-3-030-10801-4_22.
994:Checked: see -> Bonamy2019
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond, Enumerating Minimal Dominating Sets in Triangle-Free Graphs, 2019. DOI: 10.4230/LIPIcs.STACS.2019.16.
1049:Checked: see -> Conte2019
Alessio Conte, Takeaki Uno, New polynomial delay bounds for maximal subgraph enumeration by proximity search, 2019. DOI: 10.1145/3313276.3316402.
1094:Not Enum:
, Wei Li, Zhongmei Qin, Yao Wang, Enumeration of permanental sums of lattice graphs, 2020. DOI: 10.1016/j.amc.2019.124914.
1095:Not Enum:
, Yuan Cao 0001, Yonglin Cao, Hai Q. Dinh, Fang-Wei Fu, Fanghui Ma, Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m, 2020. DOI: 10.1016/j.ffa.2019.101598.
1096:Not Enum:
, Antoine Genitrini, Bernhard Gittenberger, Manuel Kauers, Michael Wallner, Asymptotic enumeration of compacted binary trees of bounded right height, 2020. DOI: 10.1016/j.jcta.2019.105177.