|
|
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 |
79 | Stefan Felsner, Rudolf Müller, Lorenz Wernisch |
Trapezoid Graphs and Generalizations, Geometry and Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 143-154, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension |
77 | Philippe Gambette, Stéphane Vialette |
On Restrictions of Balanced 2-Interval 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. 55-65, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs |
72 | Guillaume Fertin, André Raspaud |
Families of Graphs Having Broadcasting and Gossiping Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 63-77, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs |
72 | Peter F. Corbett |
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 3(5), pp. 622-626, 1992. The full citation details ...](Pics/full.jpeg) |
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 |
70 | MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx |
Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 211-220, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs |
63 | Daniel 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](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(4), pp. 327-346, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs |
60 | Andreas Jakoby, Till Tantau |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 216-227, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs |
59 | Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn |
Path-Bicolorable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 172-182, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs |
56 | Frithjof Dau |
Query Graphs with Cuts: Mathematical Foundations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Diagrams ![In: Diagrammatic Representation and Inference, Third International Conference, Diagrams 2004, Cambridge, UK, March 22-24, 2004, Proceedings, pp. 32-50, 2004, Springer, 3-540-21268-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
55 | Stavros D. Nikolopoulos, Leonidas Palios |
Recognizing HHDS-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 456-467, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
HHD-free graphs, HHDS-free graphs, homogeneously orderable graphs, recognition, sun, perfectly orderable graphs |
53 | Günter Westphal, Christoph von der Malsburg, Rolf P. Würtz |
Feature-Driven Emergence of Model Graphs for Object Recognition and Categorization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applied Pattern Recognition ![In: Applied Pattern Recognition, pp. 155-199, 2008, Springer, 978-3-540-76830-2. The full citation details ...](Pics/full.jpeg) |
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 |
52 | Tom Høholdt, Heeralal Janwa |
Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 18th International Symposium, AAECC-18 2009, Tarragona, Catalonia, Spain, June 8-12, 2009. Proceedings, pp. 53-64, 2009, Springer, 978-3-642-02180-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
eigenvalues of graphs, finite geometries, LDPC and expander codes, Bipartite graphs, expander graphs, Ramanujan graphs, BIBD |
52 | Andreas Brandstädt, Van Bang Le |
Simplicial Powers of 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. 160-170, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers |
51 | Frithjof Dau |
An Embedding of Existential Graphs into Concept Graphs with Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Integration and Interfaces, 10th International Conference on Conceptual Structures, ICCS 2002, Borovets, Bulgaria, July 15-19, 2002, Proceedings, pp. 326-340, 2002, Springer, 3-540-43901-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
51 | Andreas Brandstädt, Christian Hundt 0001 |
Ptolemaic Graphs and Interval Graphs Are Leaf Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 479-491, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
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 |
51 | Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 |
Approximating interval coloring and max-coloring in chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 10, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs |
51 | Krishnam Raju Jampani, Anna Lubiw |
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 387-398, 2009, Springer, 978-3-642-03366-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Simultaneous graphs, Sandwich graphs, Comparability graphs, Chordal graphs, Permutation graphs |
48 | Erik 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](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(6), pp. 866-893, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
48 | Erik 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](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pp. 830-839, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
47 | Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi |
On the L(h, k)-Labeling of Co-comparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 116-127, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs |
46 | Satoru Watanabe, Satoshi Okawa |
An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: Parallel and Distributed Processing and Applications, International Symposium, ISPA 2003, Aizu, Japan, July 2-4, 2003, Proceedings, pp. 220-227, 2003, Springer, 3-540-40523-2. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs |
45 | Alain Bretto, Luc Gillibert, Bernard Laget |
Symmetric and semisymmetric graphs construction using G-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, pp. 61-67, 2005, ACM, 1-59593-095-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
G-graphs, graphs from group, semisymmetric graph, symmetric graphs |
44 | L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan |
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graph Theory, Computational Intelligence and Thought ![In: Graph Theory, Computational Intelligence and Thought, Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday, pp. 148-157, 2009, Springer, 978-3-642-02028-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Cubicity, AT-free graphs, cocomparability graphs, bandwidth, circular-arc graphs, intersection graphs |
44 | Richard B. Borie, R. Gary Parker, Craig A. Tovey |
Solving problems on recursively constructed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Comput. Surv. ![In: ACM Comput. Surv. 41(1), pp. 4:1-4:51, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Halin graph, branchwidth, cliquewidth, cutwidth, rankwidth, series parallel, dynamic programming, tree, Bandwidth, treewidth, cograph, pathwidth |
44 | Paola Alimonti, Tiziana Calamoneri |
Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 22nd International Workshop, WG '96, Cadenabbia (Como), Italy, June 12-14, 1996, Proceedings, pp. 2-16, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs |
44 | Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty 0001, Samir Datta, Sambuddha Roy |
Planar and Grid Graph Reachability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(4), pp. 675-723, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs |
43 | Andreas Brandstädt |
On Robust Algorithms for the Maximum Weight Stable Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001, Proceedings, pp. 445-458, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
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 |
43 | Iztok Peterin |
Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 21(4), pp. 283-292, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
flag graphs, induced subgraphs, edge-labellings, Cartesian product graphs, quotient graphs |
43 | Mary Mehrnoosh Eshaghian, Ying-Chieh Wu |
Mapping heterogeneous task graphs onto heterogeneous system graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Heterogeneous Computing Workshop ![In: 6th Heterogeneous Computing Workshop, HCW 1997, Geneva, Switzerland, April 1, 1997, pp. 147-, 1997, IEEE Computer Society, 0-8186-7879-8. The full citation details ...](Pics/full.jpeg) |
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 |
41 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Approximately Counting Embeddings into Random 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. 416-429, 2008, Springer, 978-3-540-85362-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
41 | Ekkehard Köhler, Derek G. Corneil, Stephan Olariu, Lorna Stewart |
On Subfamilies of AT-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 241-253, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Andreas Brandstädt, Van Bang Le |
Split-Perfect Graphs: Characterizations and Algorithmic Use. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 71-82, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
41 | Balasubramanian Sivan, S. Harini, C. Pandu Rangan |
Core and Conditional Core Path of Specified Length in Special Classes of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 262-273, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs |
41 | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 218-229, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
40 | Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille |
Recognizing Bipartite Incident-Graphs of Circulant Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings, pp. 215-227, 1999, Springer, 3-540-66731-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
broadcasting, gossiping, graph isomorphism, circulant graphs, chordal rings |
39 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 54(4), pp. 544-556, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms |
39 | Noga Alon, Shai Gutner |
Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs. ![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. 394-405, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms |
39 | Rodrigo S. C. Leão, Valmir Carneiro Barbosa |
Minimal Chordal Sense of Direction and Circulant 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. 670-680, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Chordal sense of direction, Cayley graphs, Circulant graphs |
39 | Gisella Paoletti, Sara Rigutti |
Texts and Graphs Elaboration: The Effect of Graphs' Examination on Recall. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Diagrams ![In: Diagrammatic Representation and Inference, 5th International Conference, Diagrams 2008, Herrsching, Germany, September 19-21, 2008. Proceedings, pp. 401-403, 2008, Springer, 978-3-540-87729-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
spatial contiguity effect, pop-up windows, learning, graphs, texts, recall |
39 | Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001 |
Directed Graphs of Entanglement Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 169-180, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Stanko Dimitrov, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik |
r3: Resilient Random Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 137-151, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
39 | Kathie Cameron, Pavol Hell |
Independent packings in structured graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 105(2-3), pp. 201-213, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 20E28, 20G40, 20C20 |
39 | Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter |
Proper Helly Circular-Arc 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. 248-257, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs |
38 | Ryuhei Uehara, Yushi Uno |
Laminar Structure of Ptolemaic Graphs and Its Applications. ![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. 186-195, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
algorithmic graph theory, intersection model, ptolemaic graphs, data structure, Hamiltonian cycle |
37 | Bruno Escoffier, Laurent Gourvès, Jérôme Monnot |
Complexity and Approximation Results for the Connected Vertex Cover Problem. ![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. 202-213, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs |
37 | Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel |
Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 334-345, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
37 | Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren |
Cryptographic Hash Functions from Expander Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Cryptol. ![In: J. Cryptol. 22(1), pp. 93-113, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Supersingular elliptic curves, Elliptic curve cryptography, Expander graphs, Cryptographic hash functions, Ramanujan graphs, Isogenies |
37 | Min Chih Lin, Jayme Luiz Szwarcfiter |
Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings, pp. 73-82, 2006, Springer, 3-540-36925-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs |
37 | Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento |
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 26(10), pp. 1367-1372, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Graph-subgraph isomorphism, attributed relational graphs, large graphs |
37 | Cyril Gavoille, Christophe Paul |
Optimal Distance Labeling for Interval and Circular-Arc Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2003, 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, Proceedings, pp. 254-265, 2003, Springer, 3-540-20064-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
distance queries, Data-structure, interval graphs, labeling scheme, circular-arc graphs |
37 | Ryuhei Uehara |
Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 993-1004, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms |
37 | Cornelis Hoede, X. Liu |
Word Graphs: The Second Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Theory, Tools and Applications, 6th International Conference on Conceptual Structures, ICCS '98, Montpellier, France, August 10-12, 1998, Proceedings, pp. 375-389, 1998, Springer, 3-540-64791-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Knowledge graphs, adverbs, AMS Subject Classifications: 05C99, 68F99, classifiers, adjectives, word graphs |
37 | Nabil Kahalé |
Eigenvalues and Expansion of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 42(5), pp. 1091-1106, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs |
36 | Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi |
Approximation Algorithms via Structural Results for Apex-Minor-Free 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. 316-327, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Ken-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](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 401-416, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hadwiger conjecture, odd-minor, graph coloring, graph minor, list coloring |
36 | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
lambda-Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 395-406, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai |
Homogeneously Orderable Graphs and the Steiner Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings, pp. 381-395, 1995, Springer, 3-540-60618-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Ching-Chy Wang, Errol L. Lloyd, Mary Lou Soffa |
Feedback Vertex Sets and Cyclically Reducible Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 32(2), pp. 296-313, April 1985. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
36 | Herbert Fleischner, Stefan Szeider |
On Edge-Colored Graphs Covered by Properly Colored Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(3), pp. 301-306, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs |
36 | Frank Gurski, Egon Wanke |
On Module-Composed 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. 166-177, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs |
35 | Guillaume Fertin, André Raspaud, Bruce A. Reed |
On Star Coloring of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings, pp. 140-153, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring |
35 | Ryuhei Uehara |
Bandwidth of Bipartite Permutation Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 824-835, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bipartite permutation graphs, chain graphs, threshold graphs, Bandwidth, interval graphs |
35 | Philip N. Klein, Sairam Subramanian |
A linear-processor polylog-time algorithm for shortest paths in planar graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 259-270, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 |
35 | Sriram V. Pemmaraju, Rajiv Raman 0001 |
Approximation Algorithms for the Max-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1064-1075, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Bruno Courcelle |
Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings, pp. 90-91, 1999, Springer, 3-540-66201-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
34 | Sriram V. Pemmaraju, Imran A. Pirwani |
Energy conservation via domatic partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 7th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2006, Florence, Italy, May 22-25, 2006, pp. 143-154, 2006, ACM, 1-59593-368-9. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Laurenz Wiskott, Jean-Marc Fellous, Norbert Krüger, Christoph von der Malsburg |
Face Recognition by Elastic Bunch Graph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 129-132, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
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 |
34 | Peter Eades, Qing-Wen Feng, Xuemin Lin 0001, Hiroshi Nagamochi |
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(1), pp. 1-32, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Automatic graph drawing, Computational geometry, Hierarchical graph, Clustered graph, Straight-line drawing |
34 | Michael Kaufmann 0001, Jan Kratochvíl, Katharina Anna Lehmann, Amarendran Ramaswami Subramanian |
Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. ![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. 832-841, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Erik 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](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(1), pp. 33-47, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph |
34 | Erik 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](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 829-844, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
34 | Garth Isaak |
Sum List Coloring Block Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 499-506, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Sum coloring, Block graphs, List coloring |
34 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
node-capacitated graphs, directed graphs, communication networks, Oblivious routing |
34 | Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia |
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings, pp. 195-207, 2007, Springer, 978-3-540-72918-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs |
34 | Zhi-Zhong Chen, Mitsuharu Kouno |
A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 43(3), pp. 147-177, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring |
34 | Cornelis Hoede, L. Zhang |
Word Graphs: The Third Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Broadening the Base, 9th International Conference on Conceptual Structures, ICCS 2001, Stanford, CA, USA, July 30-August 3, 2001, Proceedings, pp. 15-28, 2001, Springer, 3-540-42344-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Knowledge graphs, logic word, ontology. skip AMS Subject Classifications: 05C99, 68F99, classification, word graphs |
34 | Tiziana Calamoneri, Rossella Petreschi |
L(2, 1)-labeling of planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIAL-M ![In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), Rome, Italy, July 21, 2001, pp. 28-33, 2001, ACM. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
L(2, 1)-labeling, planar graphs, outerplanar graphs, multi-hop radio networks |
34 | Bharat 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](Pics/bibsonomy.png) |
DATE ![In: 1998 Design, Automation and Test in Europe (DATE '98), February 23-26, 1998, Le Palais des Congrès de Paris, Paris, France, pp. 118-124, 1998, IEEE Computer Society, 0-8186-8359-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
aperiodic task graphs, scheduling, distributed systems, embedded systems, allocation, system synthesis, hardware-software co-synthesis |
33 | Seok-Hee Hong 0001, Peter Eades |
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(1), pp. 67-100, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Planar geometric automorphisms, Symmetry, Graph drawing, Planar graphs |
33 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
Spanners in Sparse 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. 597-608, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Robert D. Kleinberg, Jon M. Kleinberg |
Isomorphism and embedding problems for infinite limits of scale-free 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. 277-286, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
33 | Alexander Gamburd, Igor Pak |
Expansion of product replacement graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 691-696, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
33 | Julia Padberg, Hartmut Ehrig, Grzegorz Rozenberg |
Behavior and Realization Construction for Petri Nets Based on Free Monoid and Power Set Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Unifying Petri Nets ![In: Unifying Petri Nets, Advances in Petri Nets, pp. 230-249, 2001, Springer, 3-540-43067-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
place/transition nets, elementary nets, uniform approach, realization problem, category theory |
33 | Shien-Ching Hwang, Gen-Huey Chen |
The Minimum Spanner Problem on Butterfly Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 5th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2000), 7-10 December 2000, Dallas / Richardson, TX, USA, pp. 210-215, 2000, IEEE Computer Society, 0-7695-0936-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
33 | Maciej M. Syslo |
On Some Generalizations of Outerplanar Graphs: Results and Open Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graphtheoretic Concepts in Computer Science, International Workshop, WG '86, Bernried, Germany, June 17-19, 1986, Proceedings, pp. 146-164, 1986, Springer, 3-540-17218-1. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
33 | Alain Bretto, Luc Gillibert |
G-graphs for the cage problem: a new upper bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2007, Waterloo, Ontario, Canada, July 28 - August 1, 2007, Proceedings, pp. 49-53, 2007, ACM, 978-1-59593-743-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
G-graphs, cage graphs, graphs from group |
33 | Yonatan Bilu, Nathan Linial |
Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 404-412, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts |
33 | Hans L. Bodlaender |
Necessary Edges in k-Chordalisations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 7(3), pp. 283-290, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth |
33 | Steven Gold, Anand Rangarajan 0001 |
A Graduated Assignment Algorithm for Graph Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 18(4), pp. 377-388, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Graduated assignment, graph matching, weighted graphs, relaxation labeling, attributed relational graphs, model matching, continuation method, softassign |
32 | Khoriba Ghada, Jie Li 0002, Yusheng Ji |
Localized Mobility-Aware Geometric Graphs for Topology Control in Heterogeneous Mobile Ad Hoc Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNIS ![In: Databases in Networked Information Systems, 5th International Workshop, DNIS 2007, Aizu-Wakamatsu, Japan, October 17-19, 2007, Proceedings, pp. 178-188, 2007, Springer, 978-3-540-75511-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Heterogeneous Transmission range, Mobile Ad Hoc Networks, Topology control, Graph connectivity, Geometric graphs |
32 | John G. Stell |
Granulation for Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COSIT ![In: Spatial Information Theory: Cognitive and Computational Foundations of Geographic Information Science, International Conference COSIT '99, Stade, Germany, August 25-29, 1999, Proceedings, pp. 417-432, 1999, Springer, 3-540-66365-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Graphs, Formal Models, Granularity, Multi-resolution, Vagueness, Spatial Partitions |
32 | Peter Hui, Michael J. Pelsmajer, Marcus Schaefer 0001, Daniel Stefankovic |
Train Tracks and Confluent Drawings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(4), pp. 465-479, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | John T. Rickard, Ronald R. Yager |
Hypercube Graph Representations and Fuzzy Measures of Graph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Fuzzy Syst. ![In: IEEE Trans. Fuzzy Syst. 15(6), pp. 1278-1293, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Narayan Vikas |
Connected and Loosely Connected List Homomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers, pp. 399-412, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Stavros D. Nikolopoulos, Charis Papadopoulos |
The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 383-397, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems |
31 | Jiong Guo, Rolf Niedermeier, Daniel Raible 0001 |
Improved Algorithms and Complexity Results for Power Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 177-202, 2008. The full citation details ...](Pics/full.jpeg) |
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 |
31 | Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca |
Independent Sets of Maximum Weight in Apple-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 848-858, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs |
31 | Ryuhei Uehara |
Simple Geometrical Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Second International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008., pp. 25-33, 2008, Springer, 978-3-540-77890-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem |
31 | Stavros D. Nikolopoulos, Leonidas Palios |
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, First Annual International Workshop, FAW 2007, Lanzhou, China, August 1-3, 2007, Proceedings, pp. 281-292, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
HHD-free graphs, certifying algorithms, recognition, perfectly orderable graphs |
31 | Stavros D. Nikolopoulos, Leonidas Palios |
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Panhellenic Conference on Informatics ![In: Advances in Informatics, 10th Panhellenic Conference on Informatics, PCI 2005, Volos, Greece, November 11-13, 2005, Proceedings, pp. 68-79, 2005, Springer, 3-540-29673-5. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|