The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase G-graphs (changed automatically) 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
79Stefan Felsner, Rudolf Müller, Lorenz Wernisch Trapezoid Graphs and Generalizations, Geometry and Algorithms. Search on Bibsonomy SWAT The full citation details ... 1994 DBLP  DOI  BibTeX  RDF trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension
77Philippe Gambette, Stéphane Vialette On Restrictions of Balanced 2-Interval Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF 2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs
72Guillaume Fertin, André Raspaud Families of Graphs Having Broadcasting and Gossiping Properties. Search on Bibsonomy WG The full citation details ... 1998 DBLP  DOI  BibTeX  RDF minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs
72Peter F. Corbett Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks. Search on Bibsonomy IEEE Trans. Parallel Distributed Syst. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF point-to-point multiprocessor networks, directed permutation graphs, Faber-Moore graphs, rotator graphs, one-step fault diagnosable, fault tolerant, topology, multiprocessor interconnection networks, directed graphs, Hamiltonian circuit, optimal routing algorithm
70MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
63Daniel Kobler, Udi Rotics Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
60Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
59Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn Path-Bicolorable Graphs. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs
56Frithjof Dau Query Graphs with Cuts: Mathematical Foundations. Search on Bibsonomy Diagrams The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
55Stavros D. Nikolopoulos, Leonidas Palios Recognizing HHDS-Free Graphs. Search on Bibsonomy WG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF HHD-free graphs, HHDS-free graphs, homogeneously orderable graphs, recognition, sun, perfectly orderable graphs
53Günter Westphal, Christoph von der Malsburg, Rolf P. Würtz Feature-Driven Emergence of Model Graphs for Object Recognition and Categorization. Search on Bibsonomy Applied Pattern Recognition The full citation details ... 2008 DBLP  DOI  BibTeX  RDF model graphs, parquet graphs, position-invariant feature detectors, infomax principle, preselection network, model candidates, emergence of model graphs, feature- vs. correspondence-based object recognition, compositionality, elastic graph matching
52Tom Høholdt, Heeralal Janwa Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. Search on Bibsonomy AAECC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF eigenvalues of graphs, finite geometries, LDPC and expander codes, Bipartite graphs, expander graphs, Ramanujan graphs, BIBD
52Andreas Brandstädt, Van Bang Le Simplicial Powers of Graphs. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers
51Frithjof Dau An Embedding of Existential Graphs into Concept Graphs with Negations. Search on Bibsonomy ICCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
51Andreas Brandstädt, Christian Hundt 0001 Ptolemaic Graphs and Interval Graphs Are Leaf Powers. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
51Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 Approximating interval coloring and max-coloring in chordal graphs. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs
51Krishnam Raju Jampani, Anna Lubiw The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Simultaneous graphs, Sandwich graphs, Comparability graphs, Chordal graphs, Permutation graphs
48Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF (k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
48Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
47Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi On the L(h, k)-Labeling of Co-comparability Graphs. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs
46Satoru Watanabe, Satoshi Okawa An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties. Search on Bibsonomy ISPA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs
45Alain Bretto, Luc Gillibert, Bernard Laget Symmetric and semisymmetric graphs construction using G-graphs. Search on Bibsonomy ISSAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF G-graphs, graphs from group, semisymmetric graph, symmetric graphs
44L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Cubicity, AT-free graphs, cocomparability graphs, bandwidth, circular-arc graphs, intersection graphs
44Richard B. Borie, R. Gary Parker, Craig A. Tovey Solving problems on recursively constructed graphs. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth
44Paola Alimonti, Tiziana Calamoneri Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. Search on Bibsonomy WG The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
44Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy Planar and Grid Graph Reachability Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
43Andreas Brandstädt On Robust Algorithms for the Maximum Weight Stable Set Problem. Search on Bibsonomy FCT The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
43Iztok Peterin Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs. Search on Bibsonomy Order The full citation details ... 2004 DBLP  DOI  BibTeX  RDF flag graphs, induced subgraphs, edge-labellings, Cartesian product graphs, quotient graphs
43Mary Mehrnoosh Eshaghian, Ying-Chieh Wu Mapping heterogeneous task graphs onto heterogeneous system graphs. Search on Bibsonomy Heterogeneous Computing Workshop The full citation details ... 1997 DBLP  DOI  BibTeX  RDF heterogeneous task graphs mapping, heterogeneous system graphs, heterogeneous task graphs, multilayer clustered graph, Spec graph, Rep graph, suboptimal matching, computational complexity
41Martin Fürer, Shiva Prasad Kasiviswanathan Approximately Counting Embeddings into Random Graphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
41Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart On Subfamilies of AT-Free Graphs. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Andreas Brandstädt, Van Bang Le Split-Perfect Graphs: Characterizations and Algorithmic Use. Search on Bibsonomy WG The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
41Balasubramanian Sivan, S. Harini, C. Pandu Rangan Core and Conditional Core Path of Specified Length in Special Classes of Graphs. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs
41Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille Recognizing Bipartite Incident-Graphs of Circulant Digraphs. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings
39Noga Alon, Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
39Noga Alon, Shai Gutner Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
39Rodrigo S. C. Leão, Valmir Carneiro Barbosa Minimal Chordal Sense of Direction and Circulant Graphs. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Chordal sense of direction, Cayley graphs, Circulant graphs
39Gisella Paoletti, Sara Rigutti Texts and Graphs Elaboration: The Effect of Graphs' Examination on Recall. Search on Bibsonomy Diagrams The full citation details ... 2008 DBLP  DOI  BibTeX  RDF spatial contiguity effect, pop-up windows, learning, graphs, texts, recall
39Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001 Directed Graphs of Entanglement Two. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
39Stanko Dimitrov, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik r3: Resilient Random Regular Graphs. Search on Bibsonomy DISC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
39Kathie Cameron, Pavol Hell Independent packings in structured graphs. Search on Bibsonomy Math. Program. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 20E28, 20G40, 20C20
39Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter Proper Helly Circular-Arc Graphs. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
38Ryuhei Uehara, Yushi Uno Laminar Structure of Ptolemaic Graphs and Its Applications. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF algorithmic graph theory, intersection model, ptolemaic graphs, data structure, Hamiltonian cycle
37Bruno Escoffier, Laurent Gourvès, Jérôme Monnot Complexity and Approximation Results for the Connected Vertex Cover Problem. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
37Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. Search on Bibsonomy WG The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren Cryptographic Hash Functions from Expander Graphs. Search on Bibsonomy J. Cryptol. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Supersingular elliptic curves, Elliptic curve cryptography, Expander graphs, Cryptographic hash functions, Ramanujan graphs, Isogenies
37Min Chih Lin, Jayme Luiz Szwarcfiter Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. Search on Bibsonomy COCOON The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
37Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Graph-subgraph isomorphism, attributed relational graphs, large graphs
37Cyril Gavoille, Christophe Paul Optimal Distance Labeling for Interval and Circular-Arc Graphs. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF distance queries, Data-structure, interval graphs, labeling scheme, circular-arc graphs
37Ryuhei Uehara Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
37Cornelis Hoede, X. Liu Word Graphs: The Second Set. Search on Bibsonomy ICCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Knowledge graphs, adverbs, AMS Subject Classifications: 05C99, 68F99, classifiers, adjectives, word graphs
37Nabil Kahalé Eigenvalues and Expansion of Regular Graphs. Search on Bibsonomy J. ACM The full citation details ... 1995 DBLP  DOI  BibTeX  RDF induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs
36Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
36Ken-ichi Kawarabayashi, Bojan Mohar Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring
36Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen lambda-Coloring of Graphs. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
36Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai Homogeneously Orderable Graphs and the Steiner Tree Problem. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
36Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa Feedback Vertex Sets and Cyclically Reducible Graphs Search on Bibsonomy J. ACM The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
36Herbert Fleischner, Stefan Szeider On Edge-Colored Graphs Covered by Properly Colored Cycles. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs
36Frank Gurski, Egon Wanke On Module-Composed Graphs. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs
35Guillaume Fertin, André Raspaud, Bruce A. Reed On Star Coloring of Graphs. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring
35Ryuhei Uehara Bandwidth of Bipartite Permutation Graphs. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF bipartite permutation graphs, chain graphs, threshold graphs, Bandwidth, interval graphs
35Philip N. Klein, Sairam Subramanian A linear-processor polylog-time algorithm for shortest paths in planar graphs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
35Sriram V. Pemmaraju, Rajiv Raman 0001 Approximation Algorithms for the Max-coloring Problem. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Bruno Courcelle Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. Search on Bibsonomy RTA The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
34Sriram V. Pemmaraju, Imran A. Pirwani Energy conservation via domatic partitions. Search on Bibsonomy MobiHoc The full citation details ... 2006 DBLP  DOI  BibTeX  RDF domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs
34Laurenz Wiskott, Jean-Marc Fellous, Norbert Krüger, Christoph von der Malsburg Face Recognition by Elastic Bunch Graph Matching. Search on Bibsonomy ICIP (1) The full citation details ... 1997 DBLP  DOI  BibTeX  RDF elastic bunch graph matching, labeled graphs, elastic graph matching process, phase information, node positioning, object-adapted graphs, image graph extraction, sample image graphs, data structure, face recognition, face recognition, rotations, similarity function, human faces, Gabor wavelet transform
34Peter Eades, Qing-Wen Feng, Xuemin Lin 0001, Hiroshi Nagamochi Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Automatic graph drawing, Computational geometry, Hierarchical graph, Clustered graph, Straight-line drawing
34Michael Kaufmann 0001, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF (k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
34Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
34Garth Isaak Sum List Coloring Block Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Sum coloring, Block graphs, List coloring
34Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton Oblivious routing on node-capacitated and directed graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF node-capacitated graphs, directed graphs, communication networks, Oblivious routing
34Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs
34Zhi-Zhong Chen, Mitsuharu Kouno A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring
34Cornelis Hoede, L. Zhang Word Graphs: The Third Set. Search on Bibsonomy ICCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Knowledge graphs, logic word, ontology. skip AMS Subject Classifications: 05C99, 68F99, classification, word graphs
34Tiziana Calamoneri, Rossella Petreschi L(2, 1)-labeling of planar graphs. Search on Bibsonomy DIAL-M The full citation details ... 2001 DBLP  DOI  BibTeX  RDF L(2, 1)-labeling, planar graphs, outerplanar graphs, multi-hop radio networks
34Bharat P. Dave, Niraj K. Jha CASPER: Concurrent Hardware-Software Co-Synthesis of Hard Real-Time Aperiodic and Periodic Specifications of Embedded System Architectures. Search on Bibsonomy DATE The full citation details ... 1998 DBLP  DOI  BibTeX  RDF aperiodic task graphs, scheduling, distributed systems, embedded systems, allocation, system synthesis, hardware-software co-synthesis
33Seok-Hee Hong 0001, Peter Eades Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Planar geometric automorphisms, Symmetry, Graph drawing, Planar graphs
33Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach Spanners in Sparse Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Robert D. Kleinberg, Jon M. Kleinberg Isomorphism and embedding problems for infinite limits of scale-free graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
33Alexander Gamburd, Igor Pak Expansion of product replacement graphs. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
33Julia Padberg, Hartmut Ehrig, Grzegorz Rozenberg Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs. Search on Bibsonomy Unifying Petri Nets The full citation details ... 2001 DBLP  DOI  BibTeX  RDF place/transition nets, elementary nets, uniform approach, realization problem, category theory
33Shien-Ching Hwang, Gen-Huey Chen The Minimum Spanner Problem on Butterfly Graphs. Search on Bibsonomy ISPAN The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
33Maciej M. Syslo On Some Generalizations of Outerplanar Graphs: Results and Open Problems. Search on Bibsonomy WG The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
33Alain Bretto, Luc Gillibert G-graphs for the cage problem: a new upper bound. Search on Bibsonomy ISSAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF G-graphs, cage graphs, graphs from group
33Yonatan Bilu, Nathan Linial Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. Search on Bibsonomy FOCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts
33Hans L. Bodlaender Necessary Edges in k-Chordalisations of Graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth
33Steven Gold, Anand Rangarajan 0001 A Graduated Assignment Algorithm for Graph Matching. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF Graduated assignment, graph matching, weighted graphs, relaxation labeling, attributed relational graphs, model matching, continuation method, softassign
32Khoriba Ghada, Jie Li 0002, Yusheng Ji Localized Mobility-Aware Geometric Graphs for Topology Control in Heterogeneous Mobile Ad Hoc Networks. Search on Bibsonomy DNIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Heterogeneous Transmission range, Mobile Ad Hoc Networks, Topology control, Graph connectivity, Geometric graphs
32John G. Stell Granulation for Graphs. Search on Bibsonomy COSIT The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Graphs, Formal Models, Granularity, Multi-resolution, Vagueness, Spatial Partitions
32Peter Hui, Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic Train Tracks and Confluent Drawings. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32John T. Rickard, Ronald R. Yager Hypercube Graph Representations and Fuzzy Measures of Graph Properties. Search on Bibsonomy IEEE Trans. Fuzzy Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Narayan Vikas Connected and Loosely Connected List Homomorphisms. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
31Stavros D. Nikolopoulos, Charis Papadopoulos The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
31Jiong Guo, Rolf Niedermeier, Daniel Raible 0001 Improved Algorithms and Complexity Results for Power Domination in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms
31Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca Independent Sets of Maximum Weight in Apple-Free Graphs. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
31Ryuhei Uehara Simple Geometrical Intersection Graphs. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem
31Stavros D. Nikolopoulos, Leonidas Palios An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. Search on Bibsonomy FAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF HHD-free graphs, certifying algorithms, recognition, perfectly orderable graphs
31Stavros D. Nikolopoulos, Leonidas Palios Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. Search on Bibsonomy Panhellenic Conference on Informatics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs
Displaying result #1 - #100 of 76671 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
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