Search results for "vertex"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Ioan Alexandru Salomie, Adrian Munteanu 0001, Augustin Gavrilescu, Gauthier Lafruit, Peter Schelkens, Rudi Deklerck, Jan Cornelis 0001	MESHGRID-a compact, multiscalable and animation-friendly surface representation.	IEEE Trans. Circuits Syst. Video Technol.	2004	DBLP DOI BibTeX RDF
15	Artur Czumaj, Hairong Zhao	Fault-Tolerant Geometric Spanners.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
15	Randall Dougherty, Vance Faber, Michael Murphy	Unflippable Tetrahedral Complexes.	Discret. Comput. Geom.	2004	DBLP DOI BibTeX RDF
15	James R. Ezick	Resolving and applying constraint queries on context-sensitive analyses.	PASTE	2004	DBLP DOI BibTeX RDF	static analysis, context-sensitive analysis
15	Dunja Mladenic, Marko Grobelnik	Visualizing Very Large Graphs Using Clustering Neighborhoods.	Local Pattern Detection	2004	DBLP DOI BibTeX RDF
15	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP BibTeX RDF
15	Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan	The list partition problem for graphs.	SODA	2004	DBLP BibTeX RDF
15	Magnús M. Halldórsson, Guy Kortsarz	Multicoloring: Problems and Techniques.	MFCS	2004	DBLP DOI BibTeX RDF
15	Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino	Generating Paths and Cuts in Multi-pole (Di)graphs.	MFCS	2004	DBLP DOI BibTeX RDF
15	Edith Hemaspaandra, Lane A. Hemaspaandra, Stanislaw P. Radziszowski, Rahul Tripathi	Complexity Results in Graph Reconstruction.	MFCS	2004	DBLP DOI BibTeX RDF
15	Sudarshan Banerjee, Nikil D. Dutt	Efficient search space exploration for HW-SW partitioning.	CODES+ISSS	2004	DBLP DOI BibTeX RDF	HW-SW partitioning, dynamic cost function
15	Mikkel Thorup	Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles.	SWAT	2004	DBLP DOI BibTeX RDF
15	Mee Yee Chan, Danny Z. Chen, Francis Y. L. Chin, Cao An Wang	Construction of the Nearest Neighbor Embracing Graph of a Point Set.	SWAT	2004	DBLP DOI BibTeX RDF
15	Klaus Volbert	Experimental analysis of adjustable sectorized topologies for static ad hoc networks: extended abstract.	DIALM-POMC	2004	DBLP DOI BibTeX RDF	algorithms, ad hoc networks, topology control, spanner
15	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Bidimensional Parameters and Local Treewidth.	LATIN	2004	DBLP DOI BibTeX RDF
15	Hayong Shin, Joon C. Park, Byoung Kyu Choi, Yun C. Chung, Siyoul Rhee	Efficient Topology Construction from Triangle Soup.	GMP	2004	DBLP DOI BibTeX RDF
15	L. Sunil Chandran, N. S. Narayanaswamy	On the Arrangement of Cliques in Chordal Graphs with Respect to the Cuts.	COCOON	2004	DBLP DOI BibTeX RDF
15	Venkatesh Raman 0001, Saket Saurabh 0001	Improved Parameterized Algorithms for Feedback Set Problems in Weighted Tournaments.	IWPEC	2004	DBLP DOI BibTeX RDF
15	Satoshi Fujita, Yue Liang	How to Provide Continuous Services by Mobile Servers in Communication Networks.	PDCAT	2004	DBLP DOI BibTeX RDF
15	Torsten Tholey	A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.	ISAAC	2003	DBLP DOI BibTeX RDF
15	Shudong Jin, Azer Bestavros	Small-World Characteristics of the Internet and Multicast Scaling.	MASCOTS	2003	DBLP DOI BibTeX RDF
15	Kohei Muratani, Kokichi Sugihara	Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis.	IMA Conference on the Mathematics of Surfaces	2003	DBLP DOI BibTeX RDF
15	Mauritsius Tuga, Mirka Miller	Delta-Optimum Exclusive Sum Labeling of Certain Graphs with Radius One.	IJCCGGT	2003	DBLP DOI BibTeX RDF
15	Artur Czumaj, Hairong Zhao	Fault-tolerant geometric spanners.	SCG	2003	DBLP DOI BibTeX RDF	fault-tolerant spanners, computational geometry, greedy algorithms, spanners
15	Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner	High Degree Vertices and Eigenvalues in the Preferential Attachment Graph.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
15	Peter Lindstrom 0001	Out-of-core construction and visualization of multiresolution surfaces.	SI3D	2003	DBLP DOI BibTeX RDF	out-of-core algorithms, surface simplification, large-data visualization, view-dependent refinement
15	Janez Zaletelj, Jurij F. Tasic	Optimization and Tracking of Polygon Vertices for Shape Coding.	CAIP	2003	DBLP DOI BibTeX RDF
15	Laura A. Sanchis	Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem.	Algorithmica	2002	DBLP DOI BibTeX RDF	Approximation algorithms, Dominating set, Test cases
15	James Abello, Jeffrey L. Korn	MGV: A System for Visualizing Massive Multidigraphs.	IEEE Trans. Vis. Comput. Graph.	2002	DBLP DOI BibTeX RDF	visualization, graphs, hierarchies, External memory, massive data sets
15	Pierre-Marie Gandoin, Olivier Devillers	Progressive lossless compression of arbitrary simplicial complexes.	ACM Trans. Graph.	2002	DBLP DOI BibTeX RDF	non manifold meshes, interactivity, coding, progressivity, mesh compression
15	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs.	ISAAC	2002	DBLP DOI BibTeX RDF
15	Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita	File Transfer Tree Problems.	ISAAC	2002	DBLP DOI BibTeX RDF
15	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning Trees of Supply and Demand.	ISAAC	2002	DBLP DOI BibTeX RDF	maximum partition problem, supply, algorithm, approximation, tree, demand, partition problem, FPTAS
15	Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella	The freeze-tag problem: how to wake up a swarm of robots.	SODA	2002	DBLP BibTeX RDF
15	Ojas Parekh	Edge dominating and hypomatchable sets.	SODA	2002	DBLP BibTeX RDF
15	Chie Nara, Toshinori Sakai, Jorge Urrutia	Maximal Number of Edges in Geometric Graphs without Convex Polygons.	JCDCG	2002	DBLP DOI BibTeX RDF
15	Dániel Marx	The Complexity of Tree Multicolorings.	MFCS	2002	DBLP DOI BibTeX RDF
15	Jan Kratochvíl, Zsolt Tuza, Margit Voigt	On the b-Chromatic Number of Graphs.	WG	2002	DBLP DOI BibTeX RDF
15	Wen-Tzeng Huang, Woei-kae Chen, Chin-Hsing Chen	On the Fault-Tolerant Pancyclicity of Crossed Cubes.	ICPADS	2002	DBLP DOI BibTeX RDF
15	Martin E. Dyer, Mark Jerrum, Eric Vigoda	Rapidly Mixing Markov Chains for Dismantleable Constraint Graphs.	RANDOM	2002	DBLP DOI BibTeX RDF
15	Shin Yoshizawa 0001, Alexander G. Belyaev, Hans-Peter Seidel	A Simple Approach to Interactive Free-Form Shape Deformations.	PG	2002	DBLP DOI BibTeX RDF	constrained, directional and anisotropic free-form shape deformations
15	Yu-Liang Liu, Yue-Li Wang, D. J. Guan	An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks.	IEEE Trans. Computers	2001	DBLP DOI BibTeX RDF	optimal message routing, fault-tolerant, Double-loop networks
15	Hao Li	A Generalization of the Gallai-Roy Theorem.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
15	Xiao Zhou 0001, Takao Nishizeki	Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs.	ISAAC	2001	DBLP DOI BibTeX RDF
15	Daniel Král, Jan Kratochvíl, Heinz-Jürgen Voss	Complexity Note on Mixed Hypergraphs.	MFCS	2001	DBLP DOI BibTeX RDF
15	Jarek Rossignac	3D Compression Made Simple: Edgebreaker with Zip&Wrap on a Corner-Table.	Shape Modeling International	2001	DBLP DOI BibTeX RDF
15	Yutaka Ohtake, Masahiro Horikawa, Alexander G. Belyaev	Adaptive Smoothing Tangential Direction Fields on Polygonal Surfaces.	PG	2001	DBLP DOI BibTeX RDF	tangential direction fields, tracing streamlines, curvature features, non-photorealistic rendering, adaptive smoothing, polygonal surfaces
15	Volker Kaibel	Reconstructing a Simple Polytope from Its Graph.	Combinatorial Optimization	2001	DBLP DOI BibTeX RDF
15	Hristo N. Djidjev, Imrich Vrto	An Improved Lower Bound for Crossing Numbers.	GD	2001	DBLP DOI BibTeX RDF
15	Cristina G. Fernandes, Till Nierhoff	The UPS Problem.	STACS	2001	DBLP DOI BibTeX RDF
15	Jun-yong Noh, Ulrich Neumann	Expression cloning.	SIGGRAPH	2001	DBLP DOI BibTeX RDF	deformations, neural nets, facial animation, morphing
15	Xiao Zhou 0001, Takao Nishizeki	Finding Independent Spanning Trees in Partial k-Trees.	ISAAC	2000	DBLP DOI BibTeX RDF
15	Yu-Chung Lin, Su-Feng Tseng, Tsai-Ming Hsieh	Cost minimization of partitioned circuits with complex resource constraints in FPGAs (poster abstract).	FPGA	2000	DBLP DOI BibTeX RDF
15	Robert D. Carr, Toshihiro Fujito, Goran Konjevod, Ojas Parekh	A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem.	ESA	2000	DBLP DOI BibTeX RDF
15	Sayaka Nagai, Shin-Ichi Nakano	A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs.	WG	2000	DBLP DOI BibTeX RDF
15	Peter Lindstrom 0001	Out-of-core simplification of large polygonal models.	SIGGRAPH	2000	DBLP DOI BibTeX RDF
15	Toshimasa Ishii, Hiroshi Nagamochi	On the Minimum Augmentation of an l-Connected Graph to a k-Connected Graph.	SWAT	2000	DBLP DOI BibTeX RDF
15	Zhi-Zhong Chen	Approximation Algorithms for Independent Sets in Map Graphs.	COCOON	2000	DBLP DOI BibTeX RDF
15	Lata Narayanan, Jaroslav Opatrny	Compact Routing on Chordal Rings of Degree 4.	Algorithmica	1999	DBLP DOI BibTeX RDF	Compact routing schemes, Boolean routing, Distributed networks, Chordal rings, Interval routing
15	Dong-Gyu Park, Yang-Soo Kim, Hwan-Gue Cho	Triangle Mesh Compression for Fast Rendering.	IV	1999	DBLP DOI BibTeX RDF	Geometry Modeling, Mesh Compression, Realtime Rendering
15	Guangzheng Fei, Enhua Wu	A real-time generation algorithm for progressive meshes in dynamic environments.	VRST	1999	DBLP DOI BibTeX RDF
15	Igor Parfenoff, Florian Roussel, Irena Rusu	Triangulated Neighbourhoods in C4-Free Berge Graphs.	WG	1999	DBLP DOI BibTeX RDF	lexicographic breadth-first search, triangulated graph, perfectness
15	Michel X. Goemans, David P. Williamson	Primal-Dual Approximation Algorithms for Feedback Problems in Planar Graphs.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 90C27, 68Q25, 05C85
15	Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni	Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees.	Algorithmica	1998	DBLP DOI BibTeX RDF	Single-source shortest path, Output complexity, Single-source shortest path, Output complexity, Key words, Dynamic algorithms, Dynamic algorithms, Amortized complexity, Amortized complexity
15	Sudipto Guha, Samir Khuller	Approximation Algorithms for Connected Dominating Sets.	Algorithmica	1998	DBLP DOI BibTeX RDF	Approximation algorithms, Graph algorithms, Steiner trees, Dominating sets
15	H. S. M. Coxeter	Seven Cubes and Ten 24-Cells.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
15	Avner Shapiro, Ayellet Tal	Polyhedron realization for shape transformation.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	Polyhedron realization, Correspondence, Metamorphosis, Shape transformation
15	Hiroshi Nagamochi, Peter Eades	Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs.	IPCO	1998	DBLP DOI BibTeX RDF
15	Kazuyuki Miura, Daishiro Takahashi, Shin-Ichi Nakano, Takao Nishizeki	A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs.	WG	1998	DBLP DOI BibTeX RDF
15	Maurizio Talamo, Paola Vocca	Compact Implicit Representation of Graphs.	WG	1998	DBLP DOI BibTeX RDF
15	Weifa Liang, George Havas	NC Approximation Algorithms for 2-Connectivity Augmentation in a Graph.	Euro-Par	1997	DBLP DOI BibTeX RDF
15	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle	Complexity of Colored Graph Covers I. Colored Directed Multigraphs.	WG	1997	DBLP DOI BibTeX RDF
15	Susanne E. Hambrusch, Hyeong-Seok Lim	Minimizing Broadcast Costs under Edge Reductions in Tree Networks.	ICPADS	1997	DBLP DOI BibTeX RDF
15	Hsiao-Feng Steven Chen, D. T. Lee	A faster algorithm for rubber-band equivalent transformation for planar VLSI layouts.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
15	Michel X. Goemans, David P. Williamson	Primal-Dual Approximation Algorithms for Feedback Problems.	IPCO	1996	DBLP DOI BibTeX RDF
15	Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, Takeshi Tokuyama	Greedily Finding a Dense Subgraph.	SWAT	1996	DBLP DOI BibTeX RDF
15	Monika Rauch Henzinger, Jan Arne Telle	Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.	SWAT	1996	DBLP DOI BibTeX RDF
15	Monika Rauch Henzinger	Approximating Minimum Cuts under Insertions.	ICALP	1995	DBLP DOI BibTeX RDF
15	Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg	Weighted Independent Perfect Domination on Cocomparability Graphs.	ISAAC	1993	DBLP DOI BibTeX RDF	independent perfect domination, cocomparability graph, interval graph
15	Sándor P. Fekete, William R. Pulleyblank	Area Optimization of Simple Polygons.	SCG	1993	DBLP DOI BibTeX RDF
15	Koichi Wada 0001, Kimio Kawaguchi	Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs.	WG	1993	DBLP DOI BibTeX RDF
15	Derek G. Corneil, Stephan Olariu, Lorna Stewart	Asteroidal Triple-Free Graphs.	WG	1993	DBLP DOI BibTeX RDF
15	Stefan Kahrs	Unlimp, Uniqueness as a Leitmotiv for Implementation.	PLILP	1992	DBLP DOI BibTeX RDF
15	Hans L. Bodlaender	Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory.	WG	1992	DBLP DOI BibTeX RDF
15	Ton Kloks, Hans L. Bodlaender	Testing Superperfection of k-Trees.	SWAT	1992	DBLP DOI BibTeX RDF
15	Anindo Bagchi, Edward F. Schmeichel, S. Louis Hakimi	Parallel algorithms for information dissemination by packets.	SPDP	1991	DBLP DOI BibTeX RDF
15	W. T. Liou, Jimmy J. M. Tan, Richard C. T. Lee	Minimum rectangular partition problem for simple rectilinear polygons.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1990	DBLP DOI BibTeX RDF
15	Qingzhou Wang, Kam-Hoi Cheng	Parallel time complexity of a heuristic algorithm for the k-center problem with usage weights.	SPDP	1990	DBLP DOI BibTeX RDF
15	Youn-Sik Hong, Kyu Ho Park, Myunghwan Kim 0001	A heuristic algorithm for ordering the columns in one-dimensional logica arrays.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1989	DBLP DOI BibTeX RDF
15	Garry L. Johns, Tai-Chi Lee	S-Distance in Trees.	Great Lakes Computer Science Conference	1989	DBLP DOI BibTeX RDF
15	Lenwood S. Heath, Arnold L. Rosenberg, Bruce T. Smith	The physical mapping problem for parallel architectures.	J. ACM	1988	DBLP DOI BibTeX RDF
15	Andrew V. Goldberg, Robert Endre Tarjan	A new approach to the maximum-flow problem.	J. ACM	1988	DBLP DOI BibTeX RDF
15	Burkhard Monien, Ivan Hal Sudborough	Min Cut is NP-Complete for Edge Weigthed Trees.	ICALP	1986	DBLP DOI BibTeX RDF
14	Benjamin Doerr, Daniel Johannsen	Edge-based representation beats vertex-based representation in shortest path problems.	GECCO	2010	DBLP DOI BibTeX RDF	evolutionary algorithm, shortest path, runtime analysis
14	Frank Thomson Leighton, Ankur Moitra	Extensions and limits to vertex sparsification.	STOC	2010	DBLP DOI BibTeX RDF	oblivious reductions, multicommodity flow
14	Enrico Malaguti	The Vertex Coloring Problem and its generalizations.	4OR	2009	DBLP DOI BibTeX RDF	MSC classification (2000) 05C15, 05C85
14	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree.	ISAAC	2009	DBLP DOI BibTeX RDF
14	Markus Chimani, Carsten Gutwenger, Petra Mutzel, Christian Wolf 0004	Inserting a vertex into a planar graph.	SODA	2009	DBLP DOI BibTeX RDF
14	Riccardo Dondi, Guillaume Fertin, Stéphane Vialette	Maximum Motif Problem in Vertex-Colored Graphs.	CPM	2009	DBLP DOI BibTeX RDF
14	Carsten Witt	Greedy Local Search and Vertex Cover in Sparse Random Graphs.	TAMC	2009	DBLP DOI BibTeX RDF