Search results for "noncrossing"

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.	Order	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.	Discret. Comput. Geom.	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.	GD	2003	DBLP DOI BibTeX RDF
64	Yoshiyuki Kusakari, Daisuke Masubuchi, Takao Nishizeki	Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs.	ISAAC	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.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
50	Gabriel Valiente	Constrained Tree Inclusion.	CPM	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.	Discret. Math.	2009	DBLP DOI BibTeX RDF
45	William Y. C. Chen, Sherry H. F. Yan	Noncrossing Trees and Noncrossing Graphs.	Electron. J. Comb.	2006	DBLP DOI BibTeX RDF
29	Himanshu Gupta, Rephael Wenger	Constructing pairwise disjoint paths with few links.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Link paths, isomorphic triangulations, noncrossing, polygon
29	Jean-Luc Baril, Jean Marcel Pallo	The Phagocyte Lattice of Dyck Words.	Order	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.	SIAM J. Discret. Math.	2024	DBLP DOI BibTeX RDF
22	Andrew Suk	Short edges and noncrossing paths in complete topological graphs.	CoRR	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.	SODA	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.	Adv. Appl. Math.	2022	DBLP DOI BibTeX RDF
22	Vincent Moulton, Taoyang Wu	Posets and Spaces of $k$-Noncrossing RNA Structures.	SIAM J. Discret. Math.	2022	DBLP DOI BibTeX RDF
22	Zhicong Lin, Dongsu Kim	A Combinatorial Bijection on k-Noncrossing Partitions.	Comb.	2022	DBLP DOI BibTeX RDF
22	Sabrina X. M. Pang, Lun Lv, Xiaoming Deng 0005	Decomposition and Merging Algorithms for Noncrossing Forests.	Graphs Comb.	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.	CoRR	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.	Inf. Process. Lett.	2021	DBLP DOI BibTeX RDF
22	Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto	Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.	Algorithmica	2021	DBLP DOI BibTeX RDF
22	Bridget Eileen Tenner	Star factorizations and noncrossing partitions.	Discret. Math.	2021	DBLP DOI BibTeX RDF
22	C. Matthew Farmer, Joshua Hallam, Clifford D. Smyth	The Noncrossing Bond Poset of a Graph.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
22	Bruno Santos, Thomas Kneib	Noncrossing structured additive multiple-output Bayesian quantile regression models.	Stat. Comput.	2020	DBLP DOI BibTeX RDF
22	Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto	Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.	CoRR	2020	DBLP BibTeX RDF
22	Juan B. Gil, Jordan Olliver Tirrell	A simple bijection for enhanced, classical, and 2-distant k-noncrossing partitions.	Discret. Math.	2020	DBLP DOI BibTeX RDF
22	Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto	Strongly Stable and Maximum Weakly Stable Noncrossing Matchings.	IWOCA	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.	J. Lang. Model.	2019	DBLP DOI BibTeX RDF
22	Richard Ehrenborg, Alex Happ	The antipode of the noncrossing partition lattice.	Adv. Appl. Math.	2019	DBLP DOI BibTeX RDF
22	Suthee Ruangwises, Toshiya Itoh	Stable Noncrossing Matchings.	CoRR	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.	CoRR	2019	DBLP BibTeX RDF
22	I. Kuban Altinel, Necati Aras, Zeynep Suvak, Z. Caner Taskin	Minimum cost noncrossing flow problem on layered networks.	Discret. Appl. Math.	2019	DBLP DOI BibTeX RDF
22	Kostas Manes, Ioannis Tasoulas, Aristidis Sapounakis, Panagiotis Tsikouras	Counting pairs of noncrossing binary paths: A bijective approach.	Discret. Math.	2019	DBLP DOI BibTeX RDF
22	Vincent Pilaud	Hopf algebras on decorated noncrossing arc diagrams.	J. Comb. Theory, Ser. A	2019	DBLP DOI BibTeX RDF
22	Suthee Ruangwises, Toshiya Itoh	Stable Noncrossing Matchings.	IWOCA	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.	DGCI	2019	DBLP DOI BibTeX RDF
22	Michael Dougherty, Jon McCammond	Undesired Parking Spaces and Contractible Pieces of the Noncrossing Partition Link.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
22	Zhicong Lin	Restricted inversion sequences and enhanced 3-noncrossing partitions.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
22	Alexander Garver, Thomas McConville	Oriented flip graphs of polygonal subdivisions and noncrossing tree partitions.	J. Comb. Theory, Ser. A	2018	DBLP DOI BibTeX RDF
22	Josep Tarragó, Moritz Weber	The classification of tensor categories of two-colored noncrossing partitions.	J. Comb. Theory, Ser. A	2018	DBLP DOI BibTeX RDF
22	Henri Mühle	Two Posets of Noncrossing Set Partitions.	Electron. Notes Discret. Math.	2017	DBLP DOI BibTeX RDF
22	Alessandro Conflitti, Ricardo Mamede	Gray codes for noncrossing and nonnesting partitions of classical types.	Int. J. Algebra Comput.	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.	SIAM J. Discret. Math.	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.	CoRR	2017	DBLP BibTeX RDF
22	Anssi Yli-Jyrä, Carlos Gómez-Rodríguez	Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing.	CoRR	2017	DBLP BibTeX RDF
22	Daniel Birmajer, Juan B. Gil, Michael D. Weiner	Colored partitions of a convex polygon by noncrossing diagonals.	Discret. Math.	2017	DBLP DOI BibTeX RDF
22	Eonkyung Lee, Sangjin Lee	Noncrossing partitions for periodic braids.	J. Comb. Theory, Ser. A	2017	DBLP DOI BibTeX RDF
22	Anssi Yli-Jyrä	Bounded-Depth High-Coverage Search Space for Noncrossing Parses.	FSMNLP	2017	DBLP DOI BibTeX RDF
22	Anssi Yli-Jyrä, Carlos Gómez-Rodríguez	Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing.	ACL (1)	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.	Electron. J. Comb.	2016	DBLP DOI BibTeX RDF
22	Thomas Gobet, Nathan Williams	Noncrossing partitions and Bruhat order.	Eur. J. Comb.	2016	DBLP DOI BibTeX RDF
22	Isaac Owino Okoth, Stephan G. Wagner	Locally Oriented Noncrossing Trees.	Electron. J. Comb.	2015	DBLP DOI BibTeX RDF
22	Nathan Reading	Noncrossing Arc Diagrams and Canonical Join Representations.	SIAM J. Discret. Math.	2015	DBLP DOI BibTeX RDF
22	Henri Mühle	EL-shellability and noncrossing partitions associated with well-generated complex reflection groups.	Eur. J. Comb.	2015	DBLP DOI BibTeX RDF
22	Marco Kuhlmann, Peter Jonsson	Parsing to Noncrossing Dependency Graphs.	Trans. Assoc. Comput. Linguistics	2015	DBLP DOI BibTeX RDF
22	Marco Kuhlmann	Tabulation of Noncrossing Acyclic Digraphs.	CoRR	2015	DBLP BibTeX RDF
22	Yufei Huang, Bolian Liu	Noncrossing partitions with fixed points having specific properties.	Ars Comb.	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.	CTW	2015	DBLP BibTeX RDF
22	Lun Lv, Sabrina X. M. Pang	A Decomposition Algorithm for Noncrossing Trees.	Electron. J. Comb.	2014	DBLP DOI BibTeX RDF
22	Frédéric Chapoton, Samuele Giraudo	Enveloping Operads and Bicolored Noncrossing Configurations.	Exp. Math.	2014	DBLP DOI BibTeX RDF
22	Jang Soo Kim, Seunghyun Seo, Heesung Shin	Annular noncrossing permutations and minimal transitive factorizations.	J. Comb. Theory, Ser. A	2014	DBLP DOI BibTeX RDF
22	Drew Armstrong, Brendon Rhoades, Nathan Williams	Rational Associahedra and Noncrossing Partitions.	Electron. J. Comb.	2013	DBLP DOI BibTeX RDF
22	Sabrina X. M. Pang, Lun Lv	A Refinement of Leaves on Noncrossing Trees.	Graphs Comb.	2013	DBLP DOI BibTeX RDF
22	Weiming Weng, Bolian Liu	Noncrossing matchings with fixed points.	Ars Comb.	2013	DBLP BibTeX RDF
22	Hua Sun	A group action on noncrossing partitions.	Discret. Math.	2013	DBLP DOI BibTeX RDF
22	Jirí Matousek 0001, Eric Sedgwick, Martin Tancer, Uli Wagner 0001	Untangling Two Systems of Noncrossing Curves.	GD	2013	DBLP DOI BibTeX RDF
22	Weiming Weng, Bolian Liu	A note on enumeration of noncrossing partitions.	Ars Comb.	2012	DBLP BibTeX RDF
22	William Y. C. Chen, Carol J. Wang	Noncrossing linked partitions and large (3, 2)-Motzkin paths.	Discret. Math.	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.	Electron. J. Comb.	2011	DBLP DOI BibTeX RDF
22	Jang Soo Kim	Bijections on two variations of noncrossing partitions.	Discret. Math.	2011	DBLP DOI BibTeX RDF
22	Ricardo Mamede	A bijection between noncrossing and nonnesting partitions of types A, B and C.	Contributions Discret. Math.	2011	DBLP BibTeX RDF
22	Franz Lehner 0002	A noncrossing basis for noncommutative invariants of SL(2, C).	J. Comb. Theory, Ser. A	2011	DBLP DOI BibTeX RDF
22	Jang Soo Kim	New interpretations for noncrossing partitions of classical types.	J. Comb. Theory, Ser. A	2011	DBLP DOI BibTeX RDF
22	Jang Soo Kim	Chain enumeration of k-divisible noncrossing partitions of classical types.	J. Comb. Theory, Ser. A	2011	DBLP DOI BibTeX RDF
22	Christian M. Reidys, Rita R. Wang, Albus Y. Y. Zhao	Modular, k-Noncrossing Diagrams.	Electron. J. Comb.	2010	DBLP DOI BibTeX RDF
22	Emma Yu Jin, Christian M. Reidys	On the decomposition of k-noncrossing RNA structures.	Adv. Appl. Math.	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.	Graphs Comb.	2010	DBLP DOI BibTeX RDF
22	A. B. Dieker, Jon Warren	Series Jackson Networks and Noncrossing Probabilities.	Math. Oper. Res.	2010	DBLP DOI BibTeX RDF
22	Ira M. Gessel, Jang Soo Kim	A note on 2-distant noncrossing partitions and weighted Motzkin paths.	Discret. Math.	2010	DBLP DOI BibTeX RDF
22	Jang Soo Kim	Bijections on two variations of noncrossing partitions.	Electron. Notes Discret. Math.	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.	Electron. J. Comb.	2009	DBLP DOI BibTeX RDF
22	D. Armstrong, Christian Krattenthaler	Euler Characteristic of the Truncated Order Complex of Generalized Noncrossing Partitions.	Electron. J. Comb.	2009	DBLP DOI BibTeX RDF
22	Guoce Xin, Terence Y. J. Zhang	Enumeration of bilaterally symmetric 3-noncrossing partitions.	Discret. Math.	2009	DBLP DOI BibTeX RDF
22	Sherry H. F. Yan, Xuezi Liu	2-noncrossing trees and 5-ary trees.	Discret. Math.	2009	DBLP DOI BibTeX RDF
22	Fenix W. D. Huang, Wade W. J. Peng, Christian M. Reidys	Folding 3-Noncrossing RNA Pseudoknot Structures.	J. Comput. Biol.	2009	DBLP DOI BibTeX RDF
22	Drew Armstrong, Sen-Peng Eu	Nonhomogeneous Parking Functions and Noncrossing Partitions.	Electron. J. Comb.	2008	DBLP BibTeX RDF
22	Eleni Tzanaki	Faces of Generalized Cluster Complexes and Noncrossing Partitions.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
22	Nathan Reading	Chains in the Noncrossing Partition Lattice.	SIAM J. Discret. Math.	2008	DBLP DOI BibTeX RDF
22	Toufik Mansour, Simone Severini	Enumeration of (k, 2)-noncrossing partitions.	Discret. Math.	2008	DBLP DOI BibTeX RDF
22	Anna de Mier	k-noncrossing and k-nonnesting graphs and fillings of Ferrers diagrams.	Electron. Notes Discret. Math.	2007	DBLP DOI BibTeX RDF
22	Anna de Mier	k -noncrossing and k -nonnesting graphs and fillings of ferrers diagrams.	Comb.	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.	Discret. Appl. Math.	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.	Random Struct. Algorithms	2007	DBLP DOI BibTeX RDF
22	Jon McCammond	Noncrossing Partitions in Surprising Locations.	Am. Math. Mon.	2006	DBLP BibTeX RDF
22	Alexander Burstein, Sergi Elizalde, Toufik Mansour	Restricted Dumont permutations, Dyck paths, and noncrossing partitions.	Discret. Math.	2006	DBLP DOI BibTeX RDF
22	Hugh Thomas	Tamari lattices and noncrossing partitions in type B.	Discret. Math.	2006	DBLP DOI BibTeX RDF
22	William Y. C. Chen, Eva Yu-Ping Deng, Rosena R. X. Du	Reduction of m-regular noncrossing partitions.	Eur. J. Comb.	2005	DBLP DOI BibTeX RDF
22	Christos A. Athanasiadis, Victor Reiner	Noncrossing Partitions for the Group Dn.	SIAM J. Discret. Math.	2004	DBLP DOI BibTeX RDF
22	Aristidis Sapounakis, Panagiotis Tsikouras	On the enumeration of noncrossing partitions with fixed points.	Ars Comb.	2004	DBLP BibTeX RDF
22	David S. Hough	Descents in Noncrossing Trees.	Electron. J. Comb.	2003	DBLP DOI BibTeX RDF
22	A. Panayotopoulos, Aristidis Sapounakis	On Motzkin words and noncrossing partitions.	Ars Comb.	2003	DBLP BibTeX RDF