|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 15645 occurrences of 5194 keywords
|
|
|
Results
Found 76671 publication records. Showing 76671 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Fengxia Liu, Zhao Zhang 0002, Jixiang Meng |
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 30(3), pp. 699-705, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | John Vincent S. Morales, Arlene A. Pascasio |
An Action of the Tetrahedron Algebra on the Standard Module for the Hamming Graphs and Doob Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 30(6), pp. 1513-1527, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Martin Charles Golumbic, Bernard Ries |
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 29(3), pp. 499-517, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
19 | Zan-Bo Zhang, Xiaoyan Zhang 0001, Dingjun Lou, Xuelian Wen |
Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 28(3), pp. 433-448, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Akira Hiraki |
A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 28(4), pp. 449-467, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Seog-Jin Kim, Suh-Ryung Kim, Jung Yeun Lee, Won-Jin Park, Yoshio Sano |
Graph Equation for Line Graphs and m-Step Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 28(6), pp. 831-842, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
19 | Tao Jiang 0003, Michael Salerno |
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 27(1), pp. 121-128, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
19 | Arie M. C. A. Koster, Xavier Muñoz |
Graphs and Algorithms in Communication Networks on Seven League Boots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs and Algorithms in Communication Networks ![In: Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks, pp. 1-59, 2010, Springer, 978-3-642-02249-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
19 | Sergey Bereg |
On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 25(2), pp. 139-144, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Steve Butler |
Induced-Universal Graphs for Graphs with Bounded Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 25(4), pp. 461-468, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
19 | Jinquan Dong, Yanpei Liu |
On the Decomposition of Graphs into Complete Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 23(3), pp. 255-262, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Daniel Raible 0001, Henning Fernau |
Exact Elimination of Cycles in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
19 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Open Problems -- Structure Theory and FPT Algorithmcs for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
19 | Erik D. Demaine, Gregory Z. Gutin, Dániel Marx, Ulrike Stege |
07281 Abstracts Collection -- Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs ![In: Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs, 08.07. - 13.07.2007, 2007, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
19 | Stanislav Jendrol', Peter J. Owens |
On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(4), pp. 659-680, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Pavol Hell, Jaroslav Nesetril |
Counting List Homomorphisms and Graphs with Bounded Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs, Morphisms and Statistical Physics ![In: Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001, pp. 105-112, 2001, DIMACS/AMS, 978-0-8218-3551-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Reinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber |
Constrained Generation of Molecular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs and Discovery ![In: Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001, pp. 319-331, 2001, DIMACS/AMS, 978-0-8218-4380-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Pierre Hansen, Hadrien Mélot |
Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs and Discovery ![In: Graphs and Discovery, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001, pp. 253-264, 2001, DIMACS/AMS, 978-0-8218-4380-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Martin E. Dyer, Mark Jerrum, Eric Vigoda |
Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs, Morphisms and Statistical Physics ![In: Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001, pp. 87-95, 2001, DIMACS/AMS, 978-0-8218-3551-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | René Weiskircher |
Drawing Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Drawing Graphs ![In: Drawing Graphs, Methods and Models (the book grow out of a Dagstuhl Seminar, April 1999)., pp. 23-45, 1999, Springer, 3-540-42062-2. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | E. Ihrig |
Graphs that admit square 1-factorizations are hamiltonian Cayley graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 11(4), pp. 319-326, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
19 | Midori Kobayashi, Gisaku Nakamura |
On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 10(1), pp. 53-59, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Mostafa Blidia, Konrad Engel |
Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 8(2), pp. 103-108, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Chris D. Godsil, Norbert Seifter |
Graphs with polynomial growth are covering graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 8(3), pp. 233-241, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | William L. Kocay |
Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 8(3), pp. 259-276, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | John D. Lafferty, Daniel N. Rockmore |
Numerical Investigation of the Spectrum for Certain Families of Cayley Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 63-73, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Nabil Kahalé |
On the Second Eigenvalue and Linear Expansion of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 49-62, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Audrey Terras |
Are Finite Upper Half Plane Graphs Ramanujan? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 125-142, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Moshe Morgenstern |
Ramanujan Graphs and Diagrams Function Field Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 111-116, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Noga Alon, Yuval Roichman |
Random Cayley Graphs and Expanders (Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 1-3, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Holger Schellwat |
Highly Expanding Graphs Obtained from Dihedral Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 117-123, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Felix Lazebnik, Vasiliy A. Ustimenko |
Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expanding Graphs ![In: Expanding Graphs, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 11-14, 1992, pp. 75-93, 1992, DIMACS/AMS, 978-0-8218-6602-3. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
19 | Fan R. K. Chung, David Mumford |
Chordal Completions of Grids and Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 37-40, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Samir Khuller, Joseph Naor |
Flow in Planar Graphs: A Survey of Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 59-84, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk |
Stack and Queue Layouts of Directed Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 5-11, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | C. Paul Bonnington, Charles H. C. Little |
A Generalisation of MacLane's Theorem to 3-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 17-36, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little |
Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 1-3, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Douglas B. West, Tood Will |
Vertex Degrees in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Planar Graphs ![In: Planar Graphs, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, November 18-21, 1991, pp. 139-149, 1991, DIMACS/AMS, 978-0-8218-6600-9. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Chính T. Hoàng, Frédéric Maffray |
Opposition graphs are strict quasi-parity graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 5(1), pp. 83-85, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
19 | Chris D. Godsil, Wilfried Imrich |
Embedding graphs in Cayley graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 3(1), pp. 39-43, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
19 | Akira Saito, Songlin Tian |
The binding number of line graphs and total graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 1(1), pp. 351-356, 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
18 | Ashish Kundu, Elisa Bertino |
How to authenticate graphs without leaking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: EDBT 2010, 13th International Conference on Extending Database Technology, Lausanne, Switzerland, March 22-26, 2010, Proceedings, pp. 609-620, 2010, ACM, 978-1-60558-945-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno |
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 24(3), pp. 517-533, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation |
18 | Sharon Marko, Dana Ron |
Approximating the distance to properties in bounded-degree and general sparse graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(2), pp. 22:1-22:28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Sublinear approximation algorithms, property testing, graph properties, distance approximation |
18 | Brandon Lucia, Luis Ceze |
Finding concurrency bugs with context-aware communication graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: 42st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-42 2009), December 12-16, 2009, New York, New York, USA, pp. 553-563, 2009, ACM, 978-1-60558-798-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Zhilin Wu, Stéphane Grumbach |
Feasibility of Motion Planning on Directed Graphs. ![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. 430-439, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein |
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 328-340, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Frank Kammer, Torsten Tholey |
The k-Disjoint Paths Problem on Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 190-201, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa |
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 153-162, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Therese C. Biedl, Michal Stern |
Edge-Intersection Graphs of k-Bend Paths in Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 15th Annual International Conference, COCOON 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings, pp. 86-95, 2009, Springer, 978-3-642-02881-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Gianpaolo Oriolo, Gautier Stauffer |
Clique-circulants and the stable set polytope of fuzzy circular interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 115(2), pp. 291-317, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57 |
18 | Prabir Barooah, João Pedro Hespanha |
Estimation From Relative Measurements: Electrical Analogy and Large Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 56(6), pp. 2181-2193, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer |
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 77-96, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jagannathan Srinivasan |
A Scalable Scheme for Bulk Loading Large RDF Graphs into Oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 1297-1306, 2008, IEEE Computer Society, 978-1-4244-1836-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Chen Avin, Michal Koucký 0001, Zvi Lotker |
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ![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. 121-132, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | David H. White 0001, Richard C. Wilson 0001 |
Parts based generative models for graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPR ![In: 19th International Conference on Pattern Recognition (ICPR 2008), December 8-11, 2008, Tampa, Florida, USA, pp. 1-4, 2008, IEEE Computer Society, 978-1-4244-2175-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang |
Efficiently answering reachability queries on very large directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2008, Vancouver, BC, Canada, June 10-12, 2008, pp. 595-608, 2008, ACM, 978-1-60558-102-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries |
18 | Patrice Buche, Juliette Dibie-Barthélemy, Gaëlle Hignette |
Flexible Querying of Fuzzy RDF Annotations Using Fuzzy Conceptual Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Knowledge Visualization and Reasoning, 16th International Conference on Conceptual Structures, ICCS 2008, Toulouse, France, July 7-11, 2008, Proceedings, pp. 133-146, 2008, Springer, 978-3-540-70595-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Kaspar Riesen, Horst Bunke |
Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ANNPR ![In: Artificial Neural Networks in Pattern Recognition, Third IAPR Workshop, ANNPR 2008, Paris, France, July 2-4, 2008, Proceedings, pp. 24-35, 2008, Springer, 978-3-540-69938-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Marjan Marzban, Qian-Ping Gu, Xiaohua Jia |
Computational Study on Dominating Set Problem of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008. Proceedings, pp. 89-102, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition |
18 | Itai Benjamini, Oded Schramm, Asaf Shapira |
Every minor-closed property of sparse graphs is testable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 393-402, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
minor closed properties, graph algorithms, property testing |
18 | Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger |
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings, pp. 303-316, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Pim van 't Hof, Daniël Paulusma |
A New Characterization of P6-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 415-424, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng |
Probe Ptolemaic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 468-477, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Alexander Grigoriev, Hans L. Bodlaender |
Algorithms for Graphs Embeddable with Few Crossings per Edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 49(1), pp. 1-11, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Stavros D. Nikolopoulos, Leonidas Palios |
Detecting Holes and Antiholes in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(2), pp. 119-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Lian Li 0002, Quan Hoang Nguyen 0001, Jingling Xue |
Scratchpad allocation for data aggregates in superperfect graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LCTES ![In: Proceedings of the 2007 ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), San Diego, California, USA, June 13-15, 2007, pp. 207-216, 2007, ACM, 978-1-59593-632-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SPM allocation, interval coloring, superperfect graph, scratchpad memory, SPM |
18 | Jérémy Barbay, Luca Castelli Aleardi, Meng He 0001, J. Ian Munro |
Succinct Representation of Labeled Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 316-328, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Huahai He, Ambuj K. Singh |
Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA, pp. 163-172, 2007, IEEE Computer Society, 0-7695-3018-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Jiexun Wang, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu |
An Efficient Algorithm for Generating Colored Outerplanar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 573-583, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | 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 |
|
18 | Laurent Flindt Muller, Martin Zachariasen |
Fast and Compact Oracles for Approximate Distances in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 657-668, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Fabrizio Frati |
On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 133-144, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondrej Suchý, Tomás Vyskocil |
Clustered Planarity: Small Clusters in Eulerian Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 303-314, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann |
Matched Drawings of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 183-194, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik |
Why Almost All k -Colorable Graphs Are Easy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 121-132, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget |
A New Property of Hamming Graphs and Mesh of d-ary Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASCM ![In: Computer Mathematics, 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers, pp. 139-150, 2007, Springer, 978-3-540-87826-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Jan Kratochvíl, Martin Pergel |
Geometric Intersection Graphs: Do Short Cycles Help? ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 118-128, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Samir Hamaci, Jean-Louis Boimond, Sébastien Lahaye |
Modeling and Control of Hybrid Timed Event Graphs with Multipliers Using (Min, +) Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Event Dyn. Syst. ![In: Discret. Event Dyn. Syst. 16(2), pp. 241-256, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hybrid timed event graph, (min, +) algebra, Just-in-time control |
18 | Arnaud Carayol, Antoine Meyer |
Linearly bounded infinite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 43(4), pp. 265-292, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Gautam Kumar, Michael Garland |
Visual Exploration of Complex Time-Varying Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Vis. Comput. Graph. ![In: IEEE Trans. Vis. Comput. Graph. 12(5), pp. 805-812, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Graph and network visualization, financial data visualization, time series data, hierarchy visualization |
18 | Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter |
On Balanced Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 233-250, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C50, 05C17, 05C85 |
18 | Bill Jackson, Tibor Jordán, Zoltan Szabadka |
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(3), pp. 493-512, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Sylvain Guillemot |
Parameterized Problems on Coincidence Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings, pp. 253-266, 2006, Springer, 3-540-49694-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | László Babai |
On the diameter of Eulerian orientations of graphs. ![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. 822-831, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Anthony Man-Cho So, Yinyu Ye 0001 |
A semidefinite programming approach to tensegrity theory and realizability of graphs. ![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. 766-775, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Ephraim Korach, Thành Nguyen, Britta Peis |
Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. ![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. 842-850, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Anita Das 0001, B. S. Panda 0001, Rajendra P. Lal |
A linear time algorithm for constructing tree 3-spanner in simple chordal bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIT ![In: 9th International Conference in Information Technology, ICIT 2006, Bhubaneswar, Orissa, India, 18-21 December 2006, pp. 301-304, 2006, IEEE Computer Society, 0-7695-2635-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Anne Bracy, Amir Roth |
Serialization-Aware Mini-Graphs: Performance with Fewer Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MICRO ![In: 39th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-39 2006), 9-13 December 2006, Orlando, Florida, USA, pp. 171-184, 2006, IEEE Computer Society, 0-7695-2732-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov |
Optimal Linear Arrangement of Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings, pp. 267-279, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Clemens Grabmayer, Jan Willem Klop, Bas Luttik |
Some Remarks on Definability of Process Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings, pp. 16-36, 2006, Springer, 3-540-37376-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Amin Coja-Oghlan, Andreas Goerdt, André Lanka |
Spectral Partitioning of Random Graphs with Given Expected Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), IFIP 19th World Computer Congress, TC-1 Foundations of Computer Science, August 23-24, 2006, Santiago, Chile, pp. 271-282, 2006, Springer, 0-387-34633-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Pinar Heggernes, Federico Mancini 0001 |
Minimal Split Completions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 592-604, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Parikshit Gopalan |
Constructing Ramsey Graphs from Boolean Function Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 16-20 July 2006, Prague, Czech Republic, pp. 115-128, 2006, IEEE Computer Society, 0-7695-2596-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Christoph Ambühl, Uli Wagner 0001 |
The Clique Problem in Intersection Graphs of Ellipses and Triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 38(3), pp. 279-292, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Robin Nunkesser, Philipp Woelfel |
Representation of Graphs by OBDDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 1132-1142, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Van Nguyen, Charles U. Martel |
Analyzing and characterizing small-world graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 311-320, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 782-790, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Theodore Dalamagas 0001, Dimitri Theodoratos, Antonis Koufopoulos, Vincent Oria |
Evaluation of Queries on Tree-Structured Data Using Dimension Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: Ninth International Database Engineering and Applications Symposium (IDEAS 2005), 25-27 July 2005, Montreal, Canada, pp. 65-74, 2005, IEEE Computer Society, 0-7695-2404-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos |
Graphs over time: densification laws, shrinking diameters and possible explanations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005, pp. 177-187, 2005, ACM, 1-59593-135-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
densification power laws, small-world phenomena, graph mining, heavy-tailed distributions, graph generators |
|
|