The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for crossing with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1956-1975 (17) 1976-1978 (15) 1979-1982 (17) 1983-1985 (15) 1986-1988 (21) 1989-1990 (24) 1991 (22) 1992 (18) 1993 (22) 1994 (24) 1995 (32) 1996 (35) 1997 (41) 1998 (34) 1999 (78) 2000 (48) 2001 (84) 2002 (73) 2003 (102) 2004 (149) 2005 (170) 2006 (200) 2007 (233) 2008 (207) 2009 (161) 2010 (114) 2011 (134) 2012 (124) 2013 (145) 2014 (123) 2015 (140) 2016 (264) 2017 (131) 2018 (137) 2019 (172) 2020 (180) 2021 (241) 2022 (202) 2023 (177) 2024 (42)
Publication types (Num. hits)
article(1893) book(1) incollection(20) inproceedings(2236) phdthesis(16) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1261 occurrences of 923 keywords

Results
Found 4168 publication records. Showing 4168 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
114Naoki Katoh, Shin-ichi Tanigawa Fast enumeration algorithms for non-crossing geometric graphs. Search on Bibsonomy SCG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF non-crossing geometric graphs, triangulation, enumeration
101Vida Dujmovic, Ken-ichi Kawarabayashi, Bojan Mohar, David R. Wood Improved upper bounds on the crossing number. Search on Bibsonomy SCG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF convex crossing number, rectilinear crossing number, graph drawing, treewidth, crossing number, graph minors, pathwidth, maximum degree
101Petr Hlinený, Gelasio Salazar On the Crossing Number of Almost Planar Graphs. Search on Bibsonomy GD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF crossing-critical graphs, planarization, crossing number, crossing minimization
99Jacob O. Wobbrock, Krzysztof Z. Gajos A comparison of area pointing and goal crossing for people with and without motor impairments. Search on Bibsonomy ASSETS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF area pointing, goal crossing, throughput, Fitts' law, mouse, target acquisition, steering law, trackball
92Morgan Dixon, François Guimbretière, Nicholas Chen Optimal parameters for efficient crossing-based dialog boxes. Search on Bibsonomy CHI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF crossing-based interfaces, dialog box, interaction design, graphical user interfaces
81Géza Tóth 0001 Note on the Pair-crossing Number and the Odd-crossing Number. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Drawings of a graph, Crossing number
81David Orden, Günter Rote, Francisco Santos, Brigitte Servatius, Herman Servatius, Walter Whiteley Non-Crossing Frameworks with Non-Crossing Reciprocals. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
77Noga Alon, Sridhar Rajagopalan, Subhash Suri Long Non-Crossing Configurations in the Plane. Search on Bibsonomy SCG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
70Clifton Forlines, Ravin Balakrishnan Evaluating tactile feedback and direct vs. indirect stylus input in pointing and crossing selection tasks. Search on Bibsonomy CHI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF crossing interfaces, direct & indirect input, haptic & tactile feedback, pen/stylus input
70Johnny Accot, Shumin Zhai More than dotting the i's - foundations for crossing-based interfaces. Search on Bibsonomy CHI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF goal crossing, goal passing, input performance, graphical user interfaces, interaction techniques, events, Fitts' law, pointing, input, widgets
70Tadayoshi Shioyama Computer Vision Based Travel Aid for the Blind Crossing Roads. Search on Bibsonomy ACIVS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
70Xiaoyu Song, Yuke Wang On the crossing distribution problem. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF VLSI layout, crossings
63Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, Salvatore Pontarelli QCA Circuits for Robust Coplanar Crossing. Search on Bibsonomy J. Electron. Test. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF coplanar crossing, temperature characterization, defect characterization, Bayesian network, QCA, TMR
63Xiaohui Lin 0002, Yuansheng Yang, Jianguo Lü, Xin Hao The Crossing Number of C(mk;{1, k}). Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Generalized Petersen graph, Crossing number, Circulant graph
63Georg Apitz, François Guimbretière CrossY: a crossing-based drawing application. Search on Bibsonomy UIST The full citation details ... 2004 DBLP  DOI  BibTeX  RDF command composition, crossing based interfaces, fluid interaction, pen-computing
62Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann Fast RNA Structure Alignment for Crossing Input Structures. Search on Bibsonomy CPM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF sequence structure alignment, simultaneous alignment and folding, RNA
62Micha Sharir, Emo Welzl On the number of crossing-free matchings, (cycles, and partitions). Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
59Shiaofen Fang, Pooja Gupta Boundary surface extraction and rendering for volume datasets. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF iso-surface extraction, multi-scale space, zero-crossing surfaces, volume visualization
56János Pach, Géza Tóth 0001 Degenerate Crossing Numbers. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Crossing lemma, Multiple crossings, Crossing number, Incidences, Euler characteristics, Bisection width
56Eun Kyoung Choe, Kristen Shinohara, Parmit K. Chilana, Morgan Dixon, Jacob O. Wobbrock Exploring the design of accessible goal crossing desktop widgets. Search on Bibsonomy CHI Extended Abstracts The full citation details ... 2009 DBLP  DOI  BibTeX  RDF crossing-based interfaces, desktop accessibility, mouse cursor, input, human performance, motor impairments, computer access
56Marián Klesc On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph, drawing, crossing number, Cartesian product, star
56Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic Crossing Number of Graphs with Rotation Systems. Search on Bibsonomy GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF computational complexity, computational geometry, crossing number
56Petr Hlinený Crossing Number Is Hard for Cubic Graphs. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF NP-completeness, Crossing number, cubic graph
55Markus Chimani, Petra Mutzel, Immanuel M. Bomze A New Approach to Exact Crossing Minimization. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
55Yehea I. Ismail, Chirayu S. Amin Computation of signal-threshold crossing times directly from higher order moments. Search on Bibsonomy IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
55Petr Hlinený Crossing-Critical Graphs and Path-Width. Search on Bibsonomy GD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
55Petra Mutzel, Thomas Ziegler 0002 The Constrained Crossing Minimization Problem. Search on Bibsonomy GD The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
51Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf 0004 Inserting a vertex into a planar graph. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
49Vida Dujmovic, Sue Whitesides An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF FPT, Sided crossing minimization, Layer crossing minimization, Layer drawings, Level drawings, NP-completeness, Graph drawing, Fixed parameter tractability
48Erik Franken, Remco Duits Crossing-Preserving Coherence-Enhancing Diffusion on Invertible Orientation Scores. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Crossing elongated structures, Orientation scores, Coherence-enhancing diffusion, Euclidean motion group, Image enhancement, Nonlinear diffusion
48David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa Enumerating Constrained Non-crossing Minimally Rigid Frameworks. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Geometric enumeration, Constrained non-crossing minimally rigid frameworks, Rigidity, Constrained Delaunay triangulation
48Ana Busic, Tadeusz Czachórski, Jean-Michel Fourneau, Krzysztof Grochla Level crossing ordering of Markov chains: computing end to end delays in an all optical network. Search on Bibsonomy VALUETOOLS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF level crossing comparison of Markov chains, end to end delay, deflection routing, stochastic ordering
48Brian Stephen Smith, Sung Kyu Lim QCA channel routing with wire crossing minimization. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2005 DBLP  DOI  BibTeX  RDF QCA channel routing, weighted minimum feedback edge set, wire crossing minimization
48Shinji Watanabe 0002, Yujiro Akimoto, Takashi Komatsu, Takahiro Saito A new stabilized zero-crossing representation in the wavelet transform domain and signal reconstruction. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF stabilized zero-crossing representation, wavelet transform domain, local features extraction, minimum-norm optimization problem, linear simultaneous equation, fractional sampling interval accuracy, iterative reconstruction algorithm, feature extraction, wavelet transforms, image reconstruction, image reconstruction, iterative methods, image representation, minimisation, image sampling, numerical stability, picture quality, signal reconstruction
48Tamara Mchedlidze, Antonios Symvonis Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
48Haojie Wu, Daniel H. Ashmead, Bobby Bodenheimer Using immersive virtual reality to evaluate pedestrian street crossing decisions at a roundabout. Search on Bibsonomy APGV The full citation details ... 2009 DBLP  DOI  BibTeX  RDF virtual reality (VR), space perception
48Hidefumi Wakamatsu, Akira Tsumaya, Eiji Arai, Shinichi Hirai Unraveling of Deformable Linear Objects Based on 2D Information about Their Crossing States. Search on Bibsonomy IROS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
48Vittorio Bilò, Vineet Goyal, R. Ravi 0001, Mohit Singh On the Crossing Spanning Tree Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
48Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto Book Embeddings and Crossing Numbers. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
44Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic Odd Crossing Number and Crossing Number Are Not the Same. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Sergio Cabello, Bojan Mohar Crossing and Weighted Crossing Number of Near-Planar Graphs. Search on Bibsonomy GD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
44Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic Odd Crossing Number Is Not Crossing Number. Search on Bibsonomy GD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Sergio Cabello, Bojan Mohar Adding one edge to planar graphs makes crossing number hard. Search on Bibsonomy SCG The full citation details ... 2010 DBLP  DOI  BibTeX  RDF NP-hard, graph drawing, planar graphs, graph embedding, crossing number, topological graph theory
41Takashi Nakamura, Shin Takahashi, Jiro Tanaka Double-Crossing: A New Interaction Technique for Hand Gesture Interfaces. Search on Bibsonomy APCHI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Large display, Hand gesture, Crossing
41Markus Chimani, Petr Hlinený, Petra Mutzel Approximating the Crossing Number of Apex Graphs. Search on Bibsonomy GD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF apex graph, vertex insertion, Crossing number
41Ken-ichi Kawarabayashi, Bruce A. Reed Computing crossing number in linear time. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF linear time algorithm, crossing number, tree-width
41Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser On the Crossing Number of Complete Graphs. Search on Bibsonomy Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF enumeration, Crossing number, complete graph, order types
41Oswin Aichholzer, Hannes Krasser Abstract order type extension and new results on the rectilinear crossing number. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF pseudoline arrangement, rectilinear crossing number, complete graph, order type
41Saeid Arabestani, Friedemann Bitsch, Jan-Tecker Gayen Precise Definition of the Single-Track Level Crossing in Radio-Based Operation in UML Notation and Specification of Safety Requirements. Search on Bibsonomy SoftSpez Final Report The full citation details ... 2004 DBLP  DOI  BibTeX  RDF safety requirements specification, safety patterns, radio-based train control system (FFB), UML, object orientation, level crossing
41David Orden, Francisco Santos The polytope of non-crossing graphs on a planar point set. Search on Bibsonomy ISSAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF non-crossing graphs, polytope
41David Perry, Wolfgang Stadje, Shelemyahu Zacks Boundary Crossing for the Difference of Two Ordinary or Compound Poisson Processes. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF compound Poisson process, boundary crossing, queue with negative customers, two-sided stopping time, cycle maximum, busy period, deterministic service time
41Oswin Aichholzer, Franz Aurenhammer, Hannes Krasser On the crossing number of complete graphs. Search on Bibsonomy SCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF rectilinear crossing number, complete graph, order type
41Matthias F. M. Stallmann, Franc Brglez, Debabrata Ghosh Heuristics and Experimental Design for Bigraph Crossing Number Minimization. Search on Bibsonomy ALENEX The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Crossing number minimization in graphs, graph equivalence classes, design of experiments
40Petra Mutzel The Crossing Number of Graphs: Theory and Computation. Search on Bibsonomy Efficient Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
40Daisuke Hosotani, Ikushi Yoda, Katsuhiko Sakaue Development and Long-Term Verification of Stereo Vision Sensor System for Controlling Safety at Railroad Crossing. Search on Bibsonomy ICVS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
40Weidong Huang 0001, Seok-Hee Hong 0001, Peter Eades Effects of Crossing Angles. Search on Bibsonomy PacificVis The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Markus Chimani, Michael Jünger, Michael Schulz 0001 Crossing Minimization meets Simultaneous Drawing. Search on Bibsonomy PacificVis The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Hong Zhang, Ali Abdi On the average crossing rates in selection diversity. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Magnús M. Halldórsson, Christian Knauer, Andreas Spillner 0001, Takeshi Tokuyama Fixed-Parameter Tractability for Non-Crossing Spanning Trees. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic Crossing Numbers and Parameterized Complexity. Search on Bibsonomy GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
40Markus Chimani, Carsten Gutwenger, Petra Mutzel Experiments on Exact Crossing Minimization Using Column Generation. Search on Bibsonomy WEA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40David R. Wood, Jan Arne Telle Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. Search on Bibsonomy GD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa Enumerating Non-crossing Minimally Rigid Frameworks. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Carlos Santamaria, Miroslaw Bober, Wieslaw Szajnowski Texture Analysis using Level-crossing Statistics. Search on Bibsonomy ICPR (2) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
40Yehea I. Ismail, Chirayu S. Amin Computation of signal threshold crossing times directly from higher order moments. Search on Bibsonomy ICCAD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Buntarou Shizuki, Takaomi Hisamatsu, Shin Takahashi, Jiro Tanaka Laser pointer interaction techniques using peripheral areas of screens. Search on Bibsonomy AVI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF computer-based presentation, goal crossing, interaction techniques, pointing, laser pointers
37Philippe Polet, Frédéric Vanderhaegen, Peter A. Wieringa Theory of Safety-Related Violations of System Barriers. Search on Bibsonomy Cogn. Technol. Work. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Barrier crossing, Hazardous conditions, Human factors, Risk analysis, Violation
37Kyeong-Ryeol Park, Chung-Nim Lee Scale-Space Using Mathematical Morphology. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF causal property, generalized zero-crossing, alternating sequential filter, Mathematical morphology, fingerprints, scale-space
37Sergey Bereg, Minghui Jiang 0001, Boting Yang, Binhai Zhu On the Red/Blue Spanning Tree Problem. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Paul Y. S. Cheung, S. K. Yeung, W. L. Ko A new optimization model for VLSI placement algorithms. Search on Bibsonomy ISCAS (6) The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Robert Jankowski Numerical Simulation of Threshold-Crossing Problem for Random Fields of Environmental Contamination. Search on Bibsonomy ICCS (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF environmental contamination, threshold-crossing, numerical simulation, random fields
34Michael A. Bekos, Michael Kaufmann 0001, Katerina Potika, Antonios Symvonis Line Crossing Minimization on Metro Maps. Search on Bibsonomy GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Metro Maps, Trees, Lines, Paths, Crossing Minimization
34Eyal Ackerman On the maximum number of edges in topological graphs with no four pairwise crossing edges. Search on Bibsonomy SCG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF extremal graph theory, pairwise crossing edges, geometric graphs, topological graphs
34Adrian Riskin On the Nonembeddability and Crossing Numbers of Some Kleinical Polyhedral Maps on the Torus. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Reimbedding, Nontoroidal graphs, Crossing numbers
34Bernardo M. Ábrego, Silvia Fernández-Merchant A Lower Bound for the Rectilinear Crossing Number. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Allowable sequence, k-set, Convex quadrilateral, Crossing number
34Jack Koplowitz, Vito Greco On the Edge Location Error for Local Maximum and Zero-Crossing Edge Detectors. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF edge location error, local maximum detectors, zero-crossing edge detectors, localization criterion, root-mean-square error, localization measure, image processing, image segmentation, image segmentation, feature extraction, feature extraction, probability, edge detection, errors, variance, probability density function, closed-form solution
34James J. Clark Authenticating Edges Produced by Zero-Crossing Algorithms. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF edge authentication, zero-crossing edge detection algorithms, phantom edges, authentic edges, pattern recognition, pattern recognition, picture processing, picture processing
33Éva Czabarka, Ondrej Sýkora, László A. Székely, Imrich Vrto Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method. Search on Bibsonomy Random Struct. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Yun Zhai, Arun Hampapur Virtual Boundary Crossing Detection without Explicit Object Tracking. Search on Bibsonomy AVSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Seok-Hee Hong 0001, Hiroshi Nagamochi Approximating Crossing Minimization in Radial Layouts. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Nagesha, G. Hemantha Kumar 0001 Signal Resampling Technique Combining Level Crossing and Auditory Features. Search on Bibsonomy PReMI The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Sang Kyoon Park, Rhee Man Kil, Young-Giu Jung, Mun-Sung Han Zero-Crossing-Based Feature Extraction for Voice Command Systems Using Neck-Microphones. Search on Bibsonomy ISNN (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Jacob Fox, János Pach, Csaba D. Tóth A Bipartite Strengthening of the Crossing Lemma. Search on Bibsonomy GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33Chi-Chung Tao A Combinatorial Approach to Quantify Stochastic Failure of Complex Component-Based Systems_The Case of an Advanced Railway Level Crossing Surveillance System. Search on Bibsonomy FSKD (4) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
33János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth 0001 Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Hongmei He, O. Skora, E. Mkinen An Improved Neural Network Model for the Two-Page Crossing Number Problem. Search on Bibsonomy IEEE Trans. Neural Networks The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Yawgeng A. Chau, Karl Yung-Ta Huang Average Level Crossing Rates and Average Fade Durations of Multi-Branch Selection Diversity over Dependent Weibull Fading Channels. Search on Bibsonomy VTC Spring The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Neji Youssef, W. Elbahri, Matthias Pätzold 0001, S. Elasmi On the crossing statistics of phase processes and random FM noise in Nakagami-q mobile fading channels. Search on Bibsonomy IEEE Trans. Wirel. Commun. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33S. Chandra Sekhar, T. V. Sreenivas Auditory motivated level-crossing approach to instantaneous frequency estimation. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Georg Apitz, François Guimbretière CrossY: a crossing-based drawing application. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Tino Lourens, Emilia I. Barakova TiViPE Simulation of a Cortical Crossing Cell Model. Search on Bibsonomy IWANN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher Exact Crossing Minimization. Search on Bibsonomy GD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Panlong Yang, Chang Tian Crossing Effects Analysis Between Routing and MAC Protocol in Mobile Ad Hoc Networks. Search on Bibsonomy ISPA Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Rong Long Wang, Kozo Okazaki Solving the Minimum Crossing Number Problem Using an Improved Artificial Neural Network. Search on Bibsonomy ICMLC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33János Pach, Rados Radoicic, Gábor Tardos, Géza Tóth 0001 Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract]. Search on Bibsonomy SCG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Michael Forster A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. Search on Bibsonomy GD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
33Christoph Buchheim, Seok-Hee Hong 0001 Crossing Minimization for Symmetries. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Michael Forster Applying Crossing Reduction Strategies to Layered Compound Graphs. Search on Bibsonomy GD The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Gek Ling Chia, C. S. Gan On Crossing Numbers of 5-Regular Graphs. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Hristo N. Djidjev, Imrich Vrto An Improved Lower Bound for Crossing Numbers. Search on Bibsonomy GD The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 4168 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license