default search action
Ville Junnila
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Anni Hakanen
, Ville Junnila
On the unicyclic graphs having vertices that belong to all their (strong) metric bases. Discret. Appl. Math. 353: 191-207 (2024) - [j30]Olivier Hudry, Ville Junnila
On Iiro Honkala's Contributions to Identifying Codes. Fundam. Informaticae 191(3-4): 165-196 (2024) - [j29]Ville Junnila
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. IEEE Trans. Inf. Theory 70(2): 1050-1066 (2024) - [i8]Olivier Hudry, Ville Junnila, Antoine Lobstein:
Iiro Honkala's contributions to identifying codes. CoRR abs/2402.08264 (2024) - [i7]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
On Unique Error Patterns in the Levenshtein's Sequence Reconstruction Model. CoRR abs/2406.14125 (2024) - 2023
- [j28]Anni Hakanen
On the metric dimensions for sets of vertices. Discuss. Math. Graph Theory 43(1): 245-275 (2023) - [c6]Ville Junnila
Levenshtein's Reconstruction Problem with Different Error Patterns. ISIT 2023: 1300-1305 - [i6]Ville Junnila, Tero Laihonen, Tuomo Lehtilä:
New Optimal Results on Codes for Location in Graphs. CoRR abs/2306.07862 (2023) - 2022
- [j27]Anni Hakanen
On vertices contained in all or in no metric basis. Discret. Appl. Math. 319: 407-423 (2022) - [j26]Ville Junnila
Improved lower bound for locating-dominating codes in binary Hamming spaces. Des. Codes Cryptogr. 90(1): 67-85 (2022) - [c5]Ville Junnila
On the List Size in the Levenshtein's Sequence Reconstruction Problem. ISIT 2022: 510-515 - [i5]Ville Junnila, Tero Laihonen, Tuomo Lehtilä
The Levenshtein's Sequence Reconstruction Problem and the Length of the List. CoRR abs/2211.08812 (2022) - 2021
- [j25]Ville Junnila
On Levenshtein's Channel and List Size in Information Retrieval. IEEE Trans. Inf. Theory 67(6): 3322-3341 (2021) - 2020
- [j24]Ville Junnila
Tolerant location detection in sensor networks. Adv. Appl. Math. 112 (2020) - [j23]Sara Ramezanian
Private membership test protocol with low communication complexity. Digit. Commun. Networks 6(3): 321-332 (2020) - [j22]Anni Hakanen
The solid-metric dimension. Theor. Comput. Sci. 806: 156-170 (2020)
2010 – 2019
- 2019
- [j21]Ville Junnila
Optimal bounds on codes for location in circulant graphs. Cryptogr. Commun. 11(4): 621-640 (2019) - [j20]Ville Junnila, Tero Laihonen
On a Conjecture Regarding Identification in Hamming Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j19]Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas:
On Stronger Types of Locating-dominating Codes. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [j18]Ville Junnila, Tero Laihonen, Gabrielle Paris:
Solving Two Conjectures regarding Codes for Location in Circulant Graphs. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [c4]Ville Junnila
The Levenshtein's Channel and the List Size in Information Retrieval. ISIT 2019: 295-299 - 2018
- [j17]Ville Junnila
On regular and new types of codes for location-domination. Discret. Appl. Math. 247: 225-241 (2018) - [i4]Ville Junnila, Tero Laihonen, Gabrielle Paris:
Optimal bounds on codes for location in circulant graphs. CoRR abs/1802.01325 (2018) - 2016
- [j16]Ville Junnila
Minimum Number of Input Clues in Robust Information Retrieval. Fundam. Informaticae 145(3): 243-256 (2016) - [j15]Ville Junnila
Information Retrieval With Varying Number of Input Clues. IEEE Trans. Inf. Theory 62(2): 625-638 (2016) - 2015
- [j14]Ville Junnila
Optimal locating-total dominating sets in strips of height 3. Discuss. Math. Graph Theory 35(3): 447-462 (2015) - [j13]Ville Junnila
Information retrieval with unambiguous output. Inf. Comput. 242: 354-368 (2015) - 2014
- [j12]Ville Junnila
Codes for Information Retrieval With Small Uncertainty. IEEE Trans. Inf. Theory 60(2): 976-985 (2014) - 2013
- [j11]Ville Junnila
New lower bound for 2-identifying code in the square grid. Discret. Appl. Math. 161(13-14): 2042-2051 (2013) - [j10]Ville Junnila
Optimal identification of sets of edges using 2-factors. Discret. Math. 313(16): 1636-1647 (2013) - [j9]Ville Junnila
Tolerant identification with Euclidean balls. Networks 61(3): 212-225 (2013) - 2012
- [j8]Ville Junnila, Tero Laihonen:
Optimal Lower Bound for 2-Identifying Codes in the Hexagonal Grid. Electron. J. Comb. 19(2): 38 (2012) - [j7]Ville Junnila
Adaptive Identification of Sets of Vertices in Graphs. Discret. Math. Theor. Comput. Sci. 14(1): 69-86 (2012) - [j6]Ville Junnila
Optimal Identifying Codes in Cycles and Paths. Graphs Comb. 28(4): 469-481 (2012) - [c3]Ville Junnila
Codes for locating objects in sensor networks. ISIT 2012: 671-675 - [c2]Ville Junnila
New lower bounds for identifying codes in infinite grids. ISIT 2012: 676-680 - [i3]Ville Junnila, Tero Laihonen:
Optimal lower bound for 2-identifying code in the hexagonal grid. CoRR abs/1202.0670 (2012) - [i2]Ville Junnila:
New lower bound for 2-identifying code in the square grid. CoRR abs/1202.0671 (2012) - 2011
- [j5]Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in cycles. Australas. J Comb. 49: 177-194 (2011) - [j4]Ville Junnila
Identification in Z2 using Euclidean balls. Discret. Appl. Math. 159(5): 335-343 (2011) - [j3]Geoffrey Exoo, Ville Junnila
Locating-dominating codes in paths. Discret. Math. 311(17): 1863-1873 (2011) - [i1]Ville Junnila, Tero Laihonen, Aline Parreau:
Tolerant identification with Euclidean balls. CoRR abs/1109.1913 (2011) - 2010
- [j2]Geoffrey Exoo, Ville Junnila
Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31(3): 813-827 (2010)
2000 – 2009
- 2009
- [j1]Geoffrey Exoo, Ville Junnila
Upper bounds for binary identifying codes. Adv. Appl. Math. 42(3): 277-289 (2009) - 2008
- [c1]Geoffrey Exoo, Ville Junnila
Improved bounds on binary identifying codes. ISIT 2008: 629-633
Coauthor Index
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.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: