Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Toufik Mansour |
Interior vertices in set partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 101, pp. 60-69, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mansurul Bhuiyan, Mohammad Al Hasan |
Representing Graphs as Bag of Vertices and Partitions for Graph Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Sci. Eng. ![In: Data Sci. Eng. 3(2), pp. 150-165, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 332, pp. 449-456, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 337, pp. 487-493, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 331, pp. 112-119, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 18(2-3), pp. 1850010:1-1850010:13, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Marija Maksimovic |
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 10(6), pp. 212, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | António Girão, Kamil Popielarz |
Large Induced Subgraphs with k Vertices of Almost Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 32(1), pp. 450-454, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 38(4), pp. 779-801, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(5), pp. 1412-1438, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 95, pp. 109-121, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Iksanov, Zakhar Kabluchko |
Weak convergence of the number of vertices at intermediate levels of random recursive trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Probab. ![In: J. Appl. Probab. 55(4), pp. 1131-1142, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mathew D. Penrose |
Inhomogeneous random graphs, isolated vertices, and Poisson approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Probab. ![In: J. Appl. Probab. 55(1), pp. 112-136, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 30(10), pp. 1999-2012, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.08772, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Nevena Maric |
Cut polytope has vertices on a line. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.03212, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Gregory Z. Gutin, George B. Mertzios, Felix Reidl |
Searching for Maximum Out-Degree Vertices in Tournaments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.04702, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Oleh O. Dmytrenko, Dmitry V. Lande |
The Algorithm of Accumulated Mutual Influence of The Vertices in Semantic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.07251, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.01332, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Christos Pelekis |
On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.04166, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.03158, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Kshitij Gajjar, Jaikumar Radhakrishnan |
Minimizing Branching Vertices in Distance-preserving Subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.11656, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Panagiotis Charalampopoulos, Shay Mozes, Benjamin Tebeka |
Exact Distance Oracles for Planar Graphs with Failing Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.05968, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Minjia Shi, Denis S. Krotov, Patrick Solé |
A new distance-regular graph of diameter 3 on 1024 vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.07069, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Yu Yang 0001, Zhefeng Wang, Tianyuan Jin, Jian Pei, Enhong Chen |
Tracking Top-K Influential Vertices in Dynamic Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.01499, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Laurent Feuilloley, Michel Habib |
Graph classes and forbidden patterns on three vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.05913, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.03905, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.01595, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.09021, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | S. Ramachandran, P. Bhanumathy |
Digraph Isomorpshism Using Subdigraph Equivalent Vertices And Degree Pair Association. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 137, pp. 373-394, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Supaporn Saduakdee, Varanoot Khemmani |
γ-Max Labelings of Graphs with Exterior Major Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 138, pp. 291-304, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Mei-Mei Gu, Rong-Xia Hao |
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 140, pp. 45-61, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 139, pp. 297-313, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Weisheng Zhao, Xiaolu Gao, Heping Zhang |
Construction for Trees without vertices contained in all minimum dominating sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 138, pp. 3-16, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Shahab Faruqi, S. A. Katre, Dinesh G. Sarvate |
Decompositions Of λKv Into Multigraphs With Four Vertices And Five Edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 136, pp. 287-316, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Joan Boyar, Christian Kudahl |
Adding isolated vertices makes some greedy online algorithms optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 246, pp. 12-21, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Dongqin Cheng |
Cycles embedding in balanced hypercubes with faulty edges and vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 238, pp. 56-69, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 10(2), pp. 1850015:1-1850015:12, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mehdy Roayaei, Mohammadreza Razzazi |
Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 29(7), pp. 1215-1230, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 83, pp. 376-389, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 20(8), pp. 586, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(3), pp. 825-829, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | J. Pascal Gollin, Karl Heuer |
Infinite end-devouring sets of rays with prescribed start vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(7), pp. 2117-2120, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jonathan Baker, Kevin N. Vander Meulen, Adam Van Tuyl |
Shedding vertices of vertex decomposable well-covered graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(12), pp. 3355-3369, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Ju Zhou |
Characterization of the induced matching extendable graphs with 2n vertices and 3n edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(4), pp. 1021-1031, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 341(8), pp. 2276-2284, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
J. Comput. Geom. ![In: J. Comput. Geom. 9(1), pp. 94-130, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Michel Grabisch, Peter Sudhölter |
On a class of vertices of the core. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Games Econ. Behav. ![In: Games Econ. Behav. 108, pp. 541-557, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Michel Deza, Mathieu Dutour Sikiric |
The hypermetric cone and polytope on eight vertices and some generalizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 88, pp. 67-84, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Christoph Thäle |
Central Limit Theorem for the Volume of Random Polytopes with Vertices on the Boundary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 59(4), pp. 990-1000, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Salman Parsa |
On the Links of Vertices in Simplicial d-Complexes Embeddable in the Euclidean 2d-Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 59(3), pp. 663-679, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xueliang Li 0001, Yan Zhao 0013 |
On extremal graphs with exactly one Steiner tree connecting any k vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 70, pp. 1-11, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | A. D. Forbes, Terry S. Griggs |
Designs for graphs with six vertices and nine edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 70, pp. 52-74, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Quantum Inf. Process. ![In: Quantum Inf. Process. 17(4), pp. 81, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Yue Ma, Weiyin Ma |
Subdivision schemes with optimal bounded curvature near extraordinary vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Graph. Forum ![In: Comput. Graph. Forum 37(7), pp. 455-467, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Dima Kagan, Yuval Elovici, Michael Fire |
Generic anomalous vertices detection utilizing a link prediction algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soc. Netw. Anal. Min. ![In: Soc. Netw. Anal. Min. 8(1), pp. 27, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 29(4), pp. 792-806, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Biol. ![In: J. Comput. Biol. 25(10), pp. 1071-1090, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 36(1), pp. 1-12, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jens M. Schmidt |
Tight bounds for the vertices of degree k in minimally k-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 88(1), pp. 146-153, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Zhiquan Hu, Feifei Song |
Long cycles passing through ⌊4k+13⌋ vertices in k-connected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 87(3), pp. 374-393, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Henning Bruhn, Felix Joos, Oliver Schaudt |
Long cycles through prescribed vertices have the Erdős-Pósa property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 87(3), pp. 275-284, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Applications of Big Data Analytics ![In: Applications of Big Data Analytics, Trends, Issues, and Challenges., pp. 161-175, 2018, Springer, 978-3-319-76471-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1916-1933, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCCS (5) ![In: Cloud Computing and Security - 4th International Conference, ICCCS 2018, Haikou, China, June 8-10, 2018, Revised Selected Papers, Part V, pp. 574-583, 2018, Springer, 978-3-030-00017-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, pp. 51:1-51:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-081-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Flavio Chierichetti, Shahrzad Haddadan |
On the Complexity of Sampling Vertices Uniformly from a Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 149:1-149:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-076-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, IPDPS Workshops 2018, Vancouver, BC, Canada, May 21-25, 2018, pp. 287-296, 2018, IEEE Computer Society, 978-1-5386-5555-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Massinissa Merabet, Jitamitra Desai, Miklós Molnár |
A Generalization of the Minimum Branch Vertices Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers, pp. 338-351, 2018, Springer, 978-3-319-96150-7. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 26:1-26:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications - 23rd Iberoamerican Congress, CIARP 2018, Madrid, Spain, November 19-22, 2018, Proceedings, pp. 376-383, 2018, Springer, 978-3-030-13468-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | David Gillman, Dana Randall |
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AofA ![In: 29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden, pp. 24:1-24:17, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-078-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Khaled M. Elbassioni, Kazuhisa Makino |
Enumerating Vertices of 0/1-Polyhedra associated with 0/1-Totally Unimodular Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, June 18-20, 2018, Malmö, Sweden, pp. 18:1-18:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-068-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25-29, 2018, pp. 17-29, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Hang Gao, Wenyu Gao |
Kernelization for Maximum Happy Vertices Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 16-19, 2018, Proceedings, pp. 504-514, 2018, Springer, 978-3-319-77403-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Georgi Evtimov, Stefka Fidanova |
Subtraction of Two 2D Polygons with Some Matching Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NMA ![In: Numerical Methods and Applications - 9th International Conference, NMA 2018, Borovets, Bulgaria, August 20-24, 2018, Revised Selected Papers, pp. 80-87, 2018, Springer, 978-3-030-10691-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, pp. 229-237, 2018, International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BIC-TA (1) ![In: Bio-inspired Computing: Theories and Applications - 13th International Conference, BIC-TA 2018, Beijing, China, November 2-4, 2018, Proceedings, Part I, pp. 186-197, 2018, Springer, 978-981-13-2825-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Vadim E. Levit, Eugen Mandrescu |
W2-graphs and shedding vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 61, pp. 797-803, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Mahipal Jadeja, Rahul Muthu, V. Sunitha |
Set Labelling Vertices To Ensure Adjacency Coincides With Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 63, pp. 237-244, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 121, pp. 34-38, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 68(3), pp. 749-773, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. ![In: Pattern Recognit. 65, pp. 296-306, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 65(2), pp. 433-445, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 81, pp. 322-332, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Gilles Caporossi |
Variable Neighborhood Search for extremal vertices : The AutoGraphiX-III system. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Oper. Res. ![In: Comput. Oper. Res. 78, pp. 431-438, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Zhusheng Pan, Liudong Xing, Yuchang Mo |
A new reliability evaluation method for networks with imperfect vertices using BDD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Qual. Reliab. Eng. Int. ![In: Qual. Reliab. Eng. Int. 33(8), pp. 1957-1967, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Carlos A. Alfaro, Hugo Corrales, Carlos E. Valencia |
Critical ideals of signed graphs with twin vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 86, pp. 99-131, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nana Wang |
Reversible watermarking for 2D vector maps based on normalized vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 76(20), pp. 20935-20953, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Nana Wang |
Erratum to: Reversible watermarking for 2D vector maps based on normalized vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Multim. Tools Appl. ![In: Multim. Tools Appl. 76(20), pp. 20955-20956, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 315, pp. 298-312, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 305, pp. 166-173, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Qing Cui, Lingping Zhong |
The general Randić index of trees with given number of pendent vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 302, pp. 111-121, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Integer Seq. ![In: J. Integer Seq. 20(10), pp. 17.10.6, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(1), pp. 190-209, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(4), pp. 2626-2646, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(2), pp. 766-782, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 21(6), pp. 1027-1038, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | James A. Tilley |
D-resolvability of vertices in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 21(4), pp. 649-661, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
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) |
Algorithmica ![In: Algorithmica 79(1), pp. 189-210, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|