|
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 328-337, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 375-384, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 162-173, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASSETS ![In: Proceedings of the 9th International ACM SIGACCESS Conference on Computers and Accessibility, ASSETS 2007, Tempe, Arizona, USA, October 15-17, 2007, pp. 3-10, 2007, ACM, 978-1-59593-573-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 2008 Conference on Human Factors in Computing Systems, CHI 2008, 2008, Florence, Italy, April 5-10, 2008, pp. 1623-1632, 2008, ACM, 978-1-60558-011-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(4), pp. 791-799, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(4), pp. 567-600, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
77 | Noga Alon, Sridhar Rajagopalan, Subhash Suri |
Long Non-Crossing Configurations in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, CA, USA, May 19-21, 1993, pp. 257-263, 1993, ACM, 0-89791-582-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the 2008 Conference on Human Factors in Computing Systems, CHI 2008, 2008, Florence, Italy, April 5-10, 2008, pp. 1563-1572, 2008, ACM, 978-1-60558-011-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI ![In: Proceedings of the CHI 2002 Conference on Human Factors in Computing Systems: Changing our World, Changing ourselves, Minneapolis, Minnesota, USA, April 20-25, 2002., pp. 73-80, 2002, ACM, 1-58113-453-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACIVS ![In: Advanced Concepts for Intelligent Vision Systems, 8th International Conference, ACIVS 2006, Antwerp, Belgium, September 18-21, 2006, Proceedings, pp. 966-977, 2006, Springer, 3-540-44630-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
70 | Xiaoyu Song, Yuke Wang |
On the crossing distribution problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 4(1), pp. 39-51, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
VLSI layout, crossings |
63 | Sanjukta Bhanja, Marco Ottavi, Fabrizio Lombardi, Salvatore Pontarelli |
QCA Circuits for Robust Coplanar Crossing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Electron. Test. ![In: J. Electron. Test. 23(2-3), pp. 193-210, 2007. The full citation details ...](Pics/full.jpeg) |
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}). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 89-96, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UIST ![In: Proceedings of the 17th Annual ACM Symposium on User Interface Software and Technology, Santa Fe, NM, USA, October 24-27, 2004, pp. 3-12, 2004, ACM, 1-58113-957-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings, pp. 236-248, 2009, Springer, 978-3-642-02440-5. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 860-869, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
59 | Shiaofen Fang, Pooja Gupta |
Boundary surface extraction and rendering for volume datasets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), Dijon, France, April 23-27, 2006, pp. 1356-1360, 2006, ACM, 1-59593-108-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(3), pp. 376-384, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHI Extended Abstracts ![In: Proceedings of the 27th International Conference on Human Factors in Computing Systems, CHI 2009, Extended Abstracts Volume, Boston, MA, USA, April 4-9, 2009, pp. 3733-3738, 2009, ACM, 978-1-60558-247-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 324-333, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 3-12, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
computational complexity, computational geometry, crossing number |
56 | Petr Hlinený |
Crossing Number Is Hard for Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2004, 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings, pp. 772-782, 2004, Springer, 3-540-22823-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 284-296, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
55 | Yehea I. Ismail, Chirayu S. Amin |
Computation of signal-threshold crossing times directly from higher order moments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 23(8), pp. 1264-1276, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Petr Hlinený |
Crossing-Critical Graphs and Path-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers, pp. 102-114, 2001, Springer, 3-540-43309-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
55 | Petra Mutzel, Thomas Ziegler 0002 |
The Constrained Crossing Minimization Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 7th International Symposium, GD'99, Stirín Castle, Czech Republic, September 1999, Proceedings, pp. 175-185, 1999, Springer, 3-540-66904-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
51 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf 0004 |
Inserting a vertex into a planar graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 375-383, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Vida Dujmovic, Sue Whitesides |
An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(1), pp. 15-31, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 85(3), pp. 253-278, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(1), pp. 31-46, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VALUETOOLS ![In: Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2007, Nantes, France, October 22-27, 2007, pp. 46, 2007, ICST/ACM, 978-963-9799-00-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 217-220, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 37-40, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 882-891, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APGV ![In: Proceedings of the 6th Symposium on Applied Perception in Graphics and Visualization, APGV 2009, Chania, Crete, Greece, September 30 - October 2, 2009, pp. 35-40, 2009, ACM, 978-1-60558-743-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IROS ![In: 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems, IROS 2006, October 9-15, 2006, Beijing, China, pp. 3873-3878, 2006, IEEE, 1-4244-0258-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
48 | Vittorio Bilò, Vineet Goyal, R. Ravi 0001, Mohit Singh |
On the Crossing Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings, pp. 51-60, 2004, Springer, 3-540-22894-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
48 | Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto |
Book Embeddings and Crossing Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 256-268, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
44 | Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic |
Odd Crossing Number and Crossing Number Are Not the Same. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 442-454, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Sergio Cabello, Bojan Mohar |
Crossing and Weighted Crossing Number of Near-Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 38-49, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic |
Odd Crossing Number Is Not Crossing Number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 386-396, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
41 | Sergio Cabello, Bojan Mohar |
Adding one edge to planar graphs makes crossing number hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 68-76, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCHI ![In: Computer-Human Interaction, 8th Asia-Pacific Conference, APCHI 2008, Seoul, Korea, July 6-9, 2008, Proceedings, pp. 292-300, 2008, Springer, 978-3-540-70584-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Large display, Hand gesture, Crossing |
41 | Markus Chimani, Petr Hlinený, Petra Mutzel |
Approximating the Crossing Number of Apex Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers, pp. 432-434, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
apex graph, vertex insertion, Crossing number |
41 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Computing crossing number in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 382-390, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 76(1-2), pp. 165-176, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 91-98, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoftSpez Final Report ![In: Integration of Software Specification Techniques for Applications in Engineering, Priority Program SoftSpez of the German Research Foundation (DFG), Final Report, pp. 119-144, 2004, Springer, 3-540-23135-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2004, Santander, Spain, July 4-7, 2004, Proceedings, pp. 250-257, 2004, ACM, 1-58113-827-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 113(1-4), pp. 119-132, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, Spain, June 5-7, 2002, pp. 19-24, 2002, ACM, 1-58113-504-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experimentation, International Workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, Selected Papers, pp. 74-93, 1999, Springer, 3-540-66227-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Efficient Algorithms ![In: Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday, pp. 305-317, 2009, Springer, 978-3-642-03455-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICVS ![In: Computer Vision Systems, 7th International Conference on Computer Vision Systems, ICVS 2009, Liège, Belgium, October 13-15, 2009, Proceedings, pp. 154-163, 2009, Springer, 978-3-642-04666-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Weidong Huang 0001, Seok-Hee Hong 0001, Peter Eades |
Effects of Crossing Angles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PacificVis ![In: IEEE VGTC Pacific Visualization Symposium 2008, PacificVis 2008, Kyoto, Japan, March 5-7, 2008, pp. 41-46, 2008, IEEE Computer Society, 978-1-4244-1966-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Markus Chimani, Michael Jünger, Michael Schulz 0001 |
Crossing Minimization meets Simultaneous Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PacificVis ![In: IEEE VGTC Pacific Visualization Symposium 2008, PacificVis 2008, Kyoto, Japan, March 5-7, 2008, pp. 33-40, 2008, IEEE Computer Society, 978-1-4244-1966-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Hong Zhang, Ali Abdi |
On the average crossing rates in selection diversity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 6(2), pp. 448-451, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 410-421, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic |
Crossing Numbers and Parameterized Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 31-36, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
40 | Markus Chimani, Carsten Gutwenger, Petra Mutzel |
Experiments on Exact Crossing Minimization Using Column Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 5th International Workshop, WEA 2006, Cala Galdana, Menorca, Spain, May 24-27, 2006, Proceedings, pp. 303-315, 2006, Springer, 3-540-34597-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | David R. Wood, Jan Arne Telle |
Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 150-161, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-ichi Tanigawa |
Enumerating Non-crossing Minimally Rigid Frameworks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 205-215, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
40 | Carlos Santamaria, Miroslaw Bober, Wieslaw Szajnowski |
Texture Analysis using Level-crossing Statistics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR (2) ![In: 17th International Conference on Pattern Recognition, ICPR 2004, Cambridge, UK, August 23-26, 2004., pp. 712-715, 2004, IEEE Computer Society, 0-7695-2128-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Yehea I. Ismail, Chirayu S. Amin |
Computation of signal threshold crossing times directly from higher order moments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: 2004 International Conference on Computer-Aided Design, ICCAD 2004, San Jose, CA, USA, November 7-11, 2004, pp. 246-253, 2004, IEEE Computer Society / ACM, 0-7803-8702-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
37 | Buntarou Shizuki, Takaomi Hisamatsu, Shin Takahashi, Jiro Tanaka |
Laser pointer interaction techniques using peripheral areas of screens. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AVI ![In: Proceedings of the working conference on Advanced visual interfaces, AVI 2006, Venezia, Italy, May 23-26, 2006, pp. 95-98, 2006, ACM Press, 1-59593-353-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cogn. Technol. Work. ![In: Cogn. Technol. Work. 4(3), pp. 171-179, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 18(11), pp. 1121-1126, 1996. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 118-127, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Paul Y. S. Cheung, S. K. Yeung, W. L. Ko |
A new optimization model for VLSI placement algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (6) ![In: Proceedings of the 1999 International Symposium on Circuits and Systems, ISCAS 1999, Orlando, Florida, USA, May 30 - June 2, 1999, pp. 398-403, 1999, IEEE, 0-7803-5471-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Robert Jankowski |
Numerical Simulation of Threshold-Crossing Problem for Random Fields of Environmental Contamination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS (2) ![In: Computational Science - ICCS 2008, 8th International Conference, Kraków, Poland, June 23-25, 2008, Proceedings, Part II, pp. 614-621, 2008, Springer, 978-3-540-69386-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 231-242, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 259-263, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 131-135, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(3), pp. 293-300, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(12), pp. 1207-1212, 1994. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(1), pp. 43-57, 1989. The full citation details ...](Pics/full.jpeg) |
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](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 33(4), pp. 480-496, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Yun Zhai, Arun Hampapur |
Virtual Boundary Crossing Detection without Explicit Object Tracking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AVSS ![In: Sixth IEEE International Conference on Advanced Video and Signal Based Surveillance, AVSS 2009, 2-4 September 2009, Genova, Italy, pp. 518-522, 2009, IEEE Computer Society, 978-0-7695-3718-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Seok-Hee Hong 0001, Hiroshi Nagamochi |
Approximating Crossing Minimization in Radial Layouts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 461-472, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Nagesha, G. Hemantha Kumar 0001 |
Signal Resampling Technique Combining Level Crossing and Auditory Features. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PReMI ![In: Pattern Recognition and Machine Intelligence, Second International Conference, PReMI 2007, Kolkata, India, December 18-22, 2007, Proceedings, pp. 447-454, 2007, Springer, 978-3-540-77045-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISNN (1) ![In: Advances in Neural Networks - ISNN 2007, 4th International Symposium on Neural Networks, ISNN 2007, Nanjing, China, June 3-7, 2007, Proceedings, Part I, pp. 1318-1326, 2007, Springer, 978-3-540-72382-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Jacob Fox, János Pach, Csaba D. Tóth |
A Bipartite Strengthening of the Crossing Lemma. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 13-24, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (4) ![In: Fourth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2007, 24-27 August 2007, Haikou, Hainan, China, Proceedings, Volume 4, pp. 301-306, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 36(4), pp. 527-552, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Hongmei He, O. Skora, E. Mkinen |
An Improved Neural Network Model for the Two-Page Crossing Number Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks ![In: IEEE Trans. Neural Networks 17(6), pp. 1642-1646, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VTC Spring ![In: Proceedings of the 63rd IEEE Vehicular Technology Conference, VTC Spring 2006, 7-10 May 2006, Melbourne, Australia, pp. 2838-2842, 2006, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Wirel. Commun. ![In: IEEE Trans. Wirel. Commun. 4(1), pp. 24-29, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | S. Chandra Sekhar, T. V. Sreenivas |
Auditory motivated level-crossing approach to instantaneous frequency estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 53(4), pp. 1450-1462, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Georg Apitz, François Guimbretière |
CrossY: a crossing-based drawing application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 24(3), pp. 930, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Tino Lourens, Emilia I. Barakova |
TiViPE Simulation of a Cortical Crossing Cell Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN ![In: Computational Intelligence and Bioinspired Systems, 8th International Work-Conference on Artificial Neural Networks, IWANN 2005, Vilanova i la Geltrú, Barcelona, Spain, June 8-10, 2005, Proceedings, pp. 122-129, 2005, Springer, 3-540-26208-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Christoph Buchheim, Dietmar Ebner, Michael Jünger, Gunnar W. Klau, Petra Mutzel, René Weiskircher |
Exact Crossing Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 37-48, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Panlong Yang, Chang Tian |
Crossing Effects Analysis Between Routing and MAC Protocol in Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Parallel and Distributed Processing and Applications - ISPA 2005 Workshops, ISPA 2005 International Workshops AEPP, ASTD, BIOS, GCIC, IADS, MASN, SGCA, and WISA, Nanjing, China, November 2-5, 2005, Proceedings, pp. 412-421, 2005, Springer, 3-540-29770-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Rong Long Wang, Kozo Okazaki |
Solving the Minimum Crossing Number Problem Using an Improved Artificial Neural Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMLC ![In: Advances in Machine Learning and Cybernetics, 4th International Conference, ICMLC 2005, Guangzhou, China, August 18-21, 2005, Revised Selected Papers, pp. 797-803, 2005, Springer, 3-540-33584-6. The full citation details ...](Pics/full.jpeg) |
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]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004, pp. 68-75, 2004, ACM, 1-58113-885-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Michael Forster |
A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 12th International Symposium, GD 2004, New York, NY, USA, September 29 - October 2, 2004, Revised Selected Papers, pp. 206-216, 2004, Springer, 3-540-24528-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Christoph Buchheim, Seok-Hee Hong 0001 |
Crossing Minimization for Symmetries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 563-574, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Michael Forster |
Applying Crossing Reduction Strategies to Layered Compound Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers, pp. 276-284, 2002, Springer, 3-540-00158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Gek Ling Chia, C. S. Gan |
On Crossing Numbers of 5-Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 230-237, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Hristo N. Djidjev, Imrich Vrto |
An Improved Lower Bound for Crossing Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers, pp. 96-101, 2001, Springer, 3-540-43309-0. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|