Search results for "vertex"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
66	Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan	An Improved Approximation Algorithm for Vertex Cover with Hard Capacities.	ICALP	2003	DBLP DOI BibTeX RDF	capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding
64	Jean Cardinal, Eythan Levy	Connected Vertex Covers in Dense Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF	connected vertex cover, dense graph, approximation algorithm, vertex cover
63	Holger Dell, Dieter van Melkebeek	Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses.	STOC	2010	DBLP DOI BibTeX RDF	arithmetic progression free sets, hereditary graph properties, vertex deletion problems, satisfiability, kernelization, vertex cover, parameterized complexity, probabilistically checkable proofs, feedback vertex set, sparsification
62	Haiying Wang	On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Delta (G) = 3.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	The adjacent vertex-distinguishing total coloring, The adjacent vertex-distinguishing total chromatic number, Subdivision vertex, Subdivision graph
61	Claudio Esperança, Hanan Samet	Vertex representations and their applications in computer graphics.	Vis. Comput.	1998	DBLP DOI BibTeX RDF	Orthogonal polygons, Vertex lists, Solid modeling, Shape representation, Constructive solid geometry (CSG)
59	Jiangyan Guo, Elkin Vumar	The Vertex-Neighbor-Integrity of Digraphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF	Vertex-neighbor-integrity, directed vertex-neighbor-integrity, orientation
56	Mirela Damian, Robin Y. Flatland, Joseph O'Rourke	Grid Vertex-Unfolding Orthogonal Polyhedra.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Vertex-unfolding, Grid unfolding, Orthogonal polyhedra, Genus-zero
56	Shyong Jian Shyu, Peng-Yeng Yin, Bertrand M. T. Lin	An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	minimum weight vertex cover, meta-heuristic algorithm, ant colony optimization
56	Eran Halperin, Aravind Srinivasan	Improved Approximation Algorithms for the Partial Vertex Cover Problem.	APPROX	2002	DBLP DOI BibTeX RDF	Partial vertex cover, approximation algorithms, semidefinite programming, randomized rounding
55	Reuven Bar-Yehuda	One for the Price of Two: A Unified Approach for Approximating Covering Problems.	APPROX	1998	DBLP DOI BibTeX RDF	Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
54	Qinglin Yu, Lian-Cui Zuo	Fractional Vertex Arboricity of Graphs.	CJCDGCGT	2005	DBLP DOI BibTeX RDF	vertex arboricity, tree coloring, fractional vertex arboricity, fractional tree coloring
53	Budirijanto Purnomo, Jonathan Bilodeau, Jonathan D. Cohen 0001, Subodh Kumar 0001	Hardware-compatible vertex compression using quantization and simplification.	Graphics Hardware	2005	DBLP DOI BibTeX RDF
53	Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001	Parameterized Complexity of Generalized Vertex Cover Problems.	WADS	2005	DBLP DOI BibTeX RDF
53	Sung-Ho Woo, Sung-Bong Yang	Hierarchical Vertex Ordering.	ICGT	2002	DBLP DOI BibTeX RDF
53	Jing Wu, Guo-Chang Gu	RealTime-BestPoint-Based Compiler Optimization Algorithm.	APWeb Workshops	2006	DBLP DOI BibTeX RDF	Real-time best-point, live-vertex, semilive-vertex, complete semilive-vertex
51	Maytham Safar, Sami Habib	Hard Constrained Vertex-Cover Communication Algorithm for WSN.	EUC	2007	DBLP DOI BibTeX RDF	discrete space, Wireless sensor network, optimization, communication, vertex cover, evolutionary approach
51	Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee	Improved approximation algorithms for minimum-weight vertex separators.	STOC	2005	DBLP DOI BibTeX RDF	vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
49	Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon	On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms.	Algorithmica	2008	DBLP DOI BibTeX RDF	Maximum induced forest, Exact exponential algorithm, Number of minimal feedback vertex sets, Minimum feedback vertex set
49	Rajiv Gupta 0001	Generalized Dominators and Post-Dominators.	POPL	1992	DBLP DOI BibTeX RDF
48	Khaled M. Elbassioni, Hans Raj Tiwary	Complexity of Approximating the Vertex Centroid of a Polyhedron.	ISAAC	2009	DBLP DOI BibTeX RDF
48	Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001	Parameterized Complexity of Vertex Cover Variants.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
46	Julián Mestre	A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Vertex cover, Primal-dual algorithms
46	Zsolt Terék, Tamás Várady	Setback Vertex Blends in Digital Shape Reconstruction.	IMA Conference on the Mathematics of Surfaces	2009	DBLP DOI BibTeX RDF	digital shape reconstruction, vertex blends, setbacks, segmentation, functional decomposition
46	Hans Raj Tiwary, Khaled M. Elbassioni	On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism.	SCG	2008	DBLP DOI BibTeX RDF	vertex enumeration, computational geometry, graph isomorphism, polytopes, isomorphism, self-duality
46	Fabrizio Grandoni 0001, Jochen Könemann, Alessandro Panconesi, Mauro Sozio	Primal-dual based distributed algorithms for vertex cover with semi-hard capacities.	PODC	2005	DBLP DOI BibTeX RDF	approximation algorithms, distributed algorithms, vertex cover, primal-dual algorithms
46	Mohammod Abul Kashem, M. Ziaur Rahman	An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees.	ISAAC	2003	DBLP DOI BibTeX RDF	Ordered coloring, Separator-tree, Vertex-ranking, Parallel algorithm, Tree
46	Eyal Amir, Robert Krauthgamer, Satish Rao	Constant factor approximation of vertex-cuts in planar graphs.	STOC	2003	DBLP DOI BibTeX RDF	balanced cut, planar separator, quotient cut, vertex separator, approximation algorithms, planar graph
46	Muni V. Reddy, Stephen Joe	An average discrepancy for optimal vertex-modified number-theoretic rules.	Adv. Comput. Math.	2000	DBLP DOI BibTeX RDF	average L 2 discrepancy, number-theoretic rules, vertex-modified number-theoretic rules, 65D30
46	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki	Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph.	Algorithmica	2006	DBLP DOI BibTeX RDF	Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm
45	Baogang Bai, Zhongyue Li, Zhigeng Pan	Circular Arc Path Method: A New 2-D Polygon Blending Algorithm.	ICAT Workshops	2006	DBLP DOI BibTeX RDF	2-D shape blending, vertex interpolation path, vertex correspondence, NURBS
45	Reuven Bar-Yehuda	One for the Price of Two: a Unified Approach for Approximating Covering Problems.	Algorithmica	2000	DBLP DOI BibTeX RDF	Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set
45	Heejong Suh, Carl K. Chang	Algorithms for the Minimal Cutsets Enumeration of Networks by Graph Search and Branch Addition.	LCN	2000	DBLP DOI BibTeX RDF	minimal cutsets enumeration, branch addition, graph method, graph tree, sub-vertex set, graph topology, disjoint vertex set, algorithms, computational complexity, reliability, reliability, networks, graph theory, network topology, time complexity, spanning tree, binary tree, graph search
45	Christine Garcia, Claudine Peyrat	Broadcasting in an n-grid with a given neighborhood template.	HICSS (2)	1995	DBLP DOI BibTeX RDF	neighborhood template, originator vertex, shouting scheme, whispering scheme, infinite n-dimensional grid, vertex number, network, graph theory, broadcasting, broadcasting, combinatorics, telecommunication networks, lattice theory, lattice theory
44	Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki	Approximability of Partitioning Graphs with Supply and Demand.	ISAAC	2006	DBLP DOI BibTeX RDF
43	Yuichi Yoshida, Hiro Ito	Property Testing on k-Vertex-Connectivity of Graphs.	ICALP (1)	2008	DBLP DOI BibTeX RDF
43	Ruei-Yuan Chang, Guanling Lee, Sheng-Lung Peng	Minimum Vertex Ranking Spanning Tree Problem on Some Classes of Graphs.	ICIC (2)	2008	DBLP DOI BibTeX RDF
43	Hans L. Bodlaender	A Cubic Kernel for Feedback Vertex Set.	STACS	2007	DBLP DOI BibTeX RDF
43	Maytham Safar, Mohammad Taha, Sami Habib	Modeling the Communication Problem in Wireless Sensor Networks as a Vertex Cover.	AICCSA	2007	DBLP DOI BibTeX RDF
43	Mirela Damian, Robin Y. Flatland, Joseph O'Rourke	Grid Vertex-Unfolding Orthogonal Polyhedra.	STACS	2006	DBLP DOI BibTeX RDF
43	Maxim Teslenko, Elena Dubrova	An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs.	DATE	2005	DBLP DOI BibTeX RDF
43	Julián Mestre	A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
42	Fabrizio Grandoni 0001, Jochen Könemann, Alessandro Panconesi	Distributed weighted vertex cover via maximal matchings.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	Approximation algorithms, distributed algorithms, vertex cover, maximal matching
42	Qizhi Fang, Liang Kong	Core Stability of Vertex Cover Games.	WINE	2007	DBLP DOI BibTeX RDF	Vertex cover game, stable core, largeness, exactness, balanced, extendability
42	Edith Elkind, Leslie Ann Goldberg, Paul W. Goldberg	Frugality ratios and improved truthful mechanisms for vertex cover.	EC	2007	DBLP DOI BibTeX RDF	frugality, auctions, vertex cover
42	Takayuki Kanaya, Yuji Teshima, Ken-ichi Kobori, Koji Nishio	A topology-preserving polygonal simplification using vertex clustering.	GRAPHITE	2005	DBLP DOI BibTeX RDF	level of detail, polygon, simplification, topology-preserving, vertex-clustering
42	Mao-cheng Cai, Xiaotie Deng, Wenan Zang	A Min-Max Theorem on Feedback Vertex Sets.	IPCO	1999	DBLP DOI BibTeX RDF	bipartite tournament, totally dual integrality, min-max relation, AMS subject classification. 68Q25, approximation algorithm, 68R10, feedback vertex set
40	Weifa Liang, Richard P. Brent, Hong Shen	Fully Dynamic Maintenance of k-Connectivity in Parallel.	IEEE Trans. Parallel Distributed Syst.	2001	DBLP DOI BibTeX RDF	2-edge/vertex connectivity, 3-edge/vertex connectivity, parallel algorithm design and analysis, dynamic data structures, graph problems, NC algorithms
39	Loukas Georgiadis	Computing Frequency Dominators and Related Problems.	ISAAC	2008	DBLP DOI BibTeX RDF
39	Hongfeng Xiao, Guanzheng Tan	Two Dimensions Simplex Evolution Algorithm.	CSSE (1)	2008	DBLP DOI BibTeX RDF
39	David Spetzler, Fusheng Xiong, Wayne D. Frasch	Heuristic Solution to a 10-City Asymmetric Traveling Salesman Problem Using Probabilistic DNA Computing.	DNA	2007	DBLP DOI BibTeX RDF	Ligation, Denaturing PAGE, Magnetic affinity, Traveling Salesman Problem, Hybridization, DNA computing
39	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning graphs of supply and demand.	ISCAS (1)	2005	DBLP DOI BibTeX RDF
39	Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos	Probabilistic Coloring of Bipartite and Split Graphs.	ICCSA (4)	2005	DBLP DOI BibTeX RDF
39	Alex Mohr, Luke Tokheim, Michael Gleicher	Direct manipulation of interactive character skins.	SI3D	2003	DBLP DOI BibTeX RDF	direct manipulation, skinning
38	Yves Métivier, John Michael Robson, Nasser Saheb-Djahromi, Akka Zemmari	Brief Annoucement: Analysis of an Optimal Bit Complexity Randomised Distributed Vertex Colouring Algorithm.	OPODIS	2009	DBLP DOI BibTeX RDF
38	Fabio Tardella	Existence and sum decomposition of vertex polyhedral convex envelopes.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Multilinear functions, Edge-concavity, Global optimization, Convex analysis, Convex envelope
38	Wayne J. Pullan	Approximating the maximum vertex/edge weighted clique using local search.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Local search, Maximum weighted clique
38	Il Lang Yi, Yuan-Shin Lee, Hayong Shin	Mitered offset of a mesh using QEM and vertex split.	Symposium on Solid and Physical Modeling	2008	DBLP DOI BibTeX RDF	mesh, offset, quadric error metric
38	Toshimasa Ishii	Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.	ISAAC	2007	DBLP DOI BibTeX RDF
38	Kyusik Chung, Chang-Hyo Yu, Lee-Sup Kim	Vertex cache of programmable geometry processor for mobile multimedia application.	ISCAS	2006	DBLP DOI BibTeX RDF
38	Chiun-Chieh Hsu, Hon-Ren Lin, Hsi-Cheng Chang, Kung-Kuei Lin	Feedback Vertex Sets in Rotator Graphs.	ICCSA (5)	2006	DBLP DOI BibTeX RDF
38	Elena Prieto-Rodriguez, Christian Sloper	Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms - The Case of k-Internal Spanning Tree.	WADS	2003	DBLP DOI BibTeX RDF
38	Ralf Klasing	The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width.	MFCS	1994	DBLP DOI BibTeX RDF
38	Qingzhou Wang, Kam-Hoi Cheng	A Heuristic Algorithm for the k-Center Problem with Vertex Weight.	SIGAL International Symposium on Algorithms	1990	DBLP DOI BibTeX RDF
37	Zhe-Ming Lu, Zhen Li	Dynamically restricted codebook-based vector quantisation scheme for mesh geometry compression.	Signal Image Video Process.	2008	DBLP DOI BibTeX RDF	Vertex data compression, Dynamically restricted codebook, Computer graphics, Vector quantisation
37	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan	Approximation Algorithms for Partial Covering Problems.	ICALP	2001	DBLP DOI BibTeX RDF	Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
37	Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Enumerate and expand, Exact algorithms, Vertex cover, Parameterized complexity
37	Tanmoy Chakraborty 0001, Julia Chuzhoy, Sanjeev Khanna	Network design for vertex connectivity.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, network design, hardness of approximation, vertex connectivity
37	Amos Korman	Labeling Schemes for Vertex Connectivity.	ICALP	2007	DBLP DOI BibTeX RDF	Graph algorithms, labeling schemes, vertex-connectivity
37	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot	Complexity and Approximation Results for the Connected Vertex Cover Problem.	WG	2007	DBLP DOI BibTeX RDF	Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
37	Refael Hassin, Asaf Levin	The minimum generalized vertex cover problem.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	complexity classification, Vertex cover, local-ratio
37	Edith Hemaspaandra, Jörg Rothe, Holger Spakowski	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP.	WG	2002	DBLP DOI BibTeX RDF	minimum vertex cover heuristics, parallel access to NP, Computational complexity, approximation, completeness
37	Mohammod Abul Kashem, Xiao Zhou 0001, Takao Nishizeki	An NC Parallel Algorithm for Generalized Vertex-Rankings of Partial k-Trees.	ISPAN	1997	DBLP DOI BibTeX RDF	Separator tree, Vertex-ranking, Parallel algorithm, Treewidth, Partial k-tree
37	Jason Y. Zien, Martine D. F. Schlag, Pak K. Chan	Multi-level spectral hypergraph partitioning with arbitrary vertex sizes.	ICCAD	1996	DBLP DOI BibTeX RDF	spectral, arbitrary vertex size, clustering, partitioning, contraction, multi-level, generalized eigenvalue problem
35	Richard J. Qian, M. Ibrahim Sezan	Content-Scalable Shape Representation and Coding.	ICIP (2)	1997	DBLP DOI BibTeX RDF	content-scalable shape representation, hierarchical vertex selection algorithm, vertex-based content-scalable contour representation, shape coding, bitmap-based shape coding methods, video coding, video coding
35	Erik D. Demaine, David Eppstein, Jeff Erickson 0001, George W. Hart, Joseph O'Rourke	Vertex-unfoldings of simplicial manifolds.	SCG	2002	DBLP DOI BibTeX RDF	edge-unfolding, facet cycles, facet paths, facet-vertex incidence graph, hinged dissections, manifolds with boundary, ridge-unfolding, simplicial manifolds, triangulated 2-manifolds, vertex-unfolding, unfolding, polyhedra
35	Guy Even, Joseph Naor, Leonid Zosin	An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem.	FOCS	1996	DBLP DOI BibTeX RDF	8-approximation algorithm, subset feedback vertex set problem, minimum weight, special vertices, logarithmic approximation factor, relaxed multi-commodity flow, multi-terminal flow, computational complexity, NP-Complete problems, undirected graph, multi-commodity flow, vertex weights
34	Feodor F. Dragan, Martín Matamala	Navigating in a Graph by Aid of Its Spanning Tree.	ISAAC	2008	DBLP DOI BibTeX RDF
34	Tamás Lukovszki	New Results of Fault Tolerant Geometric Spanners.	WADS	1999	DBLP DOI BibTeX RDF
34	Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza	Ranking of Graphs.	WG	1994	DBLP DOI BibTeX RDF
34	Ivan Stojmenovic	Detecting intersection of two convex polygons in parallel.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
34	Jixing Wang	Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge.	COCOA	2009	DBLP DOI BibTeX RDF	De-chromatic, Critical graph, Dirac conjecture, Composition, Decomposition
34	Sounaka Mishra, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar, C. R. Subramanian 0001	The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number.	ISAAC	2007	DBLP DOI BibTeX RDF
34	Konstantinos Georgiou, Avner Magen, Toniann Pitassi, Iannis Tourlakis	Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy.	FOCS	2007	DBLP DOI BibTeX RDF
34	Tae-Young Kim, Kyoung-Su Oh	Design of a Programmable Vertex Processing Unit for Mobile Platforms.	EUC Workshops	2006	DBLP DOI BibTeX RDF
34	Qibin Hou, Li Bai	Line Feature Detection from 3D Point Clouds via Adaptive CS-RBFs Shape Reconstruction and Multistep Vertex Normal Manipulation.	CGIV	2005	DBLP DOI BibTeX RDF
34	Guofei Hu, Jie Xu 0016, Lanfang Miao, Qunsheng Peng 0001	Bilateral Estimation of Vertex Normal for Point-Sampled Models.	ICCSA (1)	2005	DBLP DOI BibTeX RDF
34	R. Ravi 0001, David P. Williamson	Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.	Algorithmica	2002	DBLP DOI BibTeX RDF
34	Yousef Alavi, Don R. Lick, Jiuqiang Liu	Survey of Double Vertex Graphs.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
34	Sudipto Guha, Refael Hassin, Samir Khuller, Einat Or	Capacitated vertex covering with applications.	SODA	2002	DBLP BibTeX RDF
34	Rolf Niedermeier, Peter Rossmanith	On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER.	ISAAC	2000	DBLP DOI BibTeX RDF
34	David Bremner, Komei Fukuda, Ambros Marzetta	Primal - Dual Methods for Vertex and Facet Enumeration.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
34	Yefim Dinitz, Zeev Nutov	Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5.	CIAC	1997	DBLP DOI BibTeX RDF
33	Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki	Augmenting a (kappa-1)-Vertex-Connected Multigraph to an iota-Edge-Connected and kappa-Vertex-Connected Multigraph.	ESA	1999	DBLP DOI BibTeX RDF
32	Y-Chuang Chen, Meng-Hung Chen, Jimmy J. M. Tan	Maximally Local Connectivity on Augmented Cubes.	ICA3PP	2009	DBLP DOI BibTeX RDF	local connectivity, vertex-disjoint path, augmented cube, fault tolerance, connectivity
32	Dibin Zhou, Kangjian Wang, Lijun Xie, Yao Zheng	Projecting Tetrahedra with a Simplified Basis Graph.	IMSCCS	2007	DBLP DOI BibTeX RDF	four-vertex mapping, volume rendering, unstructured grids, project tetrahedra
32	Ning Li 0014, Jennifer C. Hou	FLSS: a fault-tolerant topology control algorithm for wireless networks.	MobiCom	2004	DBLP DOI BibTeX RDF	k-vertex, fault tolerance, wireless networks, connectivity, topology control, energy management
32	Nan Zhang 0011, Huamin Qu, Wei Hong 0006, Arie E. Kaufman	SHIC: A View-Dependent Rendering Framework for Isosurfaces.	VolVis	2004	DBLP DOI BibTeX RDF	isosurface simpli cation, level-of-detail rendering, vertex clustering
32	Nan Zhang 0011, Wei Hong 0006, Arie E. Kaufman	Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation.	IEEE Visualization	2004	DBLP DOI BibTeX RDF	isosurface simplification, isosurface extraction, topology preservation, vertex clustering
32	James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon	A Parallel FPT Application For Clusters.	CCGRID	2003	DBLP DOI BibTeX RDF	Fixed-Parameter Tractatbility, k-Vertex Cover, Computational Biochemistry
32	Christoph Ambühl, Monaldo Mastrolilli	Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.	Algorithmica	2009	DBLP DOI BibTeX RDF	Scheduling, Algorithms, Vertex cover