The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1954-1964 (15) 1965-1967 (20) 1968-1969 (22) 1970 (18) 1971 (25) 1972 (20) 1973 (51) 1974 (67) 1975 (47) 1976 (84) 1977 (101) 1978 (125) 1979 (121) 1980 (159) 1981 (181) 1982 (187) 1983 (183) 1984 (210) 1985 (245) 1986 (268) 1987 (302) 1988 (393) 1989 (381) 1990 (502) 1991 (527) 1992 (637) 1993 (695) 1994 (822) 1995 (810) 1996 (898) 1997 (908) 1998 (929) 1999 (1021) 2000 (1077) 2001 (1256) 2002 (1422) 2003 (1509) 2004 (1842) 2005 (1966) 2006 (2132) 2007 (2536) 2008 (2865) 2009 (2849) 2010 (2162) 2011 (2187) 2012 (2454) 2013 (2542) 2014 (2580) 2015 (2880) 2016 (2974) 2017 (3287) 2018 (3350) 2019 (3678) 2020 (3887) 2021 (4107) 2022 (4347) 2023 (4695) 2024 (1113)
Publication types (Num. hits)
article(48513) book(88) data(9) incollection(423) inproceedings(26763) phdthesis(794) proceedings(81)
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
19Fengxia Liu, Zhao Zhang 0002, Jixiang Meng The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
19John 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 Graphs Comb. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
19Martin 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 Graphs Comb. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
19Zan-Bo Zhang, Xiaoyan Zhang 0001, Dingjun Lou, Xuelian Wen Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19Akira Hiraki A Characterization of the Hamming Graphs and the Dual Polar Graphs by Completely Regular Subgraphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19Seog-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 Graphs Comb. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
19Tao Jiang 0003, Michael Salerno Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
19Arie M. C. A. Koster, Xavier Muñoz Graphs and Algorithms in Communication Networks on Seven League Boots. Search on Bibsonomy Graphs and Algorithms in Communication Networks The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
19Sergey Bereg On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane. Search on Bibsonomy Graphs Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Steve Butler Induced-Universal Graphs for Graphs with Bounded Maximum Degree. Search on Bibsonomy Graphs Comb. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
19Jinquan Dong, Yanpei Liu On the Decomposition of Graphs into Complete Bipartite Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
19Daniel Raible 0001, Henning Fernau Exact Elimination of Cycles in Graphs. Search on Bibsonomy Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs The full citation details ... 2007 DBLP  BibTeX  RDF
19Erik 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 Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs The full citation details ... 2007 DBLP  BibTeX  RDF
19Erik 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 Structure Theory and FPT Algorithmics for Graphs, Digraphs and Hypergraphs The full citation details ... 2007 DBLP  BibTeX  RDF
19Stanislav Jendrol', Peter J. Owens On Light Graphs in 3-Connected Plane Graphs Without Triangular or Quadrangular Faces. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Pavol Hell, Jaroslav Nesetril Counting List Homomorphisms and Graphs with Bounded Degrees. Search on Bibsonomy Graphs, Morphisms and Statistical Physics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Reinhard Laue, Thomas Grüner, Markus Meringer, Adalbert Kerber Constrained Generation of Molecular Graphs. Search on Bibsonomy Graphs and Discovery The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Pierre Hansen, Hadrien Mélot Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph. Search on Bibsonomy Graphs and Discovery The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19Martin E. Dyer, Mark Jerrum, Eric Vigoda Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs. Search on Bibsonomy Graphs, Morphisms and Statistical Physics The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
19René Weiskircher Drawing Planar Graphs. Search on Bibsonomy Drawing Graphs The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
19E. Ihrig Graphs that admit square 1-factorizations are hamiltonian Cayley graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
19Midori Kobayashi, Gisaku Nakamura On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
19Mostafa Blidia, Konrad Engel Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable. Search on Bibsonomy Graphs Comb. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Chris D. Godsil, Norbert Seifter Graphs with polynomial growth are covering graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19William L. Kocay Reconstructing graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. Search on Bibsonomy Graphs Comb. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19John D. Lafferty, Daniel N. Rockmore Numerical Investigation of the Spectrum for Certain Families of Cayley Graphs. Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Nabil Kahalé On the Second Eigenvalue and Linear Expansion of Regular Graphs. Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Audrey Terras Are Finite Upper Half Plane Graphs Ramanujan? Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Moshe Morgenstern Ramanujan Graphs and Diagrams Function Field Approach. Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Noga Alon, Yuval Roichman Random Cayley Graphs and Expanders (Abstract). Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Holger Schellwat Highly Expanding Graphs Obtained from Dihedral Groups. Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Felix Lazebnik, Vasiliy A. Ustimenko Some Algebraic Constructions of Dense Graphs of Large Girth and of Large Size. Search on Bibsonomy Expanding Graphs The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
19Fan R. K. Chung, David Mumford Chordal Completions of Grids and Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Samir Khuller, Joseph Naor Flow in Planar Graphs: A Survey of Results. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Lenwood S. Heath, Sriram V. Pemmaraju, Ann N. Trenk Stack and Queue Layouts of Directed Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19C. Paul Bonnington, Charles H. C. Little A Generalisation of MacLane's Theorem to 3-graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Dan Archdeacon, C. Paul Bonnington, Charles H. C. Little Cycles, Cocycles and Diagonals: A Characterization of Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Douglas B. West, Tood Will Vertex Degrees in Planar Graphs. Search on Bibsonomy Planar Graphs The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
19Chính T. Hoàng, Frédéric Maffray Opposition graphs are strict quasi-parity graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
19Chris D. Godsil, Wilfried Imrich Embedding graphs in Cayley graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
19Akira Saito, Songlin Tian The binding number of line graphs and total graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
18Ashish Kundu, Elisa Bertino How to authenticate graphs without leaking. Search on Bibsonomy EDBT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
18Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. Search on Bibsonomy J. Comput. Sci. Technol. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF algorithmic graph theory, cograph, prefix tree, distance-hereditary graph, tree representation
18Sharon Marko, Dana Ron Approximating the distance to properties in bounded-degree and general sparse graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Sublinear approximation algorithms, property testing, graph properties, distance approximation
18Brandon Lucia, Luis Ceze Finding concurrency bugs with context-aware communication graphs. Search on Bibsonomy MICRO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Zhilin Wu, Stéphane Grumbach Feasibility of Motion Planning on Directed Graphs. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip N. Klein Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Frank Kammer, Torsten Tholey The k-Disjoint Paths Problem on Chordal Graphs. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs. Search on Bibsonomy FAW The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Therese C. Biedl, Michal Stern Edge-Intersection Graphs of k-Bend Paths in Grids. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
18Gianpaolo Oriolo, Gautier Stauffer Clique-circulants and the stable set polytope of fuzzy circular interval graphs. Search on Bibsonomy Math. Program. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C57
18Prabir Barooah, João Pedro Hespanha Estimation From Relative Measurements: Electrical Analogy and Large Graphs. Search on Bibsonomy IEEE Trans. Signal Process. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Gianpaolo Oriolo, Ugo Pietropaoli, Gautier Stauffer A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs. Search on Bibsonomy IPCO The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Souripriya Das, Eugene Inseok Chong, Zhe Wu, Melliyal Annamalai, Jagannathan Srinivasan A Scalable Scheme for Bulk Loading Large RDF Graphs into Oracle. Search on Bibsonomy ICDE The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Chen 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 ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18David H. White 0001, Richard C. Wilson 0001 Parts based generative models for graphs. Search on Bibsonomy ICPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang Efficiently answering reachability queries on very large directed graphs. Search on Bibsonomy SIGMOD Conference The full citation details ... 2008 DBLP  DOI  BibTeX  RDF maximal directed spanning tree, path-tree cover, transitive closure, graph indexing, reachability queries
18Patrice Buche, Juliette Dibie-Barthélemy, Gaëlle Hignette Flexible Querying of Fuzzy RDF Annotations Using Fuzzy Conceptual Graphs. Search on Bibsonomy ICCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Kaspar Riesen, Horst Bunke Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs. Search on Bibsonomy ANNPR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Marjan Marzban, Qian-Ping Gu, Xiaohua Jia Computational Study on Dominating Set Problem of Planar Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF PLANAR DOMINATING SET, computational study, data reduction, fixed-parameter algorithms, branch-decomposition
18Itai Benjamini, Oded Schramm, Asaf Shapira Every minor-closed property of sparse graphs is testable. Search on Bibsonomy STOC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minor closed properties, graph algorithms, property testing
18Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Pim van 't Hof, Daniël Paulusma A New Characterization of P6-Free Graphs. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18David B. Chandler, Maw-Shang Chang, Ton Kloks, Van Bang Le, Sheng-Lung Peng Probe Ptolemaic Graphs. Search on Bibsonomy COCOON The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
18Alexander Grigoriev, Hans L. Bodlaender Algorithms for Graphs Embeddable with Few Crossings per Edge. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Stavros D. Nikolopoulos, Leonidas Palios Detecting Holes and Antiholes in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Lian Li 0002, Quan Hoang Nguyen 0001, Jingling Xue Scratchpad allocation for data aggregates in superperfect graphs. Search on Bibsonomy LCTES The full citation details ... 2007 DBLP  DOI  BibTeX  RDF SPM allocation, interval coloring, superperfect graph, scratchpad memory, SPM
18Jérémy Barbay, Luca Castelli Aleardi, Meng He 0001, J. Ian Munro Succinct Representation of Labeled Graphs. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Huahai He, Ambuj K. Singh Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees. Search on Bibsonomy ICDM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Jiexun Wang, Liang Zhao 0013, Hiroshi Nagamochi, Tatsuya Akutsu An Efficient Algorithm for Generating Colored Outerplanar Graphs. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Hovhannes A. Harutyunyan, Xiangyang Xu New Construction of Broardcast Graphs. Search on Bibsonomy IV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Laurent Flindt Muller, Martin Zachariasen Fast and Compact Oracles for Approximate Distances in Planar Graphs. Search on Bibsonomy ESA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Fabrizio Frati On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Eva 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 GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Emilio Di Giacomo, Walter Didimo, Marc J. van Kreveld, Giuseppe Liotta, Bettina Speckmann Matched Drawings of Planar Graphs. Search on Bibsonomy GD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik Why Almost All k -Colorable Graphs Are Easy. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Alain Bretto, Cerasela Jaulin, Luc Gillibert, Bernard Laget A New Property of Hamming Graphs and Mesh of d-ary Trees. Search on Bibsonomy ASCM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Jan Kratochvíl, Martin Pergel Geometric Intersection Graphs: Do Short Cycles Help? Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
18Samir Hamaci, Jean-Louis Boimond, Sébastien Lahaye Modeling and Control of Hybrid Timed Event Graphs with Multipliers Using (Min, +) Algebra. Search on Bibsonomy Discret. Event Dyn. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Hybrid timed event graph, (min, +) algebra, Just-in-time control
18Arnaud Carayol, Antoine Meyer Linearly bounded infinite graphs. Search on Bibsonomy Acta Informatica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Gautam Kumar, Michael Garland Visual Exploration of Complex Time-Varying Graphs. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Graph and network visualization, financial data visualization, time series data, hierarchy visualization
18Flavia Bonomo, Guillermo Durán, Min Chih Lin, Jayme Luiz Szwarcfiter On Balanced Graphs. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C50, 05C17, 05C85
18Bill Jackson, Tibor Jordán, Zoltan Szabadka Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Sylvain Guillemot Parameterized Problems on Coincidence Graphs. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18László Babai On the diameter of Eulerian orientations of graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Anthony Man-Cho So, Yinyu Ye 0001 A semidefinite programming approach to tensegrity theory and realizability of graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Ephraim Korach, Thành Nguyen, Britta Peis Subgraph characterization of Red/Blue-Split Graph and König Egerváry Graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Anita 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 ICIT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Anne Bracy, Amir Roth Serialization-Aware Mini-Graphs: Performance with Fewer Resources. Search on Bibsonomy MICRO The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov Optimal Linear Arrangement of Interval Graphs. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Clemens Grabmayer, Jan Willem Klop, Bas Luttik Some Remarks on Definability of Process Graphs. Search on Bibsonomy CONCUR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Amin Coja-Oghlan, Andreas Goerdt, André Lanka Spectral Partitioning of Random Graphs with Given Expected Degrees. Search on Bibsonomy IFIP TCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Pinar Heggernes, Federico Mancini 0001 Minimal Split Completions of Graphs. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Parikshit Gopalan Constructing Ramsey Graphs from Boolean Function Representations. Search on Bibsonomy CCC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Christoph Ambühl, Uli Wagner 0001 The Clique Problem in Intersection Graphs of Ellipses and Triangles. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Robin Nunkesser, Philipp Woelfel Representation of Graphs by OBDDs. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Van Nguyen, Charles U. Martel Analyzing and characterizing small-world graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
18Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke Oblivious routing on node-capacitated and directed graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
18Theodore Dalamagas 0001, Dimitri Theodoratos, Antonis Koufopoulos, Vincent Oria Evaluation of Queries on Tree-Structured Data Using Dimension Graphs. Search on Bibsonomy IDEAS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
18Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos Graphs over time: densification laws, shrinking diameters and possible explanations. Search on Bibsonomy KDD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF densification power laws, small-world phenomena, graph mining, heavy-tailed distributions, graph generators
Displaying result #701 - #800 of 76671 (100 per page; Change: )
Pages: [<<][1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license