Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 2023
- Feifei Wang, Hai-Ying Shan, Yuyao Zhai:
On the $$\alpha $$-spectral radius of unicyclic and bicyclic graphs with a fixed diameter. Comput. Appl. Math. 42(4) (2023) - Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi:
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric. IEEE Trans. Inf. Theory 69(4): 2324-2340 (2023) - Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis:
On the complexity of Dominating Set for graphs with fixed diameter. CoRR abs/2304.09701 (2023) - 2022
- Daniella Bar-Lev, Tuvi Etzion, Eitan Yaakobi:
On the Size of Balls and Anticodes of Small Diameter under the Fixed-Length Levenshtein Metric. CoRR abs/2206.07995 (2022) - 2020
- Qizhen Xiao, Hongliang Liu, Zhenghua Xu, Zigen Ouyang:
On Collision Avoiding Fixed-Time Flocking with Measurable Diameter to a Cucker-Smale-Type Self-Propelled Particle Model. Complex. 2020: 1094950:1-1094950:12 (2020) - 2019
- Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter. Theor. Comput. Sci. 770: 69-78 (2019) - 2018
- Xianya Geng, Hongjin Zhao:
On the sum of the squares of all distances in trees with fixed diameter. Ars Comb. 139: 145-157 (2018) - Hoàng-Oanh Le, Van Bang Le:
A complexity dichotomy for Matching Cut in (bipartite) graphs of fixed diameter. CoRR abs/1804.11102 (2018) - 2017
- Xinying Pai, Sanyang Liu:
On the signless Laplacian spetral radius of bicyclic graphs with fixed diameter. Ars Comb. 130: 249-265 (2017) - David I. Bevan, Grahame Erskine, Robert Lewis:
Large circulant graphs of fixed diameter and arbitrary degree. Ars Math. Contemp. 13(2): 275-291 (2017) - Peter Frankl:
A Stability Result for Families with Fixed Diameter. Comb. Probab. Comput. 26(4): 506-516 (2017) - 2016
- Xinying Pai:
On the Laplacian coefficients and Laplacian-like energy of unicyclic graphs with fixed diameter. Ars Comb. 129: 275-286 (2016) - Guanglong Yu, Yarong Wu, Jinlong Shu:
Minimizing the least eigenvalue of bicyclic graphs with fixed diameter. Ars Comb. 124: 421-437 (2016) - Julien Bensmail, Romaric Duvignau, Sergey Kirgizov:
The complexity of deciding whether a graph admits an orientation with fixed weak diameter. Discret. Math. Theor. Comput. Sci. 17(3): 31-42 (2016) - Hoàng-Oanh Le, Van Bang Le:
On the Complexity of Matching Cut in Graphs of Fixed Diameter. ISAAC 2016: 50:1-50:12 - Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang:
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. SODA 2016: 377-391 - 2015
- Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang:
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter. CoRR abs/1506.01799 (2015) - 2014
- Luke Postle:
Pebbling Graphs of Fixed Diameter. J. Graph Theory 75(4): 302-310 (2014) - 2013
- Haixia Zhang:
The Largest Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter. J. Appl. Math. 2013: 563067:1-563067:13 (2013) - Jongyook Park, Jack H. Koolen, Greg Markowsky:
There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter. J. Comb. Theory, Ser. B 103(6): 733-741 (2013) - 2012
- Shu-Guang Guo:
On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter. Ars Comb. 106: 47-58 (2012) - 2011
- Shahrazad H. Alnafei, Stojan Radenovic, Naseer Shahzad:
Fixed point theorems for mappings with convex diminishing diameters on cone metric spaces. Appl. Math. Lett. 24(12): 2162-2166 (2011) - 2010
- Mingqing Zhai, Ruifang Liu, Jinlong Shu:
Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. Discret. Math. 310(4): 947-955 (2010) - Sebastian M. Cioaba, Edwin R. van Dam, Jack H. Koolen, Jae-Ho Lee:
A lower bound for the spectral radius of graphs with fixed diameter. Eur. J. Comb. 31(6): 1560-1566 (2010) - 2006
- Ellen E. Eischen:
Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameter. Discret. Math. 306(8-9): 745-761 (2006) - 2003
- Lali Barrière, Pierre Fraigniaud, Lata Narayanan, Jaroslav Opatrny:
Dynamic construction of Bluetooth scatternets of fixed degree and low diameter. SODA 2003: 781-790 - 2002
- Ioan Tomescu:
On the number of h-connected graphs with a fixed diameter. Discret. Math. 252(1-3): 279-285 (2002) - 2001
- Ioan Tomescu:
The Number of Graphs and Digraphs with a Fixed Diameter and Connectivity. DMTCS 2001: 33-46 - 2000
- Ioan Tomescu:
On the number of large h-hypergraphs with a fixed diameter. Discret. Math. 223(1-3): 287-297 (2000) - 1997
- Martin Knor, Jozef Sirán:
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. J. Graph Theory 24(1): 1-8 (1997)
skipping 4 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-11 19:42 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint