Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Radu Curticapean |
Counting matchings with k unmatched vertices in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.08192, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli |
Drawing Planar Graphs with Many Collinear Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.03890, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Sariel Har-Peled |
Computing the k Nearest-Neighbors for all Vertices via Dijkstra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.07818, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Yuping Ke, Yixin Cao 0001, Xiating Ouyang, Jianxin Wang 0001 |
Unit Interval Vertex Deletion: Fewer Vertices are Relevant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1607.01162, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Dima Kagan, Michael Fire, Yuval Elovici |
Unsupervised Anomalous Vertices Detection Utilizing Link Prediction Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1610.07525, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Michele Borassi |
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.02129, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Arnau Padrol |
Extension complexity of polytopes with few vertices or facets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.06894, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Emeric Gioan, Kevin Sol, Gérard Subsol |
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.01641, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Konstantinos Raftopoulos, Stefanos D. Kollias, Marin Ferecatu |
Global Vertices and the Noising Paradox. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.00668, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Vera Weil |
A note on Reed's Conjecture about $ω$, $Δ$ and $χ$ with respect to vertices of high degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.02063, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Alina-Daniela Vîlcu, Gabriel Eduard Vîlcu |
An algorithm to estimate the vertices of a tetrahedron with uniform random points inside. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.08396, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Kerrek Stinson, David F. Gleich, Paul G. Constantine |
A randomized algorithm for enumerating zonotope vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1602.06620, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Laura Eslava |
Depth of vertices with high degree in random recursive trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.07466, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | David R. Wood |
Three dimensional graph drawing with fixed vertices and one bend per edge. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1606.09188, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Xiaobin Ma, Dein Wong, Fenglei Tian |
Nullity of a graph in terms of the dimension of cycle space and the number of pendant vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 215, pp. 171-176, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ralph J. Faudree, Hao Li 0002, Kiyoshi Yoshimoto |
Locating sets of vertices on Hamiltonian cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 209, pp. 107-114, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ashkan Nikseresht |
On the minimum Kirchhoff index of graphs with a fixed number of cut vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 207, pp. 99-105, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Hunter Swan |
Expected Number of Vertices of a Hypercube Slice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 123(6), pp. 600-604, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
13 | Hiranmoy Pal, Bikash Bhattacharjya |
Perfect state transfer on NEPS of the path on three vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 831-838, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Oleg V. Borodin, Anna O. Ivanova |
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 339(2), pp. 923-930, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Zachary Abel, Jason H. Cantarella, Erik D. Demaine, David Eppstein, Thomas C. Hull, Jason S. Ku, Robert J. Lang, Tomohiro Tachi |
Rigid origami vertices: conditions and forcing sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Geom. ![In: J. Comput. Geom. 7(1), pp. 171-184, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Michiel H. M. Smid, Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu |
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Geom. ![In: J. Comput. Geom. 7(1), pp. 444-472, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Boris G. Pittel, Daniel J. Poole |
Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 49(1), pp. 3-64, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Thomas G. Wong |
Spatial search by continuous-time quantum walk with multiple marked vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 15(4), pp. 1411-1443, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Yu Hong Yeung, Jessica Crouch, Alex Pothen |
Interactively Cutting and Constraining Vertices in Meshes Using Augmented Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 35(2), pp. 18:1-18:17, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Irene Sciriha, Alexander Farrugia |
No chemical graph on more than two vertices is nuciferous. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 11(2), pp. 397-402, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Jihui Wang, Qiaoling Ma, Xue Han, Xiuyun Wang |
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 32(2), pp. 626-638, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Arnau Padrol |
Polytopes with few vertices and few facets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 142, pp. 177-180, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Maria Predari, Aurélien Esnard |
A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PDP ![In: 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, PDP 2016, Heraklion, Crete, Greece, February 17-19, 2016, pp. 280-287, 2016, IEEE Computer Society, 978-1-4673-8776-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Radu Curticapean |
Counting Matchings with k Unmatched Vertices in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, pp. 33:1-33:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-015-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
Bicovering: Covering Edges With Two Small Subsets of Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pp. 6:1-6:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-013-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Manuel Aprile, Alfonso Cevallos, Yuri Faenza |
On Vertices and Facets of Combinatorial 2-Level Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 4th International Symposium, ISCO 2016, Vietri sul Mare, Italy, May 16-18, 2016, Revised Selected Papers, pp. 177-188, 2016, Springer, 978-3-319-45586-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Xingfu Li, Haodi Feng, Haitao Jiang, Binhai Zhu |
A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings, pp. 92-101, 2016, Springer, 978-3-319-39816-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli |
Drawing Planar Graphs with Many Collinear Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, pp. 152-165, 2016, Springer, 978-3-319-50105-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Nadhir Mansour Ben Lakhal, Othman Nasri, Imen Gueddi, Jalel Ben Hadj Slama |
SDK decentralized diagnosis with vertices principle component analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoDIT ![In: International Conference on Control, Decision and Information Technologies, CoDIT 2016, Saint Julian's, Malta, April 6-8, 2016, pp. 517-522, 2016, IEEE, 978-1-5090-2188-8. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Marcel Kenji de Carli Silva, Levent Tunçel |
Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 25(1), pp. 295-316, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Shiying Wang, Jing Li 0048, Yuxing Yang |
Unchanging the diameter of k-ary n-cube networks with faulty vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Comput. Math. ![In: Int. J. Comput. Math. 92(1), pp. 15-28, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Koji Momihara, Yu Okumura |
New strongly regular decompositions of the complete graphs with prime power vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Finite Fields Their Appl. ![In: Finite Fields Their Appl. 36, pp. 63-80, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Hajime Matsumura |
On spanning k-tree in which specified vertices have degree less than k. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 35(1), pp. 191-196, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Martiniano Eguía, Francisco J. Soulignac |
Disimplicial arcs, transitive vertices, and disimplicial eliminations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 17(2), pp. 101-118, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Javier Alberto Rangél González, Jesús David Terán Villanueva, Héctor Joaquín Fraire Huacuja, Juan Javier González Barbosa, José Antonio Martínez Flores, Guadalupe Castilla Valdez, Apolinar Ramírez-Saldivar |
Control difuso del parámetro β de una heurística constructiva tipo GRASP para el problema de la bisección de vértices de un grafo. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Res. Comput. Sci. ![In: Res. Comput. Sci. 92, pp. 49-58, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Guifu Su, Jianhua Tu, Kinkar Chandra Das |
Graphs with fixed number of pendent vertices and minimal Zeroth-order general Randić index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 270, pp. 705-710, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Pao-Lien Lai |
Paths and cycles identifying vertices in twisted cubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 259, pp. 620-627, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Hirotoshi Honma, Yoko Nakajima, Yuta Igarashi, Shigeru Masuyama |
Algorithm for Identifying the Maximum Detour Hinge Vertices of a Permutation Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6), pp. 1161-1167, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng |
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 15(1-2), pp. 1550002:1-1550002:16, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono 0001 |
Graph Orientations Optimizing the Number of Light or Heavy Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 19(1), pp. 441-465, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | M. Aghabali, Saieed Akbari, Shmuel Friedland, Klas Markström, Zakeieh Tajfirouz |
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number of vertices and edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 45, pp. 132-144, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu |
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 43, pp. 295-305, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Kanstantsin Pashkovich, Stefan Weltge |
Hidden vertices in extensions of polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 43(2), pp. 161-164, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Xueliang Li 0001, Yaping Mao |
On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(6), pp. 2231-2259, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Snjezana Majstorovic, Gilles Caporossi |
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(6), pp. 2319-2334, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Elzbieta Sidorowicz |
The Relaxed Game Chromatic Number of Graphs with Cut-Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 31(6), pp. 2381-2400, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz |
Bottleneck Steiner tree with bounded number of Steiner vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 30, pp. 96-100, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Salman Parsa |
On links of vertices in simplicial $d$-complexes embeddable in euclidean $2d$-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1512.05164, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Saeed Mehrabi 0001 |
Guarding the Vertices of an Orthogonal Terrain using Vertex Guards. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1512.08292, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Natarajan Meghanathan |
Distribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1508.01668, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding Isolated Vertices Makes some Online Algorithms Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1506.08592, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Ignacio García-Marco, Kolja Knauer |
Drawing graphs with vertices and edges in convex position. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.01981, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Prosenjit Bose, Paz Carmi, Mirela Damian, Jean-Lou De Carufel, Darryl Hill, Anil Maheshwari, Yuyang Liu, Michiel H. M. Smid |
On the Stretch Factor of Convex Polyhedra whose Vertices are (Almost) on a Sphere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1507.06856, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | William T. Trotter, Bartosz Walczak, Ruidong Wang |
Dimension and cut vertices: an application of Ramsey theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1505.08162, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Alexander Gribov |
Searching for a Compressed Polyline with a Minimum Number of Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.06584, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Rafael A. Melo, Phillippe Samer, Sebastián Urrutia |
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.06562, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong |
Obstructions for three-coloring graphs without induced paths on six vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1504.06979, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Jan Gorzny, Jing Huang 0007 |
End-vertices of LBFS of (AT-free) bigraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1509.01307, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Yong Wang 0027 |
Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 19(3), pp. 585-596, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Gustavo Angulo, Shabbir Ahmed 0001, Santanu S. Dey, Volker Kaibel |
Forbidden Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 40(2), pp. 350-360, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Alfredo Marín 0001 |
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 245(3), pp. 680-689, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Milan Basic |
Perfect state transfer between non-antipodal vertices in integral circulant graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 122, pp. 65-78, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Mingfang Huang, Xiangwen Li |
Maximum degree of 3-independent vertices and group connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 123, pp. 3-16, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Mathijs H. M. J. Wintraecken, Gert Vegter |
On the Optimal Triangulation of Convex Hypersurfaces, Whose Vertices Lie in Ambient Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Sci. ![In: Math. Comput. Sci. 9(3), pp. 345-353, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ioan Tomescu, Misbah Arshad |
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 181, pp. 306-309, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Kaveh Khoshkhah |
On finding orientations with the fewest number of vertices with small out-degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 194, pp. 163-166, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer |
New sufficient conditions for α-redundant vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 338(10), pp. 1674-1680, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi |
Uniformly resolvable decompositions of Kv into paths on two, three and four vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 338(12), pp. 2212-2219, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Binlong Li, Shenggui Zhang |
Forbidden subgraphs for longest cycles to contain vertices with large degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 338(10), pp. 1681-1689, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Runli Tian, Liming Xiong |
Hamiltonian claw-free graphs with locally disconnected vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 338(11), pp. 2042-2050, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ana Paulina Figueroa, Mika Olsen, Rita Zuazua |
On the vertices of a 3-partite tournament not in triangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 338(11), pp. 1982-1988, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Konstantin E. Tikhomirov |
On the Distance of Polytopes with Few Vertices to the Euclidean Ball. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 53(1), pp. 173-181, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yanmei Hong, Liying Kang, Xingxing Yu |
Nonseparating Cycles Avoiding Specific Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 80(4), pp. 253-267, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yoshimi Egawa, Kenta Ozeki |
Spanning Trees with Vertices Having Large Degrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 79(3), pp. 213-221, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Christopher M. Dellin, Siddhartha S. Srinivasa |
A general technique for fast comprehensive multi-root planning on graphs by coloring vertices and deferring edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICRA ![In: IEEE International Conference on Robotics and Automation, ICRA 2015, Seattle, WA, USA, 26-30 May, 2015, pp. 5433-5440, 2015, IEEE, 978-1-4799-6923-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa |
On Locating-chromatic Number for Graphs with Dominant Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGTIS ![In: The 2nd International Conference of Graph Theory and Information Security, ICGTIS 2015, Bandung, Indonesia, 21-23 September 2015, pp. 89-92, 2015, Elsevier. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | P. Jeya Bala Chitra, S. Arumugam 0001 |
Resolving Sets without Isolated Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGTIS ![In: The 2nd International Conference of Graph Theory and Information Security, ICGTIS 2015, Bandung, Indonesia, 21-23 September 2015, pp. 38-42, 2015, Elsevier. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Bo Li 0006, Zhuangliang Gao, Jianwei Niu 0002, Yanfei Lv, Hong Zhang 0023 |
Vertex-centric Parallel Algorithms for Identifying Key Vertices in Large-Scale Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPCC/CSS/ICESS ![In: 17th IEEE International Conference on High Performance Computing and Communications, HPCC 2015, 7th IEEE International Symposium on Cyberspace Safety and Security, CSS 2015, and 12th IEEE International Conference on Embedded Software and Systems, ICESS 2015, New York, NY, USA, August 24-26, 2015, pp. 225-231, 2015, IEEE, 978-1-4799-8937-9. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Benjamin A. Miller, Stephen Kelley, Rajmonda Sulo Caceres, Steven Thomas Smith |
Residuals-based subgraph detection with cue vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSSC ![In: 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015, Pacific Grove, CA, USA, November 8-11, 2015, pp. 1530-1534, 2015, IEEE, 978-1-4673-8576-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Felix Joos |
Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, pp. 339-350, 2015, Springer, 978-3-662-53173-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Peng Zhang, Hong Zheng |
Generalized Contributing Vertices-Based Method for Minkowski Sum Outer-Face of Two Polygons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIG (2) ![In: Image and Graphics - 8th International Conference, ICIG 2015, Tianjin, China, August 13-16, 2015, Proceedings, Part II, pp. 333-346, 2015, Springer, 978-3-319-21962-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Dieter Kratsch, Mathieu Liedloff, Daniel Meister 0001 |
End-Vertices of Graph Search Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity - 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings, pp. 300-312, 2015, Springer, 978-3-319-18172-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ignacio García-Marco, Kolja Knauer |
Drawing Graphs with Vertices and Edges in Convex Position. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 23rd International Symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015, Revised Selected Papers, pp. 348-359, 2015, Springer, 978-3-319-27260-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Shankar Sastry |
Maximizing the Minimum Angle with the Insertion of Steiner Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 27th Canadian Conference on Computational Geometry, CCCG 2015, Kingston, Ontario, Canada, August 10-12, 2015, 2015, Queen's University, Ontario, Canada. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding Isolated Vertices Makes Some Online Algorithms Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers, pp. 65-76, 2015, Springer, 978-3-319-29515-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Wenbin Chen 0003, Lingxi Peng, Jianxiong Wang, Fufang Li, Maobin Tang |
Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Houston, TX, USA, December 18-20, 2015, Proceedings, pp. 566-573, 2015, Springer, 978-3-319-26625-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Peng Zhang 0008, Tao Jiang 0001, Angsheng Li |
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings, pp. 159-170, 2015, Springer, 978-3-319-21397-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ondrej Suchý |
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 10th International Symposium on Parameterized and Exact Computation, IPEC 2015, September 16-18, 2015, Patras, Greece, pp. 151-162, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-92-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Colin Cooper, Tomasz Radzik, Yiannis Siantos |
A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Internet Math. ![In: Internet Math. 10(1-2), pp. 137-161, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Ángeles Carmona, Andrés M. Encinas, Silvia Gago, Margarida Mitjana |
Laplacian matrix of a weighted graph with new pendant vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 46, pp. 129-136, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Michitaka Furuya |
The connectivity of domination dot-critical graphs with no critical vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 34(4), pp. 683-690, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Erfang Shan, Dingguo Wang |
On the numbers of cut-vertices and end-blocks in 4-regular graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 34(1), pp. 127-136, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Toshihiko Takahashi |
A Compact Code for Rectangular Drawings with Degree Four Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Process. ![In: J. Inf. Process. 22(4), pp. 634-637, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Hui Li 0014, Li-Ying Hao, Rong Chen 0003, Xin Ge, Hai Zhao 0002 |
Symmetric Preferential Attachment for New Vertices Attaching to Software Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
New Gener. Comput. ![In: New Gener. Comput. 32(3-4), pp. 271-296, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|