|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4662 occurrences of 2053 keywords
|
|
|
Results
Found 6380 publication records. Showing 6380 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
22 | Ondrej Sýkora, Imrich Vrto |
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings, pp. 209-217, 1984, Springer, 3-540-12920-0. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
21 | Ran Duan, Seth Pettie |
Connectivity oracles for failure prone graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 465-474, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
connectivity |
21 | Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu |
The super spanning connectivity and super spanning laceability of the enhanced hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 48(1), pp. 66-87, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Folded hypercubes, Enhanced hypercubes, Hamiltonian laceable, Super spanning connected, Super spanning laceable, Hamiltonian connected |
21 | Sun-Yuan Hsieh, Yu-Fen Weng |
Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(2), pp. 407-425, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding |
21 | Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé |
A Linear Vertex Kernel for Maximum Internal Spanning Tree. ![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. 275-282, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sanjiv Kapoor, Xiang-Yang Li 0001 |
Geodesic Spanners on Polyhedral Surfaces. ![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. 213-223, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
An exact almost optimal algorithm for target set selection in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 355-362, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing |
21 | Reid Andersen, Yuval Peres |
Finding sparse cuts locally using evolving sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 235-244, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
evolving sets, graph partitioning, local algorithms |
21 | Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan |
An Exponential Time 2-Approximation Algorithm for Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 173-184, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Hans Raj Tiwary |
On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(3), pp. 469-479, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Extended convex hull, Polytope intersection, Polytopes, Turing reduction, Minkowski addition |
21 | Yuta Harada, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita |
The Balanced Edge Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 246-257, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Nedialko B. Dimitrov, C. Greg Plaxton |
Competitive Weighted Matching in Transversal Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 397-408, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 144-155, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Menelaos I. Karavelas |
Guarding curvilinear art galleries with edge or mobile guards. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symposium on Solid and Physical Modeling ![In: Proceedings of the 2008 ACM Symposium on Solid and Physical Modeling, Stony Brook, New York, USA, June 2-4, 2008, pp. 339-345, 2008, ACM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
2-dominance, curvilinear polygons, diagonal guards, edge guards, mobile guards, piece-wise-convex polygons, triangulation graphs, art gallery |
21 | Jiong Guo |
A More Effective Linear Kernelization for Cluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 36-47, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Hiroshi Nagamochi |
Minimum Degree Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 17-28, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Hovhannes A. Harutyunyan, Xiangyang Xu |
New Construction of Broardcast Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: 11th International Conference on Information Visualisation, IV 2007, 2-6 July 2007, Zürich, Switzerland, pp. 751-756, 2007, IEEE Computer Society, 0-7695-2907-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Miroslaw Kowaluk, Andrzej Lingas |
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 265-274, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Rodrigo I. Silveira, René van Oostrum |
Flooding Countries and Destroying Dams. ![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. 227-238, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly |
Dryad: distributed data-parallel programs from sequential building blocks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroSys ![In: Proceedings of the 2007 EuroSys Conference, Lisbon, Portugal, March 21-23, 2007, pp. 59-72, 2007, ACM, 978-1-59593-636-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
concurrency, cluster computing, distributed programming, dataflow |
21 | Telikepalli Kavitha |
Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 328-339, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Harold N. Gabow |
Using expander graphs to find vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 800-844, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graphs, Expander graphs, vertex connectivity |
21 | Christof Löding |
Reachability Problems on Regular Ground Tree Rewriting Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 39(2), pp. 347-383, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Nicolas Beldiceanu, Irit Katriel, Xavier Lorca |
Undirected Forest Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings, pp. 29-43, 2006, Springer, 3-540-34306-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger |
Graph Coloring with Rejection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 364-375, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim |
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA Workshops ![In: Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings, pp. 291-300, 2006, Springer, 3-540-49860-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky |
Conflict-free coloring for intervals: from offline to online. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 128-137, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
online algorithms, coloring, cellular networks, frequency assignment, conflict free |
21 | Joseph Naor |
From Balanced Graph Partitioning to Balanced Metric Labeling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 9, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance-Based Location Update and Routing in Irregular Cellular Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SNPD ![In: Proceedings of the 6th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD 2005), May 23-25, 2005, Towson, Maryland, USA, pp. 380-387, 2005, IEEE Computer Society, 0-7695-2294-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram |
Universal approximations for TSP, Steiner tree, and set cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 386-395, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation |
21 | Shlomo Moran, Sagi Snir |
Efficient Approximation of Convex Recolorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings, pp. 192-208, 2005, Springer, 3-540-28239-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Vitaly Surazhsky, Craig Gotsman |
High quality compatible triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eng. Comput. ![In: Eng. Comput. 20(2), pp. 147-156, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Compatible triangulations, Low discrepancy point sets, Sweep meshes, Morphing, Remeshing |
21 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak |
Generalizing Pancyclic and k-Ordered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 291-309, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Kok-Why Ng, Ya-Ping Wong, Son-Ni Ho |
Improvement in Decimation of Triangle Meshes for Level of Detail. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMAG ![In: 2003 International Conference on Geometric Modeling and Graphics, GMAG'03, London, England, July 16-18, 2003, pp. 123-, 2003, IEEE Computer Society, 0-7695-1985-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Andreas Huck, Eberhard Triesch |
Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(3), pp. 409-416, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C65, 05C70 |
21 | Laura A. Sanchis |
Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 33(1), pp. 3-18, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Dominating set, Test cases |
21 | Rastislav Kralovic |
On Majority Voting Games in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24 - December 1, 2001, Proceedings, pp. 282-291, 2001, Springer, 3-540-42912-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Shin-Ichi Nakano |
Efficient Generation of Triconnected Plane Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 131-141, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 192-203, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Jirí Fiala 0001, Ton Kloks, Jan Kratochvíl |
Fixed-Parameter Complexity of lambda-Labelings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 350-363, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Chandrajit L. Bajaj, Valerio Pascucci, Guozhong Zhuang |
Single Resolution Compression of Arbitrary Triangular Meshes with Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: Data Compression Conference, DCC 1999, Snowbird, Utah, USA, March 29-31, 1999., pp. 247-256, 1999, IEEE Computer Society, 0-7695-0096-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | J. C. Lagarias 0001, Nagabhushana Prabhu |
Counting d -Step Paths in Extremal Dantzig Figures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 19(1), pp. 19-31, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Mike Burmester, Yvo Desmedt, Yongge Wang |
Using Approximation Hardness to Achieve Dependable Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 172-186, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Michal Etzion, Ari Rappoport |
On Compatible Star Decompositions of Simple Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 3(1), pp. 87-95, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Star decomposition, minimal star decomposition, compatible decompositions, compatible star decompositions |
21 | Luitpold Babel, Stephan Olariu |
A New Characterization of P4-connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 17-30, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Zvi Galil, Giuseppe F. Italiano |
Maintaining Biconnected Components of Dynamic Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 339-350, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
21 | Ivan Stojmenovic |
Detecting intersection of two convex polygons in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the Sixteenth ACM Annual Conference on Computer Science, Atlanta, Georgia, USA, February 23-25, 1988, pp. 736, 1988, ACM, 0-89791-260-8. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | David R. Forsey, Richard H. Bartels |
Hierarchical B-spline refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1988, Atlanta, Georgia, USA, August 1-5, 1988, pp. 205-212, 1988, ACM, 0-89791-275-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
free-form surface editing, refinement, subdivision, splines |
21 | Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough |
Topological Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAAP ![In: CAAP'83, Trees in Algebra and Programming, 8th Colloquium, L'Aquila, Italy, March 9-11, 1983, Proceedings, pp. 317-331, 1983, Springer, 3-540-12727-5. The full citation details ...](Pics/full.jpeg) |
1983 |
DBLP DOI BibTeX RDF |
|
18 | Hichem Barki, Florence Denis, Florent Dupont |
A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Shape Modeling International ![In: SMI 2010, Shape Modeling International Conference, Aix en Provence, France, June 21-23 2010, pp. 206-210, 2010, IEEE Computer Society, 978-0-7695-4072-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
contributing vertices, Minkowski difference, Nef polyhedra, Minkowski sum |
18 | Rabie Saidi, Mondher Maddouri, Engelbert Mephu Nguifo |
Comparing graph-based representations of protein for mining purposes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD Workshop on Statistical and Relational Learning in Bioinformatics ![In: Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009, pp. 35-38, 2009, ACM, 978-1-60558-667-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bonds, chemical interactions, discriminative feature, edges, preprocessing, vertices, protein structure, graph representation, amino acids |
18 | Hongmei He, Ondrej Sýkora, Erkki Mäkinen |
Genetic algorithms for the 2-page book drawing problem of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 13(1), pp. 77-93, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
2-page crossing number, Order of vertices, Edge distribution, Optimal values, Genetic algorithms, Hamiltonian cycle |
18 | Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke |
In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
dummy vertices, hierarchical graph drawing, layered graphs, layering, Layer assignment |
18 | Martin Skutella |
Approximating the single source unsplittable min-cost flow problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 136-145, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations |
18 | Ravi Kumar 0001, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar 0001, Andrew Tomkins, Eli Upfal |
Random graph models for the web graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 57-65, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
static HTML Web page, sparse random graphs, Erdos-Renyi models, statistics, directed graphs, directed graph, stochastic models, stochastic processes, Web graph, vertices, information resources, hyperlink, random processes, random graph model |
18 | Uriel Feige, Robert Krauthgamer |
A polylogarithmic approximation of the minimum bisection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 105-115, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
polylogarithmic approximation, minimum bisection, vertex partitioning, bisection cost, computational complexity, complexity, computational geometry, graph theory, graph, edges, vertices, approximation ratio |
18 | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski 0001, Endre Szemerédi |
Universality and Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 14-21, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
positive integers, sparse universal graphs, random constructions, fault-tolerant bipartite random graph, graph theory, graph theory, graphs, bipartite graphs, universality, vertices, tolerance, maximum degree |
18 | Dorit Dor, Shay Halperin, Uri Zwick |
All Pairs Almost Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 452-461, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication |
18 | Yuval Rabani |
Path Coloring on the Mesh. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 400-409, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring |
18 | Monika Rauch Henzinger, Satish Rao, Harold N. Gabow |
Computing Vertex Connectivity: New Bounds from Old Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 462-471, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity |
18 | Guy Even, Joseph Naor, Leonid Zosin |
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 310-319, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
8-approximation algorithm, subset feedback vertex set problem, minimum weight, special vertices, logarithmic approximation factor, relaxed multi-commodity flow, multi-terminal flow, computational complexity, NP-Complete problems, undirected graph, multi-commodity flow, vertex weights |
18 | Kazuyuki Amano, Akira Maruoka |
Potential of the Approximation Method (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 431-440, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
precise versions, bottleneck counting argument, sunflower contraction, lower bounds, Boolean functions, vertices, cliques, approximation method, monotone circuit |
18 | C. R. Subramanian 0001 |
Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 463-472, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
minimum coloring random graphs, semi-random graphs, polynomial expected time, k-coloring, worst-case model, computational complexity, graph theory, vertices, graph colouring |
18 | Guy Even, Joseph Naor, Satish Rao, Baruch Schieber |
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 62-71, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm |
18 | Nathan Linial, Eran London, Yuri Rabinovich |
The geometry of graphs and some of its algorithmic applications ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 577-591, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
host space, geometry of graphs, algorithmic applications, viewing graphs, vertices, geometric representations |
18 | David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001 |
Approximate Graph Coloring by Semidefinite Programming ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 2-13, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio |
18 | Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan 0001, Hisao Tamaki |
Motion Planning on a Graph (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 511-520, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
single movable obstacle, simple abstraction, complexity, mobile robot, motion planning, vertices, undirected graph, vertex, adjacencies |
18 | David Eppstein |
Finding the k Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 154-165, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths |
18 | Guy Kortsarz, David Peleg |
On Choosing a Dense Subgraph (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 692-701, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
weighted problem, densest k-vertex subgraph, most edges, edges-to-vertices ratio, unweighted graph problem, maximization problems, approximation algorithms, approximation ratio, dense subgraph |
18 | Harold N. Gabow |
A Framework for Cost-scaling Algorithms for Submodular Flow Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 449-458, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
cost-scaling algorithms, submodular flow problems, dijoin, edge-connectivity orientation, k-edge-connected orientation, minimum-cost k-edge-connected orientation, integer linear programming, vertices, vertex weights, minimum-cost network flow |
18 | Edith Cohen |
Fast algorithms for constructing t-spanners and paths with stretch t ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 648-658, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph |
18 | Boris Aronov, Micha Sharir |
The Union of Convex Polyhedra in Three Dimensions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 518-527, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
union of convex polyhedra, almost tight, edges, faces, vertices, three dimensions, randomized incremental algorithm |
18 | Goos Kant |
Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 101-110, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
visibility representations, lmc-ordering, required area, minimum angle, number of bends, planar drawings, triconnected planar graphs, planar graphs, faces, vertices |
18 | Gopalakrishnan Vijayan |
Generalization of Min-Cut Partitioning to Tree Structures and Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(3), pp. 307-314, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins |
18 | Greg N. Frederickson |
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 632-641, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
ambivalent data structures, dynamic maintenance, dynamic 2-edge-connectivity, k smallest spanning trees, weighted undirected graph, embedded planar graph, query, edges, vertices |
18 | Donald B. Johnson 0001, Panagiotis Takis Metaxas |
Connected Components in O(\lg^3/2 |V|) Parallel Time for the CREW PRAM ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 688-697, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
CREW processors, parallel time, edges, connected components, vertices, undirected graph, CREW PRAM |
18 | Tsan-sheng Hsu, Vijaya Ramachandran |
A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 548-559, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
triconnectivity augmentation, reliable networks, linear time sequential algorithm, fault-tolerant computing, edges, vertices, undirected graph |
18 | Rolf Klein |
Walking an Unknown Street with Bounded Detour ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 304-313, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
bounded detour, boundary chains, mutually weakly visible, onboard vision, short path, lower bound, mobile robot, polygon, vertices |
18 | Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen |
On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 793-801, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
Ackermann function inverse, four-connected components, k-connectivity query, static data structure, online updates, triconnected graphs, graph, edges, vertices, dynamic data structure, disjoint paths |
18 | Jörg-Rüdiger Sack, Subhash Suri |
An Optimal Algorithm for Detecting Weak Visibility of a Polygon. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 39(10), pp. 1213-1219, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
visibility detection, visibility edges, n-vertex polygon, endpoints, convex vertices, weak edge visibility, computational complexity, computational geometry, optimal algorithm |
18 | Sandy Irani |
Coloring Inductive Graphs On-Line ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 470-479, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
online graph colouring, First Fit algorithm, d-inductive graphs, upper bound, vertices, lookahead |
18 | Greg N. Frederickson, D. J. Guan |
Ensemble Motion Planning in Trees ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 66-71, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
ensemble motion planning, unit capacity vehicle, minimum cost transportation, nontrivial connected components, initial vertex, route, approximation algorithms, trees, NP-hard, directed graph, objects, edges, vertices, destination, performance ratio |
18 | Giuseppe Di Battista, Roberto Tamassia |
Incremental Planarity Testing (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 436-441, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
edge insertions, incremental planarity testing, supports tests, vertex insertions, queries, planar graph, edges, vertices, insertion |
18 | Harold N. Gabow, Ying Xu 0001 |
Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 106-111, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
independent assignment, linear matroids, matroid intersection problem, weighted intersection, cardinality algorithm, graphic matroids, trivial matroids, cardinality intersection, largest edge weight, scaling, edges, efficient algorithms, vertices, bipartite graph matching, fast matrix multiplication |
18 | Nathan Linial, Umesh V. Vazirani |
Graph Products and Chromatic Numbers ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 124-128, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
three-chromatic graph, graph, vertices, chromatic numbers, polynomial-time approximation algorithms |
18 | Seth M. Malitz |
Genus g Graphs have Pagenumber O(sqrt(g)) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 458-468, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
n-vertex d-regular graphs, pagenumber, book embedding, genus g, pages, edges, vertices, linear ordering, spine |
18 | Andrei Z. Broder, Anna R. Karlin |
Bounds on the Cover Time (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 479-487, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
regular expander graphs, connected unidirected graph, lower bounds, Markov chain, random walk, upper bounds, eigenvalues, vertices, particle, cover time, neighbors |
18 | Franco P. Preparata, Roberto Tamassia |
Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 558-567, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
insertion/deletion, fully dynamic techniques, planar structures, planar st-graph, transitive-closure queries, monotone subdivisions, chain method, Lee-Preparata, data structure, update, edges, transitive closure, faces, set, vertices, total orders, point location |
18 | Juan Pineda |
A parallel algorithm for polygon rasterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 15th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1988, Atlanta, Georgia, USA, August 1-5, 1988, pp. 17-20, 1988, ACM, 0-89791-275-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
linear edge function, polygon rasterization, sub-pixel vertices, parallel processing |
18 | Charles C. Pinter |
On decomposing a Boolean function and simplfying the components separately. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 13(12), pp. 758, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
basic cells, simplifying Boolean functions, minimization, vertices, prime implication |
17 | 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 |
17 | Seok-Hee Hong 0001, Martin Mader |
Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints. ![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. 278-283, 2008, Springer, 978-3-642-00218-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
17 | Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff 0001 |
Moving Vertices to Make Drawings Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 101-112, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath |
Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 345-351, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
17 | Julien Moncel |
Constructing codes identifying sets of vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 41(1), pp. 23-31, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
AMS classifications, 94C12, 94B60, 05C99 |
17 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich |
Generating all vertices of a polyhedron is hard. ![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. 758-765, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities |
17 | Zi-Xia Song, H. P. Yap |
Chromatic Index Critical Graphs of Even Order with Five Major Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(2), pp. 239-246, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Yusuke Hioka, Nozomu Hamada |
Speaker direction tracking using microphones located at the vertices of equilateral-triangle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (3) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 2847-2850, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Chang-Hyo Yu, Donghyun Kim, Lee-Sup Kim |
A 33.2M vertices/sec programmable geometry engine for multimedia embedded systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 4574-4577, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
17 | Fajie Li, Reinhard Klette |
The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 12th International Conference, DGCI 2005, Poitiers, France, April 13-15, 2005, Proceedings, pp. 183-194, 2005, Springer, 3-540-25513-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 6380 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|