Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Toufik Mansour |
Interior vertices in set partitions. |
Adv. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mansurul Bhuiyan, Mohammad Al Hasan |
Representing Graphs as Bag of Vertices and Partitions for Graph Classification. |
Data Sci. Eng. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Antonio González, Carmen Hernando 0001, Mercè Mora |
Metric-locating-dominating sets of graphs for constructing related subsets of vertices. |
Appl. Math. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Deyan Zeng, Jian-Hua Yin |
An extremal problem on graphic sequences with a realization containing every ℓ-tree on k vertices. |
Appl. Math. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Guisheng Jiang, Guidong Yu, Wei Sun, Zheng Ruan |
The least eigenvalue of graphs whose complements have only two pendent vertices. |
Appl. Math. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Chunxia Wang, Yalan Li, Shumin Zhang, Chengfu Ye, Xia Wang |
Matching Preclusion Number of Radix Triangular Mesh with Odd Vertices. |
J. Interconnect. Networks |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Marija Maksimovic |
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group. |
Symmetry |
2018 |
DBLP DOI BibTeX RDF |
|
13 | António Girão, Kamil Popielarz |
Large Induced Subgraphs with k Vertices of Almost Maximum Degree. |
SIAM J. Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Flavia Bonomo, Maria Chudnovsky, Peter Maceli, Oliver Schaudt, Maya Stein, Mingxian Zhong |
Three-Coloring and List Three-Coloring of Graphs Without Induced Paths on Seven Vertices. |
Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Peng Zhang 0008, Yao Xu, Tao Jiang 0001, Angsheng Li, Guohui Lin, Eiji Miyano |
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. |
Algorithmica |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Yuping Ke, Yixin Cao 0001, Xiating Ouyang, Wenjun Li 0001, Jianxin Wang 0001 |
Unit interval vertex deletion: Fewer vertices are relevant. |
J. Comput. Syst. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Iksanov, Zakhar Kabluchko |
Weak convergence of the number of vertices at intermediate levels of random recursive trees. |
J. Appl. Probab. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mathew D. Penrose |
Inhomogeneous random graphs, isolated vertices, and Poisson approximation. |
J. Appl. Probab. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jing Ma 0002, Bin Yao 0002, Xiaofeng Gao 0001, Yanyan Shen, Minyi Guo |
Top-kCritical Vertices Query on Shortest Path. |
IEEE Trans. Knowl. Data Eng. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Nevena Maric |
Cut polytope has vertices on a line. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Gregory Z. Gutin, George B. Mertzios, Felix Reidl |
Searching for Maximum Out-Degree Vertices in Tournaments. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Oleh O. Dmytrenko, Dmitry V. Lande |
The Algorithm of Accumulated Mutual Influence of The Vertices in Semantic Networks. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Herman J. Haverkort |
Finding the vertices of the convex hull, even unordered, takes Omega(n log n) time - a proof by reduction from epsilon-closeness. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Christos Pelekis |
On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Gauvain Devillez, Alain Hertz, Hadrien Mélot, Pierre Hauweele |
Minimum Eccentric Connectivity Index for Graphs with Fixed Order and Fixed Number of Pending Vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Kshitij Gajjar, Jaikumar Radhakrishnan |
Minimizing Branching Vertices in Distance-preserving Subgraphs. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka |
Exact Distance Oracles for Planar Graphs with Failing Vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Minjia Shi, Denis S. Krotov, Patrick Solé |
A new distance-regular graph of diameter 3 on 1024 vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Yu Yang 0001, Zhefeng Wang, Tianyuan Jin, Jian Pei, Enhong Chen |
Tracking Top-K Influential Vertices in Dynamic Networks. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Laurent Feuilloley, Michel Habib |
Graph classes and forbidden patterns on three vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Zhiyi Huang 0002, Ning Kang 0001, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001, Xue Zhu |
How to Match when All Vertices Arrive Online. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Alexander Pilz, Emo Welzl, Manuel Wettstein |
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner |
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. |
CoRR |
2018 |
DBLP BibTeX RDF |
|
13 | S. Ramachandran, P. Bhanumathy |
Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Supaporn Saduakdee, Varanoot Khemmani |
γ-Max Labelings of Graphs with Exterior Major Vertices. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Mei-Mei Gu, Rong-Xia Hao |
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Adam Gilbert, Gary Tiner |
On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Weisheng Zhao, Xiaolu Gao, Heping Zhang |
Construction for Trees without vertices contained in all minimum dominating sets. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Shahab Faruqi, S. A. Katre, Dinesh G. Sarvate |
Decompositions Of λKv Into Multigraphs With Four Vertices And Five Edges. |
Ars Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding isolated vertices makes some greedy online algorithms optimal. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Dongqin Cheng |
Cycles embedding in balanced hypercubes with faulty edges and vertices. |
Discret. Appl. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Sohaib Khalid, Akbar Ali |
On the zeroth-order general Randić index, variable sum exdeg index and trees having vertices with prescribed degree. |
Discret. Math. Algorithms Appl. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mehdy Roayaei, Mohammadreza Razzazi |
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs. |
Int. J. Found. Comput. Sci. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Min Liu, Zhen Xiong, Yue Ma, Peng Zhang, Jianliang Wu, Xingqin Qi |
DPRank centrality: Finding important vertices based on random walks with a new defined transition matrix. |
Future Gener. Comput. Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xin Wang 0111, Yi Zhang 0097, Kai Lu, Xiaoping Wang, Kai Liu |
Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk. |
Entropy |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak, Ekaterina I. Vasil'eva |
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | J. Pascal Gollin, Karl Heuer |
Infinite end-devouring sets of rays with prescribed start vertices. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jonathan Baker, Kevin N. Vander Meulen, Adam Van Tuyl |
Shedding vertices of vertex decomposable well-covered graphs. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Ju Zhou |
Characterization of the induced matching extendable graphs with 2n vertices and 3n edges. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Yoshimi Egawa, Michitaka Furuya |
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. |
Discret. Math. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Giordano Da Lozzo, Vida Dujmovic, Fabrizio Frati, Tamara Mchedlidze, Vincenzo Roselli |
Drawing planar graphs with many collinear vertices. |
J. Comput. Geom. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Michel Grabisch, Peter Sudhölter |
On a class of vertices of the core. |
Games Econ. Behav. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Michel Deza, Mathieu Dutour Sikiric |
The hypermetric cone and polytope on eight vertices and some generalizations. |
J. Symb. Comput. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Christoph Thäle |
Central Limit Theorem for the Volume of Random Polytopes with Vertices on the Boundary. |
Discret. Comput. Geom. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Salman Parsa |
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. |
Discret. Comput. Geom. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xueliang Li 0001, Yan Zhao 0013 |
On extremal graphs with exactly one Steiner tree connecting any k vertices. |
Australas. J Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | A. D. Forbes, Terry S. Griggs |
Designs for graphs with six vertices and nine edges. |
Australas. J Comb. |
2018 |
DBLP BibTeX RDF |
|
13 | Adam Glos, Aleksandra Krawiec, Ryszard Kukulski, Zbigniew Puchala |
Vertices cannot be hidden from quantum spatial search for almost all random graphs. |
Quantum Inf. Process. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Yue Ma, Weiyin Ma |
Subdivision schemes with optimal bounded curvature near extraordinary vertices. |
Comput. Graph. Forum |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Dima Kagan, Yuval Elovici, Michael Fire |
Generic anomalous vertices detection utilizing a link prediction algorithm. |
Soc. Netw. Anal. Min. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Shuguang Ding, Xiangli Nie, Hong Qiao, Bo Zhang 0006 |
A Fast Algorithm of Convex Hull Vertices Selection for Online Classification. |
IEEE Trans. Neural Networks Learn. Syst. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Yu Bao, Morihiro Hayashida, Pengyu Liu 0002, Masayuki Ishitsuka, Jose C. Nacher, Tatsuya Akutsu |
Analysis of Critical and Redundant Vertices in Controlling Directed Complex Networks Using Feedback Vertex Sets. |
J. Comput. Biol. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Wai Lam Fong, Wai Hong Chan, Ge Nong |
The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices. |
J. Comb. Optim. |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jens M. Schmidt |
Tight bounds for the vertices of degree k in minimally k-connected graphs. |
J. Graph Theory |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Zhiquan Hu, Feifei Song |
Long cycles passing through ⌊4k+13⌋ vertices in k-connected graphs. |
J. Graph Theory |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Henning Bruhn, Felix Joos, Oliver Schaudt |
Long cycles through prescribed vertices have the Erdős-Pósa property. |
J. Graph Theory |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mohamad Al Hajj Hassan, Mostafa Bamha |
Handling Pregel's Limits in Big Graph Processing in the Presence of High-Degree Vertices. |
Applications of Big Data Analytics |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001 |
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. |
SODA |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xi Li 0014, Hanwu Chen, Zhihao Liu, Wenjie Liu 0001, Mengke Xu |
Spatial Search for Two Marked Vertices on Hypercube by Continuous-Time Quantum Walk. |
ICCCS (5) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Iyad A. Kanj, Christian Komusiewicz, Manuel Sorge, Erik Jan van Leeuwen |
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around. |
ESA |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Flavio Chierichetti, Shahrzad Haddadan |
On the Complexity of Sampling Vertices Uniformly from a Graph. |
ICALP |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Geoffrey Sanders, Roger Pearce, Timothy La Fond, Jeremy Kepner |
On Large-Scale Graph Generation with Validation of Diverse Triangle Statistics at Edges and Vertices. |
IPDPS Workshops |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Massinissa Merabet, Jitamitra Desai, Miklós Molnár |
A Generalization of the Minimum Branch Vertices Spanning Tree Problem. |
ISCO |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Pavel Dvorák, Andreas Emil Feldmann, Dusan Knop, Tomás Masarík, Tomas Toufar, Pavel Veselý 0001 |
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices. |
STACS |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Pedro Company, Peter A. C. Varley, Raquel Plumed, Jorge D. Camba |
Detection of Vertices in Sketched Drawings of Polyhedral Shapes. |
CIARP |
2018 |
DBLP DOI BibTeX RDF |
|
13 | David Gillman, Dana Randall |
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices. |
AofA |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Khaled M. Elbassioni, Kazuhisa Makino |
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. |
SWAT |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Zhiyi Huang 0002, Ning Kang 0001, Zhihao Gavin Tang, Xiaowei Wu 0001, Yuhao Zhang 0001, Xue Zhu |
How to match when all vertices arrive online. |
STOC |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Hang Gao, Wenyu Gao |
Kernelization for Maximum Happy Vertices Problem. |
LATIN |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Georgi Evtimov, Stefka Fidanova |
Subtraction of Two 2D Polygons with Some Matching Vertices. |
NMA |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Alessandro Riva, Jacopo Banfi, Carlo Fanton, Nicola Basilico, Francesco Amigoni |
A Journey Among Pairs of Vertices: Computing Robots' Paths for Performing Joint Measurements. |
AAMAS |
2018 |
DBLP BibTeX RDF |
|
13 | Kai Zhang 0002, Yunfeng Shao 0003, Zhaozong Zhang, Wei Hu 0001 |
An Efficient Genetic Algorithm for Solving Constraint Shortest Path Problem Through Specified Vertices. |
BIC-TA (1) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Vadim E. Levit, Eugen Mandrescu |
W2-graphs and shedding vertices. |
Electron. Notes Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Mahipal Jadeja, Rahul Muthu, V. Sunitha |
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. |
Electron. Notes Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Hon-Chan Chen, Yun-Hao Zou, Yue-Li Wang, Kung-Jui Pai |
A note on path embedding in crossed cubes with faulty vertices. |
Inf. Process. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Mercedes Landete, Alfredo Marín 0001, José L. Sainz-Pardo |
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. |
Comput. Optim. Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Xun Yu, Yongsheng Gao 0001, Jun Zhou 0001 |
Sparse 3D directional vertices vs continuous 3D curves: Efficient 3D surface matching and its application for single model face recognition. |
Pattern Recognit. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Alper Atamtürk, Andrés Gómez 0001 |
Maximizing a Class of Utility Functions Over the Vertices of a Polytope. |
Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Selene Silvestri, Gilbert Laporte, Raffaele Cerulli |
A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. |
Comput. Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Gilles Caporossi |
Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system. |
Comput. Oper. Res. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zhusheng Pan, Liudong Xing, Yuchang Mo |
A new reliability evaluation method for networks with imperfect vertices using BDD. |
Qual. Reliab. Eng. Int. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Carlos A. Alfaro, Hugo Corrales, Carlos E. Valencia |
Critical ideals of signed graphs with twin vertices. |
Adv. Appl. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nana Wang |
Reversible watermarking for 2D vector maps based on normalized vertices. |
Multim. Tools Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nana Wang |
Erratum to: Reversible watermarking for 2D vector maps based on normalized vertices. |
Multim. Tools Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zehui Shao, Pu Wu, Yingying Gao, Ivan Gutman, Xiujun Zhang |
On the maximum ABC index of graphs without pendent vertices. |
Appl. Math. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ming-Zhu Chen, Bo Zhou 0007 |
On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices. |
Appl. Math. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Qing Cui, Lingping Zhong |
The general Randić index of trees with given number of pendent vertices. |
Appl. Math. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Marcelo Firer, Karine Bobadilha Couto, Eduardo Brandani da Silva |
Enumeration of Vertices, Edges and Polygons in Tessellations of the Plane. |
J. Integer Seq. |
2017 |
DBLP BibTeX RDF |
|
13 | James M. Carraher, Stephen G. Hartke |
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three. |
SIAM J. Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz |
Bi-Covering: Covering Edges with Two Small Subsets of Vertices. |
SIAM J. Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Naonori Kakimura, Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 |
Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs. |
SIAM J. Discret. Math. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Sumner Magruder, Stefan Bonn |
Root demotion: efficient post-processing of layered graphs to reduce dummy vertices for hierarchical graph drawing. |
J. Graph Algorithms Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | James A. Tilley |
D-resolvability of vertices in planar graphs. |
J. Graph Algorithms Appl. |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ondrej Suchý |
Extending the Kernel for Planar Steiner Tree to the Number of Steiner Vertices. |
Algorithmica |
2017 |
DBLP DOI BibTeX RDF |
|