@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{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{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{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{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{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",
}
@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",
}
@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{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{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{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{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{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",
}
@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{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",
}
@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",
}
@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{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",
}