@article{Abel1982,
author = "Abel, U. and Bicker, R.",
doi = "10.1109/TR.1982.5221285",
issn = "0018-9529",
journal = "IEEE Transactions on Reliability",
keyword = "Algorithm,Cut-set enumeration,Undirected graph",
link = "http://ieeexplore.ieee.org/document/5221285/",
month = "jun",
number = "2",
pages = "167--171",
title = "Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph",
uri = "http://ieeexplore.ieee.org/document/5221285/",
volume = "R-31",
year = "1982",
}
@article{Acuna2012,
author = "Acu\~{n}a, Vicente and Birmel\'{e}, Etienne and Cottret, Ludovic and Crescenzi, Pierluigi and Jourdan, Fabien and Lacroix, Vincent and Marchetti-Spaccamela, Alberto and Marino, Andrea and Milreu, Paulo Vieira and Sagot, Marie-France and Stougie, Leen",
doi = "10.1016/j.tcs.2012.07.023",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Feedback arc set,Maximal DAG,Story arc set",
link = "http://www.sciencedirect.com/science/article/pii/S0304397512007207 http://linkinghub.elsevier.com/retrieve/pii/S0304397512007207",
month = "oct",
number = "0",
pages = "1--9",
title = "Telling Stories: Enumerating Maximal Directed Acyclic Graphs With a Constrained Set of Sources and Targets",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397512007207",
volume = "457",
year = "2012",
}
@article{Aichholzer2007,
author = "Aichholzer, O. and Aurenhammer, F. and Huemer, C. and Vogtenhuber, B.",
doi = "10.1007/s00373-007-0750-z",
issn = "0911-0119",
journal = "Graphs and Combinatorics",
keyword = "Enumeration scheme,Geometric graphs,Gray codes",
link = "http://link.springer.com/10.1007/s00373-007-0750-z",
month = "oct",
number = "5",
pages = "467--479",
title = "Gray Code Enumeration of Plane Straight-Line Graphs",
uri = "http://link.springer.com/10.1007/s00373-007-0750-z",
volume = "23",
year = "2007",
}
@inproceedings{Akiba2013,
address = "New York, New York, USA",
author = "Akiba, Takuya and Iwata, Yoichi and Yoshida, Yuichi",
booktitle = "CIKM 2013: the 22nd ACM international conference on Conference on information \& knowledge management",
doi = "10.1145/2505515.2505751",
isbn = "9781450322638",
keyword = "all or part of,cohesive subgraphs,connectivity,graphs,maximal k -edge-connected subgraph,or,or hard copies of,permission to make digital,random contraction,this work for personal,vertex clusters",
link = "http://dl.acm.org/citation.cfm?id=2505515.2505751 http://dl.acm.org/citation.cfm?doid=2505515.2505751",
month = "oct",
pages = "909--918",
publisher = "ACM Press",
title = "Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction",
uri = "http://dl.acm.org/citation.cfm?id=2505515.2505751",
year = "2013",
}
@article{Akkoyunlu1973,
author = "Akkoyunlu, E. A.",
doi = "10.1137/0202001",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,algorithms,clique,e the set of,edges,enumeration,fig,g,graph,identify completely connected subgraphs,if so is the,introduction,is best formulated in,of an undirected graph,or cliques,set of nodes and,terms,the goal is to,the problem considered here,which are",
link = "http://epubs.siam.org/doi/abs/10.1137/0202001",
month = "mar",
number = "1",
pages = "1--6",
title = "The Enumeration of Maximal Cliques of Large Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/0202001",
volume = "2",
year = "1973",
}
@article{Alon1997,
author = "Alon, N and Yuster, R. and Zwick, U.",
doi = "10.1007/BF02523189",
issn = "0178-4617",
journal = "Algorithmica",
keyword = "1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t",
link = "http://link.springer.com/10.1007/BF02523189",
month = "mar",
number = "3",
pages = "209--223",
title = "Finding and counting given length cycles",
uri = "http://link.springer.com/10.1007/BF02523189",
volume = "17",
year = "1997",
}
@article{Altherr1975,
author = "Altherr, W.",
doi = "10.1007/BF02242366",
issn = "0010-485X",
journal = "Computing",
month = "sep",
number = "3",
pages = "181--193",
title = "An algorithm for enumerating all vertices of a convex polyhedron",
volume = "15",
year = "1975",
}
@article{Aringhieri2003,
author = "Aringhieri, Roberto and Hansen, Pierre and Malucelli, Federico",
doi = "10.1007/s10288-002-0008-9",
issn = "16194500",
journal = "4OR",
keyword = "Exact enumeration problems,applications,enumeration of graphs and maps,generating functions,trees",
link = "http://link.springer.com/10.1007/s10288-002-0008-9",
month = "mar",
number = "1",
pages = "67--83",
title = "Chemical trees enumeration algorithms",
uri = "http://link.springer.com/10.1007/s10288-002-0008-9",
volume = "1",
year = "2003",
}
@article{Avis1996,
author = "Avis, David and Fukuda, Komei",
doi = "10.1016/0166-218X(95)00026-N",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N",
month = "mar",
number = "1-3",
pages = "21--46",
title = "Reverse search for enumeration",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N",
volume = "65",
year = "1996",
}
@article{Avis1996b,
author = "Avis, David",
doi = "10.1007/BF01944353",
issn = "0178-4617",
journal = "Algorithmica",
link = "http://link.springer.com/10.1007/BF01944353",
month = "dec",
number = "6",
pages = "618--632",
title = "Generating Rooted Triangulations Without Repetitions",
uri = "http://link.springer.com/10.1007/BF01944353",
volume = "16",
year = "1996",
}
@article{Azevedo1993,
author = "Azevedo, Jos\'{e}Augusto and {Santos Costa}, Maria Em\'{\i}lia O. and {Silvestre Madeira}, Joaquim Jo\~{a}o E.R. and {Vieira Martins}, Ernesto Q.",
doi = "10.1016/0377-2217(93)90095-5",
issn = "03772217",
journal = "European Journal of Operational Research",
keyword = "labelling algorithms,network,principle of optimality,shortest path",
link = "http://linkinghub.elsevier.com/retrieve/pii/0377221793900955",
month = "aug",
number = "1",
pages = "97--106",
title = "An algorithm for the ranking of shortest paths",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0377221793900955",
volume = "69",
year = "1993",
}
@article{Babic1993,
author = "Babi\'{c}, Darko and Graovac, Ante",
doi = "10.1016/0166-218X(93)90055-S",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0166218X9390055S",
month = "aug",
number = "2",
pages = "117--123",
title = "Enumeration of Acyclic Walks in a Graph",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X9390055S",
volume = "45",
year = "1993",
}
@inproceedings{Bagan2007a,
address = "Lausanne, Switzerland",
author = "Bagan, Guillaume and Durand, Arnaud and Grandjean, Etienne",
booktitle = "CSL 2007: the 21st International Workshop on Computer Science Logic",
doi = "10.1007/978-3-540-74915-8_18",
editor = "Duparc, Jacques and Henzinger, Thomas A.",
isbn = "978-3-540-23024-3",
issn = "0302-9743",
link = "http://link.springer.com/chapter/10.1007/978-3-540-74915-8_18",
month = "sep",
pages = "208--222",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On Acyclic Conjunctive Queries and Constant Delay Enumeration",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-74915-8_18",
volume = "4646",
year = "2007",
}
@article{Balinski1961,
author = "Balinski, M. L.",
doi = "10.1137/0109008",
isbn = "0780382536",
issn = "0368-4245",
journal = "Journal of the Society for Industrial and Applied Mathematics",
link = "http://epubs.siam.org/doi/abs/10.1137/0109008 http://epubs.siam.org/doi/10.1137/0109008",
month = "mar",
number = "1",
pages = "72--88",
title = "An Algorithm for Finding All Vertices of Convex Polyhedral Sets",
uri = "http://epubs.siam.org/doi/abs/10.1137/0109008",
volume = "9",
year = "1961",
}
@article{Bapiraju1994,
author = "Bapiraju, Vinnakota and Rao, V.V.Bapeswara",
doi = "10.1016/0020-0190(94)00083-2",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary tree enumeration,Combinatorial problems",
link = "http://www.sciencedirect.com/science/article/pii/0020019094000832 http://linkinghub.elsevier.com/retrieve/pii/0020019094000832",
month = "aug",
number = "3",
pages = "125--127",
title = "Enumeration of binary trees",
uri = "http://www.sciencedirect.com/science/article/pii/0020019094000832",
volume = "51",
year = "1994",
}
@article{Barbosa1999,
author = "Barbosa, Valmir C. and Szwarcfiter, Jayme L.",
doi = "10.1016/S0020-0190(99)00120-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Acyclic orientations,Algorithms,Graphs",
link = "http://www.sciencedirect.com/science/article/pii/S0020019099001209 http://linkinghub.elsevier.com/retrieve/pii/S0020019099001209",
month = "oct",
number = "1-2",
pages = "71--74",
title = "Generating all the acyclic orientations of an undirected graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0020019099001209",
volume = "72",
year = "1999",
}
@inproceedings{Basavaraju2014,
address = "Nouan-le-Fuzelier, France",
author = "Basavaraju, Manu and Heggernes, Pinar and {van ’t Hof}, Pim and Saei, Reza and Villanger, Yngve",
booktitle = "WG 2014: the 40th International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/978-3-319-12340-0_8",
editor = "Kratsch, Dieter and Todinca, Ioan",
isbn = "9783642114083",
link = "http://link.springer.com/10.1007/978-3-319-12340-0_8",
month = "jun",
pages = "93--104",
publisher = "Springer International Publishing",
series = "Lecture Notes in Computer Science",
title = "Maximal Induced Matchings in Triangle-Free Graphs",
uri = "http://link.springer.com/10.1007/978-3-319-12340-0_8",
volume = "8747",
year = "2014",
}
@inproceedings{Bauer2010a,
address = "Austin, Texas, USA",
author = "Bauer, Reinhard and Krug, M and Wagner, D",
booktitle = "ANALCO 2010: the 7th Workshop on Analytic Algorithmics and Combinatorics",
doi = "10.1137/1.9781611973006.12",
editor = "Sedgewick, Robert and Golin, Mordecai",
isbn = "978-0-89871-933-8",
link = "http://epubs.siam.org/doi/book/10.1137/1.9781611973006",
month = "jan",
pages = "90--98",
publisher = "Society for Industrial and Applied Mathematics",
title = "Enumerating and Generating Labeled k-degenerate Graphs",
uri = "http://epubs.siam.org/doi/book/10.1137/1.9781611973006",
year = "2010",
}
@inproceedings{Beigel1999,
address = "Omni Inner Harbor Hotel, Baltimore, Maryland, USA",
author = "Beigel, Richard",
booktitle = "SODA 1999: the 10th Annual ACM-SIAM Symposium on Discrete Algorithms",
editor = "Tarjan, Robert E. and Warnow, Tandy",
isbn = "0-89871-434-6",
link = "http://dl.acm.org/citation.cfm?id=314500.314969",
month = "jan",
pages = "856--857",
publisher = "Society for Industrial and Applied Mathematics",
title = "Finding maximum independent sets in sparse and general graphs",
uri = "http://dl.acm.org/citation.cfm?id=314500.314969",
year = "1999",
zzzdoi = "MY/Beigel_1999_314500.314969",
}
@article{Bellert1962,
author = "Bellert, S.",
doi = "10.1016/0016-0032(62)90042-X",
issn = "00160032",
journal = "Journal of the Franklin Institute",
month = "dec",
number = "6",
pages = "425--443",
title = "Topological analysis and synthesis of linear systems",
volume = "274",
year = "1962",
}
@inproceedings{Bent1990,
author = "Bent, SW",
booktitle = "SWAT 1990: the 2nd Scandinavian Workshop on Algorithm",
doi = "10.1007/3-540-52846-6_84",
link = "http://link.springer.com/chapter/10.1007/3-540-52846-6_84",
pages = "132--142",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Ranking trees generated by rotations",
uri = "http://link.springer.com/chapter/10.1007/3-540-52846-6_84",
volume = "447",
year = "1990",
}
@article{Bereg2005,
author = "Bereg, Sergey",
doi = "10.1016/j.comgeo.2004.09.002",
issn = "09257721",
journal = "Computational Geometry",
keyword = "Enumeration,Flip,Pseudo-triangulation,Reverse search",
link = "http://www.sciencedirect.com/science/article/pii/S0925772104001105 http://linkinghub.elsevier.com/retrieve/pii/S0925772104001105",
month = "mar",
number = "3",
pages = "207--222",
title = "Enumerating pseudo-triangulations in the plane",
uri = "http://www.sciencedirect.com/science/article/pii/S0925772104001105",
volume = "30",
year = "2005",
}
@article{Berry2000,
author = "Berry, Anne and Bordat, Jean-Paul and Cogis, Olivier",
doi = "10.1142/S0129054100000211",
issn = "0129-0541",
journal = "International Journal of Foundations of Computer Science",
keyword = "Enumeration Algorithm,Graph,Minimal separator,enumeration algorithm,graph,minimal separator",
language = "en",
link = "http://www.worldscientific.com/doi/abs/10.1142/S0129054100000211",
month = "sep",
number = "03",
pages = "397--403",
publisher = "World Scientific Publishing Company",
title = "Generating All the Minimal Separators of a Graph",
uri = "http://www.worldscientific.com/doi/abs/10.1142/S0129054100000211",
volume = "11",
year = "2000",
}
@article{Bespamyatnikh2002,
author = "Bespamyatnikh, Sergei",
doi = "10.1016/S0925-7721(02)00111-6",
issn = "09257721",
journal = "Computational Geometry",
keyword = "enumeration,reverse search,triangulations",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0925772102001116",
month = "nov",
number = "3",
pages = "271--279",
title = "An efficient algorithm for enumeration of triangulations",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0925772102001116",
volume = "23",
year = "2002",
}
@article{Beyer1980,
author = "Beyer, Terry and Hedetniemi, Sandra Mitchell",
doi = "10.1137/0209055",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,3,algorithm,all binary,and all k-ary trees,and wilf,centered on rooted trees,in generating random trees,interest has arisen recently,introduction,lexicographic order,rooted tree generation,that is,the algorithm of nijenhuis,the present work has,those,trees,trees with a designated,vertex as the root",
link = "http://epubs.siam.org/doi/abs/10.1137/0209055",
month = "nov",
number = "4",
pages = "706--712",
title = "Constant Time Generation of Rooted Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0209055",
volume = "9",
year = "1980",
}
@inproceedings{Birmele2012,
address = "Cartagena de Indias, Colombia",
author = "Birmel\'{e}, E and Crescenzi, Pierluigi and Ferreira, Rui",
booktitle = "SPIRE 2012: the 19th International Symposium String Processing and Information Retrieval",
doi = "10.1007/978-3-642-34109-0_13",
editor = "Calder\'{o}n-Benavides, Liliana and Gonz\'{a}lez-Caro, Cristina and Ch\'{a}vez, Edgar and Ziviani, Nivio",
link = "http://link.springer.com/chapter/10.1007/978-3-642-34109-0_13",
month = "oct",
pages = "118--129",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient bubble enumeration in directed graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-34109-0_13",
volume = "7608",
year = "2012",
}
@article{Bitner1976,
author = "Bitner, James R. and Ehrlich, Gideon and Reingold, Edward M.",
doi = "10.1145/360336.360343",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "Gray code,combinations,combinatorial computing,compositions,subsets",
link = "http://dl.acm.org/citation.cfm?id=360336.360343 http://portal.acm.org/citation.cfm?doid=360336.360343",
month = "sep",
number = "9",
pages = "517--521",
publisher = "ACM",
title = "Efficient generation of the binary reflected gray code and its applications",
uri = "http://dl.acm.org/citation.cfm?id=360336.360343",
volume = "19",
year = "1976",
}
@inproceedings{Bonamy2019,
address = "Dagstuhl, Germany",
author = "Bonamy, Marthe and Defrain, Oscar and Heinrich, Marc and Raymond, Jean-Florent",
booktitle = "36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)",
doi = "10.4230/LIPIcs.STACS.2019.16",
editor = "Niedermeier, Rolf and Paul, Christophe",
isbn = "978-3-95977-100-9",
issn = "1868-8969",
pages = "16:1----16:12",
publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "{Enumerating Minimal Dominating Sets in Triangle-Free Graphs}",
volume = "126",
year = "2019",
}
@inproceedings{Borassi2013,
address = "Rome, Italy",
author = "Borassi, Michele and Crescenzi, Pierluigi and Lacroix, Vincent and Marino, Andrea and Sagot, Marie-France and Milreu, Paulo Vieira",
booktitle = "SEA 2013: the 12th International Symposium on Experimental Algorithms",
doi = "10.1007/978-3-642-38527-8_19",
editor = "Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto",
isbn = "9783642385261",
issn = "03029743",
link = "http://link.springer.com/chapter/10.1007/978-3-642-38527-8_19",
month = "jun",
pages = "200--211",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Telling stories fast: Via linear-time delay pitch enumeration",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-38527-8_19",
volume = "7933",
year = "2013",
}
@article{Boros2000a,
author = "Boros, E. and Gurvich, V. and Elbassioni, K. and Khachiyan, L.",
doi = "10.1142/S0129626400000251",
issn = "0129-6264",
journal = "Parallel Processing Letters",
link = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251",
month = "dec",
number = "04",
pages = "253--266",
title = "An Efficient Incremental Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension",
uri = "http://www.worldscientific.com/doi/abs/10.1142/S0129626400000251",
volume = "10",
year = "2000",
}
@inproceedings{Boros2004,
address = "Aires, Argentina",
author = "Boros, Endre and Elbassioni, Khaled",
booktitle = "LATIN 2004: the 6th Latin American Symposium on Theoretical Informatics",
doi = "10.1007/978-3-540-24698-5_52",
editor = "Farach-Colton, Mart\'{\i}n",
link = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52",
month = "apr",
pages = "488--498",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating maximal independent sets for hypergraphs with bounded edge-intersections",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-24698-5_52",
volume = "2976",
year = "2004",
}
@inproceedings{Boros2004a,
address = "Prague, Czech Republic",
author = "Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir",
booktitle = "MFCS 2004: the 29th International Symposium on Mathematical Foundations of Computer Science",
doi = "10.1007/978-3-540-28629-5_21",
editor = "Fiala, Jiř\'{\i} and Koubek, V\'{a}clav and Kratochv\'{\i}l, Jan",
link = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
month = "aug",
number = "Di",
pages = "298--309",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating paths and cuts in multi-pole (di) graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-28629-5_21",
volume = "3153",
year = "2004",
}
@inproceedings{Boros2004b,
address = "New York, NY, USA",
author = "Boros, E and Elbassioni, K and Gurvich, V and Khachiyan, L",
booktitle = "ICCO 2004: the 10th International Conference on Integer Programming and Combinatorial Optimization",
doi = "10.1007/978-3-540-25960-2_12",
editor = "Bienstock, Daniel and Nemhauser, George",
link = "http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12",
month = "jun",
pages = "152--162",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-25960-2_12",
volume = "3064",
year = "2004",
}
@article{Boros2006,
author = "Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir",
doi = "10.1002/jgt.20180",
issn = "03649024",
journal = "Journal of Graph Theory",
keyword = "Bipartite graphs,Blockers,Generation algorithms,Matchable graphs,Perfect matchings",
link = "http://onlinelibrary.wiley.com/doi/10.1002/jgt.20180/abstract",
number = "3",
pages = "209--232",
title = "Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms",
uri = "http://onlinelibrary.wiley.com/doi/10.1002/jgt.20180/abstract",
volume = "53",
year = "2006",
}
@inproceedings{Boros2007,
address = "Banff, Canada",
author = "Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa and Rudolf, Gabor",
booktitle = "COCOON 2007: the 13th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/978-3-540-73545-8_23",
editor = "Lin, Guohui",
link = "http://link.springer.com/chapter/10.1007/978-3-540-73545-8_23",
month = "jul",
pages = "222--231",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating Minimal k-Vertex Connected Spanning Subgraphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-73545-8_23",
volume = "4598",
year = "2007",
}
@article{Bouchitte2002,
author = "Bouchitt{\'e}, Vincent and Todinca, Ioan",
doi = "10.1016/S0304-3975(01)00007-X",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/S030439750100007X",
month = "apr",
number = "1",
pages = "17--32",
publisher = "Elsevier",
title = "Listing all potential maximal cliques of a graph",
uri = "http://www.sciencedirect.com/science/article/pii/S030439750100007X",
volume = "276",
year = "2002",
}
@article{Bowen1967a,
author = "Bowen, Robert and Fisk, Stephen",
doi = "10.1090/S0025-5718-1967-0223277-3",
issn = "0025-5718",
journal = "Mathematics of Computation",
link = "http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1967-0223277-3",
month = "may",
number = "98",
pages = "250--250",
title = "Generations of triangulations of the sphere",
uri = "http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1967-0223277-3",
volume = "21",
year = "1967",
}
@article{Bowen1967b,
author = "Bowen, Robert",
doi = "10.1090/S0025-5718-1967-0223276-1",
issn = "0025-5718",
journal = "Mathematics of Computation",
link = "http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1967-0223276-1",
month = "may",
number = "98",
pages = "248--248",
title = "The generation of minimal triangle graphs",
uri = "http://www.ams.org/jourcgi/jour-getitem?pii=S0025-5718-1967-0223276-1",
volume = "21",
year = "1967",
}
@article{Brinkmann2011,
author = "Brinkmann, Gunnar and Goedgebeur, Jan and McKay, BD",
journal = "Discrete Mathematics and Theoretical Computer Science",
keyword = "canonical construction path,cubic graph,generation,graph",
link = "http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/viewArticle/1801",
number = "2",
pages = "69--80",
title = "Generation of cubic graphs",
uri = "http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/viewArticle/1801",
volume = "13",
year = "2011",
}
@article{Bron1973,
author = "Bron, Coen and Kerbosch, Joep",
doi = "10.1145/362342.362367",
eprint = "citation.cfm?doid=362342.362367",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "backtracking algorithm,branch and bound technique,cliques,clusters,maximal complete subgraphs,recursion",
link = "http://dl.acm.org/citation.cfm?id=362342.362367 http://portal.acm.org/citation.cfm?doid=362342.362367",
month = "sep",
number = "9",
pages = "575--577",
publisher = "ACM",
title = "Algorithm 457: finding all cliques of an undirected graph",
uri = "http://dl.acm.org/citation.cfm?id=362342.362367",
volume = "16",
year = "1973",
zzzisbn = "0001-0782",
}
@article{Bronnimann2006a,
author = "Br\"{o}nnimann, Herv\'{e} and Kettner, Lutz and Pocchiola, Michel and Snoeyink, Jack",
doi = "10.1137/050631008",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "050631008,1,10,1137,52c25,52c45,65d18,68u05,68w05,algorithm,algorithms that perform computations,ams subject classifications,combinatorics,doi,enumeration,in the,introduction,on sets of points,pseudotriangulation,triangulation",
link = "http://epubs.siam.org/doi/abs/10.1137/050631008",
month = "jan",
number = "3",
pages = "721--739",
title = "Counting and Enumerating Pointed Pseudotriangulations With the Greedy Flip Algorithm",
uri = "http://epubs.siam.org/doi/abs/10.1137/050631008",
volume = "36",
year = "2006",
}
@inproceedings{Bulo2007,
address = "Alicante, Spain",
author = "Bulo, Sr and Torsello, Andrea and Pelillo, Marcello",
booktitle = "GbRPR 2007: the 6th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition",
doi = "10.1007/978-3-540-72903-7_6",
editor = "Escolano, Francisco and Vento, Mario",
link = "http://link.springer.com/chapter/10.1007/978-3-540-72903-7_6",
month = "jun",
pages = "61--70",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "A continuous-based approach for partial clique enumeration",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-72903-7_6",
volume = "4538",
year = "2007",
}
@article{Burdet1974,
author = "Burdet, Claude-Alain",
doi = "10.1137/0126045",
issn = "0036-1399",
journal = "SIAM Journal on Applied Mathematics",
link = "http://epubs.siam.org/doi/10.1137/0126045",
month = "may",
number = "3",
pages = "479--489",
title = "Generating All the Faces of a Polyhedron",
uri = "http://epubs.siam.org/doi/10.1137/0126045",
volume = "26",
year = "1974",
}
@article{Bussieck1998,
author = "Bussieck, Michael R and L\"{u}bbecke, Marco E",
doi = "10.1016/S0925-7721(98)00021-2",
issn = "09257721",
journal = "Computational Geometry",
link = "http://www.sciencedirect.com/science/article/pii/S0925772198000212",
number = "2",
pages = "103--109",
title = "The vertex set of a 1/2-polytope is strongly P-enumerable",
uri = "http://www.sciencedirect.com/science/article/pii/S0925772198000212",
volume = "11",
year = "1998",
}
@article{Byskov2004,
author = "Byskov, Jesper Makholm",
doi = "10.1016/j.orl.2004.03.002",
issn = "01676377",
journal = "Operations Research Letters",
keyword = "Chromatic number,Extremal graphs,Graph algorithms,Graph colouring,Maximal independent set",
number = "6",
pages = "547--556",
title = "Enumerating maximal independent sets with applications to graph colouring",
volume = "32",
year = "2004",
}
@article{Canfield1995,
author = "Canfield, E. Rodney and Williamson, S. Gill",
doi = "10.1007/BF01108590",
issn = "0167-8094",
journal = "Order",
link = "http://link.springer.com/10.1007/BF01108590",
number = "1",
pages = "57--75",
title = "A loop-free algorithm for generating the linear extensions of a poset",
uri = "http://link.springer.com/10.1007/BF01108590",
volume = "12",
year = "1995",
}
@article{Cattell2000,
author = "Cattell, Kevin and Ruskey, Frank and Sawada, Joe and Serra, Micaela and Miers, C.Robert",
doi = "10.1006/jagm.2000.1108",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0196677400911088 http://www.sciencedirect.com/science/article/pii/S0196677400911088",
month = "nov",
number = "2",
pages = "267--282",
title = "Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials Over GF(2)",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0196677400911088",
volume = "37",
year = "2000",
}
@article{Cazals:Karande:Theoretical_Comp_Sci:2008,
author = "Cazals, F. and Karande, C.",
doi = "10.1016/j.tcs.2008.05.010",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Enumeration problems,Maximal cliques,Maximal common subgraphs,Output sensitive algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0304397508003903 http://linkinghub.elsevier.com/retrieve/pii/S0304397508003903",
month = "nov",
number = "1-3",
pages = "564--568",
title = "A Note on the Problem of Reporting Maximal Cliques",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397508003903",
volume = "407",
year = "2008",
}
@inproceedings{Chandran2001,
address = "Guilin, China",
author = "Chandran, LS",
booktitle = "COCOON 2001: the 7th Annual International Conference Computing and Combinatorics",
doi = "10.1007/3-540-44679-6_34",
editor = "Wang, Jie",
link = "http://link.springer.com/chapter/10.1007/3-540-44679-6_34",
month = "aug",
pages = "308--317",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph",
uri = "http://link.springer.com/chapter/10.1007/3-540-44679-6_34",
volume = "2108",
year = "2001",
}
@article{Chandran2003,
author = "Chandran, L.S. and Ibarra, L. and Ruskey, F. and Sawada, J.",
doi = "10.1016/S0304-3975(03)00221-4",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "2-Processor scheduling,Antimatroid,Chordal graph,Clique tree,Gray code,Perfect elimination ordering",
link = "http://www.sciencedirect.com/science/article/pii/S0304397503002214 http://linkinghub.elsevier.com/retrieve/pii/S0304397503002214",
month = "oct",
number = "2",
pages = "303--317",
title = "Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397503002214",
volume = "307",
year = "2003",
}
@article{Chang1994a,
author = "Chang, Y.H. and Wang, J.S. and Lee, R.C.T.",
doi = "10.1016/0020-0255(94)90013-2",
issn = "00200255",
journal = "Information Sciences",
link = "http://www.sciencedirect.com/science/article/pii/0020025594900132 http://linkinghub.elsevier.com/retrieve/pii/0020025594900132",
month = "jan",
number = "3-4",
pages = "279--296",
title = "Generating all maximal independent sets on trees in lexicographic order",
uri = "http://www.sciencedirect.com/science/article/pii/0020025594900132",
volume = "76",
year = "1994",
}
@article{Chang2013,
author = "Chang, Lijun and Yu, Jeffrey Xu and Qin, Lu",
doi = "10.1007/s00453-012-9632-8",
issn = "01784617",
journal = "Algorithmica",
keyword = "H-Partition,H-Value,Maximal clique,Polynomial delay,Sparse graph",
language = "English",
link = "http://link.springer.com/10.1007/s00453-012-9632-8 http://dx.doi.org/10.1007/s00453-012-9632-8",
month = "mar",
number = "1",
pages = "173--186",
publisher = "Springer-Verlag",
title = "Fast Maximal Cliques Enumeration in Sparse Graphs",
uri = "http://link.springer.com/10.1007/s00453-012-9632-8",
volume = "66",
year = "2013",
}
@article{Char1968,
author = "Char, J.",
doi = "10.1109/TCT.1968.1082817",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082817",
number = "3",
pages = "228--238",
title = "Generation of Trees, Two-Trees, and Storage of Master Forests",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082817",
volume = "15",
year = "1968",
}
@article{Char1970,
author = "Char, J.P.",
doi = "10.1049/piee.1970.0292",
journal = "Proceedings of the Institution of Electrical Engineers",
link = "http://digital-library.theiet.org/content/journals/10.1049/piee.1970.0292",
number = "8",
pages = "1655",
title = "Master circuit matrix",
uri = "http://digital-library.theiet.org/content/journals/10.1049/piee.1970.0292",
volume = "117",
year = "1970",
}
@article{Chegireddy1987,
author = "Chegireddy, Chandra R. and Hamacher, Horst W.",
doi = "10.1016/0166-218X(87)90017-5",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X87900175",
number = "2",
pages = "155--165",
title = "Algorithms for finding K-best perfect matchings",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X87900175",
volume = "18",
year = "1987",
}
@article{Cheng2011,
author = "Cheng, James and Ke, Yiping and Fu, Ada Wai-Chee and Yu, Jeffrey Xu and Zhu, Linhong",
doi = "10.1145/2043652.2043654",
isbn = "9781450300322",
issn = "03625915",
journal = "ACM Transactions on Database Systems",
keyword = "H*-graph,Maximal clique enumeration,dynamic graphs,h-index,massive networks,scale-free networks",
link = "http://dl.acm.org/citation.cfm?doid=2043652.2043654",
month = "dec",
number = "4",
pages = "1--34",
publisher = "ACM",
title = "Finding maximal cliques in massive networks",
uri = "http://dl.acm.org/citation.cfm?doid=2043652.2043654",
volume = "36",
year = "2011",
}
@inproceedings{Cheng2012b,
address = "Beijing, China",
author = "Cheng, James and Zhu, Linhong and Ke, Yiping and Chu, Shumo",
booktitle = "KDD 2012: the 18th ACM SIGKDD international conference on Knowledge discovery and data mining",
doi = "10.1145/2339530.2339724",
editor = "Yang, Qiang",
isbn = "9781450314626",
keyword = "i/o efficient,massive networks,maximal clique enumeration,parallel algorithm,sparse graphs",
link = "http://dl.acm.org/citation.cfm?doid=2339530.2339724",
month = "aug",
pages = "1240",
publisher = "ACM Press",
title = "Fast algorithms for maximal clique enumeration with limited memory",
uri = "http://dl.acm.org/citation.cfm?doid=2339530.2339724",
year = "2012",
}
@article{Chiba1985,
author = "Chiba, Norishige and Nishizeki, Takao",
doi = "10.1137/0214017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "arboricity,clique,complete subgraph,independent set,quadrangle,subgraph listing algorithm,triangle",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0214017",
month = "feb",
number = "1",
pages = "210--223",
publisher = "Society for Industrial and Applied Mathematics",
title = "Arboricity and Subgraph Listing Algorithms",
uri = "http://epubs.siam.org/doi/abs/10.1137/0214017",
volume = "14",
year = "1985",
}
@inproceedings{Cohen2006,
address = "COEX, Seoul, Korea",
author = "Cohen, Sara and Fadida, Itzhak and Kanza, Yaron and Kimelfeld, Benny and Sagiv, Yehoshua",
booktitle = "VLDB 2006: the 32nd international conference on Very Large Data Bases",
editor = "Dayal, Umeshwar and Whang, Khu-Yong and Lomet David and Alonso Gustavo and Lohman Guy and Kersten Martin and K. Cha Sang and Kim Young-Kuk",
link = "http://dl.acm.org/citation.cfm?id=1182635.1164191",
month = "sep",
pages = "739--750",
publisher = "VLDB Endowment",
title = "Full disjunctions: polynomial-delay iterators in action",
uri = "http://dl.acm.org/citation.cfm?id=1182635.1164191",
year = "2006",
zzzdoi = "MY/1182635.1164191",
}
@article{Cohen2008,
arxivid = "cs/0410039",
author = "Cohen, Sara and Kimelfeld, Benny and Sagiv, Yehoshua",
doi = "10.1016/j.jcss.2008.04.003",
eprint = "0410039",
issn = "00220000",
journal = "Journal of Computer and System Sciences",
keyword = "Complexity classes,Enumeration,Graph properties,Hereditary properties,Maximal subgraphs",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0022000008000512",
month = "nov",
number = "7",
pages = "1147--1159",
title = "Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0022000008000512",
volume = "74",
year = "2008",
}
@inproceedings{Conte2016,
address = "Dagstuhl, Germany",
author = "Conte, Alessio and Grossi, Roberto and Marino, Andrea and Versari, Luca",
booktitle = "ICALP 2016: the 43rd International Colloquium on Automata, Languages, and Programming",
doi = "10.4230/LIPIcs.ICALP.2016.148",
editor = "{Ioannis Chatzigiannakis Michael Mitzenmacher}, Yuval Rabani and Sangiorgi, Davide",
isbn = "978-3-95977-013-2",
issn = "1868-8969",
link = "http://drops.dagstuhl.de/opus/volltexte/2016/6292",
pages = "148:1----148:15",
publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques",
uri = "http://drops.dagstuhl.de/opus/volltexte/2016/6292",
volume = "55",
year = "2016",
}
@inproceedings{Conte2017,
author = "Conte, Alessio and Kant{\'{e}}, Mamadou Moustapha and Otachi, Yota and Uno, Takeaki and Wasa, Kunihiro",
booktitle = "COCOON 2017: the 23rd Annual International Computing and Combinatorics Conference",
doi = "10.1007/978-3-319-62389-4_13",
editor = "Cao, Yixin and Chen, Jianer",
isbn = "978-3-319-62388-7_13",
link = "http://link.springer.com/10.1007/978-3-319-62389-4",
pages = "150--161",
publisher = "Springer International Publishing",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of Maximal k-Degenerate Subgraphs in a Chordal Graph",
uri = "http://link.springer.com/10.1007/978-3-319-62389-4",
volume = "10392",
year = "2017",
}
@article{Conte2018,
author = "Conte, Alessio and Grossi, Roberto and Marino, Andrea and Rizzi, Romeo",
doi = "10.1016/j.dam.2017.08.002",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
pages = "22--37",
publisher = "Elsevier B.V.",
title = "{Efficient enumeration of graph orientations with sources}",
volume = "246",
year = "2018",
}
@inproceedings{Conte2019,
address = "New York, New York, USA",
author = "Conte, Alessio and Uno, Takeaki",
booktitle = "Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019",
doi = "10.1145/3313276.3316402",
isbn = "9781450367059",
pages = "1179--1190",
publisher = "ACM Press",
title = "{New polynomial delay bounds for maximal subgraph enumeration by proximity search}",
year = "2019",
}
@article{Courcelle2009c,
author = "Courcelle, Bruno",
doi = "10.1016/j.dam.2008.08.021",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "DAG,Enumeration,Monadic second-order logic,Monadic second-order transduction,Query,Random generation,Recognizable set of terms,Tree automaton,Tree-width,Unfolding,dag,enumeration,monadic second-order logic,monadic second-order transduction,project of the,query,random generation,recognizable set of terms,support,supported by the graal,this work has been,tomaton,tree au-,tree-width,unfolding",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08003363 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08003363",
month = "jun",
number = "12",
pages = "2675--2700",
title = "Linear delay enumeration and monadic second-order logic",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08003363",
volume = "157",
year = "2009",
}
@article{Couturier2013a,
author = "Couturier, Jean-Fran{\c{c}}ois and Heggernes, Pinar and {van 't Hof}, Pim and Kratsch, Dieter",
doi = "10.1016/j.tcs.2013.03.026",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "combinatorial bounds,enumeration algorithms,minimal dominating sets",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0304397513002508",
month = "may",
pages = "82--94",
publisher = "Elsevier B.V.",
title = "Minimal dominating sets in graph classes: Combinatorial bounds and enumeration",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0304397513002508",
volume = "487",
year = "2013",
}
@inproceedings{Creignou2011,
address = "Ann Arbor, MI, USA,",
author = "Creignou, Nadia and Olive, Fr\'{e}d\'{e}ric and Schmidt, Johannes",
booktitle = "SAT 2011: the 14th International Conference Theory and Applications of Satisfiability Testing",
doi = "10.1007/978-3-642-21581-0_11",
editor = "Sakallah, Karem A. and Simon, Laurent",
keyword = "csp,enumeration,satisfiability",
link = "http://link.springer.com/chapter/10.1007/978-3-642-21581-0_11",
month = "jun",
pages = "120--133",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating all solutions of a Boolean CSP by non-decreasing weight",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-21581-0_11",
volume = "6695",
year = "2011",
}
@techreport{Dagdelen:Schneider:Appl_Mathematics:2010,
author = "Dagdelen, \"{O}zg\"{u}r and Schneider, Michael",
keyword = "enumeration,parallelization,shortest vector problem",
link = "http://eprint.iacr.org/2010/097",
title = "Parallel Enumeration of Shortest Lattice Vectors",
uri = "http://eprint.iacr.org/2010/097",
year = "2010",
}
@inproceedings{Daigo2009,
address = "\v{S}pindlerův Ml\'{y}n, Czech Republic",
author = "Daigo, Taishin and Hirata, Kouichi",
booktitle = "SOFSEM 2009: the 35th Conference on Current Trends in Theory and Practice of Computer Science",
doi = "10.1007/978-3-540-95891-8_19",
editor = "Nielsen, Mogens and Ku\v{c}era, Anton\'{\i}n and Miltersen, Peter Bro and Palamidessi, Catuscia and Tůma, Petr and Valencia, Frank",
link = "http://link.springer.com/chapter/10.1007/978-3-540-95891-8_19",
month = "jan",
pages = "181--192",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-95891-8_19",
volume = "5404",
year = "2009",
}
@article{Damaschke2006,
author = "Damaschke, Peter",
doi = "10.1016/j.tcs.2005.10.004",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Enumeration,Parameterized complexity,Perfect phylogeny,Transversal,Vertex cover",
link = "http://www.sciencedirect.com/science/article/pii/S0304397505006286 http://linkinghub.elsevier.com/retrieve/pii/S0304397505006286",
month = "feb",
number = "3",
pages = "337--350",
title = "Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397505006286",
volume = "351",
year = "2006",
}
@article{Danielson1968,
author = "Danielson, G.",
doi = "10.1109/TCT.1968.1082837",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082837",
month = "sep",
number = "3",
pages = "294--295",
title = "On finding the simple paths and circuits in a graph",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082837",
volume = "15",
year = "1968",
}
@article{Dershowitz1975,
author = "Dershowitz, Nachum",
doi = "10.1007/BF01932689",
issn = "00063835",
journal = "BIT",
keyword = "loop-free algorithms,ordering,permutation generation,permutations,permutations and combinations",
link = "http://link.springer.com/10.1007/BF01932689",
month = "jun",
number = "2",
pages = "158--164",
title = "A simplified loop-free algorithm for generating permutations",
uri = "http://link.springer.com/10.1007/BF01932689",
volume = "15",
year = "1975",
}
@article{Deza1993,
author = "Deza, Antoine and Fukuda, K and Rosta, Vera",
journal = "Research reports on information sciences. Ser. B, Operations research",
link = "http://ci.nii.ac.jp/naid/110000025461/",
number = "-",
pages = "1--5",
title = "Wagner's theorem and combinatorial enumeration of 3-polytopes",
uri = "http://ci.nii.ac.jp/naid/110000025461/",
volume = "271",
year = "1993",
zzzdoi = "MY/Deza_Fukuda_Rosta_110000025461",
}
@article{Dias2005,
author = "Dias, V\^{a}nia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.",
doi = "10.1016/j.tcs.2005.01.014",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Algorithms,Biclique,Enumeration,Lexicographic order,NP-complete,Polynomial-time delay",
link = "http://www.sciencedirect.com/science/article/pii/S030439750500037X http://linkinghub.elsevier.com/retrieve/pii/S030439750500037X",
month = "jun",
number = "1-3",
pages = "240--248",
title = "Generating Bicliques of a Graph in Lexicographic Order",
uri = "http://www.sciencedirect.com/science/article/pii/S030439750500037X",
volume = "337",
year = "2005",
}
@article{Dickerson1992,
author = "Dickerson, Matthew T. and Drysdale, R.L. Scot and Sack, J\"{o}rg-R\"{u}diger",
doi = "10.1142/S0218195992000147",
issn = "0218-1959",
journal = "International Journal of Computational Geometry \& Applications",
keyword = "Algorithms,Delaunay triangulation,enumeration,nearest neighbors,selection",
language = "en",
link = "http://www.worldscientific.com/doi/abs/10.1142/S0218195992000147",
month = "sep",
number = "03",
pages = "221--239",
publisher = "World Scientific Publishing Company",
title = "Simple Algorithms for Enumerating Interpoint Distances and Finding K Nearest Neighbors",
uri = "http://www.worldscientific.com/doi/abs/10.1142/S0218195992000147",
volume = "02",
year = "1992",
}
@article{DOGRUSOZ1996,
author = "DO\bar{G}RUS\"OZ, U. and KRISHNAMOORTHY, M. S.",
doi = "10.1080/10637199608915603",
issn = "1063-7192",
journal = "Parallel Algorithms and Applications",
month = "aug",
number = "1-2",
pages = "21--36",
title = "ENUMERATING ALL CYCLES OF A PLANAR GRAPH",
volume = "10",
year = "1996",
}
@article{Dourado2014,
author = "Dourado, Mitre C. and Oliveira, Rodolfo A. and Protti, F\'{a}bio",
doi = "10.1007/s10479-014-1607-5",
issn = "0254-5330",
journal = "Annals of Operations Research",
link = "http://link.springer.com/10.1007/s10479-014-1607-5",
month = "may",
number = "1",
pages = "155--171",
title = "Algorithmic Aspects of Steiner Convexity and Enumeration of Steiner Trees",
uri = "http://link.springer.com/10.1007/s10479-014-1607-5",
volume = "223",
year = "2014",
}
@inproceedings{Du2009,
address = "Hong Kong, China",
author = "Du, Nan and Wu, Bin and Xu, Liutong and Wang, Bai and Pei, Xin",
booktitle = "ICDMW 2006: the 6th IEEE International Conference on Data Mining - Workshops",
doi = "10.1109/ICDMW.2006.17",
isbn = "0-7695-2702-7",
keyword = "Application software,Bioinformatics,Complex networks,Computer science,Data mining,Graph theory,Intelligent networks,Laboratories,Parallel algorithms,Telecommunication computing,complex network,computational complexity,graph theory,graph-based link mining,maximal clique problem,parallel algorithm,parallel algorithms",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4063647",
month = "dec",
pages = "320--324",
publisher = "IEEE",
title = "A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4063647",
year = "2006",
zzzeditor = "-, -",
}
@article{Dumitrescu2001,
author = "Dumitrescu, Adrian and G\"{a}rtner, Bernd and Pedroni, Samuele and Welzl, Emo",
doi = "10.1016/S0925-7721(01)00031-1",
issn = "09257721",
journal = "Computational Geometry",
keyword = "combinatorics,constrained delaunay triangulation,discrete geometry,enumeration,reverse search,triangulation,triangulation path",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0925772101000311",
month = "oct",
number = "1-2",
pages = "3--12",
title = "Enumerating triangulation paths",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0925772101000311",
volume = "20",
year = "2001",
}
@article{Durand2007,
arxivid = "cs/0507020",
author = "Durand, Arnaud and Grandjean, Etienne",
doi = "10.1145/1276920.1276923",
eprint = "0507020",
issn = "15293785",
journal = "ACM Transactions on Computational Logic",
keyword = "Computational complexity,enumeration problems,first-order logic",
link = "http://dl.acm.org/citation.cfm?id=1276920.1276923 http://arxiv.org/abs/cs/0507020",
month = "aug",
number = "4",
pages = "18",
publisher = "ACM",
title = "First-order queries on structures of bounded degree are computable with constant delay",
uri = "http://dl.acm.org/citation.cfm?id=1276920.1276923",
volume = "8",
year = "2005",
}
@inproceedings{Durand2011,
address = "Dagstuhl, Germany",
author = "Durand, Arnaud and Strozecki, Yann",
booktitle = "CSL 2011: the 25th International Workshop/20th Annual Conference of the EACSL - Computer Science Logic",
doi = "10.4230/LIPIcs.CSL.2011.189",
editor = "Bezem, Marc",
isbn = "978-3-939897-32-3",
issn = "1868-8969",
keyword = "004,descriptive complexity,enumeration,query problem",
language = "eng",
link = "http://drops.dagstuhl.de/opus/volltexte/2011/3231/",
month = "aug",
pages = "189--202",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "Enumeration Complexity of Logical Query Problems with Second-order Variables",
uri = "http://drops.dagstuhl.de/opus/volltexte/2011/3231/",
volume = "12",
year = "2011",
}
@article{Dyer1977,
author = "Dyer, M. E. and Proll, L. G.",
doi = "10.1007/BF01593771",
issn = "0025-5610",
journal = "Mathematical Programming",
month = "dec",
number = "1",
pages = "81--96",
title = "An algorithm for determining all extreme points of a convex polytope",
volume = "12",
year = "1977",
}
@techreport{Ehrenfeucht1973,
author = "Ehrenfeucht, Andrzej and Fosdick, Lloyd D. and Osterweil, Leon J.",
institution = "Dept. of Computer Sci., Univ. of Colorado, Boulder",
link = "http://scholar.colorado.edu/csci_techreports/23",
number = "CU-CS-024-23",
pages = "1--54",
title = "An algorithm for finding the elementary circuits of a directed graph",
uri = "http://scholar.colorado.edu/csci_techreports/23",
year = "1973",
}
@article{Ehrlich1973a,
author = "Ehrlich, Gideon",
doi = "10.1145/321765.321781",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=321765.321781",
month = "jul",
number = "3",
pages = "500--513",
publisher = "ACM",
title = "Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations",
uri = "http://dl.acm.org/citation.cfm?id=321765.321781",
volume = "20",
year = "1973",
}
@article{Eiter2008,
author = "Eiter, Thomas and Makino, Kazuhisa and Gottlob, Georg",
doi = "10.1016/j.dam.2007.04.017",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Combinatorial enumeration,Dualization,Hitting sets,Hypergraphs,Independent sets,Limited nondeterminism,Monotone Boolean functions,Output-polynomial algorithms,Polynomial-total time,Quasi-polynomial time,Self-duality,Set coverings,Transversals",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X07001278 http://linkinghub.elsevier.com/retrieve/pii/S0166218X07001278",
month = "jun",
number = "11",
pages = "2035--2049",
title = "Computational aspects of monotone dualization: A brief survey",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X07001278",
volume = "156",
year = "2008",
}
@article{Eppstein1992,
author = "Eppstein, David",
doi = "10.1007/BF01994879",
issn = "00063835",
journal = "BIT",
keyword = "F.1.3,F.2.2,G.2.2,I.2.8",
link = "http://link.springer.com/10.1007/BF01994879",
month = "jun",
number = "2",
pages = "237--248",
title = "Finding the k smallest spanning trees",
uri = "http://link.springer.com/10.1007/BF01994879",
volume = "32",
year = "1992",
}
@article{Eppstein1997,
author = "Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon",
doi = "10.1145/265910.265914",
issn = "00045411",
journal = "Journal of the ACM",
keyword = "dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees",
link = "http://dl.acm.org/citation.cfm?id=265910.265914",
month = "sep",
number = "5",
pages = "669--696",
publisher = "ACM",
title = "Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms",
uri = "http://dl.acm.org/citation.cfm?id=265910.265914",
volume = "44",
year = "1997",
}
@article{Eppstein1998,
author = "Eppstein, David",
doi = "10.1137/S0097539795290477",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
link = "http://epubs.siam.org/doi/abs/10.1137/S0097539795290477",
month = "jan",
number = "2",
pages = "652--673",
title = "Finding the K Shortest Paths",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0097539795290477",
volume = "28",
year = "1998",
}
@article{Eppstein2003a,
author = "Eppstein, David",
doi = "10.7155/jgaa.00064",
issn = "1526-1719",
journal = "Journal of Graph Algorithms and Applications",
link = "http://www.emis.ams.org/journals/JGAA/accepted/2003/Eppstein2003.7.2.pdf http://jgaa.info/getPaper?id=64",
number = "2",
pages = "131--140",
title = "Small Maximal Independent Sets and Faster Exact Graph Coloring",
uri = "http://www.emis.ams.org/journals/JGAA/accepted/2003/Eppstein2003.7.2.pdf",
volume = "7",
year = "2003",
}
@inproceedings{Eppstein2010,
address = "Jeju Island, Korea",
author = "Eppstein, David and L\"{o}ffler, M and Strash, Darren",
booktitle = "ISAAC 2010: the 21st International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-17517-6_36",
editor = "Cheong, Otfried and Chwa, Kyung-Yong and Park, Kunsoo",
keyword = "bron,d -degenerate graphs,fixed-parameter tractability,kerbosch algorithm,maximal clique listing algorithms,sparse graphs",
link = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36",
month = "dec",
pages = "403--414",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Listing all maximal cliques in sparse graphs in near-optimal time",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-17517-6_36",
volume = "6506",
year = "2010",
}
@article{Eppstein2014,
address = "USA",
arxivid = "1412.5075",
author = "Eppstein, David",
booktitle = "arXiv",
eprint = "1412.5075",
institution = "Cornell University",
link = "http://arxiv.org/abs/1412.5075",
month = "dec",
number = "arXiv ID: 1412.5075",
title = "$K$-Best Enumeration",
uri = "http://arxiv.org/abs/1412.5075",
year = "2014",
zzzdoi = "MY/arxiv_1412.5075",
}
@article{Er1983,
author = "Er, M. C.",
doi = "10.1093/comjnl/26.3.205",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/26.3.205",
month = "mar",
number = "3",
pages = "205--207",
title = "A Note on Generating Well-Formed Parenthesis Strings Lexicographically",
uri = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/26.3.205",
volume = "26",
year = "1983",
}
@article{Er1985,
author = "Er, M. C.",
doi = "10.1093/comjnl/28.5.538",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/content/28/5/538.abstract http://comjnl.oxfordjournals.org/content/28/5/538.short http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/28.5.538",
month = "may",
number = "5",
pages = "538--542",
title = "Enumerating Ordered Trees Lexicographically",
uri = "http://comjnl.oxfordjournals.org/content/28/5/538.abstract",
volume = "28",
year = "1985",
}
@article{Er1987,
author = "Er, M. C.",
doi = "10.1093/comjnl/30.6.569",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/30.6.569",
month = "dec",
number = "6",
pages = "569--572",
title = "Lexicographic Listing and Ranking of T-Ary Trees",
uri = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/30.6.569",
volume = "30",
year = "1987",
}
@article{Er1992,
author = "Er, M. C.",
doi = "10.1093/comjnl/35.3.306",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/35.3.306",
month = "jun",
number = "3",
pages = "306--308",
title = "Efficient Generation of K-Ary Trees in Natural Order",
uri = "http://comjnl.oxfordjournals.org/cgi/doi/10.1093/comjnl/35.3.306",
volume = "35",
year = "1992",
}
@article{Fenner1980,
author = "Fenner, T. I.",
doi = "10.1093/comjnl/23.4.332",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/23.4.332",
month = "apr",
number = "4",
pages = "332--337",
title = "A binary tree representation and related algorithms for generating integer partitions",
uri = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/23.4.332",
volume = "23",
year = "1980",
}
@inproceedings{Fernau2006,
address = "Z\"{u}rich, Switzerland",
author = "Fernau, Henning",
booktitle = "IWPEC 2006: the 2nd International Workshop on Parameterized and Exact Computation",
doi = "10.1007/11847250_13",
editor = "Bodlaender, Hans L. and Langston, Michael A.",
link = "http://link.springer.com/chapter/10.1007/11847250_13",
month = "sep",
pages = "142--153",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Edge dominating set: Efficient enumeration-based exact algorithms",
uri = "http://link.springer.com/chapter/10.1007/11847250_13",
volume = "4169",
year = "2006",
}
@inproceedings{Ferreira2011,
address = "Saarbr\"{u}cken, Germany",
author = "Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo",
booktitle = "ESA 2011: the 19th Annual European Symposium on Algorithms",
doi = "10.1007/978-3-642-23719-5_24",
editor = "Demetrescu, Camil and Halld\'{o}rsson, Magn\'{u}s M.",
link = "http://link.springer.com/10.1007/978-3-642-23719-5_24",
month = "sep",
pages = "275--286",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Output-sensitive listing of bounded-size trees in undirected graphs",
uri = "http://link.springer.com/10.1007/978-3-642-23719-5_24",
volume = "6942",
year = "2011",
}
@inproceedings{Ferreira2012,
address = "New Orleans, LA, USA",
arxivid = "1205.2766v2",
author = "Birmel\'{e}, Etienne and Ferreira, Rui and Grossi, Roberto and Marino, Andrea and Pisanti, Nadia and Rizzi, Romeo and Sacomoto, Gustavo",
booktitle = "SODA 2012: the 24th Annual ACM-SIAM Symposium on Discrete Algorithms",
doi = "10.1137/1.9781611973105.134",
editor = "Khanna, Sanjeev",
eprint = "1205.2766v2",
link = "http://knowledgecenter.siam.org/0236-000084/0236-000084/1 http://adsabs.harvard.edu/abs/2012arXiv1205.2766F",
month = "jan",
pages = "1884--1896",
title = "Optimal Listing of Cycles and st-Paths in Undirected Graphs",
uri = "http://knowledgecenter.siam.org/0236-000084/0236-000084/1",
year = "2012",
}
@inproceedings{Ferreira2014,
address = "Wroclaw, Poland",
author = "Ferreira, Rui and Grossi, Roberto and Rizzi, Romeo and Sacomoto, Gustavo and Marie-France, Sagot",
booktitle = "ESA 2014: the 22th Annual European Symposium on Algorithms",
doi = "10.1007/978-3-662-44777-2_35",
editor = "Schulz, Andreas S. and Wagner, Dorothea",
link = "http://link.springer.com/chapter/10.1007/978-3-662-44777-2_35",
month = "sep",
pages = "418--429",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Amortized $\tilde\{O\}(|V|)$ -Delay Algorithm for Listing Chordless Cycles in Undirected Graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-662-44777-2_35",
volume = "8737",
year = "2014",
}
@article{Florian1981,
author = "Florian, M. and Nguyen, S. and Pallottino, S.",
doi = "10.1002/net.3230110406",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230110406",
number = "4",
pages = "367--378",
title = "A dual simplex algorithm for finding all shortest paths",
uri = "http://doi.wiley.com/10.1002/net.3230110406",
volume = "11",
year = "1981",
}
@article{Fomin2008,
author = "Fomin, Fedor V. and Grandoni, Fabrizio and Pyatkin, Artem V. and Stepanov, Alexey A.",
doi = "10.1145/1435375.1435384",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "Exact exponential algorithms,domatic number,listing algorithms,measure and conquer,minimum dominating set,minimum set cover",
link = "http://dl.acm.org/citation.cfm?id=1435375.1435384",
month = "nov",
number = "1",
pages = "1--17",
publisher = "ACM",
title = "Combinatorial bounds via measure and conquer",
uri = "http://dl.acm.org/citation.cfm?id=1435375.1435384",
volume = "5",
year = "2008",
}
@article{Frangakis1981,
author = "Frangakis, C.N.",
doi = "10.1080/00207168108803264",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
month = "jan",
number = "1",
pages = "35--41",
title = "A backtracking algorithm to generate all kernels of a directed graph",
volume = "10",
year = "1981",
}
@article{Frederickson1985,
author = "Frederickson, Greg N.",
doi = "10.1137/0214055",
isbn = "0897910990",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a minimum,be maintained for an,connected components,consider the following on-line,data structures,edge insertion and deletion,introduction,k smallest spanning,minimum spanning tree,on-line computation,planar graphs,spanning tree is to,trees,underlying graph,update problem,which is modified repeatedly",
link = "http://epubs.siam.org/doi/abs/10.1137/0214055",
number = "4",
pages = "781--798",
title = "Data Structures for On-Line Updating of Minimum Spanning Trees, With Applications",
uri = "http://epubs.siam.org/doi/abs/10.1137/0214055",
volume = "14",
year = "1985",
}
@article{Fredricksen1978a,
author = "Fredricksen, Harold and Maiorana, James",
doi = "10.1016/0012-365X(78)90002-X",
issn = "0012365X",
journal = "Discrete Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0012365X7890002X http://linkinghub.elsevier.com/retrieve/pii/0012365X7890002X",
month = "jan",
number = "3",
pages = "207--210",
title = "Necklaces of beads in k colors and k-ary de Bruijn sequences",
uri = "http://www.sciencedirect.com/science/article/pii/0012365X7890002X",
volume = "23",
year = "1978",
}
@article{Fredricksen1986b,
author = "Fredricksen, Harold and {J. Kessler}, Irving",
doi = "10.1016/0012-365X(86)90089-0",
issn = "0012365X",
journal = "Discrete Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0012365X86900890 http://linkinghub.elsevier.com/retrieve/pii/0012365X86900890",
month = "sep",
number = "2-3",
pages = "181--188",
title = "An algorithm for generating necklaces of beads in two colors",
uri = "http://www.sciencedirect.com/science/article/pii/0012365X86900890",
volume = "61",
year = "1986",
}
@article{Fujisawa1959,
author = "Fujisawa, T.",
doi = "10.1109/TCT.1959.1086556",
issn = "0096-2007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "261--266",
title = "On a Problem of Network Topology",
volume = "6",
year = "1959",
}
@article{Fukuda1991,
author = "Fukuda, Komei and Saito, Shigemasa and Tamura, Akihisa",
doi = "10.1016/0166-218X(91)90066-6",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0166218X91900666 http://linkinghub.elsevier.com/retrieve/pii/0166218X91900666",
month = "apr",
number = "2",
pages = "141--149",
title = "Combinatorial face enumeration in arrangements and oriented matroids",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X91900666",
volume = "31",
year = "1991",
}
@article{Fukuda1992,
author = "Fukuda, Komei and Matsui, Tomomi",
doi = "10.1002/net.3230220504",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230220504",
month = "aug",
number = "5",
pages = "461--468",
title = "Finding all minimum-cost perfect matchings in Bipartite graphs",
uri = "http://doi.wiley.com/10.1002/net.3230220504",
volume = "22",
year = "1992",
}
@article{Fukuda1994,
author = "Fukuda, K. and Matsui, T.",
doi = "10.1016/0893-9659(94)90045-0",
issn = "08939659",
journal = "Applied Mathematics Letters",
keyword = "Bipartite graph,Enumeration.,Matching",
link = "http://www.sciencedirect.com/science/article/pii/0893965994900450 http://linkinghub.elsevier.com/retrieve/pii/0893965994900450",
month = "jan",
number = "1",
pages = "15--18",
title = "Finding All the Perfect Matchings in Bipartite Graphs",
uri = "http://www.sciencedirect.com/science/article/pii/0893965994900450",
volume = "7",
year = "1994",
}
@article{Fukuda1995,
author = "Fukuda, Komei and Namiki, Makoto",
doi = "10.1016/0166-218X(94)00088-U",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Common basis,Enumeration,Matroid,Pivot operation",
link = "http://www.sciencedirect.com/science/article/pii/0166218X9400088U http://linkinghub.elsevier.com/retrieve/pii/0166218X9400088U",
month = "jan",
number = "2-3",
pages = "231--243",
title = "Finding all common bases in two matroids",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X9400088U",
volume = "56",
year = "1995",
}
@article{Fukuda1997,
author = "Fukuda, Komei and Liebling, Thomas M. and Margot, Fran\c{c}ois",
doi = "10.1016/0925-7721(95)00049-6",
issn = "09257721",
journal = "Computational Geometry",
link = "http://www.sciencedirect.com/science/article/pii/0925772195000496 http://linkinghub.elsevier.com/retrieve/pii/0925772195000496",
month = "jun",
number = "1",
pages = "1--12",
title = "Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron",
uri = "http://www.sciencedirect.com/science/article/pii/0925772195000496",
volume = "8",
year = "1997",
}
@article{Gabow1977,
author = "Gabow, Harold N.",
doi = "10.1137/0206011",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,branch and bound,consider this,edge exchange,electrical wiring problem,for example,graph in order of,in many practical situations,increasing weight,introduction,little wire as,n pins must be,one wants to generate,set merging,spanning trees of a,the,weighted spanning trees,wired together with as",
link = "http://epubs.siam.org/doi/abs/10.1137/0206011",
number = "1",
pages = "139--150",
title = "Two Algorithms for Generating Weighted Spanning Trees in Order",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206011",
volume = "6",
year = "1977",
}
@article{Gabow1978,
author = "Gabow, Harold N. and Myers, Eugene W.",
doi = "10.1137/0207024",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,10,252 364,252-364,4,5,6,7,8,9,algorithms of varying efficiency,algorithms varying efficiency,all spanning trees,all spanning trees of,arborescence,bridge,depth first search,depth-first search,directed,directed and,have been proposed,introduction,networks,pp,problem finding,solution electrical,spanning tree,the problem of finding,the solution of electrical,undirected graphs arises,undirected graphs arises in",
link = "http://epubs.siam.org/doi/abs/10.1137/0207024",
month = "aug",
number = "3",
pages = "280--287",
publisher = "SIAM",
title = "Finding All Spanning Trees of Directed and Undirected Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207024",
volume = "7",
year = "1978",
}
@article{Gabow1986a,
author = "Gabow, Harold N. and Galil, Zvi and Spencer, Thomas and Tarjan, Robert E.",
doi = "10.1007/BF02579168",
issn = "0209-9683",
journal = "Combinatorica",
link = "http://link.springer.com/10.1007/BF02579168",
month = "jun",
number = "2",
pages = "109--122",
title = "Efficient algorithms for finding minimum spanning trees in undirected and directed graphs",
uri = "http://link.springer.com/10.1007/BF02579168",
volume = "6",
year = "1986",
}
@article{Gainer-Dewar2014a,
author = "Gainer-Dewar, Andrew and Gessel, Ira M.",
issn = "1077-8926",
journal = "The Electronic Journal of Combinatorics",
keyword = "combinatorial species,cycle index,unlabeled bipartite graphs and blocks",
link = "http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p40",
number = "2",
pages = "P2.40",
title = "Enumeration of Bipartite Graphs and Bipartite Blocks",
uri = "http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p40",
volume = "21",
year = "2014",
}
@article{Garey1978,
author = "Garey, Michael R. and Tarjan, Robert E.",
doi = "10.1016/0020-0190(78)90015-7",
issn = "00200190",
journal = "Information Processing Letters",
link = "http://www.sciencedirect.com/science/article/pii/0020019078900157",
number = "6",
pages = "274--276",
title = "A linear-time algorithm for finding all feedback vertices",
uri = "http://www.sciencedirect.com/science/article/pii/0020019078900157",
volume = "7",
year = "1978",
}
@article{Gely2009,
author = "G\'{e}ly, Alain and Nourine, Lhouari and Sadi, Bachir",
doi = "10.1016/j.dam.2008.10.010",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Enumeration algorithms,Lattice,Maximal bicliques,Maximal cliques",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08004563 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08004563",
month = "apr",
number = "7",
pages = "1447--1459",
title = "Enumeration aspects of maximal cliques and bicliques",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08004563",
volume = "157",
year = "2009",
}
@article{Gen-Huey1994,
author = "Gen-Huey, Chen and Yung-Chen, Hung",
doi = "10.1016/0305-0548(94)90045-0",
issn = "03050548",
journal = "Computers \& Operations Research",
link = "http://www.sciencedirect.com/science/article/pii/0305054894900450 http://linkinghub.elsevier.com/retrieve/pii/0305054894900450",
month = "feb",
number = "2",
pages = "113--118",
title = "Algorithms for the Constrained Quickest Path Problem and the Enumeration of Quickest Paths",
uri = "http://www.sciencedirect.com/science/article/pii/0305054894900450",
volume = "21",
year = "1994",
}
@article{Gerhards1979,
author = "Gerhards, L. and Lindenberg, W.",
doi = "10.1007/BF02248731",
issn = "0010485X",
journal = "Computing",
link = "http://link.springer.com/10.1007/BF02248731",
month = "dec",
number = "4",
pages = "295--322",
title = "Clique detection for nondirected graphs: Two new algorithms",
uri = "http://link.springer.com/10.1007/BF02248731",
volume = "21",
year = "1979",
}
@article{Gilbert1958,
author = "Gilbert, E. N.",
doi = "10.1002/j.1538-7305.1958.tb03887.x",
journal = "Bell System Technical Journal",
link = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6773372",
month = "may",
number = "3",
pages = "815--826",
publisher = "Alcatel-Lucent",
title = "Gray Codes and Paths on the n-Cube",
uri = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6773372",
volume = "37",
year = "1958",
}
@inproceedings{Goldberg1993b,
address = "San Diego, CA, USA",
author = "Goldberg, Leslie Ann",
booktitle = "STOC 1993: the 25th annual ACM symposium on Theory of computing",
doi = "10.1145/167088.167160",
editor = "Kosaraju, Rao and Johnson, David and Aggarwal, Alok",
isbn = "0897915917",
link = "http://dl.acm.org/citation.cfm?id=167088.167160 http://portal.acm.org/citation.cfm?doid=167088.167160",
month = "jun",
pages = "218--225",
publisher = "ACM Press",
title = "Polynomial space polynomial delay algorithms for listing families of graphs",
uri = "http://dl.acm.org/citation.cfm?id=167088.167160",
year = "1993",
}
@inproceedings{Golovach2013a,
address = "Riga, Latvia",
author = "Golovach, PA and Heggernes, Pinar",
booktitle = "ICALP 2013: the 40th International Colloquium on Automata, Languages, and Programming",
doi = "10.1007/978-3-642-39206-1_41",
editor = "Fomin, Fedor V. and Freivalds, Rūsiņ\v{s} and Kwiatkowska, Marta and Peleg, David",
link = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41",
month = "jul",
pages = "485--496",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An incremental polynomial time algorithm to enumerate all minimal edge dominating sets",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-39206-1_41",
volume = "7965",
year = "2013",
}
@article{Golovach2015,
author = "Golovach, Petr A. and Heggernes, Pinar and Kant\'{e}, Mamadou M. and Kratsch, Dieter and Villanger, Yngve",
doi = "10.1016/j.dam.2014.12.010",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X1400540X",
month = "jan",
pages = "30-36",
title = "Enumerating minimal dominating sets in chordal bipartite graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X1400540X",
volume = "199",
year = "2015",
}
@book{Gusfield1989,
author = "Gusfield, Dan and Irving, Robert W.",
doi = "10.978.0262515/528",
isbn = "0-262-07118-5",
link = "http://dl.acm.org/citation.cfm?id=68392",
month = "sep",
publisher = "MIT Press",
title = "The Stable Marriage Problem: Structure and Algorithms",
uri = "http://dl.acm.org/citation.cfm?id=68392",
year = "1989",
}
@article{Hakimi1961,
author = "Hakimi, S.L.",
doi = "10.1016/0016-0032(61)90036-9",
issn = "00160032",
journal = "Journal of the Franklin Institute",
link = "http://linkinghub.elsevier.com/retrieve/pii/0016003261900369",
month = "nov",
number = "5",
pages = "347--359",
title = "On trees of a graph and their generation",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0016003261900369",
volume = "272",
year = "1961",
}
@article{Hakimi1964,
author = "Hakimi, S. and Green, D.",
doi = "10.1109/TCT.1964.1082276",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082276",
number = "2",
pages = "247--255",
title = "Generation and Realization of Trees and k-Trees",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082276",
volume = "11",
year = "1964",
}
@article{Hamacher1984a,
author = "Hamacher, Horst W. and Picard, Jean-Claude and Queyranne, Maurice",
doi = "10.1016/0167-6377(84)90083-X",
issn = "01676377",
journal = "Operations Research Letters",
keyword = "Flow algorithm,cut,ranking of solutions",
link = "http://www.sciencedirect.com/science/article/pii/016763778490083X http://linkinghub.elsevier.com/retrieve/pii/016763778490083X",
month = "mar",
number = "6",
pages = "303--305",
title = "On Finding the K Best Cuts in a Network",
uri = "http://www.sciencedirect.com/science/article/pii/016763778490083X",
volume = "2",
year = "1984",
}
@article{Harary1957,
author = "Frank Harary and Ian C. Ross",
doi = "10.2307/2785673",
issn = "00380431",
journal = "Sociometry",
link = "http://www.jstor.org/stable/2785673",
number = "3",
pages = "205-215",
publisher = "[American Sociological Association, Sage Publications, Inc.]",
title = "A Procedure for Clique Detection Using the Group Matrix",
uri = "http://www.jstor.org/stable/2785673",
volume = "20",
year = "1957",
}
@inproceedings{Hariharan1995,
address = "Kingston, Canada",
author = "Hariharan, Ramesh and Kapoor, Sanjiv and Kumar, Vijay",
booktitle = "WADS 1995: the 4th International Workshop on Algorithms and Data Structures",
doi = "10.1007/3-540-60220-8_82",
editor = "Akl, Selim G. and Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola",
link = "http://link.springer.com/chapter/10.1007/3-540-60220-8_82",
month = "aug",
pages = "428--439",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Faster enumeration of all spanning trees of a directed graph",
uri = "http://link.springer.com/chapter/10.1007/3-540-60220-8_82",
volume = "955",
year = "1995",
}
@inproceedings{HeejongSuh2000,
author = "{Heejong Suh} and Chang, C.K.",
booktitle = "Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000",
doi = "10.1109/LCN.2000.891015",
isbn = "0-7695-0912-6",
issn = "07421303",
link = "http://ieeexplore.ieee.org/document/891015/",
pages = "100--107",
publisher = "IEEE Comput. Soc",
title = "Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition",
uri = "http://ieeexplore.ieee.org/document/891015/",
year = "2000",
}
@inproceedings{Hendrix2009,
address = "New York, New York, USA",
author = "Hendrix, William and Schmidt, Matthew C. and Breimyer, Paul and Samatova, Nagiza F.",
booktitle = "U 2009: the 1st ACM SIGKDD Workshop on Knowledge Discovery from Uncertain Data",
doi = "10.1145/1610555.1610562",
isbn = "9781605586755",
keyword = "biological applications,graph algorithms,graph perturbation theory,maximal clique enumeration",
link = "http://dl.acm.org/citation.cfm?id=1610555.1610562 http://portal.acm.org/citation.cfm?doid=1610555.1610562",
month = "jun",
pages = "48--56",
publisher = "ACM Press",
title = "On perturbation theory and an algorithm for maximal clique enumeration in uncertain and noisy graphs",
uri = "http://dl.acm.org/citation.cfm?id=1610555.1610562",
year = "2009",
}
@inproceedings{Henry2013,
address = "Banff, Canada",
author = "Henry, CJ and Ramanna, Sheela",
booktitle = "Transactions on Rough Sets XVI",
doi = "10.1007/978-3-642-36505-8_7",
editor = "Peters, James F. and Skowron, Andrzej and Ramanna, Sheela and Suraj, Zbigniew and Wang, Xin",
keyword = "cbir,maximal clique enumeration,near sets,nearness measure,pre-class,tolerance near sets,tolerance relation,tolerance space",
link = "http://link.springer.com/chapter/10.1007/978-3-642-36505-8_7",
month = "oct",
pages = "103--124",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Maximal clique enumeration in Finding Near Neighbourhoods",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-36505-8_7",
volume = "7736",
year = "2013",
}
@article{Hikita1983,
author = "Hikita, Teruo",
doi = "10.1016/0020-0190(83)90046-7",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary tree generation,inorder-preorder sequences,subtree counting,subtree listing",
link = "http://www.sciencedirect.com/science/article/pii/0020019083900467 http://linkinghub.elsevier.com/retrieve/pii/0020019083900467",
month = "nov",
number = "4",
pages = "225--229",
title = "Listing and counting subtrees of equal size of a binary tree",
uri = "http://www.sciencedirect.com/science/article/pii/0020019083900467",
volume = "17",
year = "1983",
}
@article{Hoang2013,
author = "Ho\`{a}ng, Ch\'{\i}nh T. and Kamiński, Marcin and Sawada, Joe and Sritharan, R.",
doi = "10.1016/j.dam.2012.01.024",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Graph algorithm,Induced cycle,Induced path",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X12000327 http://linkinghub.elsevier.com/retrieve/pii/S0166218X12000327",
month = "mar",
number = "4-5",
pages = "633--641",
title = "Finding and listing induced paths and cycles",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X12000327",
volume = "161",
year = "2013",
}
@article{Hu1967,
author = "Hu, T. C.",
doi = "10.1137/0115017",
issn = "0036-1399",
journal = "SIAM Journal on Applied Mathematics",
link = "http://epubs.siam.org/doi/10.1137/0115017",
month = "jan",
number = "1",
pages = "207--218",
title = "Revised Matrix Algorithms for Shortest Paths",
uri = "http://epubs.siam.org/doi/10.1137/0115017",
volume = "15",
year = "1967",
}
@article{Huffner2009,
author = "H\"{u}ffner, Falk and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf",
doi = "10.1016/j.tcs.2009.05.008",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Algorithm engineering,Dense subgraph,Exact algorithm,Fixed-parameter tractability,NP-hard problem",
link = "http://www.sciencedirect.com/science/article/pii/S0304397509003570 http://linkinghub.elsevier.com/retrieve/pii/S0304397509003570",
month = "dec",
number = "52",
pages = "5384--5397",
title = "Isolation Concepts for Clique Enumeration: Comparison and Computational Experiments",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397509003570",
volume = "410",
year = "2009",
}
@inproceedings{Ishida2008,
address = "Gold Coast, Queensland, Australia",
author = "Ishida, Yusuke and Zhao, Liang and Nagamochi, Hiroshi and Akutsu, Tatsuya",
booktitle = "the 19th International Conference on Genome Informatics 2008",
doi = "10.1142/9781848163324_0005",
editor = "Arthur, Jonathan and Ng, See-Kiong",
isbn = "9781848163317",
keyword = "chemical graph enumeration,chemical tree enumeration,detachment,feature vector,path frequency",
link = "http://www.worldscientific.com/doi/abs/10.1142/9781848163324_0005",
month = "dec",
pages = "53--64",
publisher = "Imperial College Press",
series = "Genome Informatics Series",
title = "Improved Algorithms for Enumerating Tree-like Chemical Graphs with Given Path Frequency",
uri = "http://www.worldscientific.com/doi/abs/10.1142/9781848163324_0005",
volume = "21",
year = "2008",
}
@article{Ito2009,
author = "Ito, Hiro and Iwama, Kazuo",
doi = "10.1145/1597036.1597044",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "Clique,enumeration,isolation",
link = "http://dl.acm.org/citation.cfm?id=1597036.1597044",
month = "oct",
number = "4",
pages = "1--21",
publisher = "ACM",
title = "Enumeration of isolated cliques and pseudo-cliques",
uri = "http://dl.acm.org/citation.cfm?id=1597036.1597044",
volume = "5",
year = "2009",
}
@article{Jayakumar1984,
author = "Jayakumar, R. and Thulasiraman, K. and Swamy, M.",
doi = "10.1109/TCS.1984.1085435",
issn = "0098-4094",
journal = "IEEE Transactions on Circuits and Systems",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1085435",
month = "oct",
number = "10",
pages = "853--860",
title = "Complexity of computation of a spanning tree enumeration algorithm",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1085435",
volume = "31",
year = "1984",
}
@article{Johnson1963,
author = "Johnson, Selmer M.",
doi = "10.1090/S0025-5718-1963-0159764-2",
issn = "0025-5718",
journal = "Mathematics of Computation",
link = "http://www.ams.org/mcom/1963-17-083/S0025-5718-1963-0159764-2/",
month = "sep",
number = "83",
pages = "282--282",
title = "Generation of permutations by adjacent transposition",
uri = "http://www.ams.org/mcom/1963-17-083/S0025-5718-1963-0159764-2/",
volume = "17",
year = "1963",
}
@article{Johnson1975,
author = "Johnson, Donald B.",
doi = "10.1137/0204007",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,algorithm,broadly speaking,circuit,cycle,digraph,enumeration,every,graph,introduction,is determining how many,is the construction of,objects,problems on,set,sets of objects,the one,the other,there are in the,there are two enumeration,which we call counting,which we call finding",
link = "http://epubs.siam.org/doi/abs/10.1137/0204007",
month = "mar",
number = "1",
pages = "77--84",
title = "Finding All the Elementary Circuits of a Directed Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0204007",
volume = "4",
year = "1975",
}
@article{Johnson1988,
author = "Johnson, David S. and Yannakakis, Mihalis and Papadimitriou, Christos H.",
doi = "10.1016/0020-0190(88)90065-8",
issn = "00200190",
journal = "Information Processing Letters",
link = "http://www.sciencedirect.com/science/article/pii/0020019088900658 http://linkinghub.elsevier.com/retrieve/pii/0020019088900658",
month = "mar",
number = "3",
pages = "119--123",
title = "On generating all maximal independent sets",
uri = "http://www.sciencedirect.com/science/article/pii/0020019088900658",
volume = "27",
year = "1988",
}
@article{Johnston1976,
author = "Johnston, H. C.",
doi = "10.1007/BF00991836",
issn = "0091-7036",
journal = "International Journal of Computer \& Information Sciences",
keyword = "Cliques,combinatorial programming,graph theory,stepwise refinement,tree search",
link = "http://link.springer.com/10.1007/BF00991836",
month = "sep",
number = "3",
pages = "209--238",
title = "Cliques of a graph-variations on the Bron-Kerbosch algorithm",
uri = "http://link.springer.com/10.1007/BF00991836",
volume = "5",
year = "1976",
}
@article{Kamae1967,
author = "Kamae, T.",
doi = "10.1109/TCT.1967.1082699",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082699",
month = "jun",
number = "2",
pages = "166--171",
title = "A Systematic Method of Finding All Directed Circuits and Enumerating All DIrected Paths",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082699",
volume = "14",
year = "1967",
}
@article{Kanevsky1993,
author = "Kanevsky, Arkady",
doi = "10.1002/net.3230230604",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230230604",
month = "sep",
number = "6",
pages = "533--541",
title = "Finding all minimum-size separating vertex sets in a graph",
uri = "http://doi.wiley.com/10.1002/net.3230230604",
volume = "23",
year = "1993",
}
@inproceedings{Kante2011,
address = "Oslo, Norway",
author = "Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L",
booktitle = "FCT 2011: the 18th International Symposium on Fundamentals of Computation Theory",
doi = "10.1007/978-3-642-22953-4_26",
editor = "Owe, Olaf and Steffen, Martin and Telle, Jan Arne",
link = "http://link.springer.com/chapter/10.1007/978-3-642-22953-4_26",
month = "aug",
pages = "298--309",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration of minimal dominating sets and variants",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-22953-4_26",
volume = "6914",
year = "2011",
}
@inproceedings{Kante2012,
address = "Taipei, Taiwan",
author = "Kant\'{e}, MM and Limouzy, Vincent and Mary, Arnaud and Nourine, L",
booktitle = "ISAAC 2012: the 23rd International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-35261-4_32",
editor = "Chao, Kun-Mao and Hsu, Tsan-sheng and Lee, Der-Tsai",
link = "http://link.springer.com/chapter/10.1007/978-3-642-35261-4_32",
month = "dec",
pages = "289--298",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On the neighbourhood Helly of some graph classes and applications to the enumeration of minimal dominating sets",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-35261-4_32",
volume = "7676",
year = "2012",
}
@inproceedings{Kante2013,
address = "Hong Kong, China",
author = "Kant\'{e}, MamadouMoustapha MM and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari and Uno, Takeaki",
booktitle = "ISAAC 2013: the 24th International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-642-45030-3_32",
editor = "Cai, Leizhen and Cheng, Siu-Wing and Lam, Tak-Wah",
isbn = "978-3-642-45029-7",
link = "http://dx.doi.org/10.1007/978-3-642-45030-3_32 http://www.isima.fr/~kante/articles/KanteMLNU13.pdf http://link.springer.com/chapter/10.1007/978-3-642-45030-3_32",
month = "dec",
pages = "339--349",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs",
uri = "http://dx.doi.org/10.1007/978-3-642-45030-3_32",
volume = "8283",
year = "2013",
}
@article{Kante2014,
author = "Kant\'{e}, Mamadou Moustapha and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari",
doi = "10.1137/120862612",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05C30,05C65,05C69,05C85,68R05,68R10,hypergraph dualization,minimal (connected,output polynomial time algorithm,total) dominating set enumeration,transversal problem",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/120862612",
month = "nov",
number = "4",
pages = "1916--1929",
publisher = "Society for Industrial and Applied Mathematics",
title = "On the Enumeration of Minimal Dominating Sets and Related Notions",
uri = "http://epubs.siam.org/doi/abs/10.1137/120862612",
volume = "28",
year = "2014",
}
@inproceedings{Kante2015,
author = "Kant{\'{e}}, Mamadou Moustapha and Limouzy, Vincent and Mary, Arnaud and Nourine, Lhouari and Uno, Takeaki",
booktitle = "WADS 2015: the 24th International Workshop on Algorithms and Data Structures",
doi = "10.1007/978-3-319-21840-3_37",
isbn = "978-3-319-21839-7",
pages = "446--457",
title = "Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs",
volume = "1",
year = "2015",
}
@inproceedings{Kapoor1991,
address = "Ottawa, Canada",
author = "Kapoor, Sanjiv and Ramesh, H",
booktitle = "WADS 1991: the 2nd Workshop on Algorithms and Data Structures",
doi = "10.1007/BFb0028284",
editor = "Dehne, Frank and Sack, J\"{o}rg-R\"{u}diger and Santoro, Nicola",
link = "http://link.springer.com/chapter/10.1007/BFb0028284",
month = "aug",
pages = "461--472",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Algorithms for generating all spanning trees of undirected, directed and weighted graphs",
uri = "http://link.springer.com/chapter/10.1007/BFb0028284",
volume = "519",
year = "1991",
}
@article{Kapoor1995,
author = "Kapoor, Sanjiv and Ramesh, H",
doi = "10.1137/S009753979225030X",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "enumeration,spanning tree,undirected graph,weighted graph",
link = "http://epubs.siam.org/doi/abs/10.1137/S009753979225030X",
month = "apr",
number = "2",
pages = "247--265",
title = "Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/S009753979225030X",
volume = "24",
year = "1995",
}
@article{Kapoor2000,
author = "Kapoor, S. and Ramesh, H.",
doi = "10.1007/s004530010008",
isbn = "0045300100",
issn = "0178-4617",
journal = "Algorithmica",
month = "jun",
number = "2",
pages = "120--130",
title = "An Algorithm for Enumerating All Spanning Trees of a Directed Graph",
volume = "27",
year = "2000",
}
@article{Kashiwabara1992,
author = "Kashiwabara, Toshinobu and Masuda, Sumio and Nakajima, Kazuo and Fujisawa, Toshio",
doi = "10.1016/0196-6774(92)90012-2",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
month = "mar",
number = "1",
pages = "161--174",
title = "Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph",
uri = "http://www.sciencedirect.com/science/article/pii/0196677492900122",
volume = "13",
year = "1992",
}
@article{Katoh1981,
author = "Katoh, N. and Ibaraki, T. and Mine, H.",
doi = "10.1137/0210017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,and e is a,associated with each edge,be an undirected connected,computational complexity,e,e e,edges,graph algorithm,graph with no parallel,introduction,is,kth minimum spanning tree,let g,problem is to find,set of m edges,set of n vertices,the,the minimum spanning tree,the weight w,v,where v is a",
link = "http://epubs.siam.org/doi/abs/10.1137/0210017",
number = "2",
pages = "247--255",
title = "Minimum Spanning Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210017",
volume = "10",
year = "1981",
}
@article{Katoh2009a,
address = "New York, New York, USA",
author = "Katoh, Naoki and Tanigawa, Shin-ichi",
doi = "10.1007/s00454-009-9164-4",
isbn = "9781605580715",
issn = "01795376",
journal = "Discrete and Computational Geometry",
keyword = "Enumeration,Non-crossing geometric graphs,Triangulations",
link = "http://link.springer.com/10.1007/s00454-009-9164-4",
month = "apr",
number = "3",
pages = "443--468",
publisher = "ACM Press",
title = "Fast enumeration algorithms for non-crossing geometric graphs",
uri = "http://link.springer.com/10.1007/s00454-009-9164-4",
volume = "42",
year = "2009",
}
@article{Kawano2005a,
author = "Kawano, Shin-ichiro and Nakano, Shin-ichi",
doi = "10.1093/ietfec/e88-a.5.1129",
issn = "09168508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
keyword = "Algorithm,Enumeration,Series-parallel graph",
link = "http://search.ieice.org/bin/summary.php?id=e88-a_5_1129\&category=A\&year=2005\&lang=E\&abst=",
number = "5",
pages = "1129--1135",
title = "Generating all series-parallel graphs",
uri = "http://search.ieice.org/bin/summary.php?id=e88-a_5_1129&category=A&year=2005&lang=E&abst=",
volume = "E88-A",
year = "2005",
}
@article{Kawano2005b,
author = "Kawano, Shin-ichiro and Nakano, Shin-ichi",
doi = "10.1093/ietfec/e88-a.4.930",
issn = "09168508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
keyword = "Algorithm,Enumeration,Gray code,The bell number,The stirling number of the second kind",
link = "http://search.ieice.org/bin/summary.php?id=e88-a_4_930\&category=A\&year=2005\&lang=E\&abst=",
month = "apr",
number = "4",
pages = "930--934",
title = "Constant time generation of set partitions",
uri = "http://search.ieice.org/bin/summary.php?id=e88-a_4_930&category=A&year=2005&lang=E&abst=",
volume = "E88-A",
year = "2005",
}
@inproceedings{Kazana2013b,
address = "New York, New York, USA",
author = "Kazana, Wojciech and Segoufin, Luc",
booktitle = "PODS 2013: the 32nd symposium on Principles of database systems",
doi = "10.1145/2463664.2463667",
editor = "Hull, Richard",
isbn = "9781450320665",
keyword = "bounded expansion,enumeration,first-order",
link = "http://dl.acm.org/citation.cfm?id=2463664.2463667 http://dl.acm.org/citation.cfm?doid=2463664.2463667",
month = "jun",
pages = "297",
publisher = "ACM Press",
title = "Enumeration of first-order queries on classes of structures with bounded expansion",
uri = "http://dl.acm.org/citation.cfm?id=2463664.2463667",
year = "2013",
}
@article{Kazana2013c,
address = "New York, New York, USA",
author = "Kazana, Wojciech and Segoufin, Luc",
doi = "10.1145/2528928",
isbn = "9781450320665",
issn = "15293785",
journal = "ACM Transactions on Computational Logic",
keyword = "bounded expansion,enumeration,first-order",
link = "http://dx.doi.org/10.1145/2528928",
month = "nov",
number = "4",
pages = "25:1--25:12",
publisher = "ACM Press",
title = "Enumeration of Monadic Second-Order Queries on Trees",
uri = "http://dx.doi.org/10.1145/2528928",
volume = "14",
year = "2013",
}
@article{Kazana2013d,
author = "Kazana, Wojciech and Segoufin, Luc",
doi = "10.1145/2528928",
isbn = "9781450320665",
issn = "15293785",
journal = "ACM Transactions on Computational Logic",
keyword = "bounded expansion,enumeration,first-order",
link = "http://doi.acm.org/10.1145/2528928",
number = "4",
pages = "25:1--25:12",
title = "Enumeration of monadic second-order queries on trees",
uri = "http://doi.acm.org/10.1145/2528928",
volume = "14",
year = "2013",
}
@inproceedings{Khachiyan2005,
address = "Sanya, Hainan, China",
author = "Khachiyan, L and Boros, E and Borys, K",
booktitle = "ISAAC 2005: the 16th International Symposium on Algorithms and Computation",
doi = "10.1007/11602613_17",
editor = "Deng, Xiaotie and Du, Ding-Zhu",
link = "http://link.springer.com/chapter/10.1007/11602613_17",
month = "dec",
pages = "156--165",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs",
uri = "http://link.springer.com/chapter/10.1007/11602613_17",
volume = "3827",
year = "2005",
}
@inproceedings{Khachiyan2006a,
address = "Zurich, Switzerland",
author = "Khachiyan, L and Boros, E and Borys, K",
booktitle = "ESA 2006: the 14th Annual European Symposium on Algorithms",
doi = "10.1007/11841036_41",
editor = "Azar, Yossi and Erlebach, Thomas",
link = "http://link.springer.com/chapter/10.1007/11841036_41",
month = "sep",
pages = "444--455",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating spanning and connected subsets in graphs and matroids",
uri = "http://link.springer.com/chapter/10.1007/11841036_41",
volume = "4168",
year = "2006",
}
@article{Khachiyan2007,
author = "Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa",
doi = "10.1016/j.dam.2006.04.032",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
month = "jan",
number = "2",
pages = "137--149",
title = "Enumerating disjunctions and conjunctions of paths and cuts in reliability theory",
volume = "155",
year = "2007",
}
@article{Khachiyan2008a,
author = "Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa",
doi = "10.1007/s00453-007-9111-9",
issn = "01784617",
journal = "Algorithmica",
keyword = "Cut conjunction,Cut generation,Graph,Matroid,Multicut",
link = "http://link.springer.com/article/10.1007\%2Fs00453-007-9111-9",
number = "3",
pages = "239--263",
title = "Generating cut conjunctions in graphs and related problems",
uri = "http://link.springer.com/article/10.1007%2Fs00453-007-9111-9",
volume = "51",
year = "2008",
}
@article{Kijima2010,
author = "Kijima, Shuji and Kiyomi, Masashi and Okamoto, Yoshio and Uno, Takeaki",
doi = "10.1016/j.tcs.2010.03.024",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/S0304397510001611",
month = "Jun",
number = "26-28",
pages = "2591--2601",
title = "On Listing, Sampling, and Counting the Chordal Graphs With Edge Constraints",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397510001611",
volume = "411",
year = "2010",
}
@article{Kiyomi2006,
author = "Kiyomi, Masashi and Takeaki, Uno",
doi = "10.1093/ietisy/e89-d.2.763",
issn = "0916-8532",
journal = "IEICE Transactions on Information and Systems",
keyword = "chordal graph,constant time,enumeration",
link = "http://search.ieice.org/bin/summary.php?id=e89-d_2_763\&category=D\&year=2006\&lang=E\&abst= http://search.ieice.org/bin/summary.php?id=e89-d_2_763",
month = "feb",
number = "2",
pages = "763--770",
title = "Generating Chordal Graphs Included in Given Graphs",
uri = "http://search.ieice.org/bin/summary.php?id=e89-d_2_763&category=D&year=2006&lang=E&abst=",
volume = "E89-D",
year = "2006",
}
@inproceedings{Kiyomi2006a,
address = "Bergen, Norway",
author = "Kiyomi, Masashi and Kijima, Shuji and Uno, Takeaki",
booktitle = "WG 2006: the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/11917496_7",
editor = "Fomin, Fedor V.",
link = "http://link.springer.com/chapter/10.1007/11917496_7",
month = "jun",
pages = "68--77",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Listing chordal graphs and interval graphs",
uri = "http://link.springer.com/chapter/10.1007/11917496_7",
volume = "4271",
year = "2006",
}
@inproceedings{Kiyomi2012,
address = "Bordeaux, France",
author = "Kiyomi, Masashi and Okamoto, Yoshio and Saitoh, Toshiki",
booktitle = "SEA 2012: the 11th International Symposium on Experimental Algorithms",
doi = "10.1007/978-3-642-30850-5_22",
editor = "Klasing, Ralf",
link = "http://link.springer.com/chapter/10.1007/978-3-642-30850-5_22",
month = "jun",
pages = "248--259",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-30850-5_22",
volume = "7276",
year = "2012",
}
@inproceedings{Kloks1994,
address = "France",
author = "Kloks, T and Kratsch, D",
booktitle = "STACS 1994: the 11th Annual Symposium on Theoretical Aspects of Computer Science",
doi = "10.1007/3-540-57785-8_188",
editor = "Enjalbert, Patrice and Mayr, Ernst W. and Wagner, Klaus W.",
link = "http://link.springer.com/content/pdf/10.1007/3-540-57785-8_188.pdf",
month = "feb",
pages = "759--768",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Finding all minimal separators of a graph",
uri = "http://link.springer.com/content/pdf/10.1007/3-540-57785-8_188.pdf",
volume = "775",
year = "1994",
}
@article{Kloks1998,
author = "Kloks, T. and Kratsch, D.",
doi = "10.1137/S009753979427087X",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05c85,1,68r10,algorithm,ams subject classifications,given a graph,good pair,graph,in listing certain sub-,introduction,listing algorithm,minimal pair,minimal separator,one is often interested,pii,s009753979427087x",
link = "http://epubs.siam.org/doi/abs/10.1137/S009753979427087X",
month = "jun",
number = "3",
pages = "605--613",
title = "Listing All Minimal Separators of a Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/S009753979427087X",
volume = "27",
year = "1998",
}
@article{Knop1981,
author = "Knop, J. V. and Mueller, W. R. and Jericevic, Z. and Trinajstic, N.",
doi = "10.1021/ci00030a009",
issn = "1549-9596",
journal = "Journal of Chemical Information and Modeling",
link = "http://pubs.acs.org/cgi-bin/doilookup/?10.1021/ci00030a009",
month = "may",
number = "2",
pages = "91--99",
title = "Computer enumeration and generation of trees and rooted trees",
uri = "http://pubs.acs.org/cgi-bin/doilookup/?10.1021/ci00030a009",
volume = "21",
year = "1981",
}
@article{Knuth1974,
author = "Knuth, Donald E. and Szwarcfiter, Jayme L.",
doi = "10.1016/0020-0190(74)90001-5",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "combinatorial problems,data structures,programming languages",
link = "http://www.sciencedirect.com/science/article/pii/0020019074900015 http://linkinghub.elsevier.com/retrieve/pii/0020019074900015",
month = "apr",
number = "6",
pages = "153--157",
title = "A structured program to generate all topological sorting arrangements",
uri = "http://www.sciencedirect.com/science/article/pii/0020019074900015",
volume = "2",
year = "1974",
}
@article{Knuth1979,
author = "Knuth, Donald E",
doi = "10.1016/0166-218X(79)90018-0",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0166218X79900180 http://linkinghub.elsevier.com/retrieve/pii/0166218X79900180",
month = "sep",
number = "1-2",
pages = "117--125",
title = "Lexicographic permutations with restrictions",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X79900180",
volume = "1",
year = "1979",
}
@article{Koch2001,
author = "Koch, Ina",
doi = "10.1016/S0304-3975(00)00286-3",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Bron–Kerbosch algorithm,Cliques,Connected maximal common subgraphs,Graph theory",
link = "http://www.sciencedirect.com/science/article/pii/S0304397500002863 http://linkinghub.elsevier.com/retrieve/pii/S0304397500002863",
month = "jan",
number = "1-2",
pages = "1--30",
title = "Enumerating All Connected Maximal Common Subgraphs in Two Graphs",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397500002863",
volume = "250",
year = "2001",
}
@article{Koda1993,
author = "Koda, Y. and Ruskey, F.",
doi = "10.1006/jagm.1993.1044",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0196677483710448 http://linkinghub.elsevier.com/retrieve/pii/S0196677483710448",
month = "sep",
number = "2",
pages = "324--340",
title = "A Gray Code for the Ideals of a Forest Poset",
uri = "http://www.sciencedirect.com/science/article/pii/S0196677483710448",
volume = "15",
year = "1993",
}
@article{Komusiewicz2009,
author = "Komusiewicz, Christian and H{\"{u}}ffner, Falk and Moser, Hannes and Niedermeier, Rolf",
doi = "10.1016/j.tcs.2009.04.021",
isbn = "9783540735441",
issn = "03043975",
journal = "Theoretical Computer Science",
number = "38-40",
pages = "3640--3654",
publisher = "Elsevier B.V.",
title = "Isolation concepts for efficiently enumerating dense subgraphs",
volume = "410",
year = "2009",
}
@inproceedings{Komusiewicz2019,
author = "Komusiewicz, Christian and Sommer, Frank",
booktitle = "SOFSEM 2019: the 45th International Conference on Current Trends in Theory and Practice of Computer Science",
doi = "10.1007/978-3-030-10801-4_22",
isbn = "978-3-642-27659-0",
pages = "272--284",
publisher = "Springer International Publishing",
title = "Enumerating Connected Induced Subgraphs: Improved Delay and Experimental Comparison",
volume = "7147",
year = "2019",
}
@article{Korsh1994,
author = "Korsh, James F.",
doi = "10.1016/0020-0190(94)00149-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,Trees",
link = "http://www.sciencedirect.com/science/article/pii/0020019094001499 http://linkinghub.elsevier.com/retrieve/pii/0020019094001499",
month = "dec",
number = "5",
pages = "243--247",
title = "Loopless generation of k-ary tree sequences",
uri = "http://www.sciencedirect.com/science/article/pii/0020019094001499",
volume = "52",
year = "1994",
}
@article{Korsh1998,
author = "Korsh, James F. and Lipschutz, Seymour",
doi = "10.1016/S0020-0190(97)00215-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Binary trees,Combinatorial algorithms,Combinatorial problems,Data structures,Loopless generation,k-ary trees",
link = "http://www.sciencedirect.com/science/article/pii/S0020019097002159 http://linkinghub.elsevier.com/retrieve/pii/S0020019097002159",
month = "mar",
number = "5",
pages = "235--240",
title = "Shifts and loopless generation of k-ary trees",
uri = "http://www.sciencedirect.com/science/article/pii/S0020019097002159",
volume = "65",
year = "1998",
}
@article{Kroft1967b,
author = "Kroft, D.",
doi = "10.1109/PROC.1967.5389",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1447319",
month = "jan",
number = "1",
pages = "88--90",
title = "All paths through a maze",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1447319",
volume = "55",
year = "1967",
}
@inproceedings{Krzywkowski2013,
address = "Dalian, China",
author = "Krzywkowski, Marcin",
booktitle = "FAW-AAIM 2013: the 3rd Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management",
doi = "10.1007/978-3-642-38756-2_4",
editor = "Fellows, Michael and Tan, Xuehou and Zhu, Binhai",
keyword = "2-domination,combinatorial bound,domination,exponential algorithm,listing algorithm,minimal 2-dominating set,tree",
link = "http://link.springer.com/chapter/10.1007/978-3-642-38756-2_4",
month = "jun",
pages = "12--16",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An algorithm for listing all minimal 2-dominating sets of a tree",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-38756-2_4",
volume = "7924",
year = "2013",
}
@article{Krzywkowski2014,
author = "Krzywkowski, Marcin",
doi = "10.3233/FI-2014-998",
isbn = "9783642387555",
issn = "01692968",
journal = "Fundamenta Informaticae",
number = "4",
pages = "415--421",
title = "An algorithm for listing all minimal double dominating sets of a tree",
volume = "130",
year = "2014",
}
@article{Laumond1985,
author = "Laumond, Jean-Paul",
doi = "10.1016/0020-0190(85)90055-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Planar graph,connectivity",
link = "http://www.sciencedirect.com/science/article/pii/0020019085900559 http://linkinghub.elsevier.com/retrieve/pii/0020019085900559",
month = "oct",
number = "4",
pages = "173--179",
title = "Enumeration of articulation pairs of a planar graph",
uri = "http://www.sciencedirect.com/science/article/pii/0020019085900559",
volume = "21",
year = "1985",
}
@article{Lawler1972,
author = "Lawler, E. L.",
doi = "10.1287/mnsc.18.7.401",
issn = "0025-1909",
journal = "Management Science",
link = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.18.7.401",
number = "7",
pages = "401--405",
title = "A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem",
uri = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.18.7.401",
volume = "18",
year = "1972",
}
@article{Leung1984,
author = "Leung, Joseph Y.-T.",
doi = "10.1016/0196-6774(84)90037-3",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677484900373 http://linkinghub.elsevier.com/retrieve/pii/0196677484900373",
month = "mar",
number = "1",
pages = "22--35",
title = "Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs",
uri = "http://www.sciencedirect.com/science/article/pii/0196677484900373",
volume = "5",
year = "1984",
}
@inproceedings{Li1999,
author = "Li, Gang and Ruskey, Frank",
booktitle = "SODA 1999: the 10th annual ACM-SIAM symposium on Discrete algorithms",
isbn = "0-89871-434-6",
link = "http://dl.acm.org/citation.cfm?id=314500.314932",
month = "jan",
pages = "939--940",
publisher = "Society for Industrial and Applied Mathematics",
title = "The advantages of forward thinking in generating rooted and free trees",
uri = "http://dl.acm.org/citation.cfm?id=314500.314932",
year = "1999",
}
@article{Li2003,
author = "Li, Zhang-Jian and Nakano, Shin-ichi",
doi = "MY/ietisy/e86-d.4.698",
issn = "09168532",
journal = "IEICE transactions on information and systems",
link = "http://ci.nii.ac.jp/naid/110003223268/",
number = "4",
pages = "698--703",
publisher = "一般社団法人電子情報通信学会",
title = "Generating Biconnected Plane Quadrangulations",
uri = "http://ci.nii.ac.jp/naid/110003223268/",
volume = "E86-D",
year = "2003",
}
@article{Loizou1982,
author = "Loizou, G. and Thanisch, P.",
doi = "10.1016/0020-0255(82)90023-8",
issn = "00200255",
journal = "Information Sciences",
link = "http://linkinghub.elsevier.com/retrieve/pii/0020025582900238",
month = "aug",
number = "3",
pages = "163--182",
title = "Enumerating the cycles of a digraph: A new preprocessing strategy",
uri = "http://linkinghub.elsevier.com/retrieve/pii/0020025582900238",
volume = "27",
year = "1982",
}
@article{Loukakis1981,
author = "Loukakis, E. and Tsouros, C.",
doi = "10.1007/BF02277184",
issn = "0010-485X",
journal = "Computing",
link = "http://link.springer.com/10.1007/BF02277184",
month = "dec",
number = "4",
pages = "349--366",
title = "A Depth First Search Algorithm to Generate the Family of Maximal Independent Sets of a Graph Lexicographically",
uri = "http://link.springer.com/10.1007/BF02277184",
volume = "27",
year = "1981",
}
@article{Lucas1987,
author = "Lucas, Joan M.",
doi = "10.1016/0196-6774(87)90048-4",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677487900484 http://linkinghub.elsevier.com/retrieve/pii/0196677487900484",
month = "dec",
number = "4",
pages = "503--535",
title = "The Rotation Graph of Binary Trees Is Hamiltonian",
uri = "http://www.sciencedirect.com/science/article/pii/0196677487900484",
volume = "8",
year = "1987",
}
@article{Lucas1993,
author = "Lucas, Joan M. and Vanbaronaigien, D.R. and Ruskey, Frank",
doi = "10.1006/jagm.1993.1045",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S019667748371045X http://linkinghub.elsevier.com/retrieve/pii/S019667748371045X",
month = "nov",
number = "3",
pages = "343--366",
title = "On Rotations and the Generation of Binary Trees",
uri = "http://www.sciencedirect.com/science/article/pii/S019667748371045X",
volume = "15",
year = "1993",
}
@article{MacWilliams1958,
author = "MacWilliams, J.",
doi = "10.1109/TCT.1958.1086460",
issn = "00962007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "228--229",
title = "Topological Network Analysis as a Computer Program",
volume = "5",
year = "1958",
}
@article{Mai1984,
author = "Mai, Shao-Wen and Evans, D.J.",
doi = "10.1016/S0167-8191(84)90197-2",
issn = "01678191",
journal = "Parallel Computing",
month = "dec",
number = "3-4",
pages = "275--286",
title = "A parallel algorithm for the enumeration of the spanning trees of a graph",
volume = "1",
year = "1984",
}
@inproceedings{Makino2004,
address = "Humleb\ae k, Denmark",
author = "Makino, Kazuhisa and Uno, Takeaki",
booktitle = "SWAT 2004: the 9th Scandinavian Workshop on Algorithm Algorithm Theory",
doi = "10.1007/978-3-540-27810-8_23",
editor = "Hagerup, Torben and Katajainen, Jyrki",
link = "http://link.springer.com/chapter/10.1007/978-3-540-27810-8_23",
month = "jul",
pages = "260--272",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "New algorithms for enumerating all maximal cliques",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-27810-8_23",
volume = "3111",
year = "2004",
}
@article{Manas1968,
author = "Maňas, Miroslav and Nedoma, Josef",
doi = "10.1007/BF02162916",
issn = "0029-599X",
journal = "Numerische Mathematik",
link = "http://link.springer.com/10.1007/BF02162916",
month = "oct",
number = "3",
pages = "226--229",
title = "Finding all vertices of a convex polyhedron",
uri = "http://link.springer.com/10.1007/BF02162916",
volume = "12",
year = "1968",
}
@article{Manes2011,
author = "Manes, K. and Sapounakis, A. and Tasoulas, I. and Tsikouras, P.",
issn = "1077-8926",
journal = "The Electronic Journal of Combinatorics",
link = "http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p74",
number = "1",
pages = "74--95",
title = "General Results on the Enumeration of Strings in Dyck Paths",
uri = "http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p74",
volume = "18",
year = "2011",
}
@article{Martelli1976a,
author = "Martelli, Alberto",
doi = "10.1145/321921.321928",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=321921.321928 http://portal.acm.org/citation.cfm?doid=321921.321928",
month = "jan",
number = "1",
pages = "58--73",
publisher = "ACM",
title = "A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph",
uri = "http://dl.acm.org/citation.cfm?id=321921.321928",
volume = "23",
year = "1976",
}
@article{Martello1983,
author = "Martello, Silvano",
doi = "10.1145/356022.356030",
issn = "00983500",
journal = "ACM Transactions on Mathematical Software",
link = "http://portal.acm.org/citation.cfm?doid=356022.356030",
month = "mar",
number = "1",
pages = "131--138",
title = "Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph",
uri = "http://portal.acm.org/citation.cfm?doid=356022.356030",
volume = "9",
year = "1983",
}
@article{Martins1984,
author = "Martins, Ernesto de Queir\'{o}s Vieira",
doi = "10.1016/0377-2217(84)90269-8",
issn = "01716468",
journal = "European Journal of Operational Research",
link = "http://www.sciencedirect.com/science/article/pii/0377221784902698",
number = "1",
pages = "123--130",
title = "An algorithm for ranking paths that may contain cycles",
uri = "http://www.sciencedirect.com/science/article/pii/0377221784902698",
volume = "18",
year = "1984",
}
@inproceedings{Masada1996,
address = "Philadelphia, PA, USA",
author = "Masada, Tomonari and Imai, Hiroshi and Imai, Keiko",
booktitle = "SCG 1996: the 12th annual symposium on Computational geometry",
doi = "10.1145/237218.237373",
editor = "Whitesides, Sue",
isbn = "0897918045",
link = "http://dl.acm.org/citation.cfm?id=237218.237373 http://portal.acm.org/citation.cfm?doid=237218.237373",
month = "may",
pages = "224--233",
publisher = "ACM Press",
title = "Enumeration of regular triangulations",
uri = "http://dl.acm.org/citation.cfm?id=237218.237373",
year = "1996",
}
@article{Mateti1976a,
author = "Mateti, Prabhaker and Deo, Narsingh",
doi = "10.1137/0205007",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "adjacency matrix,algorithms,backtrack,circuit vector space,circuit-graph,circuits,cycles,dicircuits,graph search,graph theory",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0205007",
month = "mar",
number = "1",
pages = "90--99",
publisher = "Society for Industrial and Applied Mathematics",
title = "On Algorithms for Enumerating All Circuits of a Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0205007",
volume = "5",
year = "1976",
}
@article{Matsui1994,
author = "Matsui, Tomomi and Tamura, Akihisa and Ikebe, Yoshiko",
doi = "10.1016/0166-218X(92)00175-L",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0166218X9200175L",
number = "3",
pages = "283--296",
title = "Algorithms for finding a Kth best valued assignment",
uri = "http://www.sciencedirect.com/science/article/pii/0166218X9200175L",
volume = "50",
year = "1994",
}
@inproceedings{Matsui1996a,
address = "KAIST,Taejon,Korea",
author = "Matsui, Yasuko and Uno, Takeaki",
booktitle = "Korea-Japan Joint Workshop on Algorithms and Computation",
link = "http://homepage3.nifty.com/yasuko835/",
month = "aug",
pages = "81--87",
title = "A simple and fast algorithm for enumerating all edge colorings of a bipartite graph",
uri = "http://homepage3.nifty.com/yasuko835/",
year = "1996",
zzzdoi = "MY/MATSUI_UNO_1996_WAAC",
zzzeditor = "-, -",
}
@book{Matsui1996b,
author = "Matsui, Yasuko and Matsui, Tomomi",
doi = "10.1007/3-540-61576-8_69",
isbn = "978-3-540-61576-7",
link = "http://www.springerlink.com/index/10.1007/3-540-61576-8",
pages = "18--26",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration Algorithm for the Edge Coloring Problem on Bipartite Graphs",
uri = "http://www.springerlink.com/index/10.1007/3-540-61576-8",
volume = "1120",
year = "1996",
}
@article{Matsui1997,
author = "Matsui, T.",
doi = "10.1007/PL00009171",
issn = "0178-4617",
journal = "Algorithmica",
link = "http://link.springer.com/10.1007/PL00009171",
month = "aug",
number = "4",
pages = "530--543",
title = "A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs",
uri = "http://link.springer.com/10.1007/PL00009171",
volume = "18",
year = "1997",
}
@inproceedings{Matsui2008,
address = "Gold Coast, Australia",
author = "Matsui, Yasuko and Uehara, Ryuhei and Uno, Takeaki",
booktitle = "ISAAC 2008: the 19th International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-540-92182-0_75",
editor = "Hong, Seok-Hee and Nagamochi, Hiroshi and Fukunaga, Takuro",
keyword = "chordal graph,clique tree,enumeration,perfect sequence",
link = "http://link.springer.com/chapter/10.1007/978-3-540-92182-0_75",
month = "dec",
pages = "859--870",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration of Perfect Sequences of Chordal Graph",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-92182-0_75",
volume = "5369",
year = "2008",
}
@article{Matsui2010,
author = "Matsui, Yasuko and Uehara, Ryuhei and Uno, Takeaki",
doi = "10.1016/j.tcs.2010.06.007",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Chordal graph,Clique tree,Enumeration,Perfect sequence",
link = "http://www.sciencedirect.com/science/article/pii/S0304397510003415 http://linkinghub.elsevier.com/retrieve/pii/S0304397510003415",
month = "sep",
number = "40-42",
pages = "3635--3641",
title = "Enumeration of the Perfect Sequences of a Chordal Graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397510003415",
volume = "411",
year = "2010",
}
@article{Mattheiss1973,
author = "Mattheiss, T. H.",
doi = "10.1287/opre.21.1.247",
issn = "0030-364X",
journal = "Operations Research",
month = "feb",
number = "1",
pages = "247--260",
title = "An Algorithm for Determining Irrelevant Constraints and all Vertices in Systems of Linear Inequalities",
volume = "21",
year = "1973",
}
@article{Mattheiss1980,
author = "Mattheiss, T. H. and Schmidt, Brian K.",
doi = "10.1007/BF01588326",
issn = "0025-5610",
journal = "Mathematical Programming",
month = "dec",
number = "1",
pages = "308--329",
title = "{Computational results on an algorithm for finding all vertices of a polytope}",
volume = "18",
year = "1980",
}
@article{Maxwell1966,
author = "Maxwell, L.M. and Cline, J.M.",
doi = "10.1049/piee.1966.0224",
issn = "00203270",
journal = "Proceedings of the Institution of Electrical Engineers",
number = "8",
pages = "1344",
title = "Topological network analysis by algebraic methods",
volume = "113",
year = "1966",
}
@article{Mayeda1965a,
author = "Mayeda, W. and Seshu, S.",
doi = "10.1109/TCT.1965.1082432",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
keyword = "Application software,Application specific integrated circuits,Circuit theory,Computer networks,Graph theory,Military computing,Transfer functions,Transformers,Tree graphs",
language = "English",
link = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=1082432 http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082432",
month = "jun",
number = "2",
pages = "181--185",
publisher = "IEEE",
title = "Generation of Trees without Duplications",
uri = "http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=1082432",
volume = "12",
year = "1965",
}
@article{Mayr1992,
author = "Mayr, Ernst W and Plaxton, C Greg",
doi = "10.1007/BF01305236",
issn = "02099683",
journal = "Combinatorica",
keyword = "05C85,68R10,AMS subject classification code (1991): 05C05",
link = "http://link.springer.com/article/10.1007/BF01305236",
number = "4",
pages = "433--447",
title = "On the spanning trees of weighted graphs",
uri = "http://link.springer.com/article/10.1007/BF01305236",
volume = "12",
year = "1992",
}
@article{Mazoit2006,
author = "Mazoit, F.",
doi = "10.1016/j.disc.2005.12.007",
issn = "0012365X",
journal = "Discrete Mathematics",
keyword = "Enumeration,Minimal separator,Planar graphs",
link = "http://www.sciencedirect.com/science/article/pii/S0012365X05006138 http://linkinghub.elsevier.com/retrieve/pii/S0012365X05006138",
month = "feb",
number = "3",
pages = "372--380",
title = "Listing all the minimal separators of a 3-connected planar graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0012365X05006138",
volume = "306",
year = "2006",
}
@article{McIlroy1969,
author = "McIlroy, M. Douglas",
doi = "10.1145/363219.363229",
issn = "00010782",
journal = "Communications of the ACM",
month = "sep",
number = "9",
pages = "511",
title = "Algorithm 354: generator of spanning trees [H]",
volume = "12",
year = "1969",
}
@article{McKay1970,
author = "McKay, J. K. S.",
doi = "10.1145/361953.361980",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "number theory,partitions",
link = "http://dl.acm.org/citation.cfm?id=361953.361980 http://portal.acm.org/citation.cfm?doid=361953.361980",
month = "jan",
number = "1",
pages = "52",
publisher = "ACM",
title = "Algorithm 371: Partitions in natural order [A1]",
uri = "http://dl.acm.org/citation.cfm?id=361953.361980",
volume = "13",
year = "1970",
}
@article{McKay1998,
author = "McKay, Brendan D.",
doi = "10.1006/jagm.1997.0898",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0196677497908981 http://linkinghub.elsevier.com/retrieve/pii/S0196677497908981",
month = "feb",
number = "2",
pages = "306--324",
title = "Isomorph-Free Exhaustive Generation",
uri = "http://www.sciencedirect.com/science/article/pii/S0196677497908981",
volume = "26",
year = "1998",
}
@article{Megiddo1981,
author = "Megiddo, N. and Tamir, A. and Zemel, E. and Chandrasekaran, R.",
doi = "10.1137/0210023",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,by several authors that,fact,found in linear time,in some structured sets,in the cardinality of,introduction,it has been observed,it is now well,known that the kth,largest element of an,location theory,ordered,p-center,polynomial algorithm,s,selection,set s can be,since the discovery of,that,the kth largest,tree",
link = "http://epubs.siam.org/doi/abs/10.1137/0210023",
number = "2",
pages = "328--337",
title = "An $O(n\log^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210023",
volume = "10",
year = "1981",
}
@techreport{Micciancio:Walter:Int_Math_Comp_Sci:2014,
author = "Micciancio, Daniele and Walter, Michael",
link = "http://eprint.iacr.org/2014/569",
title = "Fast Lattice Point Enumeration With Minimal Overhead",
uri = "http://eprint.iacr.org/2014/569",
year = "2014",
}
@article{Minty1965,
author = "Minty, George J.",
doi = "10.1109/TCT.1965.1082385",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1082385",
number = "1",
pages = "120",
title = "A Simple Algorithm for Listing All the Trees of a Graph",
uri = "http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1082385",
volume = "12",
year = "1965",
}
@article{Minty1980,
author = "Minty, George J.",
doi = "10.1016/0095-8956(80)90074-X",
issn = "00958956",
journal = "Journal of Combinatorial Theory, Series B",
link = "http://linkinghub.elsevier.com/retrieve/pii/009589568090074X",
month = "jun",
number = "3",
pages = "284--304",
title = "On maximal independent sets of vertices in claw-free graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/009589568090074X",
volume = "28",
year = "1980",
}
@article{Mulligan1972,
author = "Mulligan, Gordon D. and Corneil, D. G.",
doi = "10.1145/321694.321698",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=321694.321698",
month = "apr",
number = "2",
pages = "244--247",
publisher = "ACM",
title = "Corrections to Bierstone's Algorithm for Generating Cliques",
uri = "http://portal.acm.org/citation.cfm?doid=321694.321698",
volume = "19",
year = "1972",
}
@article{Murty1968,
author = "Murty, K. G.",
doi = "10.1287/opre.16.3.682",
issn = "0030-364X",
journal = "Operations Research",
link = "http://pubsonline.informs.org/doi/abs/10.1287/opre.16.3.682",
number = "3",
pages = "682--687",
title = "Letter to the Editor--An Algorithm for Ranking All the Assignments in Order of Increasing Cost",
uri = "http://pubsonline.informs.org/doi/abs/10.1287/opre.16.3.682",
volume = "16",
year = "1968",
}
@article{Nagamochi1997,
author = "Nagamochi, Hiroshi and Nishimura, Kazuhiro and Ibaraki, Toshihide",
doi = "10.1137/S0895480194271323",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
number = "3",
pages = "469--481",
title = "Computing All Small Cuts in an Undirected Network",
volume = "10",
year = "1997",
}
@inproceedings{Nakano2001,
address = "Guilin, China",
author = "Nakano, Shin-ichi",
booktitle = "COCOON 2001: the 7th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/3-540-44679-6_15",
editor = "Wang, Jie",
isbn = "8127730181",
link = "http://link.springer.com/chapter/10.1007/3-540-44679-6_15",
month = "aug",
pages = "131--141",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Generation of Triconnected Plane Triangulations",
uri = "http://link.springer.com/chapter/10.1007/3-540-44679-6_15",
volume = "2108",
year = "2001",
}
@inproceedings{Nakano2001a,
address = "Christchurch, New Zealand,",
author = "Nakano, Shin-ichi",
booktitle = "ISAAC 2001: the 12th International Symposium on Algorithms and Computation",
doi = "10.1007/3-540-45678-3_10",
editor = "Eades, Peter and Takaoka, Tadao",
isbn = "8127730181",
keyword = "enumeration,graphs,listing,plane graphs",
link = "http://link.springer.com/chapter/10.1007/3-540-45678-3_10",
month = "dec",
pages = "107--115",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating Floorplans with n Rooms",
uri = "http://link.springer.com/chapter/10.1007/3-540-45678-3_10",
volume = "2223",
year = "2001",
}
@article{Nakano2002,
author = "Nakano, Shin-ichi",
doi = "10.1016/S0020-0190(02)00240-5",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "algorithms,enumeration,graphs,listing,plane graphs,plane trees",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0020019002002405",
month = "nov",
number = "3",
pages = "167--172",
title = "Efficient generation of plane trees",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0020019002002405",
volume = "84",
year = "2002",
}
@techreport{Nakano2003,
address = "Japan",
author = "Nakano, Shin-ichi and Uno, Takeaki",
institution = "National Institute for Infomatics",
link = "http://www.nii.ac.jp/TechReports/03-005E.pdf",
number = "Tech. Rep. NII-2003-005E",
title = "Efficient generation of rooted trees",
uri = "http://www.nii.ac.jp/TechReports/03-005E.pdf",
year = "2003",
zzzdoi = "MY/Nakano_Uno_2003_NIItech",
}
@inproceedings{Nakano2004,
address = "Honnef, Germany",
author = "Nakano, Shin-ichi and Uno, Takeaki",
booktitle = "WG 2004: the 30th International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/978-3-540-30559-0_3",
editor = "Hromkovi{\v{c}}, Juraj and Nagl, Manfred and Westfechtel, Bernhard",
link = "http://link.springer.com/chapter/10.1007/978-3-540-30559-0_3",
month = "jun",
pages = "33--45",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant TIme Generation of Trees with Specified Diameter",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-30559-0_3",
volume = "3353",
year = "2004",
}
@inproceedings{Nakano2004a,
address = "Crete, Greece",
author = "Li, Zhangjian and Nakano, Shin-ichi",
booktitle = "ICALP 2001: the 28th International Colloquium on Automata, Languages and Programming",
doi = "10.1007/3-540-48224-5_36",
editor = "Orejas, Fernando and Spirakis, Paul G. and van Leeuwen, Jan",
keyword = "Listing,Plane graphs,Plane triangulations",
link = "http://link.springer.com/chapter/10.1007/3-540-48224-5_36",
month = "jul",
pages = "433--443",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Generation of Plane Triangulations without Repetitions",
uri = "http://link.springer.com/chapter/10.1007/3-540-48224-5_36",
volume = "2076",
year = "2001",
}
@inproceedings{Nakano2004b,
address = "Perugia, Italy",
author = "Nakano, Shin-ichi and Uno, Takeaki",
booktitle = "the11th International Symposium on Graph Drawing - GD 2004",
doi = "10.1007/978-3-540-24595-7_25",
editor = "Liotta, Giuseppe",
link = "http://link.springer.com/chapter/10.1007/978-3-540-24595-7_25",
month = "sep",
pages = "273--282",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "More Efficient Generation of Plane Triangulations",
uri = "http://link.springer.com/chapter/10.1007/978-3-540-24595-7_25",
volume = "2912",
year = "2004",
}
@inproceedings{Nakano2005a,
address = "Metz, France",
author = "Nakano, Shin-ichi and Uno, Takeaki",
booktitle = "WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/11604686_22",
editor = "Kratsch, Dieter",
isbn = "3540310002",
issn = "03029743",
link = "http://link.springer.com/chapter/10.1007/11604686_22",
month = "jun",
pages = "249--260",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating colored trees",
uri = "http://link.springer.com/chapter/10.1007/11604686_22",
volume = "3787",
year = "2005",
}
@article{Nakano2009,
author = "Nakano, Shin-ichi",
issn = "18802818",
journal = "数理解析研究所講究録",
link = "http://ci.nii.ac.jp/naid/110007089589/",
number = "-",
pages = "55--62",
publisher = "京都大学",
title = "Listing All Trees with Specified Degree Sequence (Acceleration and Visualization of Computation for Enumeration Problems)",
uri = "http://ci.nii.ac.jp/naid/110007089589/",
volume = "1644",
year = "2009",
zzzdoi = "MY/NAKANO_2009_Kyoto_Cor",
}
@article{Narayana1971,
author = "Narayana, T.V and Mathsen, R.M and Sarangi, J",
doi = "10.1016/0097-3165(71)90007-0",
issn = "00973165",
journal = "Journal of Combinatorial Theory, Series A",
link = "http://www.sciencedirect.com/science/article/pii/0097316571900070",
month = "jul",
number = "1",
pages = "54--61",
title = "An algorithm for generating partitions and its applications",
uri = "http://www.sciencedirect.com/science/article/pii/0097316571900070",
volume = "11",
year = "1971",
}
@article{Nutov2009,
author = "Nutov, Zeev",
doi = "10.1016/j.dam.2008.04.026",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "Intersecting families,Listing,Minimal edge-covers,Steiner network",
link = "http://www.sciencedirect.com/science/article/pii/S0166218X08002060 http://linkinghub.elsevier.com/retrieve/pii/S0166218X08002060",
month = "jan",
number = "1",
pages = "112--117",
title = "Listing minimal edge-covers of intersecting families with applications to connectivity problems",
uri = "http://www.sciencedirect.com/science/article/pii/S0166218X08002060",
volume = "157",
year = "2009",
}
@inproceedings{Okamoto2005a,
address = "Metz, France",
author = "Okamoto, Y and Uno, T and Uehara, R",
booktitle = "WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science",
doi = "10.1007/11604686_38",
editor = "Kratsch, Dieter",
keyword = "chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm",
link = "http://link.springer.com/chapter/10.1007/11604686_38",
month = "jun",
pages = "433--444",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Linear time counting algorithms for independent sets in chordal graphs",
uri = "http://link.springer.com/chapter/10.1007/11604686_38",
volume = "3787",
year = "2005",
}
@article{Okamoto2008,
author = "Okamoto, Yoshio and Uno, Takeaki and Uehara, Ryuhei",
doi = "10.1016/j.jda.2006.07.006",
issn = "15708667",
journal = "Journal of Discrete Algorithms",
keyword = "chordal graph,counting,enumeration,independent set,np -completeness,p -completeness,polynomial time algorithm",
link = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330",
month = "jun",
number = "2",
pages = "229--242",
title = "Counting the number of independent sets in chordal graphs",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S1570866707000330",
volume = "6",
year = "2008",
}
@inproceedings{Ono2005,
address = "L{\"{u}}beck, Germany",
author = "Ono, Akimitsu and Nakano, Shin-ichi",
booktitle = "FCT 2005: the 15th International Symposium on Fundamentals of Computation Theory",
doi = "10.1007/11537311_39",
editor = "Li\'{s}kiewicz, Maciej and Reischuk, R\"{u}diger",
isbn = "978-3-540-28193-1",
link = "http://link.springer.com/chapter/10.1007/11537311_39",
month = "aug",
pages = "445--453",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant Time Generation of Linear Extensions",
uri = "http://link.springer.com/chapter/10.1007/11537311_39",
volume = "3623",
year = "2005",
}
@article{Pallo1986,
author = "Pallo, J. M.",
doi = "10.1093/comjnl/29.2.171",
issn = "0010-4620",
journal = "The Computer Journal",
month = "feb",
number = "2",
pages = "171--175",
title = "Enumerating, Ranking and Unranking Binary Trees",
volume = "29",
year = "1986",
}
@article{Pallo1987,
author = "Pallo, J.",
doi = "10.1080/00207168708803562",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
link = "http://dx.doi.org/10.1080/00207168708803562",
month = "jan",
number = "2",
pages = "133--144",
publisher = "Taylor \& Francis",
title = "Generating Trees With N Nodes and M Leaves",
uri = "http://dx.doi.org/10.1080/00207168708803562",
volume = "21",
year = "1987",
}
@inproceedings{Pan2008,
address = "Singapore",
author = "Pan, Long and Santos, Eunice E.",
booktitle = "the IEEE International Conference on Systems, Man and Cybernetics - SMC 2008",
doi = "10.1109/ICSMC.2008.4811845",
isbn = "978-1-4244-2383-5",
issn = "1062922X",
keyword = "Anytime anywhere methodologies,Maximal clique,Social network analysis",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4811845",
month = "oct",
pages = "3529--3535",
publisher = "IEEE",
title = "An anytime-anywhere approach for maximal clique enumeration in social network analysis",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4811845",
year = "2008",
zzzeditor = "-, -",
}
@article{Pardalos1994,
author = "Pardalos, Panos M. and Xue, Jue",
doi = "10.1007/BF01098364",
isbn = "978-0-7923-5924-1",
issn = "09255001",
journal = "Journal of Global Optimization",
keyword = "Maximum clique problem,NP-hard,algorithms,bibliography,graph coloring,heuristics,survey",
link = "http://link.springer.com/10.1007/BF01098364",
month = "apr",
number = "3",
pages = "301--328",
title = "The maximum clique problem",
uri = "http://link.springer.com/10.1007/BF01098364",
volume = "4",
year = "1994",
}
@inproceedings{Parvez2009,
address = "Kolkata, India",
author = "Parvez, Mohammad Tanvir and Rahman, Md Saidur and Nakano, Shin-ichi",
booktitle = "WALCOM 2009: the 3rd International Workshop on Algorithms and Computation",
doi = "10.1007/978-3-642-00202-1_14",
editor = "Das, Sandip and Uehara, Ryuhei",
isbn = "3642002013",
issn = "03029743",
keyword = "Genealogical tree,Graph,Plane graph,Polygon,Triangulation",
link = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_14",
month = "feb",
pages = "151--164",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating all triangulations of plane graphs : Extended abstract",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_14",
volume = "5431",
year = "2009",
}
@article{Percival1953,
author = "Percival, W S",
doi = "10.1049/pi-3.1953.0033",
journal = "Proceedings of the IEE - Part III: Radio and Communication Engineering",
number = "65",
pages = "143--150",
title = "The solution of passive electrical networks by means of mathematical trees",
volume = "100",
year = "1953",
}
@article{Piekarski1965,
author = "Piekarski, M.",
doi = "10.1109/TCT.1965.1082388",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
number = "1",
pages = "124--125",
title = "Listing of All Possible Trees of a Linear Graph",
volume = "12",
year = "1965",
}
@article{Ponstein1966,
author = "Ponstein, J.",
doi = "10.1137/0114051",
issn = "0036-1399",
journal = "SIAM Journal on Applied Mathematics",
keyword = "J. Ponstein",
link = "http://epubs.siam.org/doi/abs/10.1137/0114051",
month = "mar",
number = "3",
pages = "600--609",
title = "Self-Avoiding Paths and the Adjacency Matrix of a Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0114051",
volume = "14",
year = "1966",
}
@article{Proskurowski1980,
author = "Proskurowski, Andrzej",
doi = "10.1145/322169.322170",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322169.322170 http://portal.acm.org/citation.cfm?doid=322169.322170",
month = "jan",
number = "1",
pages = "1--2",
publisher = "ACM",
title = "On the Generation of Binary Trees",
uri = "http://dl.acm.org/citation.cfm?id=322169.322170",
volume = "27",
year = "1980",
}
@article{Proskurowski1985,
author = "Proskurowski, Andrzej and Ruskey, Frank",
doi = "10.1016/0196-6774(85)90040-9",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677485900409 http://linkinghub.elsevier.com/retrieve/pii/0196677485900409",
month = "jun",
number = "2",
pages = "225--238",
title = "Binary Tree Gray Codes",
uri = "http://www.sciencedirect.com/science/article/pii/0196677485900409",
volume = "6",
year = "1985",
}
@article{Proskurowski1998,
author = "Proskurowski, Andrzej and Ruskey, Frank and Smith, Malcolm",
doi = "10.1137/S0895480192234009",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05A15,05C30,60J10,68Q25,68R05,68R15,Stirling numbers,combinatorial generation,k-ary strings,k-paths,restricted growth function",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/S0895480192234009",
month = "feb",
number = "1",
pages = "94--109",
publisher = "Society for Industrial and Applied Mathematics",
title = "Analysis of Algorithms for Listing Equivalence Classes of k -ary Strings",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0895480192234009",
volume = "11",
year = "1998",
}
@article{Provan1996,
author = "Provan, J. S. and Shier, D. R.",
doi = "10.1007/BF01961544",
issn = "0178-4617",
journal = "Algorithmica",
link = "http://link.springer.com/10.1007/BF01961544",
month = "apr",
number = "4",
pages = "351--372",
title = "A paradigm for listing (s, t)-cuts in graphs",
uri = "http://link.springer.com/10.1007/BF01961544",
volume = "15",
year = "1996",
}
@article{Pruesse1991a,
author = "Pruesse, Gara and Ruskey, Frank",
doi = "10.1137/0404037",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05C45,06A05,06A06,68Q25,Hamiltonian graph,linear extension,transposition",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0404037",
month = "aug",
number = "3",
pages = "413--422",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating the Linear Extensions of Certain Posets by Transpositions",
uri = "http://epubs.siam.org/doi/abs/10.1137/0404037",
volume = "4",
year = "1991",
}
@article{Pruesse1994,
author = "Pruesse, Gara and Ruskey, Frank",
doi = "10.1137/S0097539791202647",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05c45,06a05,06a06,1,68q25,adverb,ams subject classifications,collegiate dictionary,combinatorial gray code,fast,in quick succession,introduction,is,linear extension,of,one definition of the,paper is to show,poset,s,that the linear extensions,the purpose of this,transposition,webster",
link = "http://epubs.siam.org/doi/abs/10.1137/S0097539791202647",
number = "2",
pages = "373--386",
title = "Generating Linear Extensions Fast",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0097539791202647",
volume = "23",
year = "1994",
}
@inproceedings{Ramon2007,
address = "Florence, Italy",
author = "Ramon, Jan and Nijssen, Siegfried",
booktitle = "Mining and Learning with Graphs - MLG 2007",
link = "http://eprints.pascal-network.org/archive/00003617/",
month = "aug",
pages = "4",
title = "General Graph Refinement with Polynomial Delay",
uri = "http://eprints.pascal-network.org/archive/00003617/",
year = "2007",
zzzdoi = "MY/Ramon_Nijssen_00003617",
zzzeditor = "-, -",
}
@article{Ramon2009,
author = "Ramon, Jan and Nijssen, Siegfried",
issn = "1532-4435",
journal = "The Journal of Machine Learning Research",
link = "http://dl.acm.org/citation.cfm?id=1577069.1577102",
month = "dec",
number = "-",
pages = "907--929",
publisher = "JMLR.org",
title = "Polynomial-Delay Enumeration of Monotonic Graph Classes",
uri = "http://dl.acm.org/citation.cfm?id=1577069.1577102",
volume = "10",
year = "2009",
zzzdoi = "MY/1577069.1577102",
}
@article{Rao1969,
author = "{Bapeswara Rao}, V.V. and Murti, V.G.K.",
doi = "10.1109/PROC.1969.7032",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1448962",
number = "4",
pages = "700--701",
title = "Enumeration of all circuits of a graph",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1448962",
volume = "57",
year = "1969",
}
@article{Rasmussen1995,
author = "Rasmussen, David and Savage, Carla D and West, Douglas B",
doi = "10.1016/0097-3165(95)90090-X",
issn = "00973165",
journal = "Journal of Combinatorial Theory, Series A",
link = "http://www.sciencedirect.com/science/article/pii/009731659590090X http://linkinghub.elsevier.com/retrieve/pii/009731659590090X",
month = "may",
number = "2",
pages = "201--229",
title = "Gray code enumeration of families of integer partitions",
uri = "http://www.sciencedirect.com/science/article/pii/009731659590090X",
volume = "70",
year = "1995",
}
@article{Read1975,
author = "Read, Ronald C. and Tarjan, Robert Endre",
journal = "Networks",
link = "http://scholar.google.com/scholar?hl=en{\&}btnG=Search{\&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.\#0",
number = "3",
pages = "237--252",
title = "Bounds on backtrack algorithms for listing cycles, paths, and spanning trees",
uri = "http://scholar.google.com/scholar?hl=en{&}btnG=Search{&}q=intitle:Bounds+on+backtrack+algorithms+for+listing+cycles,+paths,+and+Spanning+trees.#0",
volume = "5",
year = "1975",
}
@article{Read1987,
author = "Read, Ronald C. and Hu, Guanzhang",
doi = "10.1002/jgt.3190110412",
issn = "03649024",
journal = "Journal of Graph Theory",
month = "jan",
number = "4",
pages = "539--553",
title = "On the construction and enumeration of minimal blocks",
volume = "11",
year = "1987",
}
@article{Rosen1991,
author = "Rosen, J.B. and Sun, S.-Z. and Xue, G.-L.",
doi = "10.1016/0305-0548(91)90063-W",
issn = "03050548",
journal = "Computers \& Operations Research",
link = "http://www.sciencedirect.com/science/article/pii/030505489190063W http://linkinghub.elsevier.com/retrieve/pii/030505489190063W",
month = "jan",
number = "6",
pages = "579--584",
title = "Algorithms for the Quickest Path Problem and the Enumeration of Quickest Paths",
uri = "http://www.sciencedirect.com/science/article/pii/030505489190063W",
volume = "18",
year = "1991",
}
@article{Rotem1978a,
author = "Rotem, Doron and Varol, Y. L.",
doi = "10.1145/322077.322082",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322077.322082",
month = "jul",
number = "3",
pages = "396--404",
publisher = "ACM",
title = "Generation of Binary Trees from Ballot Sequences",
uri = "http://dl.acm.org/citation.cfm?id=322077.322082",
volume = "25",
year = "1978",
}
@article{Rotem1981,
author = "Rotem, Doron and Urrutia, Julia",
doi = "10.1002/net.3230110305",
issn = "00283045",
journal = "Networks",
link = "http://onlinelibrary.wiley.com/doi/10.1002/net.3230110305/abstract",
number = "3",
pages = "269--278",
title = "Finding Maximum Cliques In Circle Graphs",
uri = "http://onlinelibrary.wiley.com/doi/10.1002/net.3230110305/abstract",
volume = "11",
year = "1981",
}
@article{Ruskey1977,
author = "Ruskey, F. and Hu, T. C.",
doi = "10.1137/0206055",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "binary tree,feasible sequence,ranking algorithm",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0206055",
month = "dec",
number = "4",
pages = "745--758",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating Binary Trees Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206055",
volume = "6",
year = "1977",
}
@article{Ruskey1978a,
author = "Ruskey, Frank",
doi = "10.1137/0207034",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "lattice walks,lexicographic order,ranking algorithms,t-ary trees",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0207034",
month = "nov",
number = "4",
pages = "424--439",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating T -Ary Trees Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207034",
volume = "7",
year = "1978",
}
@article{Ruskey1981,
author = "Ruskey, Frank",
doi = "10.1137/0210011",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,1 subtrees were called,algorithms,in,in solving a certain,introduction,lexicographic enumeration ranking algorithm,networks,optimization problem on,ordered tree,problem of listing all,subtree,subtrees of a given,the problem originally arose,this paper studies the,tree cuts,we will also develop",
link = "http://epubs.siam.org/doi/abs/10.1137/0210011",
month = "feb",
number = "1",
pages = "141--150",
title = "Listing and Counting Subtrees of a Tree",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210011",
volume = "10",
year = "1981",
}
@article{Ruskey1988,
author = "Ruskey, Frank",
doi = "10.1016/0196-6774(88)90036-3",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677488900363 http://linkinghub.elsevier.com/retrieve/pii/0196677488900363",
month = "jun",
number = "2",
pages = "162--180",
title = "Adjacent Interchange Generation of Combinations",
uri = "http://www.sciencedirect.com/science/article/pii/0196677488900363",
volume = "9",
year = "1988",
}
@article{Ruskey1990,
author = "Ruskey, Frank and Proskurowski, Andrzej",
doi = "10.1016/0196-6774(90)90030-I",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/019667749090030I http://linkinghub.elsevier.com/retrieve/pii/019667749090030I",
month = "mar",
number = "1",
pages = "68--84",
title = "Generating Binary Trees by Transpositions",
uri = "http://www.sciencedirect.com/science/article/pii/019667749090030I",
volume = "11",
year = "1990",
}
@article{Ruskey1992,
author = "Ruskey, Frank and Savage, Carla and {Min Yih Wang}, Terry",
doi = "10.1016/0196-6774(92)90047-G",
issn = "01966774",
journal = "Journal of Algorithms",
keyword = "05-04,1,68r05,68r15,ams subject classifications,cat algorithm,difference covers,fixed density,generate,introduction,lyndon words,necklaces,pii,produc-,s0097539798344112,there are many reasons,to develop algorithms for",
link = "http://www.sciencedirect.com/science/article/pii/019667749290047G http://linkinghub.elsevier.com/retrieve/pii/019667749290047G",
month = "sep",
number = "3",
pages = "414--430",
title = "Generating Necklaces",
uri = "http://www.sciencedirect.com/science/article/pii/019667749290047G",
volume = "13",
year = "1992",
}
@article{Ruskey1992a,
author = "Ruskey, Frank",
doi = "10.1016/0095-8956(92)90067-8",
issn = "00958956",
journal = "Journal of Combinatorial Theory, Series B",
link = "http://www.sciencedirect.com/science/article/pii/0095895692900678 http://linkinghub.elsevier.com/retrieve/pii/0095895692900678",
month = "jan",
number = "1",
pages = "77--101",
title = "Generating linear extensions of posets by transpositions",
uri = "http://www.sciencedirect.com/science/article/pii/0095895692900678",
volume = "54",
year = "1992",
}
@inproceedings{Ruskey1993,
address = "Hong Kong, China",
author = "Ruskey, Frank",
booktitle = "ISAAC 1993: the 4th International Symposium on Algorithms and Computation",
doi = "10.1007/3-540-57568-5_250",
editor = "Ng, K. W. and Raghavan, P. and Balasubramanian, N. V. and Chin, F. Y. L.",
link = "http://link.springer.com/chapter/10.1007/3-540-57568-5_250",
month = "dec",
pages = "201--208",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Simple combinatorial Gray codes constructed by reversing sublists",
uri = "http://link.springer.com/chapter/10.1007/3-540-57568-5_250",
volume = "762",
year = "1993",
}
@article{Ruskey1999,
author = "Ruskey, Frank and Sawada, Joe",
doi = "10.1137/S0097539798344112",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05-04,1,68r05,68r15,ams subject classifications,cat algorithm,difference covers,fixed density,generate,introduction,lyndon words,necklaces,pii,produc-,s0097539798344112,there are many reasons,to develop algorithms for",
link = "http://link.aip.org/link/SMJCAT/v29/i2/p671/s1\&Agg=doi http://epubs.siam.org/doi/abs/10.1137/S0097539798344112",
month = "jan",
number = "2",
pages = "671--684",
title = "An Efficient Algorithm for Generating Necklaces With Fixed Density",
uri = "http://link.aip.org/link/SMJCAT/v29/i2/p671/s1&Agg=doi",
volume = "29",
year = "1999",
}
@inproceedings{Ruskey2000a,
address = "Sydney, Australia",
author = "Ruskey, Frank and Sawada, Joe",
booktitle = "COCOON 2000: the 6th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/3-540-44968-X_33",
editor = "Du, Ding-Zhu and Eades, Peter and Estivill-Castro, Vladimir and Lin, Xuemin and Sharma, Arun",
link = "http://link.springer.com/chapter/10.1007/3-540-44968-X_33",
month = "jul",
pages = "330--339",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating necklaces and strings with forbidden substrings",
uri = "http://link.springer.com/chapter/10.1007/3-540-44968-X_33",
volume = "1858",
year = "2000",
}
@inproceedings{Sacomoto2013b,
address = "Sophia Antipolis, France",
author = "Sacomoto, Gustavo and Lacroix, Vincent and Sagot, Marie-france",
booktitle = "WABI 2013: the 13th International Workshop on Algorithms in Bioinformatics",
doi = "10.1007/978-3-642-40453-5_9",
editor = "Darling, Aaron and Stoye, Jens",
link = "http://link.springer.com/chapter/10.1007/978-3-642-40453-5_9",
month = "sep",
pages = "99--111",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "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",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-40453-5_9",
volume = "8126",
year = "2013",
}
@article{Saitoh2010a,
author = "Saitoh, Toshiki and Yamanaka, Katsuhisa and Kiyomi, Masashi and Uehara, Ryuhei",
doi = "10.1587/transinf.E93.D.1816",
isbn = "3642002013",
issn = "09168532",
journal = "IEICE Transactions on Information and Systems",
keyword = "Counting,Enumeration,Proper interval graphs,Random generation,Unit interval graphs",
link = "http://search.ieice.org/bin/summary.php?id=e93-d_7_1816\&category=D\&year=2010\&lang=E\&abst=",
month = "jul",
number = "7",
pages = "1816--1823",
publisher = "The Institute of Electronics, Information and Communication Engineers",
title = "Random generation and enumeration of proper interval graphs",
uri = "http://search.ieice.org/bin/summary.php?id=e93-d_7_1816&category=D&year=2010&lang=E&abst=",
volume = "E93-D",
year = "2010",
}
@article{Saitoh2010b,
author = "Saitoh, Toshiki and Otachi, Yota and Yamanaka, Katsuhisa and Uehara, Ryuhei",
doi = "10.1016/j.jda.2011.11.001",
isbn = "3642106307",
issn = "15708667",
journal = "Journal of Discrete Algorithms",
keyword = "Bipartite permutation graph,Counting,Dyck path,Enumeration,Motzkin path,Random generation",
link = "http://www.sciencedirect.com/science/article/pii/S1570866711001006 http://linkinghub.elsevier.com/retrieve/pii/S1570866711001006",
month = "jan",
number = "1",
pages = "84--97",
title = "Random generation and enumeration of bipartite permutation graphs",
uri = "http://www.sciencedirect.com/science/article/pii/S1570866711001006",
volume = "10",
year = "2012",
}
@article{Saruwatari1993,
author = "Saruwatari, Yasufumi and Matsui, Tomomi",
doi = "10.1137/0803037",
issn = "1052-6234",
journal = "SIAM Journal on Optimization",
link = "http://epubs.siam.org/doi/abs/10.1137/0803037",
number = "4",
pages = "726--733",
title = "A Note on \$K\$-Best Solutions to the Chinese Postman Problem",
uri = "http://epubs.siam.org/doi/abs/10.1137/0803037",
volume = "3",
year = "1993",
}
@article{Savage1989,
author = "Savage, Carla D",
doi = "10.1016/0196-6774(89)90007-2",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/0196677489900072 http://linkinghub.elsevier.com/retrieve/pii/0196677489900072",
month = "dec",
number = "4",
pages = "577--595",
title = "Gray Code Sequences of Partitions",
uri = "http://www.sciencedirect.com/science/article/pii/0196677489900072",
volume = "10",
year = "1989",
}
@article{Savage1997,
author = "Savage, Carla",
doi = "10.1137/S0036144595295272",
issn = "0036-1445",
journal = "SIAM Review",
keyword = "acyclic orientations,binary strings,boolean lattice,catalan families,cayley graphs,combinations,compositions,de bruijn sequences,gray codes,hamilton cycles,integer parti-,linear extensions,necklaces,permutations,restricted growth functions,set partitions,tions,vertex-",
link = "http://epubs.siam.org/doi/abs/10.1137/S0036144595295272",
month = "jan",
number = "4",
pages = "605--629",
title = "A Survey of Combinatorial Gray Codes",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0036144595295272",
volume = "39",
year = "1997",
}
@article{Sawada2001,
author = "Sawada, Joe",
doi = "10.1137/S0097539700377037",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05-04,1,68r05,68r15,ams subject classifications,bracelet,cat algorithm,chemistry and,forbidden substring,generate,introduction,necklace,pii,s0097539700377037,the fields of combinatorial,the rapid growth in",
link = "http://link.aip.org/link/SMJCAT/v31/i1/p259/s1\&Agg=doi http://epubs.siam.org/doi/abs/10.1137/S0097539700377037",
month = "jan",
number = "1",
pages = "259--268",
title = "Generating Bracelets in Constant Amortized Time",
uri = "http://link.aip.org/link/SMJCAT/v31/i1/p259/s1&Agg=doi",
volume = "31",
year = "2001",
}
@article{Sawada2002a,
author = "Sawada, Joe",
doi = "10.1137/S0895480100377970",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
keyword = "05-04,05a15,1,68r05,68r15,ams subject classifications,chord diagram,chord diagrams are the,enumeration,fundamental combinatorial objects,generation algorithm,introduction,necklace,pii,s0895480100377970",
link = "http://link.aip.org/link/SJDMEC/v15/i4/p546/s1\&Agg=doi http://epubs.siam.org/doi/abs/10.1137/S0895480100377970",
month = "jan",
number = "4",
pages = "546--561",
title = "A Fast Algorithm for Generating Nonisomorphic Chord Diagrams",
uri = "http://link.aip.org/link/SJDMEC/v15/i4/p546/s1&Agg=doi",
volume = "15",
year = "2002",
zzzisbn = "0895480100377",
}
@article{Sawada2003,
author = "Sawada, Joe and Ruskey, Frank",
doi = "10.1016/S0196-6774(02)00286-9",
issn = "01966774",
journal = "Journal of Algorithms",
keyword = "basis,free lie algebra,generate,lyndon bracket,lyndon word,nth homogeneous component",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0196677402002869",
month = "jan",
number = "1",
pages = "21--26",
title = "Generating Lyndon Brackets.",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0196677402002869",
volume = "46",
year = "2003",
}
@article{Sawada2003a,
author = "Sawada, Joe",
doi = "10.1016/S0304-3975(03)00049-5",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "CAT algorithm,Combinatorial optimization,Exhaustive generation,Fixed content,Lyndon word,Necklace,cat algorithm,combinatorial,exhaustive generation,fixed content,lyndon word,necklace",
link = "http://www.sciencedirect.com/science/article/pii/S0304397503000495 http://linkinghub.elsevier.com/retrieve/pii/S0304397503000495",
month = "may",
number = "1-3",
pages = "477--489",
title = "A Fast Algorithm to Generate Necklaces With Fixed Content",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397503000495",
volume = "301",
year = "2003",
}
@article{Sawada2006,
author = "Sawada, Joe",
doi = "10.1145/1125994.1125995",
issn = "15496325",
journal = "ACM Transactions on Algorithms",
keyword = "CAT algorithm,chord diagram,free plane tree,necklace,planar tree,rooted plane tree",
link = "http://dl.acm.org/citation.cfm?id=1125994.1125995",
month = "jan",
number = "1",
pages = "1--13",
publisher = "ACM",
title = "Generating rooted and free plane trees",
uri = "http://dl.acm.org/citation.cfm?id=1125994.1125995",
volume = "2",
year = "2006",
}
@article{Sawada2013,
author = "Sawada, Joe and Williams, Aaron",
doi = "10.1016/j.tcs.2012.01.013",
issn = "03043975",
journal = "Theoretical Computer Science",
month = "Sep",
pages = "46--54",
publisher = "Elsevier",
title = "A Gray code for fixed-density necklaces and Lyndon words in constant amortized time",
volume = "502",
year = "2013",
}
@article{Schank2005,
author = "Schank, Thomas and Wagner, Dorothea",
doi = "10.1007/11427186_54",
journal = "Experimental and Efficient Algorithms",
pages = "606--609",
title = "Finding, counting and listing all triangles in large graphs, an experimental study",
volume = "001907",
year = "2005",
}
@article{Schmidt2009,
author = "Schmidt, Matthew C. and Samatova, Nagiza F. and Thomas, Kevin and Park, Byung-Hoon",
doi = "10.1016/j.jpdc.2009.01.003",
issn = "07437315",
journal = "Journal of Parallel and Distributed Computing",
keyword = "Biological networks,Cray XT,Dynamic load balancing,High-performance computing,Maximal clique enumeration,Parallel graph algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0743731509000082 http://linkinghub.elsevier.com/retrieve/pii/S0743731509000082",
month = "apr",
number = "4",
pages = "417--428",
title = "A Scalable, Parallel Algorithm for Maximal Clique Enumeration",
uri = "http://www.sciencedirect.com/science/article/pii/S0743731509000082",
volume = "69",
year = "2009",
}
@article{Schultz1982,
author = "Schultz, Phillip",
doi = "10.1016/0012-365X(82)90207-2",
issn = "0012365X",
journal = "Discrete Mathematics",
link = "http://www.sciencedirect.com/science/article/pii/0012365X82902072 http://linkinghub.elsevier.com/retrieve/pii/0012365X82902072",
month = "jan",
number = "2",
pages = "199--214",
title = "Enumerations of rooted trees with an application to group presentations",
uri = "http://www.sciencedirect.com/science/article/pii/0012365X82902072",
volume = "41",
year = "1982",
}
@article{Schwikowski2002,
author = "Schwikowski, Benno and Speckenmeyer, Ewald",
doi = "10.1016/S0166-218X(00)00339-5",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
keyword = "enumeration algorithm,feedback arc sets,feedback vertex sets,polynomial delay",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X00003395",
month = "mar",
number = "1-3",
pages = "253--265",
title = "On enumerating all minimal solutions of feedback problems",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0166218X00003395",
volume = "117",
year = "2002",
}
@inproceedings{Segoufin2013,
address = "Genoa, Italy",
author = "Segoufin, Luc",
booktitle = "ICDT 2013: the 16th International Conference on Database Theory",
doi = "10.1145/2448496.2448498",
editor = "Tan, Wang Chiew",
isbn = "9781450315982",
keyword = "algorithmic,databases,logic",
link = "http://dl.acm.org/citation.cfm?id=2448496.2448498 http://dl.acm.org/citation.cfm?doid=2448496.2448498",
month = "mar",
pages = "10--20",
publisher = "ACM Press",
title = "Enumerating with constant delay the answers to a query",
uri = "http://dl.acm.org/citation.cfm?id=2448496.2448498",
year = "2013",
}
@inproceedings{Segoufin2014,
author = "Segoufin, Luc",
booktitle = "STACS 2014: the 31st International Symposium on Theoretical Aspects of Computer Science",
doi = "10.4230/LIPIcs.STACS.2014.13",
isbn = "9783939897651",
issn = "18688969",
keyword = "Enumeration,constant delay,logic",
link = "http://drops.dagstuhl.de/opus/volltexte/2014/4500/",
pages = "13--27",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
title = "A glimpse on constant delay enumeration",
uri = "http://drops.dagstuhl.de/opus/volltexte/2014/4500/",
volume = "25",
year = "2014",
}
@article{Seidel1990,
author = "Seidel, Raimund",
doi = "10.1007/BF02574699",
isbn = "0897913620",
issn = "01795376",
journal = "Discrete \& Computational Geometry",
link = "http://dl.acm.org/citation.cfm?id=98570",
number = "1",
pages = "423--434",
title = "Small-dimensional linear programming and convex hulls made easy",
uri = "http://dl.acm.org/citation.cfm?id=98570",
volume = "6",
year = "1991",
}
@article{Semba1984,
author = "Semba, Ichiro",
journal = "Journal of information processing",
link = "http://ci.nii.ac.jp/naid/110002673365/",
number = "1",
pages = "41--42",
title = "An Efficient Algorithm for Generating all Partitions of the Set\{1, 2, ..., n\}",
uri = "http://ci.nii.ac.jp/naid/110002673365/",
volume = "7",
year = "1984",
zzzdoi = "MY/Semba_1984_110002673365",
}
@article{Setiawan2011,
author = "Setiawan, Andry and Nakano, Shin-ichi",
doi = "10.1587/transfun.E94.A.1965",
issn = "09168508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
keyword = "Enumeration,Graph,St-orientation",
link = "https://www.jstage.jst.go.jp/article/transfun/E94.A/10/E94.A_10_1965/_article",
number = "10",
pages = "1965--1970",
title = "Listing all st-orientations",
uri = "https://www.jstage.jst.go.jp/article/transfun/E94.A/10/E94.A_10_1965/_article",
volume = "E94-A",
year = "2011",
}
@inproceedings{Shao2014,
address = "Snowbird, UT, USA",
author = "Shao, Yingxia and Cui, Bin and Chen, Lei and Ma, Lin and Yao, Junjie and Xu, Ning",
booktitle = "SIGMOD 2014: the ACM SIGMOD international conference on Management of data",
doi = "10.1145/2588555.2588557",
isbn = "9781450323765",
keyword = "graph,graph algorithm,graph enumeration,subgraph listing",
link = "http://dl.acm.org/citation.cfm?id=2588555.2588557 http://dl.acm.org/citation.cfm?doid=2588555.2588557",
month = "jun",
pages = "625--636",
publisher = "ACM Press",
title = "Parallel subgraph listing in a large-scale graph",
uri = "http://dl.acm.org/citation.cfm?id=2588555.2588557",
year = "2014",
}
@article{Shen1997,
author = "Shen, Hong and Liang, Weifa",
doi = "10.1016/S0304-3975(97)83809-1",
issn = "03043975",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/S0304397597838091 http://linkinghub.elsevier.com/retrieve/pii/S0304397597838091",
month = "jun",
number = "1-2",
pages = "169--180",
title = "Efficient Enumeration of All Minimal Separators in a Graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397597838091",
volume = "180",
year = "1997",
}
@article{Shier1979,
author = "Shier, D. R.",
doi = "10.1002/net.3230090303",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230090303",
number = "3",
pages = "195--214",
title = "On algorithms for finding the k shortest paths in a network",
uri = "http://doi.wiley.com/10.1002/net.3230090303",
volume = "9",
year = "1979",
}
@article{Shioura1995,
author = "Shioura, Akiyoshi and Tamura, Akihisa",
doi = "10.1.1.30.4555",
journal = "Journal of the Operations Research Society of Japan",
link = "http://www.orsj.or.jp/~archive/menu/01_38.html\#vol3",
number = "3",
pages = "331--344",
title = "Efficiently Scanning all Spanning Trees of an Undirected Graph",
uri = "http://www.orsj.or.jp/~archive/menu/01_38.html#vol3",
volume = "38",
year = "1995",
}
@article{Shioura1997,
author = "Shioura, Akiyoshi and Tamura, Akihisa and Uno, Takeaki",
doi = "10.1137/S0097539794270881",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "05C30,68R10,optimal algorithm,spanning trees,undirected graphs",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/S0097539794270881?journalCode=smjcat",
month = "jun",
number = "3",
pages = "678--692",
publisher = "Society for Industrial and Applied Mathematics",
title = "An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs",
uri = "http://epubs.siam.org/doi/abs/10.1137/S0097539794270881?journalCode=smjcat",
volume = "26",
year = "1997",
}
@article{Sorensen2005,
author = "S\"{o}rensen, Kenneth and Janssens, Gerrit K.",
doi = "10.1590/S0101-74382005000200004",
issn = "0101-7438",
journal = "Pesquisa Operacional",
link = "http://www.scielo.br/scielo.php?script=sci_arttext\&pid=S0101-74382005000200004\&lng=en\&nrm=iso\&tlng=en",
month = "aug",
number = "2",
pages = "219--229",
publisher = "SOBRAPO",
title = "An algorithm to generate all spanning trees of a graph in order of increasing cost",
uri = "http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382005000200004&lng=en&nrm=iso&tlng=en",
volume = "25",
year = "2005",
}
@article{Srimani1979,
author = "Srimani, Pradip K.",
doi = "10.1109/PROC.1979.11455",
issn = "0018-9219",
journal = "Proceedings of the IEEE",
link = "http://ieeexplore.ieee.org/document/1455724/",
number = "9",
pages = "1361--1362",
title = "Generation of directed circuits in a directed graph",
uri = "http://ieeexplore.ieee.org/document/1455724/",
volume = "67",
year = "1979",
}
@article{Stix2004,
author = "Stix, Volker",
doi = "10.1023/B:COAP.0000008651.28952.b6",
issn = "0926-6003",
journal = "Computational Optimization and Applications",
link = "http://link.springer.com/10.1023/B:COAP.0000008651.28952.b6",
month = "feb",
number = "2",
pages = "173--186",
title = "Finding All Maximal Cliques in Dynamic Graphs",
uri = "http://link.springer.com/10.1023/B:COAP.0000008651.28952.b6",
volume = "27",
year = "2004",
}
@article{Stojmenovic2007,
author = "Stojmenovi\'{c}, Ivan and Zoghbi, Antoine",
doi = "10.1080/00207169808804755",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
link = "http://www.tandfonline.com/doi/abs/10.1080/00207169808804755",
month = "mar",
number = "2",
pages = "319--332",
publisher = "Taylor \& Francis",
title = "Fast Algorithms for Genegrating Integer Partitions",
uri = "http://www.tandfonline.com/doi/abs/10.1080/00207169808804755",
volume = "70",
year = "2007",
}
@inproceedings{Strozecki2010a,
address = "Brno, Czech Republic",
author = "Strozecki, Yann",
booktitle = "MFCS 2010: the 35th International Symposium on Mathematical Foundations of Computer Science",
doi = "10.1007/978-3-642-15155-2_55",
editor = "Hlin\v{e}n\'{y}, Petr and Ku\v{c}era, Anton\'{\i}n",
link = "http://link.springer.com/chapter/10.1007/978-3-642-15155-2_55",
month = "aug",
pages = "629--640",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumeration of the Monomials of a Polynomial and Related Complexity Classes",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-15155-2_55",
volume = "6281",
year = "2010",
}
@article{Syso1981,
author = "Sys{\l}o, Maciej M.",
doi = "10.1137/0210062",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a graph g,a simple graph g,all-cycle algorithm,an edge is denoted,and edges e,and m,by e uv,cycle basis,cycle graph,cycle space method,denote the number of,e,g,introduction,is a collection of,let n,number of edges of,planar graph,resp,simple graphs do,v,vertices,vertices and the",
link = "http://epubs.siam.org/doi/abs/10.1137/0210062",
month = "nov",
number = "4",
pages = "797--808",
title = "An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0210062",
volume = "10",
year = "1981",
}
@article{Szwarcfiter1976,
author = "Szwarcfiter, Jayme L. and Lauer, Peter E.",
doi = "10.1007/BF01931370",
issn = "00063835",
journal = "BIT",
link = "http://link.springer.com/10.1007/BF01931370",
month = "jun",
number = "2",
pages = "192--204",
title = "A search strategy for the elementary cycles of a directed graph",
uri = "http://link.springer.com/10.1007/BF01931370",
volume = "16",
year = "1976",
}
@article{Szwarcfiter1994,
author = "Szwarcfiter, Jayme L. and Chaty, Guy",
doi = "10.1016/0020-0190(94)00072-7",
issn = "00200190",
journal = "Information Processing Letters",
month = "aug",
number = "3",
pages = "149--153",
title = "Enumerating the kernels of a directed graph with no odd circuits",
volume = "51",
year = "1994",
}
@inproceedings{Szwarcfiter2003b,
address = "Rome, Italy",
author = "Szwarcfiter, JL",
booktitle = "CIAC 2003: the 5th Italian Conference on Algorithms and Complexity",
doi = "10.1007/3-540-44849-7_19",
editor = "Petreschi, Rossella and Persiano, Giuseppe and Silvestri, Riccardo",
keyword = "algorithms,forests,forests extensions,partially ordered sets",
link = "http://link.springer.com/chapter/10.1007/3-540-44849-7_19",
month = "may",
pages = "132--139",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating all forest extensions of a partially ordered set",
uri = "http://link.springer.com/chapter/10.1007/3-540-44849-7_19",
volume = "2653",
year = "2003",
}
@article{Takagi2004,
author = "Takagi, Masahiro and Nakano, Shin-ichi",
doi = "10.1002/scj.10563",
issn = "0882-1666",
journal = "Systems and Computers in Japan",
link = "http://doi.wiley.com/10.1002/scj.10563",
number = "4",
pages = "1--8",
title = "Listing all rectangular drawings with certain properties",
uri = "http://doi.wiley.com/10.1002/scj.10563",
volume = "35",
year = "2004",
}
@inproceedings{Takeuchi,
address = "Shanghai, China",
author = "Takeuchi, Fumihiko and Imai, Hiroshi",
booktitle = "COCOON 1997: the 3rd Annual International Conference on Computing and Combinatorics",
doi = "10.1007/BFb0045114",
editor = "Jiang, Tao and Lee, D. T.",
link = "http://link.springer.com/chapter/10.1007/BFb0045114",
month = "aug",
pages = "470--481",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating triangulations for products of two simplices and for arbitrary configurations of points",
uri = "http://link.springer.com/chapter/10.1007/BFb0045114",
volume = "1276",
year = "1997",
}
@inproceedings{Tamaki2000,
author = "Tamaki, Hisao",
booktitle = "SIGAL reports",
doi = "MY/Tamaki_2000_110002812417",
issn = "09196072",
jpnbooktitle = "アルゴリズム研究会報告",
jpnpublisher = "一般社団法人情報処理学会",
jpntitle = "極小横断列挙のメモリ効率の良いアルゴリズム",
link = "http://ci.nii.ac.jp/naid/110002812417/",
month = "nov",
number = "103",
pages = "29--36",
publisher = "Information Processing Society of Japan",
title = "Space-efficient enumeration of minimal transversals of a hypergraph (in Japanese)",
uri = "http://ci.nii.ac.jp/naid/110002812417/",
year = "2000",
zzzeditor = "-, -",
}
@article{Tarjan1973,
author = "Tarjan, Robert",
doi = "10.1137/0202017",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
link = "http://epubs.siam.org/doi/abs/10.1137/0202017",
month = "sep",
number = "3",
pages = "211--216",
title = "Enumeration of the Elementary Circuits of a Directed Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/0202017",
volume = "2",
year = "1973",
}
@article{Tiernan1970,
author = "Tiernan, James C.",
doi = "10.1145/362814.362819",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "algorithm,circuit search algorithm,graph theory,path search algorithm,searching",
link = "http://dl.acm.org/citation.cfm?id=362814.362819 http://portal.acm.org/citation.cfm?doid=362814.362819",
month = "dec",
number = "12",
pages = "722--726",
publisher = "ACM",
title = "An efficient search algorithm to find the elementary circuits of a graph",
uri = "http://dl.acm.org/citation.cfm?id=362814.362819",
volume = "13",
year = "1970",
}
@article{Tomita2006,
author = "Tomita, Etsuji and Tanaka, Akira and Takahashi, Haruhisa",
doi = "10.1016/j.tcs.2006.06.015",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "Computational experiments,Enumeration,Maximal cliques,Worst-case time complexity",
link = "http://www.sciencedirect.com/science/article/pii/S0304397506003586 http://linkinghub.elsevier.com/retrieve/pii/S0304397506003586",
month = "oct",
number = "1",
pages = "28--42",
title = "The Worst-Case Time Complexity for Generating All Maximal Cliques and Computational Experiments",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397506003586",
volume = "363",
year = "2006",
}
@article{Trojanowski1978,
author = "Trojanowski, Anthony E.",
doi = "10.1137/0207039",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "algorithm,binary trees,binomial coefficient,k-ary tree,linear order,permutation,ranking",
link = "http://epubs.siam.org/doi/abs/10.1137/0207039",
month = "nov",
number = "4",
pages = "492--509",
title = "Ranking and Listing Algorithms for k -Ary Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0207039",
volume = "7",
year = "1978",
}
@article{Tsukiyama1977a,
author = "Tsukiyama, Shuji and Ide, Mikio and Ariyoshi, Hiromu and Shirakawa, Isao",
doi = "10.1137/0206036",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,4,6,algorithm,all the maximal independent,and is also interesting,backtracking,graph,in terms of complexity,introduction,is fundamental in the,its applications,maximal clique,maximal cliques,maximal independent set,of computation,or,sets,the efficient search for,theory of graphs and",
link = "http://epubs.siam.org/doi/abs/10.1137/0206036",
month = "sep",
number = "3",
pages = "505--517",
title = "A New Algorithm for Generating All the Maximal Independent Sets",
uri = "http://epubs.siam.org/doi/abs/10.1137/0206036",
volume = "6",
year = "1977",
}
@article{Tsukiyama1980,
author = "Tsukiyama, S. and Shirakawa, I. and Ozaki, H. and Ariyoshi, H.",
doi = "10.1145/322217.322220",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322217.322220 http://portal.acm.org/citation.cfm?doid=322217.322220",
month = "oct",
number = "4",
pages = "619--632",
publisher = "ACM",
title = "An Algorithm to Enumerate All Cutsets of a Graph in Linear Time Per Cutset",
uri = "http://dl.acm.org/citation.cfm?id=322217.322220",
volume = "27",
year = "1980",
}
@inproceedings{Uno1996,
address = "Osaka, Japan",
author = "Uno, Takeaki",
booktitle = "ISAAC 1996: the 7th International Symposium on Algorithms and Computation",
doi = "10.1007/BFb0009492",
editor = "Asano, Tetsuo and Igarashi, Yoshihide and Nagamochi, Hiroshi and Miyano, Satoru and Suri, Subhash",
keyword = "directed spanning tree,enumerating algorithm,listing",
link = "http://link.springer.com/chapter/10.1007/BFb0009492",
month = "dec",
pages = "166--173",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An algorithm for enumerating all directed spanning trees in a directed graph",
uri = "http://link.springer.com/chapter/10.1007/BFb0009492",
volume = "1178",
year = "1996",
}
@inproceedings{Uno1997,
address = "Singapore",
author = "Uno, Takeaki",
booktitle = "ISAAC 1997: the 8th International Symposium on Algorithms and Computation",
doi = "10.1007/3-540-63890-3_11",
editor = "Leong, Hon Wai and Imai, Hiroshi and Jain, Sanjay",
link = "http://link.springer.com/chapter/10.1007/3-540-63890-3_11",
month = "dec",
pages = "92--101",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs",
uri = "http://link.springer.com/chapter/10.1007/3-540-63890-3_11",
volume = "1350",
year = "1997",
}
@inproceedings{Uno1998,
address = "Tokyo, Japan",
author = "Uno, Takeaki",
booktitle = "COCOON 1999: the 5th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/3-540-48686-0_35",
editor = "Asano, Takano and Imai, Hideki and Lee, D. T. and Nakano, Shin-ichi and Tokuyama, Takeshi",
link = "http://link.springer.com/chapter/10.1007/3-540-48686-0_35",
month = "jul",
pages = "349--359",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases",
uri = "http://link.springer.com/chapter/10.1007/3-540-48686-0_35",
volume = "1627",
year = "1999",
}
@inproceedings{Uno1998a,
address = "Taejon, Korea",
author = "Uno, Takeaki",
booktitle = "ISAAC 1998: the 9th International Symposium on Algorithms and Computation",
doi = "10.1007/3-540-49381-6_31",
editor = "Chwa, Kyung-Yong and Ibarra, Oscar H.",
link = "http://link.springer.com/chapter/10.1007/3-540-49381-6_31",
month = "dec",
pages = "287--296",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "New Approach for Speeding Up Enumeration Algorithms",
uri = "http://link.springer.com/chapter/10.1007/3-540-49381-6_31",
volume = "1533",
year = "1998",
}
@article{Uno2001,
author = "Uno, Takeaki",
journal = "Journal of National Institute of Informatics",
link = "http://research.nii.ac.jp/~uno/papers/enummat_nii.pdf",
number = "-",
pages = "89--97",
title = "A Fast Algorithm for Enumeration of Maximal Matchings in General Graphs",
uri = "http://research.nii.ac.jp/~uno/papers/enummat_nii.pdf",
volume = "3",
year = "2001",
zzzdoi = "MY/UNO_2001_Jounal_NII",
}
@article{Uno2008a,
author = "Uno, Takeaki",
doi = "10.1007/s00453-008-9238-3",
issn = "01784617",
journal = "Algorithmica",
keyword = "Algorithm,Clustering,Community discovering,Dense structure,Dense subgraph,Enumeration,Maximum subgraph,Mining,Pseudo clique,Quasi clique",
link = "http://link.springer.com/10.1007/s00453-008-9238-3",
month = "oct",
number = "1",
pages = "3--16",
title = "An efficient algorithm for solving pseudo clique enumeration problem",
uri = "http://link.springer.com/10.1007/s00453-008-9238-3",
volume = "56",
year = "2010",
}
@inproceedings{Unoc,
address = "Bled, Slovenia",
author = "Uno, Takeaki and Satoh, Hiroko",
booktitle = "DS 2014: the 17th International Conference on Discovery Science",
doi = "10.1007/978-3-319-11812-3_27",
editor = "D\v{z}eroski, Sa\v{s}o and Panov, Pan\v{c}e and Kocev, Dragi and Todorovski, Ljup\v{c}o",
link = "http://link.springer.com/chapter/10.1007/978-3-319-11812-3_27",
month = "oct",
pages = "313--324",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths",
uri = "http://link.springer.com/chapter/10.1007/978-3-319-11812-3_27",
volume = "8777",
year = "2014",
}
@article{VanBaronaigien1988,
author = "van Baronaigien, D.Roelants and Ruskey, Frank",
doi = "10.1016/0020-0190(88)90027-0",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "A-order,bijection,combinatorial generation,ranking,t-ary tree",
link = "http://www.sciencedirect.com/science/article/pii/0020019088900270",
month = "apr",
number = "4",
pages = "205--213",
title = "Generating t-ary trees in A-order",
uri = "http://www.sciencedirect.com/science/article/pii/0020019088900270",
volume = "27",
year = "1988",
}
@article{VanBaronaigien1991,
author = "van Baronaigien, D.Roelants",
doi = "10.1016/0020-0190(91)90178-K",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Combinatorial problems,binary tree,binary tree sequence,designs of algorithms,loopless algorithm",
link = "http://www.sciencedirect.com/science/article/pii/002001909190178K http://linkinghub.elsevier.com/retrieve/pii/002001909190178K",
month = "aug",
number = "4",
pages = "189--194",
title = "A loopless algorithm for generating binary tree sequences",
uri = "http://www.sciencedirect.com/science/article/pii/002001909190178K",
volume = "39",
year = "1991",
}
@article{VanBaronaigien2000,
author = "van Baronaigien, Dominique Roelants",
doi = "10.1006/jagm.1999.1073",
issn = "01966774",
journal = "Journal of Algorithms",
month = "apr",
number = "1",
pages = "100--107",
title = "A Loopless Gray-Code Algorithm for Listing k-ary Trees",
volume = "35",
year = "2000",
}
@article{Varol1981,
author = "Varol, Y. L.",
doi = "10.1093/comjnl/24.1.83",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oxfordjournals.org/content/24/1/83.abstract http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/24.1.83",
month = "jan",
number = "1",
pages = "83--84",
title = "An Algorithm to Generate All Topological Sorting Arrangements",
uri = "http://comjnl.oxfordjournals.org/content/24/1/83.abstract",
volume = "24",
year = "1981",
}
@article{Walsh1998,
author = "Walsh, Timothy R.",
doi = "10.1006/jagm.1998.0960",
issn = "01966774",
journal = "Journal of Algorithms",
link = "http://www.sciencedirect.com/science/article/pii/S0196677498909609 http://linkinghub.elsevier.com/retrieve/pii/S0196677498909609",
month = "oct",
number = "1",
pages = "165--173",
title = "Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time",
uri = "http://www.sciencedirect.com/science/article/pii/S0196677498909609",
volume = "29",
year = "1998",
}
@article{Wang1996,
author = "Wang, Terry Min Yih and Savage, Carla D.",
doi = "10.1137/S089548019528143X",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
link = "http://link.aip.org/link/SJDMEC/v9/i4/p654/s1\&Agg=doi http://epubs.siam.org/doi/abs/10.1137/S089548019528143X",
month = "nov",
number = "4",
pages = "654--673",
title = "A Gray Code for Necklaces of Fixed Density",
uri = "http://link.aip.org/link/SJDMEC/v9/i4/p654/s1&Agg=doi",
volume = "9",
year = "1996",
}
@inproceedings{Wang2009,
address = "Hefei, China",
author = "Wang, Jianxin and Chen, B and Feng, Qilong and Chen, Jianer",
booktitle = "FAW 2009: the 3rd International Workshop on Frontiers in Algorithmics",
doi = "10.1007/978-3-642-02270-8_25",
editor = "Deng, Xiaotie and Hopcroft, John E. and Xue, Jinyun",
link = "http://link.springer.com/chapter/10.1007/978-3-642-02270-8_25",
month = "jun",
pages = "237--250",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "An efficient fixed-parameter enumeration algorithm for weighted edge dominating set",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-02270-8_25",
volume = "5598",
year = "2009",
}
@inproceedings{Wasa2012b,
address = "Sydney, Australia",
author = "Wasa, Kunihiro and Kaneta, Yusaku and Uno, Takeaki and Arimura, Hiroki",
booktitle = "COCOON 2012: the 18th Annual International Conference on Computing and Combinatorics",
doi = "10.1007/978-3-642-32241-9_30",
editor = "Gudmundsson, Joachim and Mestre, Juli\'{a}n and Viglas, Taso",
isbn = "978-3-642-32240-2",
link = "http://link.springer.com/chapter/10.1007/978-3-642-32241-9_30",
month = "aug",
pages = "347--359",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-32241-9_30",
volume = "7434",
year = "2012",
}
@inproceedings{Wasa2013,
address = "Singapore",
author = "Wasa, Kunihiro and Uno, Takeaki and Hirata, Kouichi and Arimura, Hiroki",
booktitle = "DS 2013: the 16th International Conference on Discovery Science",
doi = "10.1007/978-3-642-40897-7_21",
editor = "F\"{u}rnkranz, Johannes and H\"{u}llermeier, Eyke and Higuchi, Tomoyuki",
isbn = "9783642408960",
issn = "16113349",
link = "http://link.springer.com/chapter/10.1007/978-3-642-40897-7_21",
month = "oct",
pages = "308--323",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Polynomial delay and space discovery of connected and acyclic sub-hypergraphs in a hypergraph",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-40897-7_21",
volume = "8140",
year = "2013",
}
@inproceedings{Wasa2014,
address = "Jeonju, Korea",
author = "Wasa, Kunihiro and Arimura, Hiroki and Uno, Takeaki",
booktitle = "ISAAC 2014: the 25th International Symposium on Algorithms and Computation",
doi = "10.1007/978-3-319-13075-0_8",
editor = "Ahn, Hee-Kap and Shin, Chan-Su",
isbn = "978-3-642-17516-9",
issn = "0302-9743",
link = "http://link.springer.com/chapter/10.1007/978-3-319-13075-0_8",
month = "dec",
pages = "488",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph",
uri = "http://link.springer.com/chapter/10.1007/978-3-319-13075-0_8",
volume = "6506",
year = "2014",
}
@article{Watanabe1960,
author = "Watanabe, H.",
doi = "10.1109/TCT.1960.1086675",
issn = "0096-2007",
journal = "IRE Transactions on Circuit Theory",
number = "3",
pages = "296--302",
title = "A Computational Method for Network Topology",
volume = "7",
year = "1960",
}
@article{Watanabe1981,
author = "Watanabe, Osamu",
doi = "10.1016/0020-0190(81)90139-3",
issn = "00200190",
journal = "Information Processing Letters",
link = "http://www.sciencedirect.com/science/article/pii/0020019081901393",
number = "1",
pages = "1--3",
title = "A fast algortihm for finding all shortest paths",
uri = "http://www.sciencedirect.com/science/article/pii/0020019081901393",
volume = "13",
year = "1981",
}
@article{Weinblatt1972,
author = "Weinblatt, Herbert",
doi = "10.1145/321679.321684",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=321679.321684",
month = "jan",
number = "1",
pages = "43--56",
publisher = "ACM",
title = "A New Search Algorithm for Finding the Simple Cycles of a Finite Directed Graph",
uri = "http://dl.acm.org/citation.cfm?id=321679.321684",
volume = "19",
year = "1972",
}
@inproceedings{Welch1965,
address = "New York, New York, USA",
author = "Welch, J T",
booktitle = "Proceedings of the 1965 20th national conference",
doi = "10.1145/800197.806053",
editor = "",
link = "http://portal.acm.org/citation.cfm?doid=800197.806053",
month = "aug",
pages = "296--301",
publisher = "ACM Press",
title = "Cycle Algorithms for Undirected Linear Graphs and Some immediate Applications",
uri = "http://portal.acm.org/citation.cfm?doid=800197.806053",
year = "1965",
}
@article{Welch1966,
author = "Welch, John T.",
doi = "10.1145/321328.321331",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=321328.321331",
month = "apr",
number = "2",
pages = "205--210",
title = "A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs",
uri = "http://portal.acm.org/citation.cfm?doid=321328.321331",
volume = "13",
year = "1966",
}
@article{Wells1961,
author = "Wells, Mark B.",
doi = "10.1090/S0025-5718-1963-0159764-2",
journal = "Mathematics of Computation",
link = "http://www.ams.org/journals/mcom/1961-15-074/S0025-5718-1961-0127507-2/home.html",
number = "74",
pages = "192--195",
title = "Generation of permutations by transposition",
uri = "http://www.ams.org/journals/mcom/1961-15-074/S0025-5718-1961-0127507-2/home.html",
volume = "15",
year = "1961",
}
@inproceedings{Wettstein2014,
address = "New York, New York, USA",
author = "Wettstein, Manuel",
booktitle = "Annual Symposium on Computational Geometry - SOCG'14",
doi = "10.1145/2582112.2582145",
editor = "",
isbn = "9781450325943",
link = "http://dl.acm.org/citation.cfm?id=2582112.2582145",
month = "jun",
pages = "1--10",
publisher = "ACM Press",
title = "Counting and Enumerating Crossing-free Geometric Graphs",
uri = "http://dl.acm.org/citation.cfm?id=2582112.2582145",
year = "2014",
}
@article{White1970,
author = "White, John S.",
doi = "10.1145/362007.362046",
issn = "00010782",
journal = "Communications of the ACM",
keyword = "partitions,restricted partitions,restricted sums,sums of intergers",
link = "http://dl.acm.org/citation.cfm?id=362007.362046 http://portal.acm.org/citation.cfm?doid=362007.362046",
month = "feb",
number = "2",
pages = "120",
publisher = "ACM",
title = "Algorithm 374: Restricted partition generator [A1]",
uri = "http://dl.acm.org/citation.cfm?id=362007.362046",
volume = "13",
year = "1970",
}
@article{Wild2008,
author = "Wild, Marcel",
doi = "10.1016/j.jda.2007.01.005",
issn = "15708667",
journal = "Journal of Discrete Algorithms",
keyword = "Generating all Hamiltonian cycles,Generating all chordless cycles,Generating all cycles",
link = "http://www.sciencedirect.com/science/article/pii/S1570866707000020 http://linkinghub.elsevier.com/retrieve/pii/S1570866707000020",
month = "mar",
number = "1",
pages = "93--102",
title = "Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion",
uri = "http://www.sciencedirect.com/science/article/pii/S1570866707000020",
volume = "6",
year = "2008",
}
@article{Wild2013,
author = "Wild, Marcel",
doi = "10.1007/s11083-013-9292-6",
issn = "0167-8094",
journal = "Order",
link = "http://link.springer.com/10.1007/s11083-013-9292-6",
month = "apr",
number = "1",
pages = "121--135",
title = "Output-Polynomial Enumeration of All Fixed-Cardinality Ideals of a Poset, Respectively All Fixed-Cardinality Subtrees of a Tree",
uri = "http://link.springer.com/10.1007/s11083-013-9292-6",
volume = "31",
year = "2013",
}
@article{Winter1986,
author = "Winter, Pawel",
doi = "10.1007/BF01939361",
issn = "0006-3835",
journal = "BIT",
keyword = "master thesis",
link = "http://link.springer.com/10.1007/BF01939361",
month = "mar",
number = "1",
pages = "44--62",
title = "An algorithm for the enumeration of spanning trees",
uri = "http://link.springer.com/10.1007/BF01939361",
volume = "26",
year = "1986",
}
@article{Wright1986,
author = "Wright, Robert Alan and Richmond, Bruce and Odlyzko, Andrew and McKay, Brendan D.",
doi = "10.1137/0215039",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,a given size,all rooted trees of,an,an algorithm for generating,ation,beyer and hedetniemi exhibit,constant time generation,constructive enumer-,free tree,in 1,introduction,lexicographic order,loop-free algorithm,nonisomorphic trees,successor function to traverse,the method uses a,unrooted tree",
link = "http://epubs.siam.org/doi/abs/10.1137/0215039",
month = "may",
number = "2",
pages = "540--548",
title = "Constant Time Generation of Free Trees",
uri = "http://epubs.siam.org/doi/abs/10.1137/0215039",
volume = "15",
year = "1986",
}
@article{Xiang1997,
author = "Xiang, L.",
doi = "10.1093/comjnl/40.5.278",
issn = "0010-4620",
journal = "The Computer Journal",
link = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/40.5.278",
month = "may",
number = "5",
pages = "278--291",
title = "Grammar-Oriented Enumeration of Binary Trees",
uri = "http://comjnl.oupjournals.org/cgi/doi/10.1093/comjnl/40.5.278",
volume = "40",
year = "1997",
}
@article{Yamada2010,
author = "Yamada, Takeo and Kataoka, Seiji and Watanabe, Kohtaro",
doi = "10.1080/00207160903329699",
issn = "0020-7160",
journal = "International Journal of Computer Mathematics",
keyword = "05c05,05c30,2000 ams classifications,68w05,enumeration algorithm,minimum spanning tree",
link = "http://www.tandfonline.com/doi/abs/10.1080/00207160903329699",
month = "nov",
number = "14",
pages = "3175--3185",
title = "Listing All the Minimum Spanning Trees in an Undirected Graph",
uri = "http://www.tandfonline.com/doi/abs/10.1080/00207160903329699",
volume = "87",
year = "2010",
}
@article{Yamanaka2006,
author = "Yamanaka, Katsuhisa and Nakano, Shin-ichi",
doi = "10.1002/ecjb.20276",
journal = "Electronics and Communications in Japan (Part II: Electronics)",
link = "http://onlinelibrary.wiley.com/doi/10.1002/ecjb.20276/abstract",
number = "7",
pages = "40--47",
title = "Generating all realizers",
uri = "http://onlinelibrary.wiley.com/doi/10.1002/ecjb.20276/abstract",
volume = "89",
year = "2006",
}
@article{Yamanaka2007,
author = "Yamanaka, Katsuhisa and Kawano, Shin-ichiro and Kikuchi, Yosuke and Nakano, Shin-ichi",
doi = "10.1093/ietfec/e90-a.5.888",
issn = "09168508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
keyword = "Algorithm,Generation,Integer partition,The family tree",
link = "http://search.ieice.org/bin/summary.php?id=e90-a_5_888\&category=A\&year=2007\&lang=E\&abst=",
number = "5",
pages = "888--895",
title = "Constant time generation of integer partitions",
uri = "http://search.ieice.org/bin/summary.php?id=e90-a_5_888&category=A&year=2007&lang=E&abst=",
volume = "E90-A",
year = "2007",
}
@article{Yamanaka2009,
author = "Yamanaka, Katsuhisa and Nakano, Shin-ichi",
doi = "10.7155/jgaa.00174",
issn = "1526-1719",
journal = "Journal of Graph Algorithms and Applications",
link = "http://jgaa.info/getPaper?id=174",
number = "1",
pages = "5--18",
title = "Listing All Plane Graphs",
uri = "http://jgaa.info/getPaper?id=174",
volume = "13",
year = "2009",
}
@inproceedings{Yamanaka2009a,
address = "Kolkata, India",
author = "Yamanaka, Katsuhisa and Otachi, Yota and Nakano, Shin-ichi",
booktitle = "WALCOM 2009: the 3rd International Workshop on Algorithms and Computation",
doi = "10.1007/978-3-642-00202-1_13",
editor = "Das, Sandip and Uehara, Ryuhei",
keyword = "algorithm,enumeration,family tree,graph,ordered tree",
link = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_13",
month = "feb",
pages = "141--150",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Efficient Enumeration of Ordered Trees with k Leaves",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-00202-1_13",
volume = "5431",
year = "2009",
}
@article{Yamanaka2010,
author = "Yamanaka, Katsuhisa and Nakano, Shin-ichi and Matsui, Yasuko and Uehara, Ryuhei and Nakada, Kento",
doi = "10.1016/j.tcs.2010.01.002",
issn = "03043975",
journal = "Theoretical Computer Science",
keyword = "enumeration algorithm",
link = "http://linkinghub.elsevier.com/retrieve/pii/S0304397510000058",
month = "mar",
number = "16-18",
pages = "1714--1722",
publisher = "Elsevier B.V.",
title = "Efficient Enumeration of All Ladder Lotteries and Its Application",
uri = "http://linkinghub.elsevier.com/retrieve/pii/S0304397510000058",
volume = "411",
year = "2010",
}
@article{Yamanaka2014,
author = "Yamanaka, Katsuhisa and Nakano, Shin-ichi",
doi = "10.1587/transfun.E97.A.1163",
issn = "0916-8508",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
link = "http://jlc.jst.go.jp/DN/JST.JSTAGE/transfun/E97.A.1163?lang=en\&from=CrossRef\&type=abstract",
number = "6",
pages = "1163--1170",
title = "Efficient Enumeration of All Ladder Lotteries with k Bars",
uri = "http://jlc.jst.go.jp/DN/JST.JSTAGE/transfun/E97.A.1163?lang=en&from=CrossRef&type=abstract",
volume = "E97.A",
year = "2014",
}
@article{Yasuko1994,
author = "Yasuko, Yoshida and Matsui, Tomomi",
journal = "IEEJ Transactions on Electronics, Information and Systems",
link = "https://www.jstage.jst.go.jp/article/ieejeiss1987/114/4/114_4_444/_article/references/-char/ja/",
number = "4",
pages = "444--449",
title = "Finding All the Edge Colorings in Bipartite Graphs (in Japanese)",
uri = "https://www.jstage.jst.go.jp/article/ieejeiss1987/114/4/114_4_444/_article/references/-char/ja/",
volume = "114",
year = "1994",
zzzdoi = "MY/Yoshida_Matsui_1994_IEE",
zzzjpnjournal = "電気学会論文誌. C, 電子・情報・システム部門誌",
zzzjpntitle = "2部グラフの辺彩色の列挙解法",
}
@article{Yau1967,
author = "Yau, S.",
doi = "10.1109/TCT.1967.1082662",
issn = "0018-9324",
journal = "IEEE Transactions on Circuit Theory",
link = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082662",
month = "mar",
number = "1",
pages = "79--81",
title = "Generation of all Hamiltonian Circuits, Paths, and Centers of a Graph, and Related Problems",
uri = "http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=1082662",
volume = "14",
year = "1967",
}
@article{Yeh2010,
author = "Yeh, Li Pu and Wang, Biing Feng and Su, Hsin Hao",
doi = "10.1007/s00453-009-9284-5",
isbn = "0045300992",
issn = "01784617",
journal = "Algorithmica",
keyword = "Algorithms,Enumeration,Graphs,Maximum flows,Minimum cuts,Suboptimal cuts",
link = "http://link.springer.com/article/10.1007/s00453-009-9284-5",
number = "3",
pages = "297--312",
title = "Efficient algorithms for the problems of enumerating cuts by non-decreasing weights",
uri = "http://link.springer.com/article/10.1007/s00453-009-9284-5",
volume = "56",
year = "2010",
}
@article{Yen1971,
author = "Yen, J. Y.",
doi = "10.1287/mnsc.17.11.712",
issn = "0025-1909",
journal = "Management Science",
link = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.11.712",
number = "11",
pages = "712--716",
title = "Finding the K Shortest Loopless Paths in a Network",
uri = "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.11.712",
volume = "17",
year = "1971",
}
@article{Zaks1979,
author = "Zaks, Shumel and Richards, D.",
doi = "10.1137/0208006",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
keyword = "1,1 leaves,2,all k-ary trees with,and,hence no,introduction,lattice path,lexicographic order,motivated by the problem,n nodes,no,of generating,ordered tree,problem for all trees,ranking,ranking and unranking,t,unranking,we solved the analogous,with ni",
language = "en",
link = "http://epubs.siam.org/doi/abs/10.1137/0208006",
month = "feb",
number = "1",
pages = "73--81",
publisher = "Society for Industrial and Applied Mathematics",
title = "Generating Trees and Other Combinatorial Objects Lexicographically",
uri = "http://epubs.siam.org/doi/abs/10.1137/0208006",
volume = "8",
year = "1979",
}
@article{Zaks1980,
author = "Zaks, Shmuel",
doi = "10.1016/0304-3975(80)90073-0",
issn = "03043975",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/0304397580900730",
month = "jan",
number = "1",
pages = "63--82",
title = "Lexicographic generation of ordered trees",
uri = "http://www.sciencedirect.com/science/article/pii/0304397580900730",
volume = "10",
year = "1980",
}
@article{Zaks1982,
author = "Zaks, Shmuel",
doi = "10.1016/0020-0190(82)90140-5",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "binary trees,k-ary trees,lexicographic order",
link = "f http://linkinghub.elsevier.com/retrieve/pii/0020019082901405",
month = "mar",
number = "1",
pages = "44--48",
title = "Generation and ranking of K-ary trees",
uri = "f",
volume = "14",
year = "1982",
}
@article{Zerling1985,
author = "Zerling, David",
doi = "10.1145/3828.214141",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://portal.acm.org/citation.cfm?doid=3828.214141",
month = "jul",
number = "3",
pages = "694--701",
publisher = "ACM",
title = "Generating Binary Trees Using Rotations",
uri = "http://portal.acm.org/citation.cfm?doid=3828.214141",
volume = "32",
year = "1985",
}
@inproceedings{Zhuang2010,
address = "Kailua-Kona, HI, USA",
author = "Zhuang, Bingbing and Nagamochi, Hiroshi",
booktitle = "COCOA 2010: the 4th International Conference on Combinatorial Optimization and Applications",
doi = "10.1007/978-3-642-17461-2_28",
editor = "Wu, Weili and Daescu, Ovidiu",
link = "http://link.springer.com/chapter/10.1007/978-3-642-17461-2_28",
month = "dec",
pages = "347--361",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Listing triconnected rooted plane graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-17461-2_28",
volume = "6509",
year = "2010",
}
@inproceedings{Zhuang2010a,
address = "Prague, Czech Republic",
author = "Zhuang, Bingbing and Nagamochi, Hiroshi",
booktitle = "TAMC 2010: the 7th Annual Conference on Theory and Applications of Models of Computation",
doi = "10.1007/978-3-642-13562-0_42",
editor = "Kratochv{\'i}l, Jan and Li, Angsheng and Fiala, Ji{\v{r}}{\'i} and Kolman, Petr",
link = "http://link.springer.com/chapter/10.1007/978-3-642-13562-0_42",
month = "jun",
pages = "467--478",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating Internally Triconnected rooted plane graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-13562-0_42",
volume = "6108",
year = "2010",
}
@inproceedings{Zhuang2010b,
address = "Rome, Italy",
author = "Zhuang, Bingbing and Nagamochi, Hiroshi",
booktitle = "CIAC 2010: the 7th International Conference on Algorithms and Complexity",
doi = "10.1007/978-3-642-13073-1_6",
editor = "Calamoneri, Tiziana and Diaz, Josep",
link = "http://link.springer.com/chapter/10.1007/978-3-642-13073-1_6",
month = "may",
pages = "49--60",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Enumerating rooted graphs with reflectional block structures",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-13073-1_6",
volume = "6078",
year = "2010",
}
@inproceedings{Zhuang2010c,
address = "Wuhan, China",
author = "Zhuang, Bingbing and Nagamochi, Hiroshi",
booktitle = "FAW 2010: the 4th International Workshop on Frontiers in Algorithmics",
doi = "10.1007/978-3-642-14553-7_13",
editor = "Lee, Der-Tsai and Chen, Danny Z. and Ying, Shi",
link = "http://link.springer.com/chapter/10.1007/978-3-642-14553-7_13",
month = "aug",
pages = "113--123",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Constant Time Generation of Biconnected Rooted Plane Graphs",
uri = "http://link.springer.com/chapter/10.1007/978-3-642-14553-7_13",
volume = "6213",
year = "2010",
}