|
|
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 |
21 | Thomas Erlebach, Erik Jan van Leeuwen |
Domination in Geometric Intersection Graphs. ![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. 747-758, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Max A. Alekseyev, Pavel A. Pevzner |
Colored de Bruijn Graphs and the Genome Halving Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(1), pp. 98-107, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Genome duplication, genome halving, breakpoint graph, reversal, genome rearrangement, de Bruijn graph |
21 | Justie Su-tzu Juan, Gerard J. Chang |
Group testing in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 113-119, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Sample space, Algorithm, Graph, Bipartite graph, Group testing |
21 | Sergio Cabello, Günter Rote |
Obnoxious centers in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 98-107, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz |
Optimization problems in multiple-interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 268-277, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Sitaram Asur, Srinivasan Parthasarathy 0001, Duygu Ucar |
An event-based framework for characterizing the evolutionary behavior of interaction graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007, pp. 913-921, 2007, ACM, 978-1-59593-609-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
evolutionary analysis, diffusion of innovations, interaction networks |
21 | Fabrizio Frati, Markus Geyer, Michael Kaufmann 0001 |
Packing and Squeezing Subgraphs into Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 394-405, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
Expander Properties and the Cover Time of Random Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 44-55, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Muhammad Rezaul Karim 0001, Md. Saidur Rahman 0001 |
Straight-line grid drawings of planar graphs with linear area. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APVIS ![In: APVIS 2007, 6th International Asia-Pacific Symposium on Visualization 2007, Sydney, Australia, 5-7 February 2007, pp. 109-112, 2007, IEEE Computer Society, 1-4244-0808-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Furuzan Atay Onat, Ivan Stojmenovic |
Generating Random Graphs for Wireless Actuator Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOWMOM ![In: 2007 International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM 2007), 18-21 June 2007, Helsinki, Finland, Proceedings, pp. 1-12, 2007, IEEE Computer Society, 1-4244-0992-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | J. Joseph Fowler, Stephen G. Kobourov |
Characterization of Unlabeled Level Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 37-49, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Fabrizio Frati, Maurizio Patrignani |
A Note on Minimum-Area Straight-Line Drawings of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers, pp. 339-344, 2007, Springer, 978-3-540-77536-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Costas Busch, Ryan LaFortune, Srikanta Tirthapura |
Improved sparse covers for graphs excluding a fixed minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 61-70, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
minor free graph, path separator, sparse cover, planar graph, compact routing |
21 | Timothy M. Chan |
More algorithms for all-pairs shortest paths in weighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 590-598, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
computational geometry, shortest paths, graph algorithms, matrix multiplication |
21 | Alessandro Ferrante, Gopal Pandurangan, Kihong Park |
On the Hardness of Optimization in Power Law 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. 417-427, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Pinar Heggernes, Charis Papadopoulos |
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. ![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. 406-416, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Mark Huber |
Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(3), pp. 183-193, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Perfect sampling, Bregman's theorem, Minc's conjecture, Approximation algorithms, Perfect matchings, Permanent |
21 | Jeffrey Chan, James Bailey 0001, Christopher Leckie |
Discovering and Summarising Regions of Correlated Spatio-Temporal Change in Evolving Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM Workshops ![In: Workshops Proceedings of the 6th IEEE International Conference on Data Mining (ICDM 2006), 18-22 December 2006, Hong Kong, China, pp. 361-365, 2006, IEEE Computer Society, 0-7695-2702-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing triangle-freeness in general graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 279-288, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Satish Rao, Shuheng Zhou |
Edge Disjoint Paths in Moderately Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 202-213, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Herman Geuvers, Iris Loeb |
From Deduction Graphs to Proof Nets: Boxes and Sharing in the Graphical Presentation of Deductions. ![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. 39-57, 2006, Springer, 3-540-37791-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Magnús M. Halldórsson, Ragnar K. Karlsson |
Strip Graphs: Recognition and Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 137-146, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng |
Partitioned Probe Comparability Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers, pp. 179-190, 2006, Springer, 3-540-48381-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Robert Kincaid, Heidi Lam |
Line graph explorer: scalable display of line graphs using Focus+Context. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AVI ![In: Proceedings of the working conference on Advanced visual interfaces, AVI 2006, Venezia, Italy, May 23-26, 2006, pp. 404-411, 2006, ACM Press, 1-59593-353-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Focus+Context, line graph |
21 | Maxim A. Babenko |
Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 23-34, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Hajo Broersma, Agostino Capponi, Daniël Paulusma |
On-Line Coloring of H-Free Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings, pp. 284-295, 2006, Springer, 3-540-34375-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Stefan Felsner, Mareike Massow |
Thickness of Bar 1-Visibility Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 330-342, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Ellis Rowland Watkins, Denis A. Nicole |
Named Graphs as a Mechanism for Reasoning About Provenance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Frontiers of WWW Research and Development - APWeb 2006, 8th Asia-Pacific Web Conference, Harbin, China, January 16-18, 2006, Proceedings, pp. 943-948, 2006, Springer, 3-540-31142-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Erik D. Demaine, Mohammad Taghi Hajiaghayi |
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. ![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. 682-689, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
21 | Miroslav Chlebík, Janka Chlebíková |
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. ![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. 267-276, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
21 | Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter |
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 13th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers, pp. 73-82, 2005, Springer, 3-540-31425-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
21 | Masashi Toyoda, Masaru Kitsuregawa |
A system for visualizing and analyzing the evolution of the web with a time series of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Hypertext ![In: HYPERTEXT 2005, Proceedings of the 16th ACM Conference on Hypertext and Hypermedia, September 6-9, 2005, Salzburg, Austria, pp. 151-160, 2005, ACM, 1-59593-168-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
visualization, evolution, link analysis, Web graph, link spamming |
21 | Anthony Bonato, Dejan Delic |
On a Problem of Cameron's on Inexhaustible Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 24(1), pp. 35-51, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C75, 03C15 |
21 | Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl |
Matching graphs with unique node labels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Anal. Appl. ![In: Pattern Anal. Appl. 7(3), pp. 243-254, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Maximum common subgraph, Median graph, Unique node label, Graph matching, Graph isomorphism, Graph edit distance |
21 | Gerard J. Chang, Chiuyuan Chen, Yaping Chen |
Vertex and Tree Arboricities of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(3), pp. 295-306, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
arboricity, block-cactus graph, tree, planar graph, hamiltonian cycle, cograph, acyclic, series-parallel graph, girth |
21 | Gianluigi Greco, Antonella Guzzo, Giuseppe Manco 0001, Luigi Pontieri, Domenico Saccà |
Mining Constrained Graphs: The Case of Workflow Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraint-Based Mining and Inductive Databases ![In: Constraint-Based Mining and Inductive Databases, European Workshop on Inductive Databases and Constraint Based Mining, Hinterzarten, Germany, March 11-13, 2004, Revised Selected Papers, pp. 155-171, 2004, Springer, 3-540-31331-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai |
A deterministic near-linear time algorithm for finding minimum cuts in planar 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. 828-829, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Anne Berry, Martin Charles Golumbic, Marina Lipshteyn |
Two tricks to triangulate chordal probe graphs in polynomial time. ![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. 962-969, 2004, SIAM, 0-89871-558-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
21 | Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001 |
Approximating Interval Coloring and Max-Coloring in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental and Efficient Algorithms, Third International Workshop, WEA 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings, pp. 399-416, 2004, Springer, 3-540-22067-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. ![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. 71-80, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis |
The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings, pp. 1029-1040, 2004, Springer, 3-540-22849-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Stavros D. Nikolopoulos, Leonidas Palios |
Recognizing HHD-free and Welsh-Powell Opposition Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 105-116, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Fedor V. Fomin, Dimitrios M. Thilikos |
A Simple and Fast Approach for Solving Problems on Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings, pp. 56-67, 2004, Springer, 3-540-21236-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
21 | Mark Korenblit, Vadim E. Levit |
On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 215-224, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Paul S. Bonsma |
The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. ![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. 93-105, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
21 | Oded Goldreich 0001, Dana Ron |
Property Testing in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 302-343, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing |
21 | Somesh Jha, Oleg Sheyner, Jeannette M. Wing |
Two Formal Analys s of Attack Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: 15th IEEE Computer Security Foundations Workshop (CSFW-15 2002), 24-26 June 2002, Cape Breton, Nova Scotia, Canada, pp. 49-63, 2002, IEEE Computer Society, 0-7695-1689-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Colcombet |
On Families of Graphs Having a Decidable First Order Theory with Reachability. ![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. 98-109, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Christopher R. Palmer, Phillip B. Gibbons, Christos Faloutsos |
ANF: a fast and scalable tool for data mining in massive graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, July 23-26, 2002, Edmonton, Alberta, Canada, pp. 81-90, 2002, ACM, 1-58113-567-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Julia Klinger |
Semiconcept Graphs with Variables. ![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. 369-381, 2002, Springer, 3-540-43901-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher |
Advances in C-Planarity Testing of Clustered Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers, pp. 220-235, 2002, Springer, 3-540-00158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Sebastián Blaustein, Fernando Oliveto, Víctor A. Braberman |
Observing timed systems by means of message sequence chart graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: Proceedings of the 24th International Conference on Software Engineering, ICSE 2002, 19-25 May 2002, Orlando, Florida, USA, pp. 707, 2002, ACM. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Erlebach, Klaus Jansen, Eike Seidel |
Polynomial-time approximation schemes for geometric graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 671-679, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
21 | Daniel Kobler, Udi Rotics |
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 468-476, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set |
21 | Maw-Shang Chang, Haiko Müller |
On the Tree-Degree 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. 44-54, 2001, Springer, 3-540-42707-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Frithjof Dau |
Concept Graphs and Predicate Logic. ![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. 72-86, 2001, Springer, 3-540-42344-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang |
Efficient Minus and Signed Domination in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 241-253, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson |
On Recognizing Cayley Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2000, 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 76-87, 2000, Springer, 3-540-41004-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Michael A. Bender, Dana Ron |
Testing Acyclicity of Directed Graphs in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 809-820, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | David Harel, Yehuda Koren |
A Fast Multi-scale Method for Drawing Large Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 183-196, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Joan P. Hutchinson |
On Polar Visibility Representations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings, pp. 63-76, 2000, Springer, 3-540-41554-8. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Fang-Rong Hsu, Yaw-Ling Lin, Yin-Te Tsai |
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999, Proceedings, pp. 173-182, 1999, Springer, 3-540-66916-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
21 | Takahiro Nakanishi, Motoshi Saeki |
Using Multiple Graphs of Programs to Modify Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 6th Asia-Pacific Software Engineering Conference (APSEC '99), 7-10 December 1999, Takamatsu, Japan, pp. 216-223, 1999, IEEE Computer Society, 0-7695-0509-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Specification Modification, Reverse Engineering, Maintenance, Program Graph |
21 | Anupam Gupta 0001, Ilan Newman, Yuri Rabinovich, Alistair Sinclair |
Cuts, Trees and l1-Embeddings of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 399-409, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
embeddings, Multicommodity flow, Sparsest cut, Finite metric spaces |
21 | Jens Knoop, Dirk Koschützki, Bernhard Steffen |
Basic-Block Graphs: Living Dinosaurs? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CC ![In: Compiler Construction, 7th International Conference, CC'98, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28 - April 4, 1998, Proceedings, pp. 65-79, 1998, Springer, 3-540-64304-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
21 | Feodor F. Dragan |
On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 184-198, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Stephan Brandt |
Computing the Independence Number of Dense Triangle-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 100-108, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
21 | Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt |
LexBFS-Orderings and Power of 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. 166-180, 1996, Springer, 3-540-62559-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
21 | Ajit A. Diwan, N. Usharani |
A Condition for the Three Colourability of Planar Locally Path Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 52-61, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
21 | Xiao Zhou 0001, Takao Nishizeki |
Edge-Coloring and f-Coloring for Various Classes of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 199-207, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller |
On Vertex Ranking for Permutations and Other Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings, pp. 747-758, 1994, Springer, 3-540-57785-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
21 | Bikash Chandra Ghosh, Vilas Wuwongse |
Conceptual Graphs as a Framework for Deductive Object-Oriented Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAiSE ![In: Advanced Information Systems Engineering, CAiSE'92, Manchester, UK, May 12-15, 1992, Proceedings, pp. 147-163, 1992, Springer, 3-540-55481-5. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
21 | Robert Y. Geva, Azaria Paz |
Toward a Complete Representation of Graphoids in Graphs (Abridged Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings, pp. 46-62, 1989, Springer, 3-540-52292-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
21 | David P. Helmbold, Ernst W. Mayr |
Applications of Parallel Scheduling to Perfect Graphs. ![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. 188-203, 1986, Springer, 3-540-17218-1. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
21 | C. E. Veni Madhavan |
Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, Bangalore, India, December 13-15, 1984, Proceedings, pp. 381-392, 1984, Springer, 3-540-13883-8. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
21 | Matej Stehlík |
Minimal Connected tau-Critical Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(3), pp. 421-426, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
?-critical hypergraphs, Colour-critical graphs, t-stable hypergraphs |
21 | Appu Muthusamy |
On Resolvable Multipartite G-Designs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(3), pp. 377-382, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Cycle-factorization, Wreath product of graphs, Complete symmetric k-partite multi-digraph, Resesolvable multipartite G-design |
21 | Glencora Borradaile, James R. Lee, Anastasios Sidiropoulos |
Randomly removing g handles at once. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 371-376, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded genus graphs, probabilistic approximation, embeddings, planar graphs |
21 | Chang-Wu Yu 0001 |
On the Complexity of the Max-Edge-Coloring Problem with Its Variants. ![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. 350-361, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
multi-graphs, bipartite graphs, algorithm design, edge coloring |
21 | Christian Borgs, Jennifer T. Chayes, László Lovász 0001, Vera T. Sós, Balázs Szegedy, Katalin Vesztergombi |
Graph limits and parameter testing. ![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. 261-270, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
convergence of graphs, distance of graphs, graph limit, property testing, graph homomorphism |
21 | Fábio Protti, Maise Dantas da Silva, Jayme Luiz Szwarcfiter |
Applying Modular Decomposition to Parameterized Bicluster Editing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 1-12, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
edge modification problems, bicluster graphs, NP-complete problems, fixed-parameter tractability, cluster graphs |
21 | Steven Noel, Sushil Jajodia |
Managing attack graph complexity through visual hierarchical aggregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VizSEC ![In: 1st ACM Workshop on Visualization and Data Mining for Computer Security, VizSEC/DMSEC 2004, Washington, DC, USA, October 29, 2004, pp. 109-118, 2004, ACM, 1-58113-974-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
network attack graphs, network attack modeling, vulnerability analysis, clustered graphs |
21 | Aubin Jarry, Zvi Lotker |
Connectivity in evolving graph with geometric properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004, pp. 24-30, 2004, ACM, 1-58113-921-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
disc graphs, evolving graphs, connectivity, trees, dynamic networks |
21 | Laurence E. LaForge, Kirk F. Korver, M. Sami Fadali |
What Designers of Bus and Network Architectures Should Know about Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 52(4), pp. 525-544, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Hypercube fault tolerance, hypercube latency, Hamming graphs, K-cubes, Moore graphs, Moore Bound, C-cubes, performability, quorums, configuration architectures, Lee distance |
21 | Shin-Ichi Nakano |
Enumerating Floorplans with n Rooms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 107-115, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Graphs, Enumeration, Listing, Plane graphs |
21 | Joseph Naor, Baruch Schieber |
Improved Approximations for Shallow-Light Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 536-541, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design |
21 | Jean-Marc Laferté, Fabrice Heitz, Patrick Pérez, Eric Fabre |
Hierarchical Statistical Models for the Fusion of Multiresolution Image Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 908-913, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
hierarchical statistical models, multiresolution image data fusion, nonlinear hierarchical algorithms, nonlinear causal Markov models, hierarchical graph structures, bayesian estimation theory, simple hierarchical graphs, ternary graphs, single-resolution image segmentation, computational complexity, computational complexity, image processing, image segmentation, graph theory, Markov processes, sensor fusion, optimal algorithm, Bayes methods, quadtrees, bayesian estimates, random processes, estimation theory, Viterbi algorithm, low-level vision, image size |
21 | Yih-Farn Chen, Glenn S. Fowler, Eleftherios Koutsofios, Ryan S. Wallach |
Ciao: a graphical navigator for software and document repositories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSM ![In: Proceedings of the International Conference on Software Maintenance, ICSM 1995, Opio (Nice), France, October 17-20, 1995, pp. 66-75, 1995, IEEE Computer Society, 0-8186-7141-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Ciao, graphical navigator, document repositories, maintenance task, virtual database pipelines, structural connections, source document collection, Aero architecture style, entity-relationship databases, directed attributed graphs, graph analysis operators, presentation filters, graph views, source views, information retrieval, database, reverse engineering, query processing, software maintenance, browsing, directed graphs, data visualisation, programmers, entity-relationship modelling, software repositories, database queries, software documents, relational views |
21 | Aniello Cimitile, Andrea De Lucia, Malcolm Munro |
Identifying reusable functions using specification driven program slicing: a case study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSM ![In: Proceedings of the International Conference on Software Maintenance, ICSM 1995, Opio (Nice), France, October 17-20, 1995, pp. 124-133, 1995, IEEE Computer Society, 0-8186-7141-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
reusable function identification, specification driven program slicing, code fragment isolation, functional abstractions, program statement execution, program predicate execution, entry points, exit points, algorithms, formal specification, software maintenance, software reusability, data flow analysis, symbolic execution, precondition, program diagnostics, dependence graphs, symbol manipulation, control flow graphs, program control structures, C programs, postcondition |
21 | Kamal Kumar Jain, V. Rajaraman |
Lower and Upper Bounds on Time for Multiprocessor Optimal Schedules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(8), pp. 879-886, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
lower time bound, upper time bound, multiprocessor optimal schedules, minimum processing time, directed acyclic task graph, worst case behavior, minimum processor number, randomly generated dense task graphs, scheduling, performance evaluation, parallel algorithms, parallel processing, directed graphs, minimisation |
21 | Vernon Rego, Aditya P. Mathur |
Exploiting Parallelism Across Program Execution: A Unification Technique and Its Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(4), pp. 399-414, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
vector multiprocessors, nonregressive graphs, optimality, parallel programming, parallelism, programming theory, unification, vector processors, sequential programs, source-to-source transformation, program graphs |
20 | Eike Best |
A Note on Persistent Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Concurrency, Graphs and Models ![In: Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday, pp. 427-438, 2008, Springer, 978-3-540-68676-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
20 | Adam H. Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett |
Sum List Coloring Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 173-183, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Choosable function, Sum choice number, Sum choice greedy graph, Graph, List coloring |
20 | Joe Anderson, Haidong Wu |
An Extremal Problem on Contractible Edges in 3-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 145-152, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer |
Planar Graphs, via Well-Orderly Maps and Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 22(2), pp. 185-202, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Well-orderly, Triangulation, Planar graph, Realizer |
20 | Catherine S. Greenhill, Oleg Pikhurko |
Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(4), pp. 407-419, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
20 | Liming Xiong, Roman Kuzel |
A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 137-144, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000). 05C45, 05C35 |
20 | Daniel Král, Jana Maxová, Pavel Podbrdský, Robert Sámal |
Pancyclicity of Strong Products of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 91-104, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Anna de Mier, Marc Noy |
On Graphs Determined by Their Tutte Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 105-119, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Xinmin Hou, Bolian Liu, Tianming Wang |
An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 19(1), pp. 111-119, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #401 - #500 of 76671 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ >>] |
|