Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
114 | Elena Barcucci, Antonio Bernini, Luca Ferrari 0001, Maddalena Poneti |
A Distributive Lattice Structure Connecting Dyck Paths, Noncrossing Partitions and 312-avoiding Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(4), pp. 311-328, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Dyck paths, noncrossing partitions, 312-avoiding permutations, Bell and Catalan numbers, strong Bruhat order, distributive lattice |
84 | Jeremy L. Martin, David Savitt, Ted Singer |
Harmonic Algebraic Curves and Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(2), pp. 267-286, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
64 | Jakub Cerný, Zdenek Dvorák 0001, Vít Jelínek, Jan Kára |
Noncrossing Hamiltonian Paths in Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers, pp. 86-97, 2003, Springer, 3-540-20831-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki |
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 337-346, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
62 | Gyula Károlyi, János Pach, Géza Tóth 0001, Pavel Valtr 0001 |
Ramsey-Type Results for Geometric Graphs, II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 20(3), pp. 375-388, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
50 | Gabriel Valiente |
Constrained Tree Inclusion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michocán, Mexico, June 25-27, 2003, Proceedings, pp. 361-371, 2003, Springer, 3-540-40311-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Tree inclusion, subtree homeomorphism, noncrossing bipartite matching, tree pattern matching |
45 | William Y. C. Chen, Sabrina X. M. Pang, Ellen X. Y. Qu, Richard P. Stanley |
Pairs of noncrossing free Dyck paths and noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(9), pp. 2834-2838, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | William Y. C. Chen, Sherry H. F. Yan |
Noncrossing Trees and Noncrossing Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 13(1), 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Himanshu Gupta, Rephael Wenger |
Constructing pairwise disjoint paths with few links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(3), pp. 26, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Link paths, isomorphic triangulations, noncrossing, polygon |
29 | Jean-Luc Baril, Jean Marcel Pallo |
The Phagocyte Lattice of Dyck Words. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(2-3), pp. 97-107, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Dyck words, noncrossing partitions, lattice |
22 | Yen-Jen Cheng, Sen-Peng Eu, Tung-Shan Fu, Jyun-Cheng Yao |
On \({\boldsymbol q}\)-Counting of Noncrossing Chains and Parking Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 38(1), pp. 917-946, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Andrew Suk |
Short edges and noncrossing paths in complete topological graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.08165, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | François Dross, Krzysztof Fleszar 0001, Karol Wegrzycki, Anna Zych-Pawlewicz |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, SODA 2023, Florence, Italy, January 22-25, 2023, pp. 1433-1463, 2023, SIAM, 978-1-61197-755-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Jean-Christophe Novelli, Jean-Yves Thibon |
Noncommutative symmetric functions and Lagrange inversion II: Noncrossing partitions and the Farahat-Higman algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 140, pp. 102396, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Vincent Moulton, Taoyang Wu |
Posets and Spaces of $k$-Noncrossing RNA Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(3), pp. 1586-1611, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Zhicong Lin, Dongsu Kim |
A Combinatorial Bijection on k-Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 42(4), pp. 559-586, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Sabrina X. M. Pang, Lun Lv, Xiaoming Deng 0005 |
Decomposition and Merging Algorithms for Noncrossing Forests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(1), pp. 2, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | François Dross, Krzysztof Fleszar 0001, Karol Wegrzycki, Anna Zych-Pawlewicz |
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.08904, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Marcos Oropeza, Csaba D. Tóth |
Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 170, pp. 106116, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto |
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 83(9), pp. 2678-2696, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Bridget Eileen Tenner |
Star factorizations and noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(7), pp. 112428, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | C. Matthew Farmer, Joshua Hallam, Clifford D. Smyth |
The Noncrossing Bond Poset of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(4), pp. 4, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Bruno Santos, Thomas Kneib |
Noncrossing structured additive multiple-output Bayesian quantile regression models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stat. Comput. ![In: Stat. Comput. 30(4), pp. 855-869, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto |
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2001.08468, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Juan B. Gil, Jordan Olliver Tirrell |
A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(6), pp. 111705, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto |
Strongly Stable and Maximum Weakly Stable Noncrossing Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, pp. 304-315, 2020, Springer, 978-3-030-48965-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Anssi Mikael Yli-Jyrä |
How to embed noncrossing trees in Universal Dependencies treebanks in a low-complexity regular language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Lang. Model. ![In: J. Lang. Model. 7(2), pp. 177-232, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Richard Ehrenborg, Alex Happ |
The antipode of the noncrossing partition lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 110, pp. 76-85, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Suthee Ruangwises, Toshiya Itoh |
Stable Noncrossing Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.02185, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Kostas Hatalis, Alberto J. Lamadrid, Katya Scheinberg, Shalinee Kishore |
A Novel Smoothed Loss and Penalty Function for Noncrossing Composite Quantile Estimation via Deep Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.12122, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin |
Minimum cost noncrossing flow problem on layered networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 261, pp. 2-21, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Kostas Manes, Ioannis Tasoulas, Aristidis Sapounakis, Panagiotis Tsikouras |
Counting pairs of noncrossing binary paths: A bijective approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(2), pp. 352-359, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Vincent Pilaud |
Hopf algebras on decorated noncrossing arc diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 161, pp. 486-507, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Suthee Ruangwises, Toshiya Itoh |
Stable Noncrossing Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings, pp. 405-416, 2019, Springer, 978-3-030-25004-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Marcos Oropeza, Csaba D. Tóth |
Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery - 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26-28, 2019, Proceedings, pp. 234-245, 2019, Springer, 978-3-030-14084-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Michael Dougherty, Jon McCammond |
Undesired Parking Spaces and Contractible Pieces of the Noncrossing Partition Link. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 25(1), pp. 1, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Zhicong Lin |
Restricted inversion sequences and enhanced 3-noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 70, pp. 202-211, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Alexander Garver, Thomas McConville |
Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 158, pp. 126-175, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Josep Tarragó, Moritz Weber |
The classification of tensor categories of two-colored noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 154, pp. 464-506, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Henri Mühle |
Two Posets of Noncrossing Set Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 61, pp. 885-891, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Alessandro Conflitti, Ricardo Mamede |
Gray codes for noncrossing and nonnesting partitions of classical types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Algebra Comput. ![In: Int. J. Algebra Comput. 27(5), pp. 455-475, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Hung-Chun Liang, Hsueh-I Lu |
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(1), pp. 454-476, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Hung-Chun Liang, Hsueh-I Lu |
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.07964, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Anssi Yli-Jyrä, Carlos Gómez-Rodríguez |
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.03357, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Daniel Birmajer, Juan B. Gil, Michael D. Weiner |
Colored partitions of a convex polygon by noncrossing diagonals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(4), pp. 563-571, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Eonkyung Lee, Sangjin Lee |
Noncrossing partitions for periodic braids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 151, pp. 36-50, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Anssi Yli-Jyrä |
Bounded-Depth High-Coverage Search Space for Noncrossing Parses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSMNLP ![In: Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing, FSMNLP 2017, Umeå, Sweden, September 2017, pp. 30-40, 2017, Association for Computational Linguistics. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Anssi Yli-Jyrä, Carlos Gómez-Rodríguez |
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACL (1) ![In: Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, ACL 2017, Vancouver, Canada, July 30 - August 4, Volume 1: Long Papers, pp. 1745-1755, 2017, Association for Computational Linguistics, 978-1-945626-75-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | David M. Einstein, Miriam Farber, Emily Gunawan, Michael Joseph, Matthew Macauley, James Propp, Simon Rubinstein-Salzedo |
Noncrossing Partitions, Toggles, and Homomesies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 23(3), pp. 3, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Thomas Gobet, Nathan Williams |
Noncrossing partitions and Bruhat order. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 53, pp. 8-34, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Isaac Owino Okoth, Stephan G. Wagner |
Locally Oriented Noncrossing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 22(3), pp. 3, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Nathan Reading |
Noncrossing Arc Diagrams and Canonical Join Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 29(2), pp. 736-750, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Henri Mühle |
EL-shellability and noncrossing partitions associated with well-generated complex reflection groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 43, pp. 249-278, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Marco Kuhlmann, Peter Jonsson |
Parsing to Noncrossing Dependency Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Assoc. Comput. Linguistics ![In: Trans. Assoc. Comput. Linguistics 3, pp. 559-570, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Marco Kuhlmann |
Tabulation of Noncrossing Acyclic Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.04993, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Yufei Huang, Bolian Liu |
Noncrossing partitions with fixed points having specific properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 118, pp. 51-61, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Yavuz Bogaç Türkogullari, I. Kuban Altinel, Z. Caner Taskin, Zeynep Suvak, Necati Aras |
Minimum Cost Noncrossing Flow Problem on a Layered Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CTW ![In: 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, Istanbul, Turkey, May 26-28, 2015., pp. 129-132, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
22 | Lun Lv, Sabrina X. M. Pang |
A Decomposition Algorithm for Noncrossing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 21(1), pp. 1, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Frédéric Chapoton, Samuele Giraudo |
Enveloping Operads and Bicolored Noncrossing Configurations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Exp. Math. ![In: Exp. Math. 23(3), pp. 332-349, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Jang Soo Kim, Seunghyun Seo, Heesung Shin |
Annular noncrossing permutations and minimal transitive factorizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 124, pp. 251-262, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Drew Armstrong, Brendon Rhoades, Nathan Williams |
Rational Associahedra and Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 20(3), pp. 54, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Sabrina X. M. Pang, Lun Lv |
A Refinement of Leaves on Noncrossing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 29(1), pp. 131-143, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Weiming Weng, Bolian Liu |
Noncrossing matchings with fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 109, pp. 161-170, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Hua Sun |
A group action on noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(20), pp. 2124-2126, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Jirí Matousek 0001, Eric Sedgwick, Martin Tancer, Uli Wagner 0001 |
Untangling Two Systems of Noncrossing Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing - 21st International Symposium, GD 2013, Bordeaux, France, September 23-25, 2013, Revised Selected Papers, pp. 472-483, 2013, Springer, 978-3-319-03840-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Weiming Weng, Bolian Liu |
A note on enumeration of noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 103, pp. 377-384, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
22 | William Y. C. Chen, Carol J. Wang |
Noncrossing linked partitions and large (3, 2)-Motzkin paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 312(11), pp. 1918-1922, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | William Y. C. Chen, Andrew Y. Z. Wang, Alina F. Y. Zhao |
Identities Derived from Noncrossing Partitions of Type B. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 18(1), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Jang Soo Kim |
Bijections on two variations of noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 311(12), pp. 1057-1063, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Ricardo Mamede |
A bijection between noncrossing and nonnesting partitions of types A, B and C. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 6(2), 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
22 | Franz Lehner 0002 |
A noncrossing basis for noncommutative invariants of SL(2, C). ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 118(1), pp. 257-269, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Jang Soo Kim |
New interpretations for noncrossing partitions of classical types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 118(4), pp. 1168-1189, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Jang Soo Kim |
Chain enumeration of k-divisible noncrossing partitions of classical types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 118(3), pp. 879-898, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Christian M. Reidys, Rita R. Wang, Albus Y. Y. Zhao |
Modular, k-Noncrossing Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 17(1), 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Emma Yu Jin, Christian M. Reidys |
On the decomposition of k-noncrossing RNA structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 44(1), pp. 53-70, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Luca Ferrari 0001 |
Some Combinatorics Related to Central Binomial Coefficients: Grand-Dyck Paths, Coloured Noncrossing Partitions and Signed Pattern Avoiding Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 26(1), pp. 51-70, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | A. B. Dieker, Jon Warren |
Series Jackson Networks and Noncrossing Probabilities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 35(2), pp. 257-266, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Ira M. Gessel, Jang Soo Kim |
A note on 2-distant noncrossing partitions and weighted Motzkin paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 310(23), pp. 3421-3425, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Jang Soo Kim |
Bijections on two variations of noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 283-288, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | William Y. C. Chen, Jing Qin 0006, Christian M. Reidys, Doron Zeilberger |
Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 16(1), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | D. Armstrong, Christian Krattenthaler |
Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 16(1), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Guoce Xin, Terence Y. J. Zhang |
Enumeration of bilaterally symmetric 3-noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(8), pp. 2497-2509, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Sherry H. F. Yan, Xuezi Liu |
2-noncrossing trees and 5-ary trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 309(20), pp. 6135-6138, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Fenix W. D. Huang, Wade W. J. Peng, Christian M. Reidys |
Folding 3-Noncrossing RNA Pseudoknot Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 16(11), pp. 1549-1575, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Drew Armstrong, Sen-Peng Eu |
Nonhomogeneous Parking Functions and Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 15(1), 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
22 | Eleni Tzanaki |
Faces of Generalized Cluster Complexes and Noncrossing Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(1), pp. 15-30, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Nathan Reading |
Chains in the Noncrossing Partition Lattice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 22(3), pp. 875-886, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Toufik Mansour, Simone Severini |
Enumeration of (k, 2)-noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(20), pp. 4570-4577, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | Anna de Mier |
k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 28, pp. 3-10, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Anna de Mier |
k -noncrossing and k -nonnesting graphs and fillings of ferrers diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(6), pp. 699-720, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Jakub Cerný, Zdenek Dvorák 0001, Vít Jelínek, Jan Kára |
Noncrossing Hamiltonian paths in geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 155(9), pp. 1096-1105, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | József Balogh, Boris G. Pittel, Gelasio Salazar |
Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 30(1-2), pp. 105-130, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Jon McCammond |
Noncrossing Partitions in Surprising Locations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 113(7), pp. 598-610, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
22 | Alexander Burstein, Sergi Elizalde, Toufik Mansour |
Restricted Dumont permutations, Dyck paths, and noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 306(22), pp. 2851-2869, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Hugh Thomas |
Tamari lattices and noncrossing partitions in type B. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 306(21), pp. 2711-2723, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | William Y. C. Chen, Eva Yu-Ping Deng, Rosena R. X. Du |
Reduction of m-regular noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 26(2), pp. 237-243, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Christos A. Athanasiadis, Victor Reiner |
Noncrossing Partitions for the Group Dn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 18(2), pp. 397-417, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Aristidis Sapounakis, Panagiotis Tsikouras |
On the enumeration of noncrossing partitions with fixed points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 73, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
22 | David S. Hough |
Descents in Noncrossing Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 10, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | A. Panayotopoulos, Aristidis Sapounakis |
On Motzkin words and noncrossing partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 69, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|