Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Rajesh Chitnis, László Egri, Dániel Marx |
List H-Coloring a Graph by Removing Few Vertices. |
Algorithmica |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Pablo Spiga, Gabriel Verret |
Vertex-primitive digraphs having vertices with almost equal neighbourhoods. |
Eur. J. Comb. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Johanna Björklund, Frank Drewes, Anna Jonsson |
Finding the N best vertices in an infinite weighted hypergraph. |
Theor. Comput. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Markus Haltmeier, Sunghwan Moon, Daniela Schiefeneder |
Inversion of the Attenuated V-Line Transform With Vertices on the Circle. |
IEEE Trans. Computational Imaging |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Maria Predari, Aurélien Esnard, Jean Roman |
Comparison of initial partitioning methods for multilevel direct k-way graph partitioning with fixed vertices. |
Parallel Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Richard Behr |
Edges and vertices in a unique signed circle in a signed graph. |
AKCE Int. J. Graphs Comb. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ronald J. Gould, Colton Magnant, Pouria Salehi Nowbandegani |
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle. |
Graphs Comb. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Keith Copenhaver |
k-Protected Vertices in Unlabeled Rooted Plane Trees. |
Graphs Comb. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Yang Lu 0005, Jun-Hai Yong, Kan-Le Shi, He-Jin Gu, Ping Zheng, Jean-Claude Paul |
B-spline surface fitting to mesh vertices. |
Sci. China Inf. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Manuel Aprile, Alfonso Cevallos, Yuri Faenza |
On vertices and facets of combinatorial 2-level polytopes. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Khaled M. Elbassioni, Kazuhisa Makino |
Enumerating Vertices of $0/1$-Polyhedra associated with $0/1$-Totally Unimodular Matrices. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomás Toufar, Pavel Veselý 0001 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Tomasz Kociumaka, Marcin Pilipczuk |
Deleting vertices to graphs of bounded genus. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Erik M. Lindgren, Alexandros G. Dimakis, Adam R. Klivans |
Exact MAP Inference by Avoiding Fractional Vertices. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Huiju Wang, Zhengkui Wang, Kian-Lee Tan, Chee-Yong Chan, Qi Fan, Xiao Yue |
VCExplorer: A Interactive Graph Exploration Framework Based on Hub Vertices with Graph Consolidation. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot |
Constrained Routing Between Non-Visible Vertices. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Javlon E. Isomurodov, Alexander A. Loboda, Alexey A. Sergushichev |
Ranking vertices for active module recovery problem. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Daniël Paulusma, Christophe Picouleau, Bernard Ries |
Critical Vertices and Edges in $H$-free Graphs. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Louis DeBiasio, Allan Lo |
Spanning trees with few branch vertices. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
13 | Byeong Moon Kim, Yoomi Rho, Byung Chul Song |
Distance multi-labelling of graphs with weighted vertices. |
IET Commun. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | David Alcaide López de Pablo, Joaquin Sicilia, Miguel Á. González-Sierra |
Locating names on vertices of a transaction network. |
Eur. J. Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Xiaoxin Li, Jia-Bao Liu |
On the reciprocal degree distance of graphs with cut vertices or cut edges. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | Xinying Pai, Sanyang Liu |
On the signless Laplacian spectral radius of tricyclic graphs with n vertices and diameter d. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | Lili Song, Lei Sun |
Every 1-planar graph without 4-cycles or adjacent 5-vertices is 5-colorable. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | Yingqiu Yang |
Vertices of Degree 9 in Contraction Critical 8-Connected Graphs. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | S. Ramachandran, P. Bhanumathy |
Subgraphs And Similarity Of Vertices. |
Ars Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | Hovhannes A. Harutyunyan, Shahin Kamali |
Efficient broadcast trees for weighted vertices. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Jan Gorzny, Jing Huang 0007 |
End-vertices of LBFS of (AT-free) bigraphs. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning |
Partitioning the vertices of a cubic graph into two total dominating sets. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Che-Nan Kuo, Yu-Huei Cheng |
Cycles embedding in folded hypercubes with conditionally faulty vertices. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Shaohui Wang, Chunxiang Wang, Lin Chen, Jia-Bao Liu |
On extremal multiplicative Zagreb indices of trees with given number of vertices of maximum degree. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ivan Gutman, Shuchao Li, Wei Wei |
Cacti with n-vertices and t cycles having extremal Wiener index. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Xiang-Jun Li, Bin Liu, Meijie Ma, Jun-Ming Xu 0001 |
Many-to-many disjoint paths in hypercubes with faulty vertices. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Qing Cui, Lingping Zhong |
On the general sum-connectivity index of trees with given number of pendent vertices. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Michel Mollard |
Non covered vertices in Fibonacci cubes by a maximum set of disjoint hypercubes. |
Discret. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Farzad Shaveisi |
A neigborhood union condition for nonadjacent vertices in graphs. |
Discret. Math. Algorithms Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Lili Guo, Xi Wang 0006, Cheng-Kuan Lin, Jingya Zhou, Jianxi Fan |
A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices. |
Int. J. Found. Comput. Sci. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Oleg V. Borodin, Anna O. Ivanova, D. V. Nikiforov |
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Sen-Peng Eu, Seunghyun Seo, Heesung Shin |
Enumerations of vertices among all rooted ordered trees with levels and degrees. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Shuya Chiba, Tomoki Yamashita |
Degree sum conditions for vertex-disjoint cycles passing through specified vertices. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Byung-Geun Oh |
On the number of vertices of positively curved planar graphs. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita |
Degree sum conditions for path-factors with specified end vertices in bipartite graphs. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer |
The minimum number of vertices in uniform hypergraphs with given domination number. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Oleg V. Borodin, Anna O. Ivanova |
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. |
Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Kohnosuke Ogiwara, Tatsuya Fukami, Norikazu Takahashi |
Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges. |
IEEE Trans. Control. Netw. Syst. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Daniela Schiefeneder, Markus Haltmeier |
The Radon Transform over Cones with Vertices on the Sphere and Orthogonal Axes. |
SIAM J. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Cheng-Kuan Lin, Yuan Zhao, Jianxi Fan, Baolei Cheng |
基于顶点度数的完全独立生成树研究 (Research on Completely Independent Spanning Trees Based on Degree of Vertices). |
计算机科学 |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Peter Borg, Kurt Fenech |
Reducing the maximum degree of a graph by deleting vertices. |
Australas. J Comb. |
2017 |
DBLP BibTeX RDF |
|
13 | Ehsan Estaji, Juan Alberto Rodríguez-Velázquez |
The strong metric dimension of generalized Sierpiński graphs with pendant vertices. |
Ars Math. Contemp. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Peter Hudák, Mária Maceková, Tomás Madaras, Pavol Siroczki |
More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges. |
Ars Math. Contemp. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Long-Tu Yuan, Xiao-Dong Zhang 0001 |
On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices. |
Ars Math. Contemp. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zdenek Dvorák 0001, Bernard Lidický, Bojan Mohar, Luke Postle |
5-list-coloring planar graphs with distant precolored vertices. |
J. Comb. Theory, Ser. B |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos |
Irrelevant vertices for the planar Disjoint Paths Problem. |
J. Comb. Theory, Ser. B |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu |
Planar Hypohamiltonian Graphs on 40 Vertices. |
J. Graph Theory |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zhi-Hong Chen |
Hamiltonicity and Degrees of Adjacent Vertices in Claw-Free Graphs. |
J. Graph Theory |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nicolas Trotignon, Kristina Vuskovic |
On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. |
J. Graph Theory |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ken-ichi Kawarabayashi, Kenta Ozeki, Michael D. Plummer |
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces. |
J. Graph Theory |
2017 |
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. |
J. Graph Theory |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Lucas C. Scabora, Paulo H. Oliveira, Daniel S. Kaster, Agma J. M. Traina, Caetano Traina Jr. |
Relational graph data management on the edge: Grouping vertices' neighborhood with Edge-k. |
SBBD |
2017 |
DBLP BibTeX RDF |
|
13 | Zahrah Yahya, Rahmita Wirza O. K. Rahmat, Fatimah Khalid, Amir Rizaan, Rizal Rahman |
An automated 3D modelling application based on vertices from 2D paper sketches. |
ICSCA |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Guoyi Chi, KengLiang Loi, Pongsak Lasang |
An Efficient Method to Find a Triangle with the Least Sum of Distances from Its Vertices to the Covered Point. |
ICVS |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Pilz, Emo Welzl, Manuel Wettstein |
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. |
SoCG |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Joshua Feldman, Jeannette C. M. Janssen |
High Degree Vertices and Spread of Infections in Spatially Modelled Social Networks. |
WAW |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Wei Ye 0001, Linfei Zhou, Dominik Mautz, Claudia Plant, Christian Böhm 0001 |
Learning from Labeled and Unlabeled Vertices in Networks. |
KDD |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Guillaume Ducoffe |
Finding Cut-Vertices in the Square Roots of a Graph. |
WG |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Javlon E. Isomurodov, Alexander A. Loboda, Alexey A. Sergushichev |
Ranking Vertices for Active Module Recovery Problem. |
AlCoB |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Klaus-Tycho Foerster, Linus Groner, Torsten Hoefler, Michael König 0001, Sascha Schmid, Roger Wattenhofer |
Multi-agent Pathfinding with n Agents on Graphs with n Vertices: Combinatorial Classification and Tight Algorithmic Bounds. |
CIAC |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Gribov |
Searching for a Compressed Polyline with a Minimum Number of Vertices (Discrete Solution). |
GREC |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nikolajs Nahimovs, Raqueline A. M. Santos |
Adjacent Vertices Can Be Hard to Find by Quantum Walks. |
SOFSEM |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Prosenjit Bose, Matias Korman, André van Renssen, Sander Verdonschot |
Constrained Routing Between Non-Visible Vertices. |
COCOON |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Erik M. Lindgren, Alexandros G. Dimakis, Adam R. Klivans |
Exact MAP Inference by Avoiding Fractional Vertices. |
ICML |
2017 |
DBLP BibTeX RDF |
|
13 | Vasiliy Kruglov, Andrey M. Zubkov |
Number of Pairs of Template Matchings in q-ary Tree with Randomly Marked Vertices. |
ACMPT |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Gribov |
Searching for a Compressed Polyline with a Minimum Number of Vertices. |
GREC@ICDAR |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ismael González Yero |
Vertices, edges, distances and metric dimension in graphs. |
Electron. Notes Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Dmitri V. Karpov |
Minimal k-connected Graphs with Small Number of Vertices of Degree k. |
Fundam. Informaticae |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Gabriel Coutinho |
Spectrally Extremal Vertices, Strong Cospectrality, and State Transfer. |
Electron. J. Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | M. G. Karunambigai, Muhammad Akram 0001, R. Buvaneswari |
Strong and superstrong vertices in intuitionistic fuzzy graphs. |
J. Intell. Fuzzy Syst. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Dean Crnkovic, Marija Maksimovic, Bernardo Gabriel Rodrigues, Sanja Rukavina |
Self-orthogonal codes from the strongly regular graphs on up to 40 vertices. |
Adv. Math. Commun. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Natarajan Meghanathan |
On the Sufficiency of Using Degree Sequence of the Vertices to Generate Random Networks Corresponding to Real-World Networks. |
Polibits |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Xie-Bin Chen |
Hamiltonicity of hypercubes with faulty vertices. |
Inf. Process. Lett. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Michele Borassi |
A note on the complexity of computing the number of reachable vertices in a digraph. |
Inf. Process. Lett. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Binlong Li, Liming Xiong, Jun Yin |
Large degree vertices in longest cycles of graphs, I. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Marisa Gutierrez, Silvia B. Tondato |
End simplicial vertices in path graphs. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Zheng Yan |
Spanning trees whose stems have a bounded number of branch vertices. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Michael A. Henning, Alister J. Marcon |
Vertices contained in all or in no minimum semitotal dominating set of a tree. |
Discuss. Math. Graph Theory |
2016 |
DBLP DOI 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. |
Comput. Optim. Appl. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Alexandru Lupan, Robert Bruce King |
Molybdatricarbaboranes as examples of isocloso metallaborane deltahedra with three carbon vertices. |
J. Comput. Chem. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Miklós Bóna |
On the number of vertices of each rank in phylogenetic trees and their generalizations. |
Discret. Math. Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ronan Hamon, Pierre Borgnat, Patrick Flandrin, Céline Robardet |
Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum. |
J. Complex Networks |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Mangayarkarasi Ramaiah, Bimal Kumar Ray |
An iterative point elimination technique to retain significant vertices on digital planar curves. |
Int. J. Comput. Vis. Robotics |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Arnau Padrol |
Extension Complexity of Polytopes with Few Vertices or Facets. |
SIAM J. Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ignacio García-Marco, Kolja Knauer |
Drawing graphs with vertices and edges in convex position. |
Comput. Geom. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Da-Wei Yang, Mei-Mei Gu |
Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges. |
Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ibrahim Tarawneh, Roslan Hasni, Ali Ahmad 0003 |
On the edge irregularity strength of corona product of cycle with isolated vertices. |
AKCE Int. J. Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Mohammad Taghi Hajiaghayi, Amey Bhangale, Rajiv Gandhi, Rohit Khandekar, Guy Kortsarz |
Bicovering: Covering edges with two small subsets of vertices. |
Electron. Colloquium Comput. Complex. |
2016 |
DBLP BibTeX RDF |
|
13 | Shaohua Zhang, Jin Yan, Suyun Jiang |
Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto |
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Zachary Cohn, Anant P. Godbole, Elizabeth Wright Harkness, Yiguang Zhang |
The Number of Seymour Vertices in Random Tournaments and Digraphs. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Binlong Li, Bo Ning 0001, Shenggui Zhang |
Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition. |
Graphs Comb. |
2016 |
DBLP DOI BibTeX RDF |
|
13 | Manoj Changat, Prasanth G. Narasimha-Shenoi, Mary Shallet T. J, R. Ram Kumar |
Directed graphs and its Boundary Vertices. |
CoRR |
2016 |
DBLP BibTeX RDF |
|