Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Radu Curticapean |
Counting matchings with k unmatched vertices in planar graphs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli |
Drawing Planar Graphs with Many Collinear Vertices. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Sariel Har-Peled |
Computing the k Nearest-Neighbors for all Vertices via Dijkstra. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Yuping Ke, Yixin Cao 0001, Xiating Ouyang, Jianxin Wang 0001 |
Unit Interval Vertex Deletion: Fewer Vertices are Relevant. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Dima Kagan, Michael Fire, Yuval Elovici |
Unsupervised Anomalous Vertices Detection Utilizing Link Prediction Algorithms. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Michele Borassi |
A Note on the Complexity of Computing the Number of Reachable Vertices in a Digraph. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Arnau Padrol |
Extension complexity of polytopes with few vertices or facets. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Emeric Gioan, Kevin Sol, Gérard Subsol |
Orientations of Simplices Determined by Orderings on the Coordinates of their Vertices. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Konstantinos Raftopoulos, Stefanos D. Kollias, Marin Ferecatu |
Global Vertices and the Noising Paradox. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Vera Weil |
A note on Reed's Conjecture about $ω$, $Δ$ and $χ$ with respect to vertices of high degree. |
CoRR |
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. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Kerrek Stinson, David F. Gleich, Paul G. Constantine |
A randomized algorithm for enumerating zonotope vertices. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | Laura Eslava |
Depth of vertices with high degree in random recursive trees. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
13 | David R. Wood |
Three dimensional graph drawing with fixed vertices and one bend per edge. |
CoRR |
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. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ralph J. Faudree, Hao Li 0002, Kiyoshi Yoshimoto |
Locating sets of vertices on Hamiltonian cycles. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ashkan Nikseresht |
On the minimum Kirchhoff index of graphs with a fixed number of cut vertices. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Hunter Swan |
Expected Number of Vertices of a Hypercube Slice. |
Am. Math. Mon. |
2016 |
DBLP BibTeX RDF |
|
13 | Hiranmoy Pal, Bikash Bhattacharjya |
Perfect state transfer on NEPS of the path on three vertices. |
Discret. Math. |
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. |
Discret. Math. |
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. |
J. Comput. Geom. |
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. |
J. Comput. Geom. |
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. |
Random Struct. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Thomas G. Wong |
Spatial search by continuous-time quantum walk with multiple marked vertices. |
Quantum Inf. Process. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Yu Hong Yeung, Jessica Crouch, Alex Pothen |
Interactively Cutting and Constraining Vertices in Meshes Using Augmented Matrices. |
ACM Trans. Graph. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Irene Sciriha, Alexander Farrugia |
No chemical graph on more than two vertices is nuciferous. |
Ars Math. Contemp. |
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. |
J. Comb. Optim. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Arnau Padrol |
Polytopes with few vertices and few facets. |
J. Comb. Theory, Ser. A |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Maria Predari, Aurélien Esnard |
A k-Way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications. |
PDP |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Radu Curticapean |
Counting Matchings with k Unmatched Vertices in Planar Graphs. |
ESA |
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. |
ICALP |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Manuel Aprile, Alfonso Cevallos, Yuri Faenza |
On Vertices and Facets of Combinatorial 2-Level Polytopes. |
ISCO |
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. |
FAW |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli |
Drawing Planar Graphs with Many Collinear Vertices. |
GD |
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. |
CoDIT |
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. |
SIAM J. Optim. |
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. |
Int. J. Comput. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Koji Momihara, Yu Okumura |
New strongly regular decompositions of the complete graphs with prime power vertices. |
Finite Fields Their Appl. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Hajime Matsumura |
On spanning k-tree in which specified vertices have degree less than k. |
Discuss. Math. Graph Theory |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Martiniano Eguía, Francisco J. Soulignac |
Disimplicial arcs, transitive vertices, and disimplicial eliminations. |
Discret. Math. Theor. Comput. Sci. |
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. |
Res. Comput. Sci. |
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. |
Appl. Math. Comput. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Pao-Lien Lai |
Paths and cycles identifying vertices in twisted cubes. |
Appl. Math. Comput. |
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. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
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. |
J. Interconnect. Networks |
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. |
J. Graph Algorithms Appl. |
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. |
Eur. J. Comb. |
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. |
Eur. J. Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Kanstantsin Pashkovich, Stefan Weltge |
Hidden vertices in extensions of polytopes. |
Oper. Res. Lett. |
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. |
Graphs Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Snjezana Majstorovic, Gilles Caporossi |
Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree. |
Graphs Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Elzbieta Sidorowicz |
The Relaxed Game Chromatic Number of Graphs with Cut-Vertices. |
Graphs Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz |
Bottleneck Steiner tree with bounded number of Steiner vertices. |
J. Discrete Algorithms |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Salman Parsa |
On links of vertices in simplicial $d$-complexes embeddable in euclidean $2d$-space. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Saeed Mehrabi 0001 |
Guarding the Vertices of an Orthogonal Terrain using Vertex Guards. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Natarajan Meghanathan |
Distribution of maximal clique size of the vertices for theoretical small-world networks and real-world networks. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding Isolated Vertices Makes some Online Algorithms Optimal. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Ignacio García-Marco, Kolja Knauer |
Drawing graphs with vertices and edges in convex position. |
CoRR |
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. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | William T. Trotter, Bartosz Walczak, Ruidong Wang |
Dimension and cut vertices: an application of Ramsey theory. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Alexander Gribov |
Searching for a Compressed Polyline with a Minimum Number of Vertices. |
CoRR |
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. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong |
Obstructions for three-coloring graphs without induced paths on six vertices. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Jan Gorzny, Jing Huang 0007 |
End-vertices of LBFS of (AT-free) bigraphs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
13 | Yong Wang 0027 |
Hybrid Max-Min ant system with four vertices and three lines inequality for traveling salesman problem. |
Soft Comput. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Gustavo Angulo, Shabbir Ahmed 0001, Santanu S. Dey, Volker Kaibel |
Forbidden Vertices. |
Math. Oper. Res. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Alfredo Marín 0001 |
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. |
Eur. J. Oper. Res. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Milan Basic |
Perfect state transfer between non-antipodal vertices in integral circulant graphs. |
Ars Comb. |
2015 |
DBLP BibTeX RDF |
|
13 | Mingfang Huang, Xiangwen Li |
Maximum degree of 3-independent vertices and group connectivity. |
Ars Comb. |
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. |
Math. Comput. Sci. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ioan Tomescu, Misbah Arshad |
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices. |
Discret. Appl. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Kaveh Khoshkhah |
On finding orientations with the fewest number of vertices with small out-degree. |
Discret. Appl. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer |
New sufficient conditions for α-redundant vertices. |
Discret. Math. |
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. |
Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Binlong Li, Shenggui Zhang |
Forbidden subgraphs for longest cycles to contain vertices with large degrees. |
Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Runli Tian, Liming Xiong |
Hamiltonian claw-free graphs with locally disconnected vertices. |
Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ana Paulina Figueroa, Mika Olsen, Rita Zuazua |
On the vertices of a 3-partite tournament not in triangles. |
Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Konstantin E. Tikhomirov |
On the Distance of Polytopes with Few Vertices to the Euclidean Ball. |
Discret. Comput. Geom. |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yanmei Hong, Liying Kang, Xingxing Yu |
Nonseparating Cycles Avoiding Specific Vertices. |
J. Graph Theory |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Yoshimi Egawa, Kenta Ozeki |
Spanning Trees with Vertices Having Large Degrees. |
J. Graph Theory |
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. |
ICRA |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Des Welyyanti, Edy Tri Baskoro, Rinovia Simanjuntak, Saladin Uttunggadewa |
On Locating-chromatic Number for Graphs with Dominant Vertices. |
ICGTIS |
2015 |
DBLP DOI BibTeX RDF |
|
13 | P. Jeya Bala Chitra, S. Arumugam 0001 |
Resolving Sets without Isolated Vertices. |
ICGTIS |
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. |
HPCC/CSS/ICESS |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Benjamin A. Miller, Stephen Kelley, Rajmonda Sulo Caceres, Steven Thomas Smith |
Residuals-based subgraph detection with cue vertices. |
ACSSC |
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. |
WG |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Peng Zhang, Hong Zheng |
Generalized Contributing Vertices-Based Method for Minkowski Sum Outer-Face of Two Polygons. |
ICIG (2) |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Dieter Kratsch, Mathieu Liedloff, Daniel Meister 0001 |
End-Vertices of Graph Search Algorithms. |
CIAC |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ignacio García-Marco, Kolja Knauer |
Drawing Graphs with Vertices and Edges in Convex Position. |
GD |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Shankar Sastry |
Maximizing the Minimum Angle with the Insertion of Steiner Vertices. |
CCCG |
2015 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding Isolated Vertices Makes Some Online Algorithms Optimal. |
IWOCA |
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. |
COCOA |
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. |
COCOON |
2015 |
DBLP DOI BibTeX RDF |
|
13 | Ondrej Suchý |
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. |
IPEC |
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. |
Internet Math. |
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. |
Electron. Notes Discret. Math. |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Michitaka Furuya |
The connectivity of domination dot-critical graphs with no critical vertices. |
Discuss. Math. Graph Theory |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Erfang Shan, Dingguo Wang |
On the numbers of cut-vertices and end-blocks in 4-regular graphs. |
Discuss. Math. Graph Theory |
2014 |
DBLP DOI BibTeX RDF |
|
13 | Toshihiko Takahashi |
A Compact Code for Rectangular Drawings with Degree Four Vertices. |
J. Inf. Process. |
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. |
New Gener. Comput. |
2014 |
DBLP DOI BibTeX RDF |
|