Search results for "Non-crossing"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
141	Naoki Katoh, Shin-ichi Tanigawa	Fast enumeration algorithms for non-crossing geometric graphs.	SCG	2008	DBLP DOI BibTeX RDF	non-crossing geometric graphs, triangulation, enumeration
102	David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley	Non-Crossing Frameworks with Non-Crossing Reciprocals.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
90	Noga Alon, Sridhar Rajagopalan, Subhash Suri	Long Non-Crossing Configurations in the Plane.	SCG	1993	DBLP DOI BibTeX RDF
63	David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa	Enumerating Constrained Non-crossing Minimally Rigid Frameworks.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Geometric enumeration, Constrained non-crossing minimally rigid frameworks, Rigidity, Constrained Delaunay triangulation
55	Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann	Fast RNA Structure Alignment for Crossing Input Structures.	CPM	2009	DBLP DOI BibTeX RDF	sequence structure alignment, simultaneous alignment and folding, RNA
54	David Orden, Francisco Santos	The polytope of non-crossing graphs on a planar point set.	ISSAC	2004	DBLP DOI BibTeX RDF	non-crossing graphs, polytope
49	David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa	Enumerating Non-crossing Minimally Rigid Frameworks.	COCOON	2006	DBLP DOI BibTeX RDF
46	Magnús M. Halldórsson, Christian Knauer, Andreas Spillner 0001, Takeshi Tokuyama	Fixed-Parameter Tractability for Non-Crossing Spanning Trees.	WADS	2007	DBLP DOI BibTeX RDF
40	Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo	Graphs of Triangulations and Perfect Matchings.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Non-crossing, Triangulation, Perfect matching
38	Sergey Bereg, Minghui Jiang 0001, Boting Yang, Binhai Zhu	On the Red/Blue Spanning Tree Problem.	TAMC	2009	DBLP DOI BibTeX RDF
33	Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki	Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.	ISAAC	1992	DBLP DOI BibTeX RDF
32	Naoki Katoh, Shin-ichi Tanigawa	Enumerating Constrained Non-crossing Geometric Spanning Trees.	COCOON	2007	DBLP DOI BibTeX RDF
32	David Orden, Francisco Santos	The Polytope of Non-Crossing Graphs on a Planar Point Set.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
32	Evanthia Papadopoulou	k-Pairs Non-Crossing Shortest Paths in a Simple Polygon.	ISAAC	1996	DBLP DOI BibTeX RDF
32	Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki	Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions.	ISAAC	1993	DBLP DOI BibTeX RDF
26	Gábor Fejes Tóth	Covering with Fat Convex Discs.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
23	Ri Choe, Taejin Park, Seung Min Ok, Kwang Ryel Ryu	Real-Time Scheduling for Non-crossing Stacking Cranes in an Automated Container Terminal.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF	stacking crane, automated container terminal, optimization, real-time scheduling
23	Aladár Heppes	Covering the Plane with Fat Ellipses without Non-Crossing Assumption.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
23	Aiqun Cao, Cheng-Kok Koh	Non-Crossing OBDDs for Mapping to Regular Circuit Structures.	ICCD	2003	DBLP DOI BibTeX RDF
18	Chunlin Liu, Baodi Li	Bicoloured ordered trees, non-nesting partitions and non-crossing partitions.	Ars Comb.	2016	DBLP BibTeX RDF
17	Yu Zhuang, Xian-He Sun	A Highly Parallel Algorithm for the Numerical Simulation of Unsteady Diffusion Processes.	IPDPS	2005	DBLP DOI BibTeX RDF
17	Ileana Streinu, Walter Whiteley	Single-Vertex Origami and Spherical Expansive Motions.	JCDCG	2004	DBLP DOI BibTeX RDF
17	Irene Finocchi	Layered Drawings of Graphs with Crossing Constraints.	COCOON	2001	DBLP DOI BibTeX RDF
16	Zhuozhi Wang, Kaizhong Zhang	Alignment between Two RNA Structures.	MFCS	2001	DBLP DOI BibTeX RDF
16	Cyril Gavoille, Nicolas Hanusse	Compact Routing Tables for Graphs of Bounded Genus.	ICALP	1999	DBLP DOI BibTeX RDF
15	Jungmin Shin, Seunghyun Gwak, Seung Jun Shin, Sungwan Bang	Simultaneous estimation and variable selection for a non-crossing multiple quantile regression using deep neural networks.	Stat. Comput.	2024	DBLP DOI BibTeX RDF
15	Júlia Baligács, Yann Disser, Andreas Emil Feldmann, Anna Zych-Pawlewicz	A (5/3+ε)-Approximation for Tricolored Non-crossing Euclidean TSP.	CoRR	2024	DBLP DOI BibTeX RDF
15		Algebraic methods for solving recognition problems with non-crossing classes.	CoRR	2024	DBLP DOI BibTeX RDF
15	Ioannis Mantas, Marko Savic, Hendrik Schrezenmaier	New variants of perfect non-crossing matchings.	Discret. Appl. Math.	2024	DBLP DOI BibTeX RDF
15	Adrian Celestino, Kurusch Ebrahimi-Fard, Alexandru Nica, Daniel Perales, Leon Witzman	Multiplicative and semi-multiplicative functions on non-crossing partitions, and relations to cumulants.	Adv. Appl. Math.	2023	DBLP DOI BibTeX RDF
15	Ali Mohammad Lavasani, Denis Pankratov	Advice complexity of online non-crossing matching.	Comput. Geom.	2023	DBLP DOI BibTeX RDF
15	Jaeoh Kim, Byoungwook Jang, Sungwan Bang	Model-based recursive partitioning algorithm to penalized non-crossing multiple quantile regression for the right-censored data.	Commun. Stat. Simul. Comput.	2023	DBLP DOI BibTeX RDF
15	Woo Young Shin, Yoonsuh Jung	Deep support vector quantile regression with non-crossing constraints.	Comput. Stat.	2023	DBLP DOI BibTeX RDF
15	Toufik Mansour, Mark Shattuck	Counting occurrences of subword patterns in non-crossing partitions.	Art Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
15	Xiao Peng, Olivier Simonin 0001, Christine Solnon	Non-Crossing Anonymous MAPF for Tethered Robots.	J. Artif. Intell. Res.	2023	DBLP DOI BibTeX RDF
15	Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron	A note on the flip distance between non-crossing spanning trees.	CoRR	2023	DBLP DOI BibTeX RDF
15	David Eppstein	Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time.	CoRR	2023	DBLP DOI BibTeX RDF
15	Steven Chaplick	Intersection graphs of non-crossing paths.	Discret. Math.	2023	DBLP DOI BibTeX RDF
15	Nicolas Bousquet, Valentin Gledel, Jonathan Narboni, Théo Pierron	A Note on the Flip Distance between Non-crossing Spanning Trees.	Comput. Geom. Topol.	2023	DBLP BibTeX RDF
15	B. S. Panda 0001, Sachin	Algorithms and Complexity of Strongly Stable Non-crossing Matchings.	CALDAM	2023	DBLP DOI BibTeX RDF
15	David Eppstein	Non-Crossing Hamiltonian Paths and Cycles in Output-Polynomial Time.	SoCG	2023	DBLP DOI BibTeX RDF
15	Lorenzo Balzotti, Paolo Giulio Franciosa	Non-crossing Shortest Paths Lengths in Planar Graphs in Linear Time.	CIAC	2023	DBLP DOI BibTeX RDF
15	Lorenzo Balzotti	Non-crossing shortest paths in planar graphs with applications to max flow, and path graphs.		2023	RDF
15	Marko Savic, Milos Stojakovic	Structural properties of bichromatic non-crossing matchings.	Appl. Math. Comput.	2022	DBLP DOI BibTeX RDF
15	Lorenzo Balzotti, Paolo Giulio Franciosa	Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.	J. Graph Algorithms Appl.	2022	DBLP DOI BibTeX RDF
15	Wenlu Tang, Guohao Shen, Yuanyuan Lin, Jian Huang 0003	Nonparametric Quantile Regression: Non-Crossing Constraints and Conformal Prediction.	CoRR	2022	DBLP DOI BibTeX RDF
15	Guohao Shen, Yuling Jiao, Yuanyuan Lin, Joel L. Horowitz, Jian Huang 0003	Estimation of Non-Crossing Quantile Regression Process with Deep ReQU Neural Networks.	CoRR	2022	DBLP DOI BibTeX RDF
15	Lorenzo Balzotti	Non-Crossing Shortest Paths are Covered with Exactly Four Forests.	CoRR	2022	DBLP DOI BibTeX RDF
15	Axel Brando, Joan Gimeno, José A. Rodríguez-Serrano, Jordi Vitrià	Deep Non-Crossing Quantiles through the Partial Derivative.	CoRR	2022	DBLP BibTeX RDF
15	Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno	Reconfiguration of Non-crossing Spanning Trees.	CoRR	2022	DBLP DOI BibTeX RDF
15	Gi-Sang Cheon, Hong Joon Choi, Guillermo Esteban, Minho Song	Enumeration of bipartite non-crossing geometric graphs.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
15	Lorenzo Balzotti, Paolo Giulio Franciosa	Non-crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.	CSR	2022	DBLP DOI BibTeX RDF
15	Shahin Kamali, Pooya Nikbakht, Arezoo Sajadpour	A Randomized Algorithm for Non-crossing Matching of Online Points.	CCCG	2022	DBLP BibTeX RDF
15	Neeldhara Misra, Harshil Mittal, Saraswati Nanoti	Diverse Non Crossing Matchings.	CCCG	2022	DBLP BibTeX RDF
15	Axel Brando, Joan Gimeno, José A. Rodríguez-Serrano, Jordi Vitrià	Deep Non-crossing Quantiles through the Partial Derivative.	AISTATS	2022	DBLP BibTeX RDF
15	Norman Do, Jian He, Daniel V. Mathews	Counting Non-Crossing Permutations on Surfaces of any Genus.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
15	Thomas Lange	Representing non-crossing cuts by phylogenetic trees.	Electron. J. Graph Theory Appl.	2021	DBLP DOI BibTeX RDF
15	Ali Mohammad Lavasani, Denis Pankratov	Advice Complexity of Online Non-Crossing Matching.	CoRR	2021	DBLP BibTeX RDF
15	Alix Lhéritier, Nicolas Bondoux	A Cramér Distance perspective on Non-crossing Quantile Regression in Distributional Reinforcement Learning.	CoRR	2021	DBLP BibTeX RDF
15	Ioannis Mantas, Marko Savic, Hendrik Schrezenmaier	New Variants of Perfect Non-crossing Matchings.	CALDAM	2021	DBLP DOI BibTeX RDF
15	Tao Yang, Peng Li 0019, Qing Shi, Yunhui Liu	Deployable Polyhedral Mechanisms with Radially Reciprocating Motion Based on Non-Crossing Angulated Structural Element.	RCAR	2021	DBLP DOI BibTeX RDF
15	Xiao Peng, Christine Solnon, Olivier Simonin 0001	Solving the Non-Crossing MAPF with CP.	CP	2021	DBLP DOI BibTeX RDF
15	Robert Mcalmon, Suho Oh	The Rank Function of a Positroid and Non-Crossing Partitions.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
15	Ioannis Mantas, Marko Savic, Hendrik Schrezenmaier	The Very Best of Perfect Non-crossing Matchings.	CoRR	2020	DBLP BibTeX RDF
15	Lorenzo Balzotti, Paolo Giulio Franciosa	Computing Lengths of Shortest Non-Crossing Paths in Planar Graphs.	CoRR	2020	DBLP BibTeX RDF
15	Dimitrina S. Dimitrova, Zvetan G. Ignatov, Vladimir K. Kaishev, Senren Tan	On double-boundary non-crossing probability for a class of compound processes with applications.	Eur. J. Oper. Res.	2020	DBLP DOI BibTeX RDF
15	Prosenjit Bose, Paz Carmi, Stephane Durocher, Shahin Kamali, Arezoo Sajadpour	Non-Crossing Matching of Online Points.	CCCG	2020	DBLP BibTeX RDF
15	Fan Zhou, Jianing Wang, Xingdong Feng	Non-Crossing Quantile Regression for Distributional Reinforcement Learning.	NeurIPS	2020	DBLP BibTeX RDF
15	Omar Abou Kasm, Ali Diabat	The quay crane scheduling problem with non-crossing and safety clearance constraints: An exact solution approach.	Comput. Oper. Res.	2019	DBLP DOI BibTeX RDF
15	Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek	Non-crossing paths with geographic constraints.	Discret. Math. Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
15	Steven Chaplick	Intersection Graphs of Non-crossing Paths.	CoRR	2019	DBLP BibTeX RDF
15	James A. Mingo	Non-crossing annular pairings and the infinitesimal distribution of the goe.	J. Lond. Math. Soc.	2019	DBLP DOI BibTeX RDF
15	Steven Chaplick	Intersection Graphs of Non-crossing Paths.	WG	2019	DBLP DOI BibTeX RDF
15	Julia Heller, Petra Schwer	Generalized Non-Crossing Partitions and Buildings.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
15	Andrei Asinowski, Günter Rote	Point sets with many non-crossing perfect matchings.	Comput. Geom.	2018	DBLP DOI BibTeX RDF
15	Mikio Kano, Kenta Noguchi, David Orden	Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets.	CoRR	2018	DBLP BibTeX RDF
15	Marko Savic, Milos Stojakovic	Bottleneck Bichromatic Non-crossing Matchings using Orbits.	CoRR	2018	DBLP BibTeX RDF
15	Igor Kortchemski, Cyril Marzouk	Simply Generated Non-Crossing Partitions.	Comb. Probab. Comput.	2017	DBLP DOI BibTeX RDF
15	Marko Savic, Milos Stojakovic	Faster bottleneck non-crossing matchings of points in convex position.	Comput. Geom.	2017	DBLP DOI BibTeX RDF
15	Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu	Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots.	CoRR	2017	DBLP BibTeX RDF
15	Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek	Non-crossing paths with geographic constraints.	CoRR	2017	DBLP BibTeX RDF
15	An Zhang 0001, Wenshuai Zhang, Yong Chen 0002, Guangting Chen, Xufeng Chen	Approximate the scheduling of quay cranes with non-crossing constraints.	Eur. J. Oper. Res.	2017	DBLP DOI BibTeX RDF
15	Irina Kostitsyna, Bettina Speckmann, Kevin Verbeek	Non-Crossing Geometric Steiner Arborescences.	ISAAC	2017	DBLP DOI BibTeX RDF
15	Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek	Non-crossing Paths with Geographic Constraints.	GD	2017	DBLP DOI BibTeX RDF
15	Shin-ichi Tanigawa	Enumeration of Non-crossing Geometric Graphs.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
15	Louis Esperet, Daniel Gonçalves 0001, Arnaud Labourel	Coloring Non-Crossing Strings.	Electron. J. Comb.	2016	DBLP DOI BibTeX RDF
15	Sungwan Bang, HyungJun Cho, Myoungshic Jhun	Simultaneous estimation for non-crossing multiple quantile regression with right censored data.	Stat. Comput.	2016	DBLP DOI BibTeX RDF
15	Paul Drube, Puttipong Pongtanapaisan	Annular Non-Crossing Matchings.	J. Integer Seq.	2016	DBLP BibTeX RDF
15	Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou	A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters.	Algorithmica	2016	DBLP DOI BibTeX RDF
15	Marko Savic, Milos Stojakovic	Faster Bottleneck Non-crossing Matchings of Points in Convex Position.	CoRR	2016	DBLP BibTeX RDF
15	Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.	CoRR	2016	DBLP BibTeX RDF
15	Édouard Bonnet, Tillmann Miltzow	Flip Distance to a Non-crossing Perfect Matching.	CoRR	2016	DBLP BibTeX RDF
15	Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia	Configurations of Non-crossing Rays and Related Problems.	Discret. Comput. Geom.	2016	DBLP DOI BibTeX RDF
15	Chee K. Yap, Zhongdi Luo, Ching-Hsiang Hsu	Resolution-Exact Planner for Thick Non-Crossing 2-Link Robots.	WAFR	2016	DBLP DOI BibTeX RDF
15	Laurent Méhats, Lutz Straßburger	Non-crossing Tree Realizations of Ordered Degree Sequences.	LACL	2016	DBLP DOI BibTeX RDF
15	Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen	Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.	SPIRE	2016	DBLP DOI BibTeX RDF
15	Oswin Aichholzer, Andrei Asinowski, Tillmann Miltzow	Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position.	Electron. J. Comb.	2015	DBLP DOI BibTeX RDF
15	Maryam Tahmasbi, Narges Mirehi	Thick non-crossing paths in a polygonal domain.	Optim. Lett.	2015	DBLP DOI BibTeX RDF
15	Clemens Huemer, Anna de Mier	Lower bounds on the maximum number of non-crossing acyclic graphs.	Eur. J. Comb.	2015	DBLP DOI BibTeX RDF
15	Sergi Elizalde	Bijections for pairs of non-crossing lattice paths and walks in the plane.	Eur. J. Comb.	2015	DBLP DOI BibTeX RDF