Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
100 | Richard S. Bird |
Loopless Functional Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MPC ![In: Mathematics of Program Construction, 8th International Conference, MPC 2006, Kuressaare, Estonia, July 3-5, 2006, Proceedings, pp. 90-114, 2006, Springer, 3-540-35631-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
89 | James F. Korsh, Paul LaFollette |
Loopless Generation of Linear Extensions of a Poset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 19(2), pp. 115-126, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
loopless algorithm, poset, linear extension, topological sort |
89 | Limin Xiang, Kazuo Ushijima, Yuichi Asahiro |
Coding k-ary Trees for Efficient Loopless Generation in Lexicographic Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCC ![In: 2002 International Symposium on Information Technology (ITCC 2002), 8-10 April 2002, Las Vegas, NV, USA, pp. 396-403, 2002, IEEE Computer Society, 0-7695-1506-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
coding $k$-ary trees, loopless generation, lexicographic order |
89 | Paul LaFollette, James F. Korsh |
A Loopless Algorithm for Generation of Basic Minimal Interval Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 17(3), pp. 271-285, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
loopless algorithm, minimal, interval order |
79 | Doohee Nam, Seongil Shin, Changho Choi, Yongtaek Lim, Seung Jae Lee |
An Algorithm for Loopless Optimum Paths Finding Agent System and Its Application to Multimodal Public Transit Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES-AMSTA ![In: Agent and Multi-Agent Systems: Technologies and Applications, First KES International Symposium, KES-AMSTA 2007, Wroclaw, Poland, May 31- June 1, 2007, Proceedings, pp. 496-505, 2007, Springer, 978-3-540-72829-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
optimum path agent, Loopless path, Looping path, Network Transform, Mode-Link Transformation, Link Loopless path, K shortest Path |
75 | Koichiro Doi, Jing Li 0002, Tao Jiang 0001 |
Minimum Recombiant Haplotype Configuration on Tree Pedigrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, Third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003, Proceedings, pp. 339-353, 2003, Springer, 3-540-20076-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
70 | James F. Korsh, Paul LaFollette |
A loopless Gray code for rooted trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(2), pp. 135-152, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Loopless, Gray code, rooted trees |
70 | Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal |
A new implementation of Yen's ranking loopless paths algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 1(2), pp. 121-133, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
loopless path, paths ranking, network, path |
62 | Aaron Williams |
Loopless generation of multiset permutations using a constant number of variables by prefix shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 987-996, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
44 | Gurmeet Singh Manku, Joe Sawada |
A Loopless Gray Code for Minimal Signed-Binary Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 438-447, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Gideon Ehrlich |
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 20(3), pp. 500-513, 1973. The full citation details ...](Pics/full.jpeg) |
1973 |
DBLP DOI BibTeX RDF |
|
37 | Arvind Gupta, Mehdi Karimi 0001, Eun Jung Kim 0002, Arash Rafiey |
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 374-383, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Richard S. Bird |
Spider Spinning for Dummies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advanced Functional Programming ![In: Advanced Functional Programming, 6th International School, AFP 2008, Heijen, The Netherlands, May 2008, Revised Lectures, pp. 39-65, 2008, Springer, 978-3-642-04651-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
37 | Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco |
A comprehensive survey on the quickest path problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 147(1), pp. 5-21, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Bicriteria problem, Minsum-maxmin, Quickest path, Paths ranking |
37 | Markus Bläser, L. Shankar Ram, Maxim Sviridenko |
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 9th International Workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings, pp. 350-359, 2005, Springer, 3-540-28101-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Michael M. Weigand |
Algorithmus 20 Ein leistungsfähiger Algorithmus zur Bestimmung von K-kürzesten Wegen in einem Graphen. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 12(3), pp. 273-283, 1974. The full citation details ...](Pics/full.jpeg) |
1974 |
DBLP DOI BibTeX RDF |
|
25 | Pedro A. Saa, Sebastian Zapararte, Christopher C. Drovandi, Lars K. Nielsen |
LooplessFluxSampler: an efficient toolbox for sampling the loopless flux solution space of metabolic models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BMC Bioinform. ![In: BMC Bioinform. 25(1), pp. 3, December 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Boao Kong, Shuchen Zhu, Songtao Lu, Xinmeng Huang, Kun Yuan |
Decentralized Bilevel Optimization over Graphs: Loopless Algorithmic Update and Transient Iteration Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.03167, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Yury Demidovich, Grigory Malinovsky, Peter Richtárik |
Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.06677, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
25 | Jean Néraud |
Loopless algorithms to generate maximum length gray cycles wrt. k-character substitutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 977, pp. 114175, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Nikita Fedin, Eduard Gorbunov |
Byzantine-Robust Loopless Stochastic Variance-Reduced Gradient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.04560, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Jean Néraud |
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.01556, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Youcheng Niu, Ying Sun 0003, Yan Huang, Jinming Xu 0002 |
A Loopless Distributed Algorithm for Personalized Bilevel Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 62nd IEEE Conference on Decision and Control, CDC 2023, Singapore, December 13-15, 2023, pp. 4189-4196, 2023, IEEE, 979-8-3503-0124-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Yuanyuan Liu 0001, Jiacheng Geng, Fanhua Shang, Weixin An, Hongying Liu, Qi Zhu |
Loopless Variance Reduced Stochastic ADMM for Equality Constrained Problems in IoT Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Internet Things J. ![In: IEEE Internet Things J. 9(3), pp. 2293-2303, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Matilde Gargiani, Andrea Zanelli, Andrea Martinelli, Tyler H. Summers, John Lygeros |
PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.00308, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
25 | Massimiliano Lucci, Valerio Campanari, Davide Cassi, Vittorio Merlo, Francesco Romeo, Gaetano Salina, Matteo Cirillo |
Quantum Coherence in Loopless Superconductive Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 24(11), pp. 1690, November 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Julian von Tschammer, Robert Mattmüller, David Speck 0001 |
Loopless Top-K Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPS ![In: Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (virtual), June 13-24, 2022, pp. 380-384, 2022, AAAI Press, 978-1-57735-874-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
25 | Matilde Gargiani, Andrea Zanelli, Andrea Martinelli, Tyler H. Summers, John Lygeros |
PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: International Conference on Machine Learning, ICML 2022, 17-23 July 2022, Baltimore, Maryland, USA., pp. 7223-7240, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
25 | Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang |
A loopless algorithm for generating (k, m)-ary trees in Gray code order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 15(4), pp. 1133-1154, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
25 | Zhize Li |
ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Method. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.11333, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
25 | Yu-Hsuan Chang, Ro-Yu Wu, Cheng-Kuan Lin, Jou-Ming Chang |
A Loopless Algorithm for Generating (k, m)-ary Trees in Gray-Code Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings, pp. 121-132, 2020, Springer, 978-3-030-59900-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Xiangyang Liu, Bingkun Wei, Fanhua Shang, Hongying Liu |
Loopless Semi-Stochastic Gradient Descent with Less Hard Thresholding for Sparse Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM 2019, Beijing, China, November 3-7, 2019., pp. 881-890, 2019, ACM, 978-1-4503-6976-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray code enumeration and the Tower of Bucharest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 748, pp. 40-54, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Siu Hung Joshua Chan, Lin Wang 0031, Satyakam Dash, Costas D. Maranas |
Accelerating flux balance calculations in genome-scale metabolic models by localizing the application of loopless constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 34(24), pp. 4248-4255, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Pedro A. Saa, Lars Keld Nielsen |
Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bioinform. ![In: Bioinform. 32(24), pp. 3807-3814, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray Code Enumeration and the Tower of Bucharest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.06707, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Cassio Neri |
A loopless and branchless $O(1)$ algorithm to generate the next Dyck word. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.06426, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
25 | Felix Herter, Günter Rote |
Loopless Gray Code Enumeration and the Tower of Bucharest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUN ![In: 8th International Conference on Fun with Algorithms, FUN 2016, June 8-10, 2016, La Maddalena, Italy, pp. 19:1-19:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-005-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai |
A loopless algorithm for generating multiple binary tree sequences simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 556, pp. 25-33, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Shude Long, Junliang Cai |
Enumeration of rooted loopless unicursal planar maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 117, pp. 131-146, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Hung-Chang Chan, Kung-Jui Pai |
A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings, pp. 340-350, 2013, Springer, 978-3-319-03779-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
25 | Amin Ahmadi-Adl, Abbas Nowzari-Dalini, Hayedeh Ahrabian |
Ranking and unranking algorithms for loopless generation of t-ary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. J. IGPL ![In: Log. J. IGPL 19(1), pp. 33-43, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Stephane Durocher, Pak Ching Li, Debajyoti Mondal, Aaron Williams |
Ranking and Loopless Generation of k-ary Dyck Words in Cool-lex Order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers, pp. 182-194, 2011, Springer, 978-3-642-25010-1. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Ro-Yu Wu, Jou-Ming Chang, Yue-Li Wang |
Loopless Generation of Non-regular Trees with a Prescribed Branching Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 53(6), pp. 661-666, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Toufik Mansour, Ghalib Nassar |
Gray Codes, Loopless Algorithm and Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Math. Model. Algorithms ![In: J. Math. Model. Algorithms 7(3), pp. 291-310, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Tadao Takaoka, Stephen Violich |
Fusing Loopless Algorithms for Combinatorial Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 18(2), pp. 263-293, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Olivier Bernardi |
Bijective counting of Kreweras walks and loopless triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 114(5), pp. 931-956, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | H. Bricard |
An adaptation of Eppstein's algorithm dealing with the k shortest - loopless and having at most p arcs - paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 25, pp. 23-26, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
25 | Tadao Takaoka, Stephen Violich |
Combinatorial Generation by Fusing Loopless Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Theory of Computing 2006, Proceedings of the Twelfth Computing: The Australasian Theory Symposium (CATS2006). Hobart, Tasmania, Australia, 16-19 January 2006, Proceedings, pp. 69-77, 2006, Australian Computer Society, 1-920682-33-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
25 | Valery A. Liskovets, Timothy R. S. Walsh |
Counting unrooted loopless planar maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 26(5), pp. 651-663, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Array Generation of Multiset Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 47(5), pp. 612-621, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette, Seymour Lipschutz |
Loopless Algorithms and Schröder Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 80(6), pp. 709-725, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
A loopless algorithm for generating the permutations of a multiset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 307(2), pp. 415-431, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Schröder Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 46(1), pp. 106-113, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Han Ren, Yanpei Liu, Zhaoxiang Li |
Enumeration of 2 -connected Loopless 4 -regular Maps on the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 23(1), pp. 93-111, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Trees with Specified Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 45(3), pp. 364-372, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Han Ren, Yanpei Liu |
The Number of Loopless 4-Regular Maps on the Projective Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 84(1), pp. 84-99, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Jason P. Jue |
An algorithm for loopless deflection in photonic packet-switched networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: IEEE International Conference on Communications, ICC 2002, April 28 - May 2, 2002, New York City, NY, USA, pp. 2776-2780, 2002, IEEE, 0-7803-7400-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh |
Loopless generation of up-down permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 240(1-3), pp. 97-122, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
A Loopless Generation of Bitstrings without p Consecutive Ones. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, Romania., pp. 227-240, 2001, Springer, 978-1-85233-526-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Limin Xiang, Kazuo Ushijima, Changjie Tang |
Efficient loopless generation of Gray codes for k-ary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 76(4-6), pp. 169-174, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Dominique Roelants van Baronaigien |
A Loopless Gray-Code Algorithm for Listing k-ary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 35(1), pp. 100-107, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 34(2), pp. 309-336, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Paul LaFollette |
Loopless Generation of Gray Codes for k-Ary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 70(1), pp. 7-11, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh, Seymour Lipschutz |
Shifts and Loopless Generation of k-Ary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 65(5), pp. 235-240, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Vincent Vajnovszki |
On the Loopless Generation of Binary Tree Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 68(3), pp. 113-117, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
25 | James F. Korsh |
Loopless Generation of k-Ary Tree Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 52(5), pp. 243-247, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
25 | Dominique Roelants van Baronaigien |
A Loopless Algorithm for Generating Binary Tree Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 39(4), pp. 189-194, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
25 | M. C. Er |
A loopless and optimal algorithm for the cyclic towers of hanoi problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 42(3), pp. 283-287, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
25 | Aarni Perko |
Implementation of algorithms for K shortest loopless paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 16(2), pp. 149-160, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
25 | Edward A. Bender, Nicholas C. Wormald |
The number of loopless planar maps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 54(2), pp. 235-237, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
19 | Hiroshi Nagamochi |
A Detachment Algorithm for Inferring a Graph from Path Frequency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(2), pp. 207-224, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Detachment algorithm, Graph inference, Connectivity, Multigraphs |
19 | John Hershberger 0001, Matthew Maxel, Subhash Suri |
Finding the k shortest simple paths: A new algorithm and its implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 45, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Loop-free paths, directed paths, path equivalence class, replacement paths |
19 | Hiroshi Nagamochi |
A Detachment Algorithm for Inferring a Graph from Path Frequency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 274-283, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Zifei Zhong, Ram Keralapura, Srihari Nelakuditi, Yinzhe Yu, Junling Wang, Chen-Nee Chuah, Sanghwan Lee |
Avoiding Transient Loops Through Interface-Specific Forwarding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWQoS ![In: Quality of Service - IWQoS 2005: 13th International Workshop, IWQoS 2005, Passau, Germany, June 21-23, 2005, Proceedings, pp. 219-232, 2005, Springer. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Frank Ruskey, Aaron Williams |
Generating Combinations by Prefix Shifts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 11th Annual International Conference, COCOON 2005, Kunming, China, August 16-29, 2005, Proceedings, pp. 570-576, 2005, Springer, 3-540-28061-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Daniel Sawitzki |
A Symbolic Approach to the All-Pairs Shortest-Paths Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 154-167, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Talal Ali Al-Hawary, D. George McRae |
Toward an Elementary Axiomatic Theory of the Category of LP-Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 11(2), pp. 157-169, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
strong map, category, matroid |
19 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos |
(H, C, K)-Coloring: Fast, Easy, and Hard Cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 304-315, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Romeo Rizzi |
NOTE - On Minimizing Symmetric Set Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(3), pp. 445-450, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C85 |
19 | Donna Ghosh, Venkatesh Sarangan, Raj Acharya |
Distributed Quality of Service Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HiPC ![In: High Performance Computing - HiPC 2000, 7th International Conference, Bangalore, India, December 17-20, 2000, Proceedings, pp. 439-448, 2000, Springer, 3-540-41429-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
19 | Erich Prisner |
Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 273-287, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Michael M. Weigand |
Algorithmus 27 Ein neuer Algorithmus zur Bestimmung vonk-kürzesten Wegen in einem Graphen. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 16(1-2), pp. 139-151, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|