Search results for "vertex"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
14	Rudolf Fleischer, Xi Wu 0001, Liwei Yuan	Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem.	ESA	2009	DBLP DOI BibTeX RDF
14	Matti Åstrand, Patrik Floréen, Valentin Polishchuk, Joel Rybicki, Jukka Suomela, Jara Uitto	A Local 2-Approximation Algorithm for the Vertex Cover Problem.	DISC	2009	DBLP DOI BibTeX RDF
14	Samuel Bernard, Stéphane Devismes, Maria Gradinariu Potop-Butucaru, Sébastien Tixeuil	Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks.	IPDPS	2009	DBLP DOI BibTeX RDF
14	Peter Damaschke	Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover.	IWPEC	2009	DBLP DOI BibTeX RDF
14	Barbara Mazbic-Kulma, Krzysztof Sep	Some Approximation Algorithms for Minimum Vertex Cover in a Hypergraph.	Computer Recognition Systems 2	2008	DBLP DOI BibTeX RDF
14	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh 0001	Graph Layout Problems Parameterized by Vertex Cover.	ISAAC	2008	DBLP DOI BibTeX RDF
14	Andreas Wiese, Evangelos Kranakis	Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs.	ADHOC-NOW	2008	DBLP DOI BibTeX RDF
14	Wei Cheng 0001, Kai Xing, Xiuzhen Cheng 0001, Xicheng Lu, Zexin Lu, Jinshu Su, Baosheng Wang, Yujun Liu	Route recovery in vertex-disjoint multipath routing for many-to-one sensor networks.	MobiHoc	2008	DBLP DOI BibTeX RDF	multipath determinability, route recovery, wireless sensor networks, multipath routing
14	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto	Computing the Tutte Polynomial in Vertex-Exponential Time.	FOCS	2008	DBLP DOI BibTeX RDF
14	Guoqiang Bai 0002, Henning Fernau	Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations.	FAW	2008	DBLP DOI BibTeX RDF
14	Pietro De Lellis, Mario di Bernardo, Francesco Garofalo	Vertex-based adaptive synchronization of complex networks.	ISCAS	2008	DBLP DOI BibTeX RDF
14	Xiao Xun, Wang Jiangqing	An Application of Vertex Partition for Parallel Test Tasks Scheduling in Automatic Test System.	CSSE (2)	2008	DBLP DOI BibTeX RDF
14	Lin Yang, Oncel Tuzel, Peter Meer, David J. Foran	Automatic Image Analysis of Histopathology Specimens Using Concave Vertex Graph.	MICCAI (1)	2008	DBLP DOI BibTeX RDF
14	Jittat Fakcharoenphol, Bundit Laekhanukit	An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
14	Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001	Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities.	COCOON	2008	DBLP DOI BibTeX RDF
14	Fulu Li	The expansion rate of Margulis expanders and LPS expanders for vertex set Z × Z.	CISS	2008	DBLP DOI BibTeX RDF
14	Paul Beame, Russell Impagliazzo, Ashish Sabharwal	The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17
14	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT using vertex covers.	Acta Informatica	2007	DBLP DOI BibTeX RDF
14	Ying Zhang 0002, A. Ben Hamza	Vertex-Based Diffusion for 3-D Mesh Denoising.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
14	Victor F. Cavalcante, Cid C. de Souza	Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
14	Martin Marciniszyn, Reto Spöhel	Online vertex colorings of random graphs without monochromatic subgraphs.	SODA	2007	DBLP BibTeX RDF
14	Silvia Richter, Malte Helmert, Charles Gretton	A Stochastic Local Search Approach to Vertex Cover.	KI	2007	DBLP DOI BibTeX RDF
14	Pietro S. Oliveto, Jun He 0004, Xin Yao 0001	Evolutionary algorithms and the Vertex Cover problem.	IEEE Congress on Evolutionary Computation	2007	DBLP DOI BibTeX RDF
14	Michael R. Fellows, Guillaume Fertin, Danny Hermelin, Stéphane Vialette	Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs.	ICALP	2007	DBLP DOI BibTeX RDF
14	Dániel Marx, Ildikó Schlotter	Obtaining a Planar Graph by Vertex Deletion.	WG	2007	DBLP DOI BibTeX RDF
14	Jing-jing Tian, Xin-sheng Liu, Zhongfu Zhang, Fang'an Deng	Upper Bounds on the D(beta)-Vertex-Distinguishing Edge-Chromatic Numbers of Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF
14	Masoud Taghinezhad Omran	Parallel Algorithm to Find Minimum Vertex Guard Set in a Triangulated Irregular Network.	PPAM	2007	DBLP DOI BibTeX RDF	Art Gallery Problem, Guarding Problem, Approximation Algorithms, Parallel Computing, MPI, Graph Partitioning
14	Hamed Hatami, Avner Magen, Evangelos Markakis	Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
14	Faisal N. Abu-Khzam, Nagiza F. Samatova, Mohamad A. Rizk, Michael A. Langston	The Maximum Common Subgraph Problem: Faster Solutions via Vertex Cover.	AICCSA	2007	DBLP DOI BibTeX RDF
14	Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf	Generating Minimal k-Vertex Connected Spanning Subgraphs.	COCOON	2007	DBLP DOI BibTeX RDF
14	Grant Schoenebeck, Luca Trevisan, Madhur Tulsiani	A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover.	CCC	2007	DBLP DOI BibTeX RDF
14	Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. Karmakar	Variable Width Admissible Control Point Band for Vertex Based Operational-Rate-Distortion Optimal Shape Coding Algorithms.	ICIP	2006	DBLP DOI BibTeX RDF
14	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Intuitive Algorithms and t-Vertex Cover.	ISAAC	2006	DBLP DOI BibTeX RDF
14	Moses Charikar, Mohammad Taghi Hajiaghayi, Howard J. Karloff, Satish Rao	l22 spreading metrics for vertex ordering problems.	SODA	2006	DBLP DOI BibTeX RDF
14	Mingji Xia, Wenbo Zhao	#3-Regular Bipartite Planar Vertex Cover is #P-Complete.	TAMC	2006	DBLP DOI BibTeX RDF
14	Christoph Ambühl, Monaldo Mastrolilli	Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem.	ESA	2006	DBLP DOI BibTeX RDF
14	Yantao Pan, Wei Peng 0005, Xicheng Lu	A Vertex-Arc-United Bidirectional Adjustment Algorithm in Lifetime Optimization of Sensor Networks.	ICICIC (1)	2006	DBLP DOI BibTeX RDF
14	Jianer Chen, Iyad A. Kanj, Ge Xia	Improved Parameterized Upper Bounds for Vertex Cover.	MFCS	2006	DBLP DOI BibTeX RDF
14	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
14	Stephen Gilmour, Mark Dras	Kernelization as Heuristic Structure for the Vertex Cover Problem.	ANTS Workshop	2006	DBLP DOI BibTeX RDF
14	Ying Zhang 0002, A. Ben Hamza	Vertex-Based Anisotropic Smoothing of 3D Mesh Data.	CCECE	2006	DBLP DOI BibTeX RDF
14	Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond	The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel.	IWPEC	2006	DBLP DOI BibTeX RDF
14	Ákos Seress	Square-Free Non-Cayley Numbers. On Vertex-Transitive Non-Cayley Graphs of Square-Free Order.	Des. Codes Cryptogr.	2005	DBLP DOI BibTeX RDF
14	László A. Végh, András A. Benczúr	Primal-dual approach for directed vertex connectivity augmentation and generalizations.	SODA	2005	DBLP BibTeX RDF
14	Loukas Georgiadis, Robert Endre Tarjan	Dominator tree verification and vertex-disjoint paths.	SODA	2005	DBLP BibTeX RDF
14	Amit Deshpande 0001, Daniel A. Spielman	Improved Smoothed Analysis of the Shadow Vertex Simplex Method.	FOCS	2005	DBLP DOI BibTeX RDF
14	René Krenz, Elena Dubrova	Improved Boolean function hashing based on multiple-vertex dominators.	ASP-DAC	2005	DBLP DOI BibTeX RDF
14	A. S. Nepomniaschaya	Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex.	PaCT	2005	DBLP DOI BibTeX RDF
14	K. Subramani 0001, Dejan Desovski	On the Empirical Efficiency of the Vertex Contraction Algorithm for Detecting Negative Cost Cyles in Networks.	International Conference on Computational Science (1)	2005	DBLP DOI BibTeX RDF
14	Adam Meissner, Krzysztof Zwierzynski	Vertex-Magic Total Labeling of a Graph by Distributed Constraint Solving in the Mozart System.	PPAM	2005	DBLP DOI BibTeX RDF
14	Jun Feng 0006, Horace Ho-Shing Ip	Iterative 3D Point-Set Registration Based on Hierarchical Vertex Signature (HVS).	MICCAI (2)	2005	DBLP DOI BibTeX RDF
14	Zhihong Mao, Lizhuang Ma, Wuzheng Tan	A Modified Nielson's Side-Vertex Triangular Mesh Interpolation Scheme.	ICCSA (1)	2005	DBLP DOI BibTeX RDF
14	Iannis Tourlakis	Towards Optimal Integrality Gaps for Hypergraph Vertex Cover in the Lovász-Schrijver Hierarchy.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
14	Faisal N. Abu-Khzam, Michael A. Langston, W. Henry Suters	Fast, effective vertex cover kernelization: a tale of two algorithms.	AICCSA	2005	DBLP DOI BibTeX RDF
14	Jan Kára, Jan Kratochvíl, David R. Wood	On the Complexity of the Balanced Vertex Ordering Problem.	COCOON	2005	DBLP DOI BibTeX RDF
14	Haeyoung Lee, Sujin Park	Adaptive Vertex Chasing for the Lossless Geometry Coding of 3D Meshes.	PCM (1)	2005	DBLP DOI BibTeX RDF
14	Bert Randerath, Ingo Schiermeyer	Vertex Colouring and Forbidden Subgraphs - A Survey.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
14	Tetsuji Katahira	Infinite Series of Triangulations on Closed Surfaces with Vertex Covers of Given Degree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
14	Erik J. Hanashiro, Henrique Mongelli, Siang W. Song	Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm.	WEA	2004	DBLP DOI BibTeX RDF
14	Zhiyun Chen, Huiqin Qu, Mingming Lu, Hong Zhu 0004	A Probabilistic Parameterized Algorithm for Vertex Cover in Sticker Model.	IPDPS	2004	DBLP DOI BibTeX RDF
14	Wlodzimierz Bielecki, Rafal Kocisz	A Modified Vertex Method for Parallelization of Arbitrary Nested Loops.	PARELEC	2004	DBLP DOI BibTeX RDF
14	Yoshimasa Takahashi	Chemical data mining based on non-terminal vertex graph.	SMC (5)	2004	DBLP DOI BibTeX RDF
14	Flaminia L. Luccio, Jop F. Sibeyn	Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks.	SIROCCO	2004	DBLP DOI BibTeX RDF
14	Alexey Baburin, Edward Gimadi	Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees.	OR	2004	DBLP DOI BibTeX RDF
14	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
14	Andreas Bley	On the complexity of vertex-disjoint length-restricted path problems.	Comput. Complex.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 68Q25, 90C27, 05C38, 05C40
14	Loïc Barthe, Leif Kobbelt	Direct Computation of a Control Vertex Position on any Subdivision Level.	IMA Conference on the Mathematics of Surfaces	2003	DBLP DOI BibTeX RDF
14	Toshimasa Ishii, Masayuki Hagiwara	Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs.	MFCS	2003	DBLP DOI BibTeX RDF
14	Dieter Kratsch, Haiko Müller, Ioan Todinca	Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.	WG	2003	DBLP DOI BibTeX RDF
14	Alessandro Ferrante, Mimmo Parente	An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality.	ICTCS	2003	DBLP DOI BibTeX RDF
14	Bong-Ju Jang, Kwang-Seok Moon, Young Huh, Ki-Ryong Kwon	A New Digital Watermarking for Architectural Design Drawing Using LINEs and ARCs Based on Vertex.	IWDW	2003	DBLP DOI BibTeX RDF	architectural design drawing, CAD, digital watermarking, copyright protection, geometrical attack
14	Ana Paula Tomás, António Leslie Bajuelos, Fábio Marques	Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains.	International Conference on Computational Science	2003	DBLP DOI BibTeX RDF
14	Mohamed Tadjouddine, Shaun A. Forth, John D. Pryce	Hierarchical Automatic Differentiation by Vertex Elimination and Source Transformation.	ICCSA (2)	2003	DBLP DOI BibTeX RDF
14	Matthias Kriesell	A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity.	Graphs Comb.	2002	DBLP DOI BibTeX RDF
14	Irene Finocchi, Alessandro Panconesi, Riccardo Silvestri	Experimental analysis of simple, distributed vertex coloring algorithms.	SODA	2002	DBLP BibTeX RDF
14	R. Ravi 0001, David P. Williamson	Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems.	SODA	2002	DBLP BibTeX RDF
14	Brian N. Wylie, Kenneth Moreland, Lee Ann Fisk, Patricia Crossno	Tetrahedral projection using vertex shaders.	VolVis	2002	DBLP DOI BibTeX RDF	PC graphics hardware, projection volume rendering, volume scan conversion, direct volume rendering
14	Sandor Kersting, Günther R. Raidl, Ivana Ljubic	A Memetic Algorithm for Vertex-Biconnectivity Augmentation.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
14	Martin Franc, Václav Skala	Fast Algorithm for Triangular Mesh Simplification Based on Vertex Decimation.	International Conference on Computational Science (2)	2002	DBLP DOI BibTeX RDF
14	Ioan Tomescu	On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques.	COCOON	2002	DBLP DOI BibTeX RDF
14	János Pach, Rephael Wenger	Embedding Planar Graphs at Fixed Vertex Locations.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
14	Hiroshi Nagamochi, Toshimasa Ishii	On the Minimum Local-Vertex-Connectivity Augmentation in Graphs.	ISAAC	2001	DBLP DOI BibTeX RDF
14	Pierre Fraigniaud	Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.	ESA	2001	DBLP DOI BibTeX RDF	Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms
14	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.	WADS	2001	DBLP DOI BibTeX RDF
14	Csaba D. Tóth	Illuminating Polygons with Vertex pi-Floodlights.	International Conference on Computational Science (1)	2001	DBLP DOI BibTeX RDF
14	Michael Sampels	Visualization of Automorphisms and Vertex-Symmetry.	PPAM	2001	DBLP DOI BibTeX RDF
14	Dalibor Biolek, Viera Biolková	Optimization of frequency filters via vertex graphs.	ISCAS (1)	2001	DBLP DOI BibTeX RDF
14	L. Sunil Chandran	Edge Connectivity vs Vertex Connectivity in Chordal Graphs.	COCOON	2001	DBLP DOI BibTeX RDF
14	Kam-Fai Chan, Chi-Wah Kok	Mesh Simplification by Vertex Cluster Contraction.	IEEE Pacific Rim Conference on Multimedia	2001	DBLP DOI BibTeX RDF
14	Sergey G. Bobkov, Christian Houdré, Prasad Tetali	lambdainfty Vertex Isoperimetry and Concentration.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 60C05, 68Q01, 05C50, 60E15
14	Hen-Ming Lin, Jing-Yang Jou	On computing the minimum feedback vertex set of a directed graph bycontraction operations.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
14	Kyeong Joong Kim, Jong-Yeul Suh, Moon Gi Kang	Generalized interframe vertex-based shape encoding scheme for video sequences.	IEEE Trans. Image Process.	2000	DBLP DOI BibTeX RDF
14	Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo	Representing Vertex-Based Simplicial Multi-complexes.	Digital and Image Geometry	2000	DBLP DOI BibTeX RDF
14	Tsan-sheng Hsu	Simpler and Faster Vertex-Connectivity Augmentation Algorithms.	ESA	2000	DBLP DOI BibTeX RDF
14	Patrick Healy, Ago Kuusik	The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation.	GD	1999	DBLP DOI BibTeX RDF
14	Longin Jan Latecki, Rolf Lakämper	Polygon Evolution by Vertex Deletion.	Scale-Space	1999	DBLP DOI BibTeX RDF
14	Miuno Toshihiro, Toshimasa Watanabe	Extracting nonplanar connections in a terminal-vertex graph.	ISCAS (6)	1999	DBLP DOI BibTeX RDF
14	Hans-Joachim Böckenhauer	Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode.	WG	1998	DBLP DOI BibTeX RDF
14	János Pach, Rephael Wenger	Embedding Planar Graphs at Fixed Vertex Locations.	GD	1998	DBLP DOI BibTeX RDF
14	Dorit S. Hochbaum	The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints.	APPROX	1998	DBLP DOI BibTeX RDF