|
|
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 |
23 | Graham A. Mann |
Assembly of Conceptual Graphs from Natural Language by Means of Multiple Knowledge Specialists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Conceptual Graphs ![In: Conceptual Structures: Theory and Implementation, 7th Annual Workshop, Las Cruces, NM, USA, July 8-10, 1992, Proceedings, pp. 275-282, 1992, Springer, 3-540-57454-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos |
The Longest Path Problem Is Polynomial on Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 403-414, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Longest path problem, complexity, dynamic programming, interval graphs, polynomial algorithm |
23 | Eduardo Alberto Canale, Pablo Monzón, Franco Robledo |
Global Synchronization Properties for Different Classes of Underlying Interconnection Graphs for Kuramoto Coupled Oscillators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FGIT ![In: Future Generation Information Technology, First International Conference, FGIT 2009, Jeju Island, Korea, December 10-12, 2009. Proceedings, pp. 104-111, 2009, Springer, 978-3-642-10508-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Network synchronization, synchronizing graphs, Nonlinear systems, coupled oscillators |
23 | Abdel Aziz Farrag, Shituo Lou, Qi Yao |
Fault-tolerance and reconfiguration of circulant graphs and hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim ![In: Proceedings of the 2008 Spring Simulation Multiconference, SpringSim 2008, Ottawa, Canada, April 14-17, 2008, pp. 475-481, 2008, SCS/ACM, 1-56555-319-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fault-tolerance, networks, reconfiguration, hypercubes, circulant graphs |
23 | Sascha A. Parduhn, Raimund Seidel, Reinhard Wilhelm |
Algorithm visualization using concrete and abstract shape graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFTVIS ![In: Proceedings of the ACM 2008 Symposium on Software Visualization, Ammersee, Germany, September 16-17, 2008, pp. 33-36, 2008, ACM, 978-1-60558-112-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
algorithm visualisation, shape graphs, invariants, shape analysis, algorithm animation |
23 | Petr A. Golovach, Yngve Villanger |
Parameterized Complexity for Domination Problems on Degenerate 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. 195-205, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
degenerate graphs, algorithms, domination, Parameterized complexity |
23 | Avraham Ben-Aroya, Amnon Ta-Shma |
A combinatorial construction of almost-ramanujan graphs using the zig-zag product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 325-334, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
zig-zag product, expander graphs |
23 | Alan M. Frieze, Santosh S. Vempala, Juan Vera 0001 |
Logconcave random graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 779-788, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
random graphs |
23 | Abdelfattah Abouelaoualim, Kinkar Chandra Das, Luérbio Faria, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad |
Paths and Trails in Edge-Colored 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. 723-735, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
properly edge-colored paths, trails and cycles, connectivity, Edge colored graphs |
23 | Sun-Yuan Hsieh |
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 39(1), pp. 39-57, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
The perfect domination problem, Parallel algorithms, Parallel random access machine (PRAM), Distance-hereditary graphs |
23 | Paul S. A. Reitsma, Nancy S. Pollard |
Evaluating motion graphs for character animation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 26(4), pp. 18, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Motion capability, capability metrics, editing model, motion graph embedding, motion capture, human motion, motion graphs |
23 | Detlef Seese |
Easy Problems for Grid-Structured 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. 293-304, 2007, Springer, 978-3-540-73813-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
grid structured hierarchical graphs, first order problems, monotone properties, constant time |
23 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion. ![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. 757-766, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
23 | Robert Elsässer |
On the communication complexity of randomized broadcasting in random-like graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006, pp. 148-157, 2006, ACM, 1-59593-452-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
broadcasting, random graphs |
23 | James F. Lynch |
Convergence law for random graphs with specified degree sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(4), pp. 727-748, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
random graphs, Finite model theory |
23 | Vasileios Vlachos, Vassiliki Vouzi, Damianos Chatziantoniou, Diomidis Spinellis |
NGCE - Network Graphs for Computer Epidemiologists. ![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. 672-683, 2005, Springer, 3-540-29673-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Network graphs, Computer epidemiology, Malicious software |
23 | Michal Malafiejski, Krzysztof Giaro, Robert Janczewski, Marek Kubale |
Sum Coloring of Bipartite Graphs with Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 235-244, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Sum coloring, Chromatic sum, Bipartite graphs |
23 | Brijnesh J. Jain, Fritz Wysotzki |
Central Clustering of Attributed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 56(1-3), pp. 169-207, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
weighted maximum clique, winner-takes-all networks, graph matching, K-means clustering, Hopfield networks, attributed graphs |
23 | William Duckworth, Bernard Mans |
Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 83-95, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
weakly-connected, dominating sets, random regular graphs |
23 | Isabella Lari, Federica Ricca, Andrea Scozzari |
The Forest Wrapping Problem on Outerplanar Graphs. ![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. 345-354, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Connected partition, Steiner Forest, Maximum Split Clustering, Outerplanar graphs |
23 | Dimitris Achlioptas, Cristopher Moore |
Almost all graphs with average degree 4 are 3-colorable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 199-208, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
threshold phenomena, graph coloring, random graphs |
23 | Parthasarathi Dasgupta, Susmita Sur-Kolay |
Slicible rectangular graphs and their optimal floorplans. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 6(4), pp. 447-470, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
graph dualization, nonslicible floorplans, slicible floorplans, heuristic search, planar graphs, Floorplanning |
23 | Burkhard Monien, Robert Preis |
Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 524-536, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
local improvement, graph partitioning, regular graphs, bisection width |
23 | Johan Janssen, Henk Corporaal |
Making Graphs Reducible with Controlled Node Splitting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 19(6), pp. 1031-1052, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
compilation, instruction-level parallelism, reducibility, control flow graphs, node splitting, irreducibility |
23 | Gerard Ellis, Fritz Lehmann |
Exploiting the Induced Order on Type-Labeled Graphs for Fast Knowledge Retrieval. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Current Practices, Second International Conference on Conceptual Structures, ICCS '94, College Park, Maryland, USA, August 16-20, 1994, Proceedings, pp. 293-310, 1994, Springer, 3-540-58328-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
type lattice, bit string, skeleton product, fret product, order theory, information retrieval, encoding, knowledge base, deductive database, conceptual graphs, poset, graph database, subsumption, subgraph isomorphism |
23 | Isaac D. Scherson |
Orthogonal Graphs for the Construction of a Class of Interconnection Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(1), pp. 3-19, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
multidimensional access memories, graph theoretical representation, orthogonal binary vectors, link modes, node covering problem, binary m-cube, spanning-bus meshes, orthogonal shared memorymultiprocessing systems, interconnection networks, graph theory, connectivity, placement, bipartite graphs, multiprocessor interconnectionnetworks |
23 | Louise E. Moser |
Data Dependency Graphs for Ada Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 16(5), pp. 498-509, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
composition rules, primitive program statements, data structures, Ada, tracking, programming, information flow, exception handling, correctness, recursion, tasking, iteration, data dependency graphs, Ada programs, program development environment |
23 | Nikhil S. Ketkar, Lawrence B. Holder, Diane J. Cook |
Faster computation of the direct product kernel for graph classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIDM ![In: Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining, CIDM 2009, part of the IEEE Symposium Series on Computational Intelligence 2009, Nashville, TN, USA, March 30, 2009 - April 2, 2009, pp. 267-274, 2009, IEEE, 978-1-4244-2765-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Punyashloka Biswal, James R. Lee, Satish Rao |
Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 751-760, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
23 | Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos |
Graph evolution: Densification and shrinking diameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Knowl. Discov. Data ![In: ACM Trans. Knowl. Discov. Data 1(1), pp. 2, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Densification power laws, small-world phenomena, graph mining, heavy-tailed distributions, graph generators |
23 | Vadim V. Lozin, Martin Milanic |
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. ![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. 26-30, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
polynomial-time algorithm, independent set |
23 | Arthur Brady, Lenore Cowen |
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 20th International Symposium, DISC 2006, Stockholm, Sweden, September 18-20, 2006, Proceedings, pp. 339-354, 2006, Springer, 3-540-44624-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Leah Epstein, Asaf Levin |
On Bin Packing with Conflicts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 160-173, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Andy Yoo, Keith W. Henderson |
Poster reception - Parallel massive scale-free graph generators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the ACM/IEEE SC2006 Conference on High Performance Networking and Computing, November 11-17, 2006, Tampa, FL, USA, pp. 160, 2006, ACM Press, 0-7695-2700-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
23 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More About Subcolorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 69(3), pp. 187-203, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C15, 05C17, 05C85 |
23 | Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger |
More about Subcolorings. ![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. 68-79, 2002, Springer, 3-540-00331-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
subcoloring, special graph classes, computational complexity, graph coloring, polynomial time algorithm |
23 | Chin Soon Lee |
Program Termination Analysis in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GPCE ![In: Generative Programming and Component Engineering, ACM SIGPLAN/SIGSOFT Conference, GPCE 2002, Pittsburgh, PA, USA, October 6-8, 2002, Proceedings, pp. 218-235, 2002, Springer, 3-540-44284-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
23 | Gabriel Valiente |
A General Method for Graph Isomorphism. ![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. 428-431, 2001, Springer, 3-540-42487-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
23 | Petr Jancar, Faron Moller |
Techniques for Decidability and Undecidability of Bisimilarity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24-27, 1999, Proceedings, pp. 30-45, 1999, Springer, 3-540-66425-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
23 | Bharat P. Dave, Niraj K. Jha |
COHRA: Hardware-Software Co-Synthesis of Hierarchical Distributed Embedded System Architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 11th International Conference on VLSI Design (VLSI Design 1991), 4-7 January 1998, Chennai, India, pp. 347-354, 1998, IEEE Computer Society, 0-8186-8224-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
scheduling, distributed systems, embedded systems, hierarchy, allocation, system synthesis, hardware-software co-synthesis |
23 | Ewa M. Kubicka, Grzegorz Kubicki, Ignatios Vakalis |
Using Graph Distance in Object Recognition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 18th Annual Computer Science Conference on Cooperation, CSC '90, Sheraton Washington Hotel, Washington, DC, USA, February 20-22, 1990, pp. 43-48, 1990, ACM, 0-89791-348-5. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
23 | Johannes Schneider 0002, Roger Wattenhofer |
Coloring unstructured wireless multi-hop networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, PODC 2009, Calgary, Alberta, Canada, August 10-12, 2009, pp. 210-219, 2009, ACM, 978-1-60558-396-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded independence graphs, growth bounded graphs, unstructured radio networks, sensor networks, parallel algorithms, ad hoc networks, distributed algorithms, coloring, local algorithms, unit disk graphs |
23 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 249-264, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
23 | Karl J. Lieberherr, Boaz Patt-Shamir, Doug Orleans |
Traversals of object structures: Specification and Efficient Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 26(2), pp. 370-412, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Low of Demeter, adaptive programming, class graphs, strategy graphs, structure-shy software, Aspect-oriented programming, object graphs |
23 | Camil Demetrescu, Giuseppe F. Italiano |
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 381-389, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms |
23 | Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski 0001, Endre Szemerédi |
Universality and Tolerance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 14-21, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
positive integers, sparse universal graphs, random constructions, fault-tolerant bipartite random graph, graph theory, graph theory, graphs, bipartite graphs, universality, vertices, tolerance, maximum degree |
23 | Toshinori Yamada, Shuichi Ueno |
Sparse Networks Tolerating Random Faults. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99), 23-25 June 1999, Fremantle, Australia, pp. 114-118, 1999, IEEE Computer Society, 0-7695-0231-8. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Hypercubic Graphs, Random-Fault-Tolerant Graphs, Interconnection Networks, Circulant Graphs, Multi-processor Systems |
23 | Gary L. Miller, Shang-Hua Teng, Stephen A. Vavasis |
A Unified Geometric Approach to Graph Separators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 538-547, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
randomized NC algorithms, geometric embedding, randomized linear time algorithms, k-overlap graphs, k-nearest neighbor graphs, separator bound, finite element methods, planar graphs, graph separators |
23 | Sebastian M. Cioaba, Himanshu Gupta |
On the Eigenvalues of Grassmann Graphs, Bilinear Forms Graphs and Hermitian Forms Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 38(2), pp. 30, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
23 | Mahdi Reza Khorsandi |
Graphs whose line graphs are ring graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(3), pp. 801-803, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Radha Madhavi Duggaraju, Lipika Mazumdar |
An algorithm for generating generalized splines on graphs such as complete graphs, complete bipartite graphs and hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(1), pp. 276-295, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
23 | Mojtaba Abdolmaleki, Joan P. Hutchinson, S. Gh. Ilchi, Ebadollah S. Mahmoodian, Naoki Matsumoto, Mohammad Amin Shabani |
On Uniquely k-List Colorable Planar Graphs, Graphs on Surfaces, and Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 34(3), pp. 383-394, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
23 | Xuding Zhu |
Perfect Graphs for Generalized Colouring-Circular Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs, Morphisms and Statistical Physics ![In: Graphs, Morphisms and Statistical Physics, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, March 19-21, 2001, pp. 177-193, 2001, DIMACS/AMS, 978-0-8218-3551-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Yusuke Kobayashi 0001, Ken-ichi Kawarabayashi |
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 1146-1155, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
Tree Spanners for Bipartite Graphs and Probe Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(1), pp. 27-51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Cyril Gavoille, Arnaud Labourel |
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 582-593, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Jean-Pierre Aubert, Jean-François Baget, Michel Chein |
Simple Conceptual Graphs and Simple Concept Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Inspiration and Application, 14th International Conference on Conceptual Structures, ICCS 2006, Aalborg, Denmark, July 16-21, 2006, Proceedings, pp. 87-101, 2006, Springer, 3-540-35893-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Cornelia Dangelmayr, Stefan Felsner |
Chordal Graphs as Intersection Graphs of Pseudosegments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 208-219, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos |
Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(4), pp. 245-267, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Subexponential algorithms, Dominating set, Graph minors |
22 | Moni Naor, Asaf Nussboim, Eran Tromer |
Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 66-85, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara |
Tree Spanners for Bipartite Graphs and Probe Interval 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. 106-118, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness |
22 | Marie-Laure Mugnier, Michel Chein |
Characterization and Algorithmic Recognition of Canonical Conceptual Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Graphs for Knowledge Representation, ICCS '93, Quebec City, Canada, August 4-7, 1993, Proceedings, pp. 294-311, 1993, Springer, 3-540-56979-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
22 | Santos Hernández, Florian Luca |
Integer Roots Chromatic Polynomials of Non-Chordal Graphs and the Prouhet-Tarry-Escott Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(3), pp. 319-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Chromatic polynomials of graphs, the Prouhet-Tarry-Escott problem |
22 | János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth 0001 |
Topological Graphs with No Large Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(3), pp. 355-364, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Crossing edges, Topological graphs |
22 | Hossein Hajiabolhassan, Xuding Zhu |
Sparse H-Colourable Graphs of Bounded Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(1), pp. 65-71, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Uniquely H-colourable graphs, Bounded maximum degree, Girth |
22 | Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl |
Resource Placement in Networks Using Chromatic Sets of Power Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 158-167, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Symmetric graphs, Power graphs, Interconnection networks, Chromatic number, Resource placement |
22 | Harold N. Gabow |
Using expander graphs to find vertex connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 800-844, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
graphs, Expander graphs, vertex connectivity |
22 | Daniel Gonçalves 0001 |
Edge partition of planar sraphs into two outerplanar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 504-512, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
edge partition, planar graphs, outerplanar graphs |
22 | Peter Kuchment, Leonid A. Kunyansky |
Differential Operators on Graphs and Photonic Crystals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 16(2-3), pp. 263-290, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
photonic bandgap, photonic crystal, Dirichlet-to-Neumann map, differential operators on graphs, pseudo-differential operators on graphs, spectrum |
22 | Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo |
A Technique for Drawing Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 19(3), pp. 214-230, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
four-pass algorithm, optimal rank assignment, network simplex algorithm, vertex order, iterative heuristic, novel weight function, local transpositions, optimal coordinates, auxiliary graph, computer graphics, optimisation, directed graphs, directed graphs, splines, splines (mathematics) |
22 | Edward A. Lee |
Consistency in Dataflow Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 2(2), pp. 223-235, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
synchronous dataflow graphs, dataflow graphsemantics, token-flow model, graphtheory, programming languages, deadlock, programming theory, consistency checks, dataflow graphs, dataflow graph |
22 | Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau |
Algorithms for Constructing Minimal Deduction Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(6), pp. 760-770, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF |
22 | Jai Prakash Gupta, Stephen C. Winter, Derek R. Wilson |
CTDNet-A Mechanism for the Concurrent Execution of Lambda Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(11), pp. 1357-1367, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
CTDNet, lambda graphs, data-driven reduction machine, applicative functional programs, lambda calculus expressions, binary-tree-structured process graphs, ancestor, master processes, slave processes, distributed eager evaluation scheme, conditional expressions, distributed string reduction, parallel programmingas, graph theory, children, parallel machines, pointers, concurrent execution, neighbors |
22 | Ian M. Wanless |
Cycle Switches in Latin Squares. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 20(4), pp. 545-570, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Sait Dogru, James R. Slagle |
A System that Translates Conceptual Structures into English. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Workshop on Conceptual Graphs ![In: Conceptual Structures: Theory and Implementation, 7th Annual Workshop, Las Cruces, NM, USA, July 8-10, 1992, Proceedings, pp. 283-292, 1992, Springer, 3-540-57454-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
22 | Ashkan Aazami, Michael D. Stilp |
Approximation Algorithms and Hardness for Domination with Propagation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings, pp. 1-15, 2007, Springer, 978-3-540-74207-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Power Dominating Set, Approximation Algorithms, Integer Programming, Planar Graphs, Greedy Algorithms, Dominating Set, Hardness of Approximation, PTAS |
22 | Omer Reingold, Luca Trevisan, Salil P. Vadhan |
Pseudorandom walks on regular digraphs and the RL vs. L problem. ![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. 457-466, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation |
22 | Heath A. James, Kenneth A. Hawick |
Data Futures in DISCWorld. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCN ![In: High-Performance Computing and Networking, 8th International Conference, HPCN Europe 2000, Amsterdam, The Netherlands, May 8-10, 2000, Proceedings, pp. 41-50, 2000, Springer, 3-540-67553-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
data futures, Java, metacomputing, task graphs |
22 | Ada Wai-Chee Fu, Siu-Cheung Chau |
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(12), pp. 1253-1268, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
generalized hypercube, fixed degree, interconnection, Cayley graphs |
22 | Bruno T. Messmer, Horst Bunke |
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(5), pp. 493-504, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
error-correcting graph matching, search, Graphs, graph algorithms, graph matching, graph decomposition, subgraph isomorphism |
22 | Gail C. Murphy, David Notkin, Erica S.-C. Lan |
An Empirical Study of Static Call Graph Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 18th International Conference on Software Engineering, Berlin, Germany, March 25-29, 1996, Proceedings., pp. 90-99, 1996, IEEE Computer Society, 0-8186-7246-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
C call graphs, CIA, cflow, extraction tools, gee, mapmaker, mk-functmap, rigiparse, static call graph extractors, understanding task, optimization, software engineers, compilers, graph theory, software tools, program understanding, program compilers, mosaic, software systems, program diagnostics, quantitative analysis, qualitative analysis, Field, software engineering tools, false negatives |
22 | Walling R. Cyre, S. Balachandar 0002, Aniruddha R. Thakar |
Knowledge Visualization from Conceptual Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Current Practices, Second International Conference on Conceptual Structures, ICCS '94, College Park, Maryland, USA, August 16-20, 1994, Proceedings, pp. 275-292, 1994, Springer, 3-540-58328-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
Representation Mapping, Schematic Diagrams, Visualization, Conceptual Graphs, Pictures |
22 | Bengt Nordström |
Programming with abstract data types, some examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Annual Conference (2) ![In: Proceedings 1978 ACM Annual Conference, Washington, DC, USA, December 4-6, 1978, Volume II, pp. 646-654, 1978, ACM, 978-0-89791-000-2. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
Graphs, Mappings, Pascal, Pascal, Pointers |
21 | Claude Boksenbaum, Boris Carbonneill, Ollivier Haemmerlé, Thérèse Libourel |
Conceptual Graphs for Relational Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Graphs for Knowledge Representation, ICCS '93, Quebec City, Canada, August 4-7, 1993, Proceedings, pp. 142-161, 1993, Springer, 3-540-56979-0. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
Database, Conceptual graphs |
21 | Yiming Zhang 0003, Xicheng Lu, Dongsheng Li 0001 |
SKY: efficient peer-to-peer networks based on distributed Kautz graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Ser. F Inf. Sci. ![In: Sci. China Ser. F Inf. Sci. 52(4), pp. 588-601, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constant degree, D-Kautz graph, peer-to-peer network, topology maintenance, Kautz graph |
21 | Sylvain Coulonges, Arnaud Pêcher, Annegret Wagler |
Characterizing and bounding the imperfection ratio for some classes of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 118(1), pp. 37-46, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57 (90C27) |
21 | Konstantinos Panagiotou, Angelika Steger |
Maximal biconnected subgraphs of random planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 432-440, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Sanjeev Arora, David Steurer, Avi Wigderson |
Towards a Study of Low-Complexity 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. 119-131, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Kaspar Riesen, Horst Bunke |
Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MLDM ![In: Machine Learning and Data Mining in Pattern Recognition, 6th International Conference, MLDM 2009, Leipzig, Germany, July 23-25, 2009. Proceedings, pp. 617-631, 2009, Springer, 978-3-642-03069-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Feodor F. Dragan, Yang Xiang |
How to Use Spanning Trees to Navigate in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 282-294, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Zdenek Dvorák 0001, Daniel Král |
Algorithms for Classes of Graphs with Bounded Expansion. ![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. 17-32, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Thomas Raimbault, David Genest, Stéphane Loiseau |
Conceptual Graphs and Datatypes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCS ![In: Conceptual Structures: Leveraging Semantic Technologies, 17th International Conference on Conceptual Structures, ICCS 2009, Moscow, Russia, July 26-31, 2009. Proceedings, pp. 270-283, 2009, Springer, 978-3-642-03078-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Yueping Li, Zhe Nie |
A Note on n-Critical Bipartite Graphs and Its Application. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 279-286, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
n-critical graph, Matching, assignment |
21 | Venkatesh Raman 0001, Saket Saurabh 0001 |
Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 203-225, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
21 | Tamás Horváth 0001, Jan Ramon |
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECML/PKDD (1) ![In: Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I, pp. 520-535, 2008, Springer, 978-3-540-87478-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Leman Akoglu, Mary McGlohon, Christos Faloutsos |
RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Proceedings of the 8th IEEE International Conference on Data Mining (ICDM 2008), December 15-19, 2008, Pisa, Italy, pp. 701-706, 2008, IEEE Computer Society, 978-0-7695-3502-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Simon Schenk, Steffen Staab |
Networked graphs: a declarative mechanism for SPARQL rules, SPARQL views and RDF data integration on the web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 17th International Conference on World Wide Web, WWW 2008, Beijing, China, April 21-25, 2008, pp. 585-594, 2008, ACM, 978-1-60558-085-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
distributed rules, semantic web, rules, views, SPARQL, well founded semantics |
21 | Christian Bachmaier, Wolfgang Brunner |
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings, pp. 136-147, 2008, Springer, 978-3-540-87743-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach |
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 290-298, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Anna Galluccio, Claudio Gentile, Paolo Ventura |
On the Stable Set Polytope of Claw-Free 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. 339-350, 2008, Springer, 978-3-540-85096-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 76671 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|