Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Heng Guo 0001, Mark Jerrum |
Counting vertices of integer polytopes defined by facets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.01469, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Heng Yang 0002, Ling Liang, Kim-Chuan Toh, Luca Carlone |
STRIDE along Spectrahedral Vertices for Solving Large-Scale Rank-One Semidefinite Relaxations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.14033, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho, Jinde Cao |
Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.15374, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Yu Zhu 0003, Boning Li, Santiago Segarra |
Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.10169, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Gustavo A. Bezerra, Pedro H. G. Lugão, Renato Portugal |
Quantum walk-based search algorithms with multiple marked vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.12878, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Sai Vamshi Samala, Subhajit Pramanick, Debasish Pattanayak, Partha Sarathi Mandal 0001 |
Filling MIS Vertices by Myopic Luminous Robots. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.04885, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke |
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.06192, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Guido Montúfar, Yue Ren, Leon Zhang |
Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.08135, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Debsoumya Chakraborti, Jaehoon Kim, Jinha Kim, Minki Kim, Hong Liu 0010 |
Well-mixing vertices and almost expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.12864, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Sándor Bozóki, Gábor Domokos, Flórián Kovács, Krisztina Regos |
Mono-monostatic polyhedra with uniform point masses have at least 8 vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.12769, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Vladimir V. Mazalov, V. A. Khitraya |
A Modified Myerson Value for Determining the Centrality of Graph Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Remote. Control. ![In: Autom. Remote. Control. 82(1), pp. 145-159, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Nili Guttmann-Beck, Roni Rozen, Michal Stern |
Vertices removal for feasibility of clustered spanning trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 296, pp. 68-84, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Che-Nan Kuo, Yu-Huei Cheng |
Every edge lies on cycles of folded hypercubes with a pair of faulty adjacent vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 294, pp. 1-9, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Vladimir Bozovic, Zana Kovijanic Vukicevic, Goran Popivoda, Rong-Ying Pan, Xiao-Dong Zhang 0001 |
Extreme Wiener indices of trees with given number of vertices of maximum degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 304, pp. 23-31, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Roghayeh Hafezieh, Mohammad Ali Hosseinzadeh, Samaneh Hossein-Zadeh, Ali Iranmanesh |
On cut vertices and eigenvalues of character graphs of solvable groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 303, pp. 86-93, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Valentin Bouquet, François Delbot, Christophe Picouleau |
On the vertices belonging to all, some, none minimum dominating set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 288, pp. 9-19, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi |
A method for enumerating pairwise compatibility graphs with a given number of vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 303, pp. 171-185, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Jérémie Turcotte, Samuel Yvon |
4-cop-win graphs have at least 19 vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 301, pp. 74-98, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Sergei Chubanov |
Correction to: A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 190(1), pp. 103-104, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Sergei Chubanov |
A scaling algorithm for optimizing arbitrary functions over vertices of polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 190(1), pp. 89-102, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Francesco Carrabs, Raffaele Cerulli, Ciriaco D'Ambrosio, Federica Laureana |
The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Optim. Theory Appl. ![In: J. Optim. Theory Appl. 188(2), pp. 356-377, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Amélia Fonseca, Ângela Mestre, Ali Mohammadian, Cecília Perdigão, Maria Manuel Torres |
The maximum number of Parter vertices of acyclic matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(2), pp. 112198, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Milica Andelic, Domingos M. Cardoso, Slobodan K. Simic, Zoran Stanic |
The main vertices of a star set and related graph parameters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(12), pp. 112593, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Primoz Potocnik, Micael Toledo |
Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(2), pp. 112195, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Shuchao Li, Xuechao Li, Bing Wei 0001 |
Long cycles through specified vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(4), pp. 112274, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Jacob Fox, Lisa Sauermann, Fan Wei |
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 59(4), pp. 554-615, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Reyes-Lastiri, Hans J. Cappon, Karel J. Keesman |
Set-membership parameter estimation based on Voronoi vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Environ. Model. Softw. ![In: Environ. Model. Softw. 143, pp. 105125, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Lucía M. González, Luciano N. Grippo, Martín D. Safe |
Formulas in connection with parameters related to convexity of paths on three vertices: caterpillars and unit interval graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 79, pp. 401-423, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Naoki Matsumoto, Masaki Yamamoto 0001, Masahito Yamazaki |
The minimum number of vertices of graphs containing two monochromatic triangles for any edge $2$-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 81, pp. 208-232, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Lidija Comic |
A Combinatorial Coordinate System for the Vertices in the Octagonal $C_{4}C_{8}(S)$ Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPA ![In: 12th International Symposium on Image and Signal Processing and Analysis, ISPA 2021, Zagreb, Croatia, September 13-15, 2021, pp. 235-240, 2021, IEEE, 978-1-6654-2639-8. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Alexander van der Grinten, Eugenio Angriman, Maria Predari, Henning Meyerhenke |
New Approximation Algorithms for Forest Closeness Centrality - for Individual Vertices and Vertex Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SDM ![In: Proceedings of the 2021 SIAM International Conference on Data Mining, SDM 2021, Virtual Event, April 29 - May 1, 2021., pp. 136-144, 2021, SIAM, 978-1-61197-670-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Sonja Stüdli, Yamin Yan, María M. Seron, Richard H. Middleton |
Plug-and-Play Networks: Adding Vertices and Connections to Preserve Algebraic Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 2021 60th IEEE Conference on Decision and Control (CDC), Austin, TX, USA, December 14-17, 2021, pp. 4823-4828, 2021, IEEE, 978-1-6654-3659-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Luciano S. de Souza, Jonathan H. A. de Carvalho, Tiago A. E. Ferreira |
Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
BRACIS (1) ![In: Intelligent Systems - 10th Brazilian Conference, BRACIS 2021, Virtual Event, November 29 - December 3, 2021, Proceedings, Part I, pp. 249-263, 2021, Springer, 978-3-030-91701-2. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Ricardo Velezmoro-León, Robert Ipanaqué Chero, Felícita Marcela Velásquez-Fernández, Jorge Jimenez Gomez |
Construction of Polyhedra Whose Vertices are Points on Curve Which Lying on Lemniscatic Torus with Mathematica. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (2) ![In: Computational Science and Its Applications - ICCSA 2021 - 21st International Conference, Cagliari, Italy, September 13-16, 2021, Proceedings, Part II, pp. 3-17, 2021, Springer, 978-3-030-86959-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein |
New Bounds for the Vertices of the Integer Hull. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 25-36, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Ran Gu, Gregory Z. Gutin, Shasha Li, Yongtang Shi, Zhenyu Taoqiu |
The Smallest Number of Vertices in a 2-Arc-Strong Digraph Without Pair of Arc-Disjoint In- and Out-Branchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings, pp. 318-332, 2021, Springer, 978-3-030-92680-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Xiaochen Liu, Weiguo Zheng, Zhenyi Chen, Zhenying He, X. Sean Wang |
Incrementally Finding the Vertices Absent from the Maximum Independent Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PAKDD (1) ![In: Advances in Knowledge Discovery and Data Mining - 25th Pacific-Asia Conference, PAKDD 2021, Virtual Event, May 11-14, 2021, Proceedings, Part I, pp. 421-433, 2021, Springer, 978-3-030-75761-8. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Zint, Roberto Grosso |
On the Link between Mesh Size Adaptation and Irregular Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VISIGRAPP (1: GRAPP) ![In: Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, VISIGRAPP 2021, Volume 1: GRAPP, Online Streaming, February 8-10, 2021., pp. 67-74, 2021, SCITEPRESS, 978-989-758-488-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Arash Tavakoli, Mehdi Fatemi, Petar Kormushev |
Learning to Represent Action Values as a Hypergraph on the Action Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: 9th International Conference on Learning Representations, ICLR 2021, Virtual Event, Austria, May 3-7, 2021, 2021, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
13 | Lidija Comic |
A Combinatorial Coordinate System for the Vertices in the Octagonal C4C8(R) Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAIP (1) ![In: Computer Analysis of Images and Patterns - 19th International Conference, CAIP 2021, Virtual Event, September 28-30, 2021, Proceedings, Part I, pp. 69-78, 2021, Springer, 978-3-030-89127-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Yu Zhu 0003, Boning Li, Santiago Segarra |
Co-clustering Vertices and Hyperedges via Spectral Hypergraph Partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUSIPCO ![In: 29th European Signal Processing Conference, EUSIPCO 2021, Dublin, Ireland, August 23-27, 2021, pp. 1416-1420, 2021, IEEE, 978-9-0827-9706-0. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
13 | Andre Löffler |
Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2021 |
RDF |
|
13 | Dawei He, Yan Wang, Xingxing Yu |
The Kelmans-Seymour conjecture II: 2-Vertices in K4-. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 144, pp. 225-264, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Louigi Addario-Berry, Maria Chudnovsky, Frédéric Havet, Bruce A. Reed, Paul D. Seymour |
Corrigendum to "Bisimplicial vertices in even-hole-free graphs". ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 142, pp. 374-375, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Dawei He, Yan Wang, Xingxing Yu |
The Kelmans-Seymour conjecture III: 3-vertices in K4-. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 144, pp. 265-308, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Kathie Cameron, Carsten Thomassen |
Cycles containing all the odd-degree vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 143, pp. 219-225, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Samantha Dahlberg, Adrian She, Stephanie van Willigenburg |
Schur and e-Positivity of Trees and Cut Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(1), pp. 1, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Jared Culbertson, Anton Dochtermann, Dan P. Guralnik, Peter F. Stiller |
Extendable Shellability for $d$-Dimensional Complexes on $d+3$ Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(3), pp. 3, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Anna Kompisová, Robert Lukot'ka |
Short Cycle Covers of Graphs with at Most 77% Vertices of Degree Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 27(4), pp. 4, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Ewa Drgas-Burchardt, Elzbieta Sidorowicz |
Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(3), pp. 893-917, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva |
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(4), pp. 985-994, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Tian Tian, Liming Xiong |
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(1), pp. 85-106, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Nawarat Ananchuen, Pawaton Kaemawichanurat |
Connected domination critical graphs with cut vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(4), pp. 1035-1055, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Carlos M. da Fonseca, Zhibin Du |
The number of P-vertices of singular acyclic matrices: An inverse problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 40(2), pp. 525-532, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Imed Boudabbous, Walid Marweni |
Description of the Triangle-free Prime Graphs Having at Most Two Non Critical Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Multiple Valued Log. Soft Comput. ![In: J. Multiple Valued Log. Soft Comput. 34(1-2), pp. 77-103, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Brendan D. McKay, Fang Tian |
Asymptotic enumeration of linear hypergraphs with given number of vertices and edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 115, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Youcef Magnouche, Sébastien Martin |
Most vital vertices for the shortest s-t path problem: complexity and Branch-and-Cut algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 14(8), pp. 2039-2053, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin, Carlos Aníbal Suárez |
Correction to: Distance between vertices of lattice polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 14(2), pp. 327-328, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Anna Deza, Antoine Deza, Zhongyan Guan, Lionel Pournin |
Distance between vertices of lattice polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 14(2), pp. 309-326, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Mohammad Javad Nadjafi-Arani, Mahsa Mirzargar, Frank Emmert-Streib, Matthias Dehmer |
Partition and Colored Distances in Graphs Induced to Subsets of Vertices and Some of Its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 12(12), pp. 2027, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Michal Stas |
On the Crossing Numbers of the Joining of a Specific Graph on Six Vertices with the Discrete Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 12(1), pp. 135, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Khaled M. Elbassioni, Kazuhisa Makino |
Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(1), pp. 843-864, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Iyad 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) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 34(1), pp. 640-681, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Sávio Vinícius Albieri Barone Cantero, Diogo Nunes Gonçalves, Leonardo F. S. Scabini, Wesley Nunes Gonçalves |
Importance of Vertices in Complex Networks Applied to Texture Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Cybern. ![In: IEEE Trans. Cybern. 50(2), pp. 777-786, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan |
Tackling the maximum happy vertices problem in large networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 18(4), pp. 507-527, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Alexander Wang, Hailun Zheng |
Centrally symmetric and balanced triangulations of S2×Sd-3 with few vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 85, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Michael Fire, Carlos Guestrin |
The rise and fall of network stars: Analyzing 2.5 million graphs to reveal how high-degree vertices emerge over time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Manag. ![In: Inf. Process. Manag. 57(2), pp. 102041, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Rinovia Simanjuntak, Susilawati, Edy Tri Baskoro |
Total vertex irregularity strength for trees with many vertices of degree two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Graph Theory Appl. ![In: Electron. J. Graph Theory Appl. 8(2), pp. 415-421, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | M. Ilayaraja, K. Sowndhariya, Appu Muthusamy |
Decomposition of product graphs into paths and stars on five vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AKCE Int. J. Graphs Comb. ![In: AKCE Int. J. Graphs Comb. 17(3), pp. 777-783, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Stefan Kratsch, Magnus Wahlström |
Representative Sets and Irrelevant Vertices: New Tools for Kernelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 67(3), pp. 16:1-16:50, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Yoshihiro Asayama, Ryo Matsukawa, Naoki Matsumoto, Atsuhiro Nakamoto |
N-Flips in Triangulations with Two Odd Degree Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(3), pp. 469-490, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin |
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(3), pp. 491-501, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Xihe Li, Ligong Wang 0001 |
Correction to: Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(6), pp. 1619-1622, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Kieran Clancy, Michael Haythorpe, Alex Newcombe, Ed Pegg |
There Are No Cubic Graphs on 26 Vertices with Crossing Number 10 or 11. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(6), pp. 1713-1721, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Xihe Li, Ligong Wang 0001 |
Gallai-Ramsey Numbers for a Class of Graphs with Five Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(6), pp. 1603-1618, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Colton Magnant, Yaping Mao |
On Cycles that Alternate Through Selected Sets of Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(5), pp. 1517-1523, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Zdenek Ryjácek, Petr Vrána, Liming Xiong |
A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 36(3), pp. 665-677, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Marthe Bonamy, Natasha Morrison, Alex Scott 0001 |
Partitioning the vertices of a torus into isomorphic subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. A ![In: J. Comb. Theory, Ser. A 174, pp. 105252, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Mohammad Azad |
Decision Trees with at Most 19 Vertices for Knowledge Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Rough Sets ![In: Transactions on Rough Sets XXII, pp. 1-7, 2020, Springer, 978-3-662-62797-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Markus Haltmeier, Sunghwan Moon |
The conical Radon transform with vertices on triple lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.10730, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Santiago Guzmán-Pro, César Hernández-Cruz |
Orientations without forbidden patterns on three vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.05606, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Louis Brown |
Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.11296, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Arash Tavakoli, Mehdi Fatemi, Petar Kormushev |
Learning to Represent Action Values as a Hypergraph on the Action Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2010.14680, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Jérémie Turcotte, Samuel Yvon |
4-cop-win graphs have at least 19 vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.02998, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein |
New Bounds for the Vertices of the Integer Hull. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.10847, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
13 | Kosuke Nakamura, Toru Araki |
Partitioning vertices into in- and out-dominating sets in digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 285, pp. 43-54, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Peter Luo, Cun-Quan Zhang, Xiao-Dong Zhang 0001 |
Wiener index of unicycle graphs with given number of even degree vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 12(4), pp. 2050054:1-2050054:13, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | ChenKun Tsung, Hann-Jang Ho, Chien-Yu Chen 0006, Tien-Wei Chang, Sing-Ling Lee |
Detecting Overlapping Communities in Modularity Optimization by Reweighting Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 22(8), pp. 819, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi |
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 22(9), pp. 923, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | A. Bocci, Vincenzo Innocente, M. Kortelainen, Felice Pantaleo, Marco Rovere |
Heterogeneous Reconstruction of Tracks and Primary Vertices With the CMS Pixel Tracker. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Big Data ![In: Frontiers Big Data 3, pp. 601728, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Ronald J. Gould, Warren Shull |
On spanning trees with few branch vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(1), pp. 111581, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Weihua He, Hao Li 0002, Qiang Sun 0004 |
Locating any two vertices on Hamiltonian cycles in large graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(9), pp. 111941, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Gerben J. Hettinga, Jirí Kosinka |
A multisided C2 B-spline patch over extraordinary vertices in quadrilateral meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Des. ![In: Comput. Aided Des. 127, pp. 102855, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Yue Ma, Weiyin Ma |
A Global G2 Spline Space with Improved Geometry Consistency Near Extraordinary Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Aided Des. ![In: Comput. Aided Des. 127, pp. 102871, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Emre Kolotoglu |
A complete solution to the spectrum problem for graphs with six vertices and up to nine edges. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 15(3), pp. 1-24, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
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) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 64(3), pp. 1067-1097, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Dejan Govc, Waclaw Marzantowicz, Petar Pavesic |
Estimates of Covering Type and the Number of Vertices of Minimal Triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 63(1), pp. 31-48, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Salman Parsa |
Correction to: 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. 64(1), pp. 227-228, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI 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) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 140, pp. 45-83, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
13 | Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai |
Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 95(2), pp. 240-255, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|