Search results for "Graphs"

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.	Workshop on Conceptual Graphs	1992	DBLP DOI BibTeX RDF
23	Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos	The Longest Path Problem Is Polynomial on Interval Graphs.	MFCS	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.	FGIT	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.	SpringSim	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.	SOFTVIS	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.	WG	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.	STOC	2008	DBLP DOI BibTeX RDF	zig-zag product, expander graphs
23	Alan M. Frieze, Santosh S. Vempala, Juan Vera 0001	Logconcave random graphs.	STOC	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.	LATIN	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.	J. Supercomput.	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.	ACM Trans. Graph.	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.	FAW	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.	STOC	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.	SPAA	2006	DBLP DOI BibTeX RDF	broadcasting, random graphs
23	James F. Lynch	Convergence law for random graphs with specified degree sequence.	ACM Trans. Comput. Log.	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.	Panhellenic Conference on Informatics	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.	Algorithmica	2004	DBLP DOI BibTeX RDF	Sum coloring, Chromatic sum, Bipartite graphs
23	Brijnesh J. Jain, Fritz Wysotzki	Central Clustering of Attributed Graphs.	Mach. Learn.	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.	CIAC	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.	WG	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.	STOC	2002	DBLP DOI BibTeX RDF	threshold phenomena, graph coloring, random graphs
23	Parthasarathi Dasgupta, Susmita Sur-Kolay	Slicible rectangular graphs and their optimal floorplans.	ACM Trans. Design Autom. Electr. Syst.	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.	MFCS	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.	ACM Trans. Program. Lang. Syst.	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.	ICCS	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.	IEEE Trans. Parallel Distributed Syst.	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.	IEEE Trans. Software Eng.	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.	CIDM	2009	DBLP DOI BibTeX RDF
23	Punyashloka Biswal, James R. Lee, Satish Rao	Eigenvalue Bounds, Spectral Partitioning, and Metrical Deformations via Flows.	FOCS	2008	DBLP DOI BibTeX RDF
23	Jure Leskovec, Jon M. Kleinberg, Christos Faloutsos	Graph evolution: Densification and shrinking diameters.	ACM Trans. Knowl. Discov. Data	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.	SODA	2006	DBLP DOI BibTeX RDF	polynomial-time algorithm, independent set
23	Arthur Brady, Lenore Cowen	Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.	DISC	2006	DBLP DOI BibTeX RDF
23	Leah Epstein, Asaf Levin	On Bin Packing with Conflicts.	WAOA	2006	DBLP DOI BibTeX RDF
23	Andy Yoo, Keith W. Henderson	Poster reception - Parallel massive scale-free graph generators.	SC	2006	DBLP DOI BibTeX RDF
23	Hajo Broersma, Fedor V. Fomin, Jaroslav Nesetril, Gerhard J. Woeginger	More About Subcolorings.	Computing	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.	WG	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.	GPCE	2002	DBLP DOI BibTeX RDF
23	Gabriel Valiente	A General Method for Graph Isomorphism.	FCT	2001	DBLP DOI BibTeX RDF
23	Petr Jancar, Faron Moller	Techniques for Decidability and Undecidability of Bisimilarity.	CONCUR	1999	DBLP DOI BibTeX RDF
23	Bharat P. Dave, Niraj K. Jha	COHRA: Hardware-Software Co-Synthesis of Hierarchical Distributed Embedded System Architectures.	VLSI Design	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.	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF
23	Johannes Schneider 0002, Roger Wattenhofer	Coloring unstructured wireless multi-hop networks.	PODC	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.	Algorithmica	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.	ACM Trans. Program. Lang. Syst.	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.	FOCS	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.	FOCS	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.	ISPAN	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	FOCS	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.	Graphs Comb.	2022	DBLP DOI BibTeX RDF
23	Mahdi Reza Khorsandi	Graphs whose line graphs are ring graphs.	AKCE Int. J. Graphs Comb.	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.	AKCE Int. J. Graphs Comb.	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.	Graphs Comb.	2018	DBLP DOI BibTeX RDF
23	Xuding Zhu	Perfect Graphs for Generalized Colouring-Circular Perfect Graphs.	Graphs, Morphisms and Statistical Physics	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.	SODA	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.	Algorithmica	2007	DBLP DOI BibTeX RDF
22	Cyril Gavoille, Arnaud Labourel	Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs.	ESA	2007	DBLP DOI BibTeX RDF
22	Jean-Pierre Aubert, Jean-François Baget, Michel Chein	Simple Conceptual Graphs and Simple Concept Graphs.	ICCS	2006	DBLP DOI BibTeX RDF
22	Cornelia Dangelmayr, Stefan Felsner	Chordal Graphs as Intersection Graphs of Pseudosegments.	GD	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.	Algorithmica	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.	TCC	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.	WG	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.	ICCS	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.	Graphs Comb.	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.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Crossing edges, Topological graphs
22	Hossein Hajiabolhassan, Xuding Zhu	Sparse H-Colourable Graphs of Bounded Maximum Degree.	Graphs Comb.	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.	CSR	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.	J. ACM	2006	DBLP DOI BibTeX RDF	graphs, Expander graphs, vertex connectivity
22	Daniel Gonçalves 0001	Edge partition of planar sraphs into two outerplanar graphs.	STOC	2005	DBLP DOI BibTeX RDF	edge partition, planar graphs, outerplanar graphs
22	Peter Kuchment, Leonid A. Kunyansky	Differential Operators on Graphs and Photonic Crystals.	Adv. Comput. Math.	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.	IEEE Trans. Software Eng.	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.	IEEE Trans. Parallel Distributed Syst.	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.	IEEE Trans. Software Eng.	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.	IEEE Trans. Software Eng.	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.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
22	Sait Dogru, James R. Slagle	A System that Translates Conceptual Structures into English.	Workshop on Conceptual Graphs	1992	DBLP DOI BibTeX RDF
22	Ashkan Aazami, Michael D. Stilp	Approximation Algorithms and Hardness for Domination with Propagation.	APPROX-RANDOM	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.	STOC	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.	HPCN	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.	IEEE Trans. Parallel Distributed Syst.	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.	IEEE Trans. Pattern Anal. Mach. Intell.	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.	ICSE	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.	ICCS	1994	DBLP DOI BibTeX RDF	Representation Mapping, Schematic Diagrams, Visualization, Conceptual Graphs, Pictures
22	Bengt Nordström	Programming with abstract data types, some examples.	ACM Annual Conference (2)	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.	ICCS	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.	Sci. China Ser. F Inf. Sci.	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.	Math. Program.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C57 (90C27)
21	Konstantinos Panagiotou, Angelika Steger	Maximal biconnected subgraphs of random planar graphs.	SODA	2009	DBLP DOI BibTeX RDF
21	Sanjeev Arora, David Steurer, Avi Wigderson	Towards a Study of Low-Complexity Graphs.	ICALP (1)	2009	DBLP DOI BibTeX RDF
21	Kaspar Riesen, Horst Bunke	Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes.	MLDM	2009	DBLP DOI BibTeX RDF
21	Feodor F. Dragan, Yang Xiang	How to Use Spanning Trees to Navigate in Graphs.	MFCS	2009	DBLP DOI BibTeX RDF
21	Zdenek Dvorák 0001, Daniel Král	Algorithms for Classes of Graphs with Bounded Expansion.	WG	2009	DBLP DOI BibTeX RDF
21	Thomas Raimbault, David Genest, Stéphane Loiseau	Conceptual Graphs and Datatypes.	ICCS	2009	DBLP DOI BibTeX RDF
21	Yueping Li, Zhe Nie	A Note on n-Critical Bipartite Graphs and Its Application.	COCOA	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.	Algorithmica	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.	ECML/PKDD (1)	2008	DBLP DOI BibTeX RDF
21	Leman Akoglu, Mary McGlohon, Christos Faloutsos	RTM: Laws and a Recursive Generator for Weighted Time-Evolving Graphs.	ICDM	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.	WWW	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.	ESA	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.	MFCS	2008	DBLP DOI BibTeX RDF
21	Anna Galluccio, Claudio Gentile, Paolo Ventura	On the Stable Set Polytope of Claw-Free Graphs.	COCOA	2008	DBLP DOI BibTeX RDF