Search results for "Graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Thomas Erlebach, Erik Jan van Leeuwen	Domination in Geometric Intersection Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
21	Max A. Alekseyev, Pavel A. Pevzner	Colored de Bruijn Graphs and the Genome Halving Problem.	IEEE ACM Trans. Comput. Biol. Bioinform.	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.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Sample space, Algorithm, Graph, Bipartite graph, Group testing
21	Sergio Cabello, Günter Rote	Obnoxious centers in graphs.	SODA	2007	DBLP BibTeX RDF
21	Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz	Optimization problems in multiple-interval graphs.	SODA	2007	DBLP BibTeX RDF
21	Sitaram Asur, Srinivasan Parthasarathy 0001, Duygu Ucar	An event-based framework for characterizing the evolutionary behavior of interaction graphs.	KDD	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.	MFCS	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.	MFCS	2007	DBLP DOI BibTeX RDF
21	Muhammad Rezaul Karim 0001, Md. Saidur Rahman 0001	Straight-line grid drawings of planar graphs with linear area.	APVIS	2007	DBLP DOI BibTeX RDF
21	Furuzan Atay Onat, Ivan Stojmenovic	Generating Random Graphs for Wireless Actuator Networks.	WOWMOM	2007	DBLP DOI BibTeX RDF
21	J. Joseph Fowler, Stephen G. Kobourov	Characterization of Unlabeled Level Planar Graphs.	GD	2007	DBLP DOI BibTeX RDF
21	Fabrizio Frati, Maurizio Patrignani	A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.	GD	2007	DBLP DOI BibTeX RDF
21	Costas Busch, Ryan LaFortune, Srikanta Tirthapura	Improved sparse covers for graphs excluding a fixed minor.	PODC	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.	STOC	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.	COCOON	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.	COCOON	2007	DBLP DOI BibTeX RDF
21	Mark Huber	Exact Sampling from Perfect Matchings of Dense Regular Bipartite Graphs.	Algorithmica	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.	ICDM Workshops	2006	DBLP DOI BibTeX RDF
21	Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron	Testing triangle-freeness in general graphs.	SODA	2006	DBLP DOI BibTeX RDF
21	Satish Rao, Shuheng Zhou	Edge Disjoint Paths in Moderately Connected Graphs.	ICALP (1)	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.	MFCS	2006	DBLP DOI BibTeX RDF
21	Magnús M. Halldórsson, Ragnar K. Karlsson	Strip Graphs: Recognition and Scheduling.	WG	2006	DBLP DOI BibTeX RDF
21	David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng	Partitioned Probe Comparability Graphs.	WG	2006	DBLP DOI BibTeX RDF
21	Robert Kincaid, Heidi Lam	Line graph explorer: scalable display of line graphs using Focus+Context.	AVI	2006	DBLP DOI BibTeX RDF	Focus+Context, line graph
21	Maxim A. Babenko	Acyclic Bidirected and Skew-Symmetric Graphs: Algorithms and Structure.	CSR	2006	DBLP DOI BibTeX RDF
21	Hajo Broersma, Agostino Capponi, Daniël Paulusma	On-Line Coloring of H-Free Bipartite Graphs.	CIAC	2006	DBLP DOI BibTeX RDF
21	Stefan Felsner, Mareike Massow	Thickness of Bar 1-Visibility Graphs.	GD	2006	DBLP DOI BibTeX RDF
21	Ellis Rowland Watkins, Denis A. Nicole	Named Graphs as a Mechanism for Reasoning About Provenance.	APWeb	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.	SODA	2005	DBLP BibTeX RDF
21	Miroslav Chlebík, Janka Chlebíková	Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes.	SODA	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.	GD	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.	Hypertext	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.	Comb.	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.	Pattern Anal. Appl.	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.	J. Comb. Optim.	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.	Constraint-Based Mining and Inductive Databases	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.	SODA	2004	DBLP BibTeX RDF
21	Anne Berry, Martin Charles Golumbic, Marina Lipshteyn	Two tricks to triangulate chordal probe graphs in polynomial time.	SODA	2004	DBLP BibTeX RDF
21	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman 0001	Approximating Interval Coloring and Max-Coloring in Chordal Graphs.	WEA	2004	DBLP DOI BibTeX RDF
21	Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd	Edge-Disjoint Paths in Planar Graphs.	FOCS	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.	ICALP	2004	DBLP DOI BibTeX RDF
21	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing HHD-free and Welsh-Powell Opposition Graphs.	WG	2004	DBLP DOI BibTeX RDF
21	Fedor V. Fomin, Dimitrios M. Thilikos	A Simple and Fast Approach for Solving Problems on Planar Graphs.	STACS	2004	DBLP DOI BibTeX RDF
21	Mark Korenblit, Vadim E. Levit	On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.	DMTCS	2003	DBLP DOI BibTeX RDF
21	Paul S. Bonsma	The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.	WG	2003	DBLP DOI BibTeX RDF
21	Oded Goldreich 0001, Dana Ron	Property Testing in Bounded Degree Graphs.	Algorithmica	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.	CSFW	2002	DBLP DOI BibTeX RDF
21	Thomas Colcombet	On Families of Graphs Having a Decidable First Order Theory with Reachability.	ICALP	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.	KDD	2002	DBLP DOI BibTeX RDF
21	Julia Klinger	Semiconcept Graphs with Variables.	ICCS	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.	GD	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.	ICSE	2002	DBLP DOI BibTeX RDF
21	Thomas Erlebach, Klaus Jansen, Eike Seidel	Polynomial-time approximation schemes for geometric graphs.	SODA	2001	DBLP BibTeX RDF
21	Daniel Kobler, Udi Rotics	Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).	SODA	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.	WG	2001	DBLP DOI BibTeX RDF
21	Frithjof Dau	Concept Graphs and Predicate Logic.	ICCS	2001	DBLP DOI BibTeX RDF
21	Chin Lung Lu, Sheng-Lung Peng, Chuan Yi Tang	Efficient Minus and Signed Domination in Graphs.	ISAAC	2000	DBLP DOI BibTeX RDF
21	Lali Barrière, Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, John Michael Robson	On Recognizing Cayley Graphs.	ESA	2000	DBLP DOI BibTeX RDF
21	Michael A. Bender, Dana Ron	Testing Acyclicity of Directed Graphs in Sublinear Time.	ICALP	2000	DBLP DOI BibTeX RDF
21	David Harel, Yehuda Koren	A Fast Multi-scale Method for Drawing Large Graphs.	GD	2000	DBLP DOI BibTeX RDF
21	Joan P. Hutchinson	On Polar Visibility Representations of Graphs.	GD	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.	ISAAC	1999	DBLP DOI BibTeX RDF
21	Takahiro Nakanishi, Motoshi Saeki	Using Multiple Graphs of Programs to Modify Specifications.	APSEC	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.	FOCS	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?	CC	1998	DBLP DOI BibTeX RDF
21	Feodor F. Dragan	On Greedy Matching Ordering and Greedy Matchable Graphs (Extended Abstract).	WG	1997	DBLP DOI BibTeX RDF
21	Stephan Brandt	Computing the Independence Number of Dense Triangle-Free Graphs.	WG	1997	DBLP DOI BibTeX RDF
21	Feodor F. Dragan, Falk Nicolai, Andreas Brandstädt	LexBFS-Orderings and Power of Graphs.	WG	1996	DBLP DOI BibTeX RDF
21	Ajit A. Diwan, N. Usharani	A Condition for the Three Colourability of Planar Locally Path Graphs.	FSTTCS	1995	DBLP DOI BibTeX RDF
21	Xiao Zhou 0001, Takao Nishizeki	Edge-Coloring and f-Coloring for Various Classes of Graphs.	ISAAC	1994	DBLP DOI BibTeX RDF
21	Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller	On Vertex Ranking for Permutations and Other Graphs.	STACS	1994	DBLP DOI BibTeX RDF
21	Bikash Chandra Ghosh, Vilas Wuwongse	Conceptual Graphs as a Framework for Deductive Object-Oriented Databases.	CAiSE	1992	DBLP DOI BibTeX RDF
21	Robert Y. Geva, Azaria Paz	Toward a Complete Representation of Graphoids in Graphs (Abridged Version).	WG	1989	DBLP DOI BibTeX RDF
21	David P. Helmbold, Ernst W. Mayr	Applications of Parallel Scheduling to Perfect Graphs.	WG	1986	DBLP DOI BibTeX RDF
21	C. E. Veni Madhavan	Approximation Algorithm for Maximum Independent Set in Planar Tiangle-Free Graphs.	FSTTCS	1984	DBLP DOI BibTeX RDF
21	Matej Stehlík	Minimal Connected tau-Critical Hypergraphs.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	?-critical hypergraphs, Colour-critical graphs, t-stable hypergraphs
21	Appu Muthusamy	On Resolvable Multipartite G-Designs.	Graphs Comb.	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.	SCG	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.	ESCAPE	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.	STOC	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.	IWPEC	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.	VizSEC	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.	DIALM-POMC	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.	IEEE Trans. Computers	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.	ISAAC	2001	DBLP DOI BibTeX RDF	Graphs, Enumeration, Listing, Plane graphs
21	Joseph Naor, Baruch Schieber	Improved Approximations for Shallow-Light Spanning Trees.	FOCS	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.	ICCV	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.	ICSM	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.	ICSM	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.	IEEE Trans. Parallel Distributed Syst.	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.	IEEE Trans. Parallel Distributed Syst.	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.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
20	Adam H. Berliner, Ulrike Bostelmann, Richard A. Brualdi, Louis Deaett	Sum List Coloring Graphs.	Graphs Comb.	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.	Graphs Comb.	2006	DBLP DOI BibTeX RDF
20	Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer	Planar Graphs, via Well-Orderly Maps and Trees.	Graphs Comb.	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.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
20	Liming Xiong, Roman Kuzel	A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.	Graphs Comb.	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.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
20	Anna de Mier, Marc Noy	On Graphs Determined by Their Tutte Polynomials.	Graphs Comb.	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.	Graphs Comb.	2003	DBLP DOI BibTeX RDF