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