Search results for "vertices"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Ondrej Sýkora, Imrich Vrto	Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region.	STACS	1984	DBLP DOI BibTeX RDF
21	Ran Duan, Seth Pettie	Connectivity oracles for failure prone graphs.	STOC	2010	DBLP DOI BibTeX RDF	connectivity
21	Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu	The super spanning connectivity and super spanning laceability of the enhanced hypercubes.	J. Supercomput.	2009	DBLP DOI BibTeX RDF	Folded hypercubes, Enhanced hypercubes, Hamiltonian laceable, Super spanning connected, Super spanning laceable, Hamiltonian connected
21	Sun-Yuan Hsieh, Yu-Fen Weng	Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Pairwise independent Hamiltonian paths, Hypercubes, Hamiltonian, Graph-theoretic interconnection networks, Fault-tolerant embedding
21	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
21	Sanjiv Kapoor, Xiang-Yang Li 0001	Geodesic Spanners on Polyhedral Surfaces.	ISAAC	2009	DBLP DOI BibTeX RDF
21	Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman	An exact almost optimal algorithm for target set selection in social networks.	EC	2009	DBLP DOI BibTeX RDF	bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing
21	Reid Andersen, Yuval Peres	Finding sparse cuts locally using evolving sets.	STOC	2009	DBLP DOI BibTeX RDF	evolving sets, graph partitioning, local algorithms
21	Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan	An Exponential Time 2-Approximation Algorithm for Bandwidth.	IWPEC	2009	DBLP DOI BibTeX RDF
21	Hans Raj Tiwary	On the Hardness of Computing Intersection, Union and Minkowski Sum of Polytopes.	Discret. Comput. Geom.	2008	DBLP DOI BibTeX RDF	Extended convex hull, Polytope intersection, Polytopes, Turing reduction, Minkowski addition
21	Yuta Harada, Hirotaka Ono 0001, Kunihiko Sadakane, Masafumi Yamashita	The Balanced Edge Cover Problem.	ISAAC	2008	DBLP DOI BibTeX RDF
21	Nedialko B. Dimitrov, C. Greg Plaxton	Competitive Weighted Matching in Transversal Matroids.	ICALP (1)	2008	DBLP DOI BibTeX RDF
21	Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini 0001, Charis Papadopoulos, Frances A. Rosamond	Clustering with Partial Information.	MFCS	2008	DBLP DOI BibTeX RDF
21	Menelaos I. Karavelas	Guarding curvilinear art galleries with edge or mobile guards.	Symposium on Solid and Physical Modeling	2008	DBLP DOI BibTeX RDF	2-dominance, curvilinear polygons, diagonal guards, edge guards, mobile guards, piece-wise-convex polygons, triangulation graphs, art gallery
21	Jiong Guo	A More Effective Linear Kernelization for Cluster Editing.	ESCAPE	2007	DBLP DOI BibTeX RDF
21	Hiroshi Nagamochi	Minimum Degree Orderings.	ISAAC	2007	DBLP DOI BibTeX RDF
21	Hovhannes A. Harutyunyan, Xiangyang Xu	New Construction of Broardcast Graphs.	IV	2007	DBLP DOI BibTeX RDF
21	Miroslaw Kowaluk, Andrzej Lingas	Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication.	ESA	2007	DBLP DOI BibTeX RDF
21	Rodrigo I. Silveira, René van Oostrum	Flooding Countries and Destroying Dams.	WADS	2007	DBLP DOI BibTeX RDF
21	Michael Isard, Mihai Budiu, Yuan Yu, Andrew Birrell, Dennis Fetterly	Dryad: distributed data-parallel programs from sequential building blocks.	EuroSys	2007	DBLP DOI BibTeX RDF	concurrency, cluster computing, distributed programming, dataflow
21	Telikepalli Kavitha	Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF
21	Harold N. Gabow	Using expander graphs to find vertex connectivity.	J. ACM	2006	DBLP DOI BibTeX RDF	graphs, Expander graphs, vertex connectivity
21	Christof Löding	Reachability Problems on Regular Ground Tree Rewriting Graphs.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
21	Nicolas Beldiceanu, Irit Katriel, Xavier Lorca	Undirected Forest Constraints.	CPAIOR	2006	DBLP DOI BibTeX RDF
21	Leah Epstein, Asaf Levin, Gerhard J. Woeginger	Graph Coloring with Rejection.	ESA	2006	DBLP DOI BibTeX RDF
21	Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim	Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements.	ISPA Workshops	2006	DBLP DOI BibTeX RDF
21	Amotz Bar-Noy, Panagiotis Cheilaris, Shakhar Smorodinsky	Conflict-free coloring for intervals: from offline to online.	SPAA	2006	DBLP DOI BibTeX RDF	online algorithms, coloring, cellular networks, frequency assignment, conflict free
21	Joseph Naor	From Balanced Graph Partitioning to Balanced Metric Labeling.	ESA	2005	DBLP DOI BibTeX RDF
21	Victor Chepoi, Feodor F. Dragan, Yann Vaxès	Distance-Based Location Update and Routing in Irregular Cellular Networks.	SNPD	2005	DBLP DOI BibTeX RDF
21	Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram	Universal approximations for TSP, Steiner tree, and set cover.	STOC	2005	DBLP DOI BibTeX RDF	sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation
21	Shlomo Moran, Sagi Snir	Efficient Approximation of Convex Recolorings.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
21	Vitaly Surazhsky, Craig Gotsman	High quality compatible triangulations.	Eng. Comput.	2004	DBLP DOI BibTeX RDF	Compatible triangulations, Low discrepancy point sets, Sweep meshes, Morphing, Remeshing
21	Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak	Generalizing Pancyclic and k-Ordered Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
21	Kok-Why Ng, Ya-Ping Wong, Son-Ni Ho	Improvement in Decimation of Triangle Meshes for Level of Detail.	GMAG	2003	DBLP DOI BibTeX RDF
21	Andreas Huck, Eberhard Triesch	Perfect Matchings in Balanced Hypergraphs - A Combinatorial Approach.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C65, 05C70
21	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
21	Rastislav Kralovic	On Majority Voting Games in Trees.	SOFSEM	2001	DBLP DOI BibTeX RDF
21	Shin-Ichi Nakano	Efficient Generation of Triconnected Plane Triangulations.	COCOON	2001	DBLP DOI BibTeX RDF
21	Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender	Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width.	ISAAC	2000	DBLP DOI BibTeX RDF
21	Jirí Fiala 0001, Ton Kloks, Jan Kratochvíl	Fixed-Parameter Complexity of lambda-Labelings.	WG	1999	DBLP DOI BibTeX RDF
21	Chandrajit L. Bajaj, Valerio Pascucci, Guozhong Zhuang	Single Resolution Compression of Arbitrary Triangular Meshes with Properties.	Data Compression Conference	1999	DBLP DOI BibTeX RDF
21	J. C. Lagarias 0001, Nagabhushana Prabhu	Counting d -Step Paths in Extremal Dantzig Figures.	Discret. Comput. Geom.	1998	DBLP DOI BibTeX RDF
21	Mike Burmester, Yvo Desmedt, Yongge Wang	Using Approximation Hardness to Achieve Dependable Computation.	RANDOM	1998	DBLP DOI BibTeX RDF
21	Michal Etzion, Ari Rappoport	On Compatible Star Decompositions of Simple Polygons.	IEEE Trans. Vis. Comput. Graph.	1997	DBLP DOI BibTeX RDF	Star decomposition, minimal star decomposition, compatible decompositions, compatible star decompositions
21	Luitpold Babel, Stephan Olariu	A New Characterization of P4-connected Graphs.	WG	1996	DBLP DOI BibTeX RDF
21	Zvi Galil, Giuseppe F. Italiano	Maintaining Biconnected Components of Dynamic Planar Graphs.	ICALP	1991	DBLP DOI BibTeX RDF
21	Ivan Stojmenovic	Detecting intersection of two convex polygons in parallel.	ACM Conference on Computer Science	1988	DBLP DOI BibTeX RDF
21	David R. Forsey, Richard H. Bartels	Hierarchical B-spline refinement.	SIGGRAPH	1988	DBLP DOI BibTeX RDF	free-form surface editing, refinement, subdivision, splines
21	Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough	Topological Bandwidth.	CAAP	1983	DBLP DOI BibTeX RDF
18	Hichem Barki, Florence Denis, Florent Dupont	A New Algorithm for the Computation of the Minkowski Difference of Convex Polyhedra.	Shape Modeling International	2010	DBLP DOI BibTeX RDF	contributing vertices, Minkowski difference, Nef polyhedra, Minkowski sum
18	Rabie Saidi, Mondher Maddouri, Engelbert Mephu Nguifo	Comparing graph-based representations of protein for mining purposes.	KDD Workshop on Statistical and Relational Learning in Bioinformatics	2009	DBLP DOI BibTeX RDF	bonds, chemical interactions, discriminative feature, edges, preprocessing, vertices, protein structure, graph representation, amino acids
18	Hongmei He, Ondrej Sýkora, Erkki Mäkinen	Genetic algorithms for the 2-page book drawing problem of graphs.	J. Heuristics	2007	DBLP DOI BibTeX RDF	2-page crossing number, Order of vertices, Edge distribution, Optimal values, Genetic algorithms, Hamiltonian cycle
18	Nikola S. Nikolov, Alexandre Tarassov, Jürgen Branke	In search for efficient heuristics for minimum-width graph layering with consideration of dummy nodes.	ACM J. Exp. Algorithmics	2005	DBLP DOI BibTeX RDF	dummy vertices, hierarchical graph drawing, layered graphs, layering, Layer assignment
18	Martin Skutella	Approximating the single source unsplittable min-cost flow problem.	FOCS	2000	DBLP DOI BibTeX RDF	single source unsplittable min-cost flow problem, common source vertex, destination vertices, edge capacities, virtual-circuit routing, hard cost constraints, computational complexity, load balancing, resource allocation, combinatorial optimization, partitioning, optimisation, processor scheduling, NP-complete problems, packing, hardness, bicriteria approximations
18	Ravi Kumar 0001, Prabhakar Raghavan, Sridhar Rajagopalan, D. Sivakumar 0001, Andrew Tomkins, Eli Upfal	Random graph models for the web graph.	FOCS	2000	DBLP DOI BibTeX RDF	static HTML Web page, sparse random graphs, Erdos-Renyi models, statistics, directed graphs, directed graph, stochastic models, stochastic processes, Web graph, vertices, information resources, hyperlink, random processes, random graph model
18	Uriel Feige, Robert Krauthgamer	A polylogarithmic approximation of the minimum bisection.	FOCS	2000	DBLP DOI BibTeX RDF	polylogarithmic approximation, minimum bisection, vertex partitioning, bisection cost, computational complexity, complexity, computational geometry, graph theory, graph, edges, vertices, approximation ratio
18	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
18	Dorit Dor, Shay Halperin, Uri Zwick	All Pairs Almost Shortest Paths.	FOCS	1996	DBLP DOI BibTeX RDF	all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication
18	Yuval Rabani	Path Coloring on the Mesh.	FOCS	1996	DBLP DOI BibTeX RDF	minimum path coloring problem, circuit routing, mesh, vertices, packet routing, graph colouring, randomized rounding, all-optical networks, path coloring
18	Monika Rauch Henzinger, Satish Rao, Harold N. Gabow	Computing Vertex Connectivity: New Bounds from Old Techniques.	FOCS	1996	DBLP DOI BibTeX RDF	smallest number of vertices, preflow push algorithm, computational geometry, deterministic algorithm, digraph, error probability, vertex connectivity
18	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
18	Kazuyuki Amano, Akira Maruoka	Potential of the Approximation Method (extended abstract).	FOCS	1996	DBLP DOI BibTeX RDF	precise versions, bottleneck counting argument, sunflower contraction, lower bounds, Boolean functions, vertices, cliques, approximation method, monotone circuit
18	C. R. Subramanian 0001	Minimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time.	FOCS	1995	DBLP DOI BibTeX RDF	minimum coloring random graphs, semi-random graphs, polynomial expected time, k-coloring, worst-case model, computational complexity, graph theory, vertices, graph colouring
18	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	1995	DBLP DOI BibTeX RDF	divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
18	Nathan Linial, Eran London, Yuri Rabinovich	The geometry of graphs and some of its algorithmic applications	FOCS	1994	DBLP DOI BibTeX RDF	host space, geometry of graphs, algorithmic applications, viewing graphs, vertices, geometric representations
18	David R. Karger, Rajeev Motwani 0001, Madhu Sudan 0001	Approximate Graph Coloring by Semidefinite Programming	FOCS	1994	DBLP DOI BibTeX RDF	approximate graph coloring, k-colorable graphs, randomized polynomial time algorithm, semidefinite optimization problems, MAX 2-SAT problems, duality relationship, lower bounds, linear programs, semidefinite programming, vertices, chromatic number, MAX CUT, approximation ratio
18	Christos H. Papadimitriou, Prabhakar Raghavan, Madhu Sudan 0001, Hisao Tamaki	Motion Planning on a Graph (Extended Abstract)	FOCS	1994	DBLP DOI BibTeX RDF	single movable obstacle, simple abstraction, complexity, mobile robot, motion planning, vertices, undirected graph, vertex, adjacencies
18	David Eppstein	Finding the k Shortest Paths	FOCS	1994	DBLP DOI BibTeX RDF	maximum inscribed polygons, implicit representation, dynamic programming problems, algorithms, sequence alignment, knapsack problem, vertices, digraph, k shortest paths
18	Guy Kortsarz, David Peleg	On Choosing a Dense Subgraph (Extended Abstract)	FOCS	1993	DBLP DOI BibTeX RDF	weighted problem, densest k-vertex subgraph, most edges, edges-to-vertices ratio, unweighted graph problem, maximization problems, approximation algorithms, approximation ratio, dense subgraph
18	Harold N. Gabow	A Framework for Cost-scaling Algorithms for Submodular Flow Problems	FOCS	1993	DBLP DOI BibTeX RDF	cost-scaling algorithms, submodular flow problems, dijoin, edge-connectivity orientation, k-edge-connected orientation, minimum-cost k-edge-connected orientation, integer linear programming, vertices, vertex weights, minimum-cost network flow
18	Edith Cohen	Fast algorithms for constructing t-spanners and paths with stretch t	FOCS	1993	DBLP DOI BibTeX RDF	pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph
18	Boris Aronov, Micha Sharir	The Union of Convex Polyhedra in Three Dimensions	FOCS	1993	DBLP DOI BibTeX RDF	union of convex polyhedra, almost tight, edges, faces, vertices, three dimensions, randomized incremental algorithm
18	Goos Kant	Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract)	FOCS	1992	DBLP DOI BibTeX RDF	visibility representations, lmc-ordering, required area, minimum angle, number of bends, planar drawings, triconnected planar graphs, planar graphs, faces, vertices
18	Gopalakrishnan Vijayan	Generalization of Min-Cut Partitioning to Tree Structures and Its Applications.	IEEE Trans. Computers	1991	DBLP DOI BibTeX RDF	min-cut partitioning, hyperedges, VLSI design applications, iterative improvement heuristic, routing, computational complexity, data structures, trees (mathematics), hypergraph, minimisation, minimisation, tree structures, vertices, cost function, nodes, pins
18	Greg N. Frederickson	Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees	FOCS	1991	DBLP DOI BibTeX RDF	ambivalent data structures, dynamic maintenance, dynamic 2-edge-connectivity, k smallest spanning trees, weighted undirected graph, embedded planar graph, query, edges, vertices
18	Donald B. Johnson 0001, Panagiotis Takis Metaxas	Connected Components in O(\lg^3/2 \|V\|) Parallel Time for the CREW PRAM	FOCS	1991	DBLP DOI BibTeX RDF	CREW processors, parallel time, edges, connected components, vertices, undirected graph, CREW PRAM
18	Tsan-sheng Hsu, Vijaya Ramachandran	A Linear Time Algorithm for Triconnectivity Augmentation (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	triconnectivity augmentation, reliable networks, linear time sequential algorithm, fault-tolerant computing, edges, vertices, undirected graph
18	Rolf Klein	Walking an Unknown Street with Bounded Detour	FOCS	1991	DBLP DOI BibTeX RDF	bounded detour, boundary chains, mutually weakly visible, onboard vision, short path, lower bound, mobile robot, polygon, vertices
18	Arkady Kanevsky, Roberto Tamassia, Giuseppe Di Battista, Jianer Chen	On-Line Maintenance of the Four-Connected Components of a Graph (Extended Abstract)	FOCS	1991	DBLP DOI BibTeX RDF	Ackermann function inverse, four-connected components, k-connectivity query, static data structure, online updates, triconnected graphs, graph, edges, vertices, dynamic data structure, disjoint paths
18	Jörg-Rüdiger Sack, Subhash Suri	An Optimal Algorithm for Detecting Weak Visibility of a Polygon.	IEEE Trans. Computers	1990	DBLP DOI BibTeX RDF	visibility detection, visibility edges, n-vertex polygon, endpoints, convex vertices, weak edge visibility, computational complexity, computational geometry, optimal algorithm
18	Sandy Irani	Coloring Inductive Graphs On-Line	FOCS	1990	DBLP DOI BibTeX RDF	online graph colouring, First Fit algorithm, d-inductive graphs, upper bound, vertices, lookahead
18	Greg N. Frederickson, D. J. Guan	Ensemble Motion Planning in Trees	FOCS	1989	DBLP DOI BibTeX RDF	ensemble motion planning, unit capacity vehicle, minimum cost transportation, nontrivial connected components, initial vertex, route, approximation algorithms, trees, NP-hard, directed graph, objects, edges, vertices, destination, performance ratio
18	Giuseppe Di Battista, Roberto Tamassia	Incremental Planarity Testing (Extended Abstract)	FOCS	1989	DBLP DOI BibTeX RDF	edge insertions, incremental planarity testing, supports tests, vertex insertions, queries, planar graph, edges, vertices, insertion
18	Harold N. Gabow, Ying Xu 0001	Efficient Algorithms for Independent Assignments on Graphic and Linear Matroids	FOCS	1989	DBLP DOI BibTeX RDF	independent assignment, linear matroids, matroid intersection problem, weighted intersection, cardinality algorithm, graphic matroids, trivial matroids, cardinality intersection, largest edge weight, scaling, edges, efficient algorithms, vertices, bipartite graph matching, fast matrix multiplication
18	Nathan Linial, Umesh V. Vazirani	Graph Products and Chromatic Numbers	FOCS	1989	DBLP DOI BibTeX RDF	three-chromatic graph, graph, vertices, chromatic numbers, polynomial-time approximation algorithms
18	Seth M. Malitz	Genus g Graphs have Pagenumber O(sqrt(g))	FOCS	1988	DBLP DOI BibTeX RDF	n-vertex d-regular graphs, pagenumber, book embedding, genus g, pages, edges, vertices, linear ordering, spine
18	Andrei Z. Broder, Anna R. Karlin	Bounds on the Cover Time (Preliminary Version)	FOCS	1988	DBLP DOI BibTeX RDF	regular expander graphs, connected unidirected graph, lower bounds, Markov chain, random walk, upper bounds, eigenvalues, vertices, particle, cover time, neighbors
18	Franco P. Preparata, Roberto Tamassia	Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	insertion/deletion, fully dynamic techniques, planar structures, planar st-graph, transitive-closure queries, monotone subdivisions, chain method, Lee-Preparata, data structure, update, edges, transitive closure, faces, set, vertices, total orders, point location
18	Juan Pineda	A parallel algorithm for polygon rasterization.	SIGGRAPH	1988	DBLP DOI BibTeX RDF	linear edge function, polygon rasterization, sub-pixel vertices, parallel processing
18	Charles C. Pinter	On decomposing a Boolean function and simplfying the components separately.	Commun. ACM	1970	DBLP DOI BibTeX RDF	basic cells, simplifying Boolean functions, minimization, vertices, prime implication
17	Marián Klesc	On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices.	IWOCA	2009	DBLP DOI BibTeX RDF	graph, drawing, crossing number, Cartesian product, star
17	Seok-Hee Hong 0001, Martin Mader	Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints.	GD	2008	DBLP DOI BibTeX RDF
17	Xavier Goaoc, Jan Kratochvíl, Yoshio Okamoto, Chan-Su Shin, Alexander Wolff 0001	Moving Vertices to Make Drawings Plane.	GD	2007	DBLP DOI BibTeX RDF
17	Hazel Everett, Sylvain Lazard, Giuseppe Liotta, Stephen K. Wismath	Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.	GD	2007	DBLP DOI BibTeX RDF
17	Julien Moncel	Constructing codes identifying sets of vertices.	Des. Codes Cryptogr.	2006	DBLP DOI BibTeX RDF	AMS classifications, 94C12, 94B60, 05C99
17	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich	Generating all vertices of a polyhedron is hard.	SODA	2006	DBLP DOI BibTeX RDF	enumeration problem, facet enumeration, feasible system, negative cycle, polytope-polyhedron problem, vertex enumeration, graph, cycle, face, polytope, polyhedron, facet, vertex, linear inequalities
17	Zi-Xia Song, H. P. Yap	Chromatic Index Critical Graphs of Even Order with Five Major Vertices.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
17	Yusuke Hioka, Nozomu Hamada	Speaker direction tracking using microphones located at the vertices of equilateral-triangle.	ISCAS (3)	2005	DBLP DOI BibTeX RDF
17	Chang-Hyo Yu, Donghyun Kim, Lee-Sup Kim	A 33.2M vertices/sec programmable geometry engine for multimedia embedded systems.	ISCAS (5)	2005	DBLP DOI BibTeX RDF
17	Fajie Li, Reinhard Klette	The Class of Simple Cube-Curves Whose MLPs Cannot Have Vertices at Grid Points.	DGCI	2005	DBLP DOI BibTeX RDF