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