|
|
Venues (Conferences, Journals, ...)
|
|
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 |
49 | Naveen Garg 0001 |
A 3-Approximation for the Minimum Tree Spanning k Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 302-309, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
minimum tree, 3-approximation, k-vertices, minimum tour, spanning k vertices, graph, trees (mathematics) |
48 | David W. Paglieroni, Gary E. Ford, Eric M. Tsujimoto |
The Position-Orientation Masking Approach to Parametric Search for Template Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 16(7), pp. 740-747, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
44 | Franck Xia |
Invariant property of contour: VPIUD with arbitrary neighborhood. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP ![In: Proceedings 1995 International Conference on Image Processing, Washington, DC, USA, October 23-26, 1995, pp. 651-654, 1995, IEEE Computer Society, 0-8186-7310-9. The full citation details ...](Pics/full.jpeg) |
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 |
44 | David Coudert, Frédéric Giroire, Ignasi Sau |
Edge-Simple Circuits through 10 Ordered Vertices in Square Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 134-145, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
edge-simple circuit, prescribed vertices, ILP solver, square grid |
43 | Anand Bhalgat, Ramesh Hariharan |
Fast edge orientation for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 265-272, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Itai Ashlagi, Felix A. Fischer, Ian A. Kash, Ariel D. Procaccia |
Mix and match. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), Cambridge, Massachusetts, USA, June 7-11, 2010, pp. 305-314, 2010, ACM, 978-1-60558-822-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximate mechanism design without money, kidney exchange |
39 | Chinmoy Dutta, Jaikumar Radhakrishnan |
Tradeoffs in Depth-Two Superconcentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 372-383, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
39 | Xin Yao 0003, Changshui Zhang, Jinwen Chen, Yanda Li |
On the Scale-Free Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part II, pp. 1217-1224, 2005, Springer, 3-540-25861-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
35 | Esther Ezra, János Pach, Micha Sharir |
On Regular Vertices of the Union of Planar Convex Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(2), pp. 216-231, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Geometric arrangements, Union of planar regions, Regular vertices, Bi-clique decompositions, (1/r)-cuttings, Lower envelopes |
35 | Shmuel Onn, Uriel G. Rothblum |
The use of edge-directions and linear programming to enumerate vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 14(2-3), pp. 153-164, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Edge-directions, Linear programming, Vertices, Polytopes |
35 | Esther Ezra, János Pach, Micha Sharir |
On regular vertices on the union of planar objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 220-226, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
(1/r)-cuttings, regular vertices, union of geometric objects |
34 | Anvesh Komuravelli, Matús Mihalák |
Exploring Polygonal Environments by Simple Robots with Faulty Combinatorial Vision. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSS ![In: Stabilization, Safety, and Security of Distributed Systems, 11th International Symposium, SSS 2009, Lyon, France, November 3-6, 2009. Proceedings, pp. 458-471, 2009, Springer, 978-3-642-05117-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
34 | Klim Efremenko, Omer Reingold |
How Well Do Random Walks Parallelize?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings, pp. 476-489, 2009, Springer, 978-3-642-03684-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Markov Chains, Random Walks |
34 | Reuven Bar-Yehuda, Craig Gotsman |
Time/Space Tradeoffs for Polygon Mesh Rendering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 15(2), pp. 141-152, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
rendering, polygons, graphics pipeline |
31 | Efim D. Gluskin, Alexander E. Litvak |
Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 40(4), pp. 528-536, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Asymmetry of polytopes, Illumination parameter, Measures of symmetry, Polytopes with few vertices, Vertex index |
30 | Wei Ding 0006, Guoliang Xue |
A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 14-23, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Most reliable source, Transmitting probability, Receiving probability |
30 | Zvi Lotker, Alfredo Navarra |
Unbalanced Points and Vertices Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PerCom Workshops ![In: 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 13-17 March 2006, Pisa, Italy, pp. 96-100, 2006, IEEE Computer Society, 0-7695-2520-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Robert Haas 0001, Michael Hoffmann 0001 |
Chordless Paths Through Three Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 25-36, 2004, Springer, 3-540-23071-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
30 | Debashis Bera, Madhumangal Pal, Tapan Kumar Pal |
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 17-27, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
30 | Satoshi Taoka, Toshimasa Watanabe |
Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 5th International Symposium, ISAAC '94, Beijing, P. R. China, August 25-27, 1994, Proceedings, pp. 217-225, 1994, Springer, 3-540-58325-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
30 | Konstantinos Panagiotou, Angelika Steger |
Maximal biconnected subgraphs of random planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 432-440, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
30 | Mohammad Tanvir Parvez, Md. Saidur Rahman 0001, Shin-Ichi Nakano |
Generating All Triangulations of Plane Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation, Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings, pp. 151-164, 2009, Springer, 978-3-642-00201-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Genealogical Tree, Graph, Triangulation, Polygon, Plane Graph |
30 | Stavros D. Nikolopoulos, Leonidas Palios |
Detecting Holes and Antiholes in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 47(2), pp. 119-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Reid Andersen, Christian Borgs, Jennifer T. Chayes, John E. Hopcroft, Vahab S. Mirrokni, Shang-Hua Teng |
Local Computation of PageRank Contributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAW ![In: Algorithms and Models for the Web-Graph, 5th International Workshop, WAW 2007, San Diego, CA, USA, December 11-12, 2007, Proceedings, pp. 150-165, 2007, Springer, 978-3-540-77003-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Puneet Maheshwari, Parag Agarwal, Balakrishnan Prabhakaran 0001 |
Progressive compression invariant semi-fragile watermarks for 3d meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MM&Sec ![In: Proceedings of the 9th workshop on Multimedia & Security, MM&Sec 2007, Dallas, Texas, USA, September 20-21, 2007, pp. 245-250, 2007, ACM, 978-1-59593-857-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
authentication, compression, watermarking |
30 | Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov |
Approximation Algorithms for the Black and White Traveling Salesman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 559-567, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
30 | Steve Hanneke |
An analysis of graph cut size for transductive learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006), Pittsburgh, Pennsylvania, USA, June 25-29, 2006, pp. 393-399, 2006, ACM, 1-59593-383-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
30 | Purvi Saraiya, Peter Lee 0005, Chris North 0001 |
Visualization of Graphs with Associated Timeseries Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOVIS ![In: IEEE Symposium on Information Visualization (InfoVis 2005), 23-25 October 2005, Minneapolis, MN, USA, pp. 225-232, 2005, IEEE Computer Society, 0-7803-9464-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
data overlay, timeseries data analysis, usability experiments, Graph visualization |
30 | Alexander Gribov, Eugene Bodansky |
A New Method of Polyline Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSPR/SPR ![In: Structural, Syntactic, and Statistical Pattern Recognition, Joint IAPR International Workshops, SSPR 2004 and SPR 2004, Lisbon, Portugal, August 18-20, 2004 Proceedings, pp. 504-511, 2004, Springer, 3-540-22570-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
polylinecompression, polyline approximation, vectorization, shape analysis |
30 | Colin Cooper |
Classifying Special Interest Groups in Web Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 263-276, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
30 | David Peleg |
Informative Labeling Schemes for Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings, pp. 579-588, 2000, Springer, 3-540-67901-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
30 | Ton Kloks, Hans L. Bodlaender |
Testing Superperfection of k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 292-303, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
26 | Martin C. Cooper |
Constraints Between Distant Lines in the Labelling of Line Drawings of Polyhedral Scenes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Vis. ![In: Int. J. Comput. Vis. 73(2), pp. 195-212, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
line drawing labelling, non-trihedral vertices, valued constraint satisfaction problem, soft constraints, polyhedral objects, parallel lines |
26 | Enrico De Micheli, Bruno Caprile, P. Ottonello, Vincent Torre |
Localization and Noise in Edge Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 11(10), pp. 1106-1117, 1989. The full citation details ...](Pics/full.jpeg) |
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 |
26 | Oleg V. Borodin, Anna O. Ivanova |
3-Vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 345(8), pp. 112904, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
26 | Shuji 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](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 106-122, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
26 | Oleg 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](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(4), pp. 1025-1033, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Cristina Maier, Dan A. Simovici |
Betweenness Centrality of Sets of Vertices in Graphs: which Vertices to Associate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISDM ![In: ICISDM 2020: The 4th International Conference on Information System and Data Mining, Hawaii, HI, USA, May 15-17, 2020, pp. 20-24, 2020, ACM, 978-1-4503-7765-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
26 | Oleg 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](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(8), pp. 2439-2444, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
26 | Oleg 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](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 38(3), pp. 615-625, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Shuya Chiba, Shinya Fujita 0001 |
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 313(3), pp. 269-277, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
26 | Xinying Pai, Sanyang Liu |
On the Laplacian Coefficients and Laplacian-Like Energy of Unicyclic Graphs with Vertices and Pendent Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Math. ![In: J. Appl. Math. 2012, pp. 404067:1-404067:11, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
26 | Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi |
Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 56(4), pp. 413-436, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Endre 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0801.3790, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
26 | Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi |
Minimum Augmentation of Edge-connectivity between Vertices and Sets of Vertices in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Computing: the Australasian Theory Symposiumm, CATS 2003, Adelaide, SA, Australia, February 4-7, 2003, pp. 236-259, 2003, Elsevier. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Shinsei 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](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 90(1), pp. 63-74, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
26 | Hans-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](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 37(1), pp. 67-72, 1981. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
26 | Hans 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](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 22(3), pp. 286-288, 1977. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
|
26 | Hugo Gimbert, Florian Horn 0001 |
Simple Stochastic Games with Few Random Vertices Are Easy to Solve. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS ![In: Foundations of Software Science and Computational Structures, 11th International Conference, FOSSACS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29 - April 6, 2008. Proceedings, pp. 5-19, 2008, Springer, 978-3-540-78497-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Sy-Yen Kuo, Fu-Min Yeh, Hung-Yau Lin |
Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Reliab. ![In: IEEE Trans. Reliab. 56(2), pp. 288-300, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Deepak Ajwani, Saurabh Ray, Raimund Seidel, Hans Raj Tiwary |
On Computing the Centroid of the Vertices of an Arrangement and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 519-528, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Ralf Klasing, Zvi Lotker, Alfredo Navarra, Stephane Perennes |
From Balls and Bins to Points and Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 757-766, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Toshiya 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](Pics/bibsonomy.png) |
ISCAS (1) ![In: International Symposium on Circuits and Systems (ISCAS 2005), 23-26 May 2005, Kobe, Japan, pp. 752-755, 2005, IEEE, 0-7803-8834-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Jesús A. De Loera, Tyrrell B. McAllister |
Vertices of Gelfand-Tsetlin Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(4), pp. 459-470, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Abraham Flaxman, Alan M. Frieze, Trevor I. Fenner |
High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings, pp. 264-274, 2003, Springer, 3-540-40770-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Satoshi 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](Pics/bibsonomy.png) |
ISCAS (3) ![In: Proceedings of the 2003 International Symposium on Circuits and Systems, ISCAS 2003, Bangkok, Thailand, May 25-28, 2003, pp. 236-239, 2003, IEEE, 0-7803-7761-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Graham 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](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2003, International Conference, Montreal, Canada, May 18-21, 2003, Proceedings, Part III, pp. 894-902, 2003, Springer, 3-540-40156-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Toshinori Sakai |
Long Paths through Specified Vertices in 3-Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2002, Tokyo, Japan, December 6-9, 2002, Revised Papers, pp. 251-260, 2002, Springer, 3-540-20776-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | T. Ozawa |
Efficient algorithms for planar embedding of graphs with constraints in placing specified vertices on face boundaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS (5) ![In: Proceedings of the 2002 International Symposium on Circuits and Systems, ISCAS 2002, Scottsdale, Arizona, USA, May 26-29, 2002, pp. 749-752, 2002, IEEE, 0-7803-7448-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | N. S. Narayanaswamy, C. E. Veni Madhavan |
On Assigning Prefix Free Codes to the Vertices of a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 328-337, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Andreas Spillner 0001, Alexander Wolff 0001 |
Untangling a Planar Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 473-484, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Andrzej Lingas, Martin Wahlen |
On Exact Complexity of Subgraph Homeomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings, pp. 256-261, 2007, Springer, 978-3-540-72503-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Tsan-sheng Hsu, Kuo-Hui Tsai, Da-Wei Wang 0004, D. T. Lee |
Two Variations of the Minimum Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(1), pp. 101-120, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
minimum Steiner network, minimum union paths, NP-hard, directed acyclic graph, polynomial time |
26 | Shyh-Kuang Ueng, Yan-Jen Su, Chi-Tang Chang |
LoD Volume Rendering of FEA Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Visualization ![In: 15th IEEE Visualization Conference, IEEE Vis 2004, Austin, TX, USA, October 10-15, 2004, Proceedings, pp. 417-424, 2004, IEEE Computer Society, 0-7803-8788-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
splatting method, Volume rendering, level-of-detail, scientific visualization, unstructured data |
26 | John Burns 0001, Heather J. Ruskin |
Network Topology in Immune System Shape Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
International Conference on Computational Science ![In: Computational Science - ICCS 2004, 4th International Conference, Kraków, Poland, June 6-9, 2004, Proceedings, Part III, pp. 1094-1101, 2004, Springer, 3-540-22116-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Ediz Saykol, Gürcan Gülesir, Ugur Güdükbay, Özgür Ulusoy |
KiMPA: A Kinematics-Based Method for Polygon Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADVIS ![In: Advances in Information Systems, Second International Conference, ADVIS 2002, Izmir, Turkey, October 23-25, 2002, Proceedings, pp. 186-194, 2002, Springer, 3-540-00009-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Eran Halperin, Uri Zwick |
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001, Proceedings, pp. 210-225, 2001, Springer, 3-540-42225-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Zhangjian Li, Shin-Ichi Nakano |
Efficient Generation of Plane Triangulations without Repetitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 433-443, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Claudio Esperança, Hanan Samet |
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SSD ![In: Advances in Spatial Databases, 5th International Symposium, SSD'97, Berlin, Germany, July 15-18, 1997, Proceedings, pp. 197-220, 1997, Springer, 3-540-63238-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
22 | Marc Alexa, Tamy Boubekeur |
Subdivision shading. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 27(5), pp. 142, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
irregular vertices, subdivision, shading, visual quality |
22 | Ali Mohammad-Djafari, Yassine Khayi, Ken D. Sauer, Eric Cano |
Reconstruction of the Shape of a Compact Object from Few Projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (1) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 165-168, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
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 |
22 | Ron Shamir, Dekel Tsur |
Faster subtree isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 126-131, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem |
22 | Christian Capelle, Michel Habib |
Graph decompositions and factorizing permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 132-143, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
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 |
22 | Chin-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](Pics/bibsonomy.png) |
IPPS ![In: 11th International Parallel Processing Symposium (IPPS '97), 1-5 April 1997, Geneva, Switzerland, Proceedings, pp. 603-607, 1997, IEEE Computer Society, 0-8186-7792-9. The full citation details ...](Pics/full.jpeg) |
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 |
22 | Panos A. Patsouris |
Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 466-471, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
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 |
22 | Philippe Clauss, Vincent Loechner |
Parametric Analysis of Polyhedral Iteration Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASAP ![In: 1996 International Conference on Application-Specific Systems, Architectures, and Processors (ASAP '96), August 19-23, 1996, Chicago, IL , USA, pp. 415-, 1996, IEEE Computer Society, 0-8186-7542-X. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
parametric vertices, parametric counting, Ehrhart polynomials, automatic parallelization, nested loops, convex polyhedra |
22 | Gabriel Taubin |
Curve and Surface Smoothing without Shrinkage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV ![In: Procedings of the Fifth International Conference on Computer Vision (ICCV 95), Massachusetts Institute of Technology, Cambridge, Massachusetts, USA, June 20-23, 1995, pp. 852-857, 1995, IEEE Computer Society, 0-8186-7042-8. The full citation details ...](Pics/full.jpeg) |
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 |
22 | John R. Gilbert, Gary L. Miller, Shang-Hua Teng |
Geometric mesh partitioning: implementation and experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 418-427, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
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 |
22 | Hongwei 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](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications, Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009. Proceedings, pp. 258-268, 2009, Springer, 978-3-642-02025-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich |
Generating All Vertices of a Polyhedron Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 39(1-3), pp. 174-190, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
22 | William Duckworth, Michele Zito 0001 |
Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings, pp. 56-66, 2007, Springer, 978-3-540-74455-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
22 | Bill Jackson, Tibor Jordán, Zoltan Szabadka |
Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 35(3), pp. 493-512, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Xiaomei Liu, Li Xiao 0001, Andrew Kreling, Yunhao Liu 0001 |
Optimizing overlay topology by reducing cut vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NOSSDAV ![In: Network and Operating System Support for Digital Audio and Video, 16th International Workshop, NOSSDAV 2006, Newport, Rhode Island, USA, November 22-23, 2006, Proceedings, pp. 17, 2006, ACM, 1-59593-285-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
22 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 21(1), pp. 27-37, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification, 05C40 |
22 | Michael A. Henning, Michael D. Plummer |
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 10(3), pp. 283-294, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
paired-domination number, tree |
22 | Xiangyu Yu, Hong Sun |
Automatic Image Registration via Clustering and Convex Hull Vertices Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADMA ![In: Advanced Data Mining and Applications, First International Conference, ADMA 2005, Wuhan, China, July 22-24, 2005, Proceedings, pp. 439-445, 2005, Springer, 3-540-27894-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
22 | Antó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](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 127-136, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | P. A. C. Varley, Hiromasa Suzuki, Ralph R. Martin |
Interpreting Line Drawings of Objects with K-Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GMP ![In: 2004 Geometric Modeling and Processing (GMP 2004), Theory and Applications, 13-15 April 2004, Beijing, China, pp. 249-258, 2004, IEEE Computer Society, 0-7695-2078-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
22 | Dimitrios Katsoulas |
Robust Extraction of Vertices in Range Images by Constraining the Hough Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IbPRIA ![In: Pattern Recognition and Image Analysis, First Iberian Conference, IbPRIA 2003, Puerto de Andratx, Mallorca, Spain, June 4-6, 2003, Proceedings, pp. 360-369, 2003, Springer, 3-540-40217-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Sammani D. Abdullahi, Martin E. Dyer, Les G. Proll |
Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DMTCS ![In: Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings, pp. 89-96, 2003, Springer, 3-540-40505-4. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Gill Barequet, Michael T. Goodrich, Chris Riley |
Drawing Graphs with Large Vertices and Thick Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings, pp. 281-293, 2003, Springer, 3-540-40545-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
22 | Matthias Kriesell |
Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 18(1), pp. 133-146, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro |
Spanning Trees with Bounded Number of Branch Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 355-365, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Yvo Desmedt, Yongge Wang |
Maximum Flows and Critical Vertices in AND/OR Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 238-248, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
22 | Gregory 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](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 17(3), pp. 473-477, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Deok-Soo Kim, Jaeyeol Chung, Youngsong Cho, Taeboom Jang, Hyun Kim |
Geometry Compression Based on Mantissa Chunking of Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IV ![In: International Conference on Information Visualisation, IV 2001, London, England, UK, July 25-27, 2001, pp. 606-611, 2001, IEEE Computer Society, 0-7695-1195-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
22 | Iiro S. Honkala, Mark G. Karpovsky, Simon Litsyn |
On the Identification of Vertices and Edges Using Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAECC ![In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 14th International Symposium, AAECC-14, Melbourne, Australia November 26-30, 2001, Proceedings, pp. 308-314, 2001, Springer, 3-540-42911-5. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
binary hypercube, Lee metric, graph, multiprocessor system, Identification, cycle, Hamming distance |
22 | Mekkia Kouider |
Neighborhoods and Covering Vertices by Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(2), pp. 219-226, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C38, 05C35, 05C70 |
22 | Boris Aronov, Alon Efrat, Dan Halperin, Micha Sharir |
On the Number of Regular Vertices of the Union of Jordan Regions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, pp. 322-334, 1998, Springer, 3-540-64682-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
22 | Ulrich Kortenkamp |
Every Simplicial Polytope with at Most d + 4 Vertices Is a Quotient of a Neighborly Polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(4), pp. 455-462, 1997. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|