The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for vertices with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1965-1973 (19) 1974-1976 (21) 1977-1980 (22) 1981-1982 (15) 1983-1984 (27) 1985 (24) 1986 (22) 1987 (28) 1988 (44) 1989 (48) 1990 (62) 1991 (43) 1992 (72) 1993 (62) 1994 (87) 1995 (72) 1996 (101) 1997 (96) 1998 (132) 1999 (186) 2000 (201) 2001 (275) 2002 (347) 2003 (343) 2004 (431) 2005 (501) 2006 (562) 2007 (537) 2008 (545) 2009 (434) 2010 (97) 2011 (53) 2012 (68) 2013 (69) 2014 (57) 2015 (59) 2016 (62) 2017 (95) 2018 (86) 2019 (82) 2020 (72) 2021 (63) 2022 (76) 2023 (68) 2024 (14)
Publication types (Num. hits)
article(2473) incollection(15) inproceedings(3889) phdthesis(3)
Venues (Conferences, Journals, ...)
ISAAC(195) Discret. Math.(194) WG(190) SODA(170) Graphs Comb.(165) Discret. Comput. Geom.(159) CoRR(151) GD(140) SCG(132) COCOON(110) Comb.(103) ESA(101) Algorithmica(100) ICALP(94) FOCS(85) STOC(79) More (+10 of total 1020)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4662 occurrences of 2053 keywords

Results
Found 6380 publication records. Showing 6380 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
49Naveen Garg 0001 A 3-Approximation for the Minimum Tree Spanning k Vertices. Search on Bibsonomy FOCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF minimum tree, 3-approximation, k-vertices, minimum tour, spanning k vertices, graph, trees (mathematics)
48David W. Paglieroni, Gary E. Ford, Eric M. Tsujimoto The Position-Orientation Masking Approach to Parametric Search for Template Matching. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF position-orientation masking, edge segments matching, template vertices, image vertices, binary decomposition, quadrant decomposition, edge detection, transforms, correlations, search problems, template matching, distance transforms, correlation methods, parametric search
44Franck Xia Invariant property of contour: VPIUD with arbitrary neighborhood. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF VPIUD, neighbourhood, virtual perimeter increment under dilation, contour VPIUD, contour propagation model, secondary waves, convex vertices, concave vertices, 8-neighborhood, 6-neighborhood, total curvature, hole contours, outer contours, contour classification, edge detection, optical character recognition, images, image classification, Chinese characters, invariant property
44David Coudert, Frédéric Giroire, Ignasi Sau Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. Search on Bibsonomy IWOCA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF edge-simple circuit, prescribed vertices, ILP solver, square grid
43Anand Bhalgat, Ramesh Hariharan Fast edge orientation for unweighted graphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
39Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia Mix and match. Search on Bibsonomy EC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximate mechanism design without money, kidney exchange
39Chinmoy Dutta, Jaikumar Radhakrishnan Tradeoffs in Depth-Two Superconcentrators. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39Xin Yao 0003, Changshui Zhang, Jinwen Chen, Yanda Li On the Scale-Free Intersection Graphs. Search on Bibsonomy ICCSA (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Esther Ezra, János Pach, Micha Sharir On Regular Vertices of the Union of Planar Convex Objects. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes
35Shmuel Onn, Uriel G. Rothblum The use of edge-directions and linear programming to enumerate vertices. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Edge-directions, Linear programming, Vertices, Polytopes
35Esther Ezra, János Pach, Micha Sharir On regular vertices on the union of planar objects. Search on Bibsonomy SCG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF (1/r)-cuttings, regular vertices, union of geometric objects
34Anvesh Komuravelli, Matús Mihalák Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. Search on Bibsonomy SSS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
34Klim Efremenko, Omer Reingold How Well Do Random Walks Parallelize?. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Markov Chains, Random Walks
34Reuven Bar-Yehuda, Craig Gotsman Time/Space Tradeoffs for Polygon Mesh Rendering. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF rendering, polygons, graphics pipeline
31Efim D. Gluskin, Alexander E. Litvak Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index
30Wei Ding 0006, Guoliang Xue A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Most reliable source, Transmitting probability, Receiving probability
30Zvi Lotker, Alfredo Navarra Unbalanced Points and Vertices Problem. Search on Bibsonomy PerCom Workshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Robert Haas 0001, Michael Hoffmann 0001 Chordless Paths Through Three Vertices. Search on Bibsonomy IWPEC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Debashis Bera, Madhumangal Pal, Tapan Kumar Pal An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Satoshi Taoka, Toshimasa Watanabe Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. Search on Bibsonomy ISAAC The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
30Konstantinos Panagiotou, Angelika Steger Maximal biconnected subgraphs of random planar graphs. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
30Mohammad Tanvir Parvez, Md. Saidur Rahman 0001, Shin-Ichi Nakano Generating All Triangulations of Plane Graphs (Extended Abstract). Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Genealogical Tree, Graph, Triangulation, Polygon, Plane Graph
30Stavros D. Nikolopoulos, Leonidas Palios Detecting Holes and Antiholes in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng Local Computation of PageRank Contributions. Search on Bibsonomy WAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Puneet Maheshwari, Parag Agarwal, Balakrishnan Prabhakaran 0001 Progressive compression invariant semi-fragile watermarks for 3d meshes. Search on Bibsonomy MM&Sec The full citation details ... 2007 DBLP  DOI  BibTeX  RDF authentication, compression, watermarking
30Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov Approximation Algorithms for the Black and White Traveling Salesman Problem. Search on Bibsonomy COCOON The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Steve Hanneke An analysis of graph cut size for transductive learning. Search on Bibsonomy ICML The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Purvi Saraiya, Peter Lee 0005, Chris North 0001 Visualization of Graphs with Associated Timeseries Data. Search on Bibsonomy INFOVIS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF data overlay, timeseries data analysis, usability experiments, Graph visualization
30Alexander Gribov, Eugene Bodansky A New Method of Polyline Approximation. Search on Bibsonomy SSPR/SPR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF polylinecompression, polyline approximation, vectorization, shape analysis
30Colin Cooper Classifying Special Interest Groups in Web Graphs. Search on Bibsonomy RANDOM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
30David Peleg Informative Labeling Schemes for Graphs. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Ton Kloks, Hans L. Bodlaender Testing Superperfection of k-Trees. Search on Bibsonomy SWAT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
26Martin C. Cooper Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes. Search on Bibsonomy Int. J. Comput. Vis. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF line drawing labelling, non-trihedral vertices, valued constraint satisfaction problem, soft constraints, polyhedral objects, parallel lines
26Enrico De Micheli, Bruno Caprile, P. Ottonello, Vincent Torre Localization and Noise in Edge Detection. Search on Bibsonomy IEEE Trans. Pattern Anal. Mach. Intell. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF trihedral vertices, gradient schemes, zero-crossing schemes, localization, edge detection, filters, noise, computerised picture processing, computerised picture processing, computerised pattern recognition, computerised pattern recognition, sensitivity, digital images
26Oleg V. Borodin, Anna O. Ivanova 3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. Search on Bibsonomy Discret. Math. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
26Shuji Kijima, Nobutaka Shimizu, Takeharu Shiraga How Many Vertices Does a Random Walk Miss in a Network with Moderately Increasing the Number of Vertices? Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
26Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. Search on Bibsonomy Discuss. Math. Graph Theory The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
26Cristina Maier, Dan A. Simovici Betweenness Centrality of Sets of Vertices in Graphs: which Vertices to Associate. Search on Bibsonomy ICISDM The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
26Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. Search on Bibsonomy Discret. Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
26Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11. Search on Bibsonomy Discuss. Math. Graph Theory The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
26Shuya Chiba, Shinya Fujita 0001 Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. Search on Bibsonomy Discret. Math. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
26Xinying Pai, Sanyang Liu On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices. Search on Bibsonomy J. Appl. Math. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
26Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
26Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Hans Raj Tiwary Characterization of the vertices and extreme directions of the negative cycle polyhedron and harness of generating vertices of $0/1$-polyhedra Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
26Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. Search on Bibsonomy CATS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Shinsei Tazawa, Teruhiro Shirakura, Saburo Tamura Enumeration of digraphs with given number of vertices of odd out-degree and vertices of odd in-degree. Search on Bibsonomy Discret. Math. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
26Hans-Dietrich O. F. Gronau Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices I. Search on Bibsonomy Discret. Math. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
26Hans Georg Carstens, Arian Kruse Graphs in which each m-tuple of vertices is adjacent to the same number n of other vertices. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 1977 DBLP  DOI  BibTeX  RDF
26Hugo Gimbert, Florian Horn 0001 Simple Stochastic Games with Few Random Vertices Are Easy to Solve. Search on Bibsonomy FoSSaCS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Sy-Yen Kuo, Fu-Min Yeh, Hung-Yau Lin Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices. Search on Bibsonomy IEEE Trans. Reliab. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary On Computing the Centroid of the Vertices of an Arrangement and Related Problems. Search on Bibsonomy WADS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes From Balls and Bins to Points and Vertices. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. Search on Bibsonomy ISCAS (1) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
26Jesús A. De Loera, Tyrrell B. McAllister Vertices of Gelfand-Tsetlin Polytopes. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. Search on Bibsonomy RANDOM-APPROX The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph. Search on Bibsonomy ISCAS (3) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Graham M. Seed, Douglas E. R. Clark, Raffaella Ocone, Xiaoyan Y. Yang Four Colouring the Vertices of the Triangulation of a Polygon Containing a Hole. Search on Bibsonomy ICCSA (3) The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
26Toshinori Sakai Long Paths through Specified Vertices in 3-Connected Graphs. Search on Bibsonomy JCDCG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26T. Ozawa Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries. Search on Bibsonomy ISCAS (5) The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26N. S. Narayanaswamy, C. E. Veni Madhavan On Assigning Prefix Free Codes to the Vertices of a Graph. Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Andreas Spillner 0001, Alexander Wolff 0001 Untangling a Planar Graph. Search on Bibsonomy SOFSEM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Andrzej Lingas, Martin Wahlen On Exact Complexity of Subgraph Homeomorphism. Search on Bibsonomy TAMC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee Two Variations of the Minimum Steiner Problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time
26Shyh-Kuang Ueng, Yan-Jen Su, Chi-Tang Chang LoD Volume Rendering of FEA Data. Search on Bibsonomy IEEE Visualization The full citation details ... 2004 DBLP  DOI  BibTeX  RDF splatting method, Volume rendering, level-of-detail, scientific visualization, unstructured data
26John Burns 0001, Heather J. Ruskin Network Topology in Immune System Shape Space. Search on Bibsonomy International Conference on Computational Science The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
26Ediz Saykol, Gürcan Gülesir, Ugur Güdükbay, Özgür Ulusoy KiMPA: A Kinematics-Based Method for Polygon Approximation. Search on Bibsonomy ADVIS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
26Eran Halperin, Uri Zwick A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Zhangjian Li, Shin-Ichi Nakano Efficient Generation of Plane Triangulations without Repetitions. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
26Claudio Esperança, Hanan Samet Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies. Search on Bibsonomy SSD The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
22Marc Alexa, Tamy Boubekeur Subdivision shading. Search on Bibsonomy ACM Trans. Graph. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF irregular vertices, subdivision, shading, visual quality
22Ali Mohammad-Djafari, Yassine Khayi, Ken D. Sauer, Eric Cano Reconstruction of the Shape of a Compact Object from Few Projections. Search on Bibsonomy ICIP (1) The full citation details ... 1997 DBLP  DOI  BibTeX  RDF compact object, limited tomographic projection data, NDT, air hole, homogeneous region, metal, industrial techniques, default region shape, tomographic reconstruction, global optimization method, pixel representation, 2D representation, contour modelling, local descent-based method, moment based method, Bayesian MAP estimation, localization, coordinates, simulated annealing, image reconstruction, detection, polygon, industrial applications, characterization, vertices, surface modelling, inclusion, polyhedron, shape reconstruction, computational cost, 3D representation, voxel representation, nondestructive testing
22Ron Shamir, Dekel Tsur Faster subtree isomorphism. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem
22Christian Capelle, Michel Habib Graph decompositions and factorizing permutations. Search on Bibsonomy ISTCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree
22Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees. Search on Bibsonomy IPPS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM
22Panos A. Patsouris Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases. Search on Bibsonomy ICPADS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF two-level-hierarchies of objects, unit of reference, distributed object-oriented databases, partial directed acyclic graphs, vertices objects, Uni-Design, distribution design strategy, distributed databases, aggregation, object-oriented databases, directed graphs, grouping, association, equivalence relation
22Philippe Clauss, Vincent Loechner Parametric Analysis of Polyhedral Iteration Spaces. Search on Bibsonomy ASAP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF parametric vertices, parametric counting, Ehrhart polynomials, automatic parallelization, nested loops, convex polyhedra
22Gabriel Taubin Curve and Surface Smoothing without Shrinkage. Search on Bibsonomy ICCV The full citation details ... 1995 DBLP  DOI  BibTeX  RDF piecewise-linear techniques, curve smoothing, scientific data visualization, multimodal medical data registration, polygonal curves, boundary-following algorithms, iso-surface construction algorithms, piecewise linear shapes, linear low-pass filter, high curvature variations, required storage, computer vision, computational complexity, computational complexity, approximation algorithms, computational geometry, topology, image registration, medical image processing, data visualisation, curve fitting, edges, faces, vertices, smoothing methods, faceting, shrinkage, polyhedral surfaces, surface smoothing
22John R. Gilbert, Gary L. Miller, Shang-Hua Teng Geometric mesh partitioning: implementation and experiments. Search on Bibsonomy IPPS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF geometric mesh partitioning, equal-sized pieces, geometric coordinates, mesh vertices, Matlab code, spectral bisection, computational geometry, mesh generation, finite element analysis, irregular mesh, finite element meshes
22Hongwei Wang A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices. Search on Bibsonomy COCOA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich Generating All Vertices of a Polyhedron Is Hard. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
22William Duckworth, Michele Zito 0001 Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. Search on Bibsonomy MFCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Bill Jackson, Tibor Jordán, Zoltan Szabadka Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Xiaomei Liu, Li Xiao 0001, Andrew Kreling, Yunhao Liu 0001 Optimizing overlay topology by reducing cut vertices. Search on Bibsonomy NOSSDAV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Search on Bibsonomy Graphs Comb. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF AMS Subject Classification, 05C40
22Michael A. Henning, Michael D. Plummer Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF paired-domination number, tree
22Xiangyu Yu, Hong Sun Automatic Image Registration via Clustering and Convex Hull Vertices Matching. Search on Bibsonomy ADMA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
22António Leslie Bajuelos, Ana Paula Tomás, Fábio Marques Partitioning Orthogonal Polygons by Extension of All Edges Incident to Reflex Vertices: Lower and Upper Bounds on the Number of Pieces. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
22P. A. C. Varley, Hiromasa Suzuki, Ralph R. Martin Interpreting Line Drawings of Objects with K-Vertices. Search on Bibsonomy GMP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
22Dimitrios Katsoulas Robust Extraction of Vertices in Range Images by Constraining the Hough Transform. Search on Bibsonomy IbPRIA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. Search on Bibsonomy DMTCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Gill Barequet, Michael T. Goodrich, Chris Riley Drawing Graphs with Large Vertices and Thick Edges. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
22Matthias Kriesell Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro Spanning Trees with Bounded Number of Branch Vertices. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22Yvo Desmedt, Yongge Wang Maximum Flows and Critical Vertices in AND/OR Graphs. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22Gregory Z. Gutin, Anders Yeo Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Deok-Soo Kim, Jaeyeol Chung, Youngsong Cho, Taeboom Jang, Hyun Kim Geometry Compression Based on Mantissa Chunking of Vertices. Search on Bibsonomy IV The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
22Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn On the Identification of Vertices and Edges Using Cycles. Search on Bibsonomy AAECC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF binary hypercube, Lee metric, graph, multiprocessor system, Identification, cycle, Hamming distance
22Mekkia Kouider Neighborhoods and Covering Vertices by Cycles. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70
22Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir On the Number of Regular Vertices of the Union of Jordan Regions. Search on Bibsonomy SWAT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
22Ulrich Kortenkamp Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 6380 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license