default search action
Vladimir Ufimtsev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Brenden Latham, Vladimir Ufimtsev, Ayan Dutta
:
Matching-based Coalition Formation for Multi-robot Task Assignment Under Partial Uncertainty. FLAIRS 2024 - 2021
- [c11]Ayan Dutta, Vladimir Ufimtsev, Tuffa Said, Inmo Jang, Roger Eggen:
Distributed Hedonic Coalition Formation for Multi-Robot Task Allocation. CASE 2021: 639-644
2010 – 2019
- 2019
- [j3]Ayan Dutta, Vladimir Ufimtsev, Asai Asaithambi, Emily Czarnecki:
Coalition Formation for Multi-Robot Task Allocation via Correlation Clustering. Cybern. Syst. 50(8): 711-728 (2019) - [c10]Ayan Dutta, Asai Asaithambi, Vladimir Ufimtsev:
Distributed Coalition Formation with Heterogeneous Agents for Task Allocation. FLAIRS 2019: 116-119 - [c9]Ayan Dutta, Vladimir Ufimtsev, Asai Asaithambi:
Correlation clustering based coalition formation for multi-robot task allocation. SAC 2019: 906-913 - 2018
- [i2]Ayan Dutta, Vladimir Ufimtsev, Asai Asaithambi:
Correlation Clustering Based Coalition Formation For Multi-Robot Task Allocation. CoRR abs/1805.08629 (2018) - 2016
- [c8]Vladimir Ufimtsev, Soumya Sarkar, Animesh Mukherjee, Sanjukta Bhowmick:
Understanding Stability of Noisy Networks through Centrality Measures and Local Connections. CIKM 2016: 2347-2352 - [i1]Vladimir Ufimtsev, Soumya Sarkar, Animesh Mukherjee, Sanjukta Bhowmick:
Understanding Stability of Noisy Networks through Centrality Measures and Local Connections. CoRR abs/1609.05402 (2016) - 2014
- [c7]Vladimir Ufimtsev, Sanjukta Bhowmick, Sivasankaran Rajamanickam:
Building blocks for graph based network analysis. HPEC 2014: 1-6 - [c6]Vladimir Ufimtsev, Sanjukta Bhowmick:
An extremely fast algorithm for identifying high closeness centrality vertices in large-scale networks. IA3@SC 2014: 53-56 - 2013
- [j2]Kathryn Dempsey, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali:
A Parallel Template for Implementing filters for biological Correlation Networks. Int. J. Comput. 12(4): 285-297 (2013) - [c5]Vladimir Ufimtsev, Sanjukta Bhowmick:
Identifying High betweenness Centrality Vertices in Large Noisy Networks. IPDPS Workshops 2013: 2234-2237 - 2012
- [c4]Prithviraj Dasgupta, Vladimir Ufimtsev, Carl A. Nelson, S. G. M. Hossain:
Dynamic reconfiguration in modular robots using graph partitioning-based coalitions. AAMAS 2012: 121-128 - 2011
- [c3]Zachary Ramaekers, Raj Dasgupta, Vladimir Ufimtsev, S. G. M. Hossain, Carl A. Nelson:
Self-Reconfiguration in Modular Robots Using Coalition Games with Uncertainty. Automated Action Planning for Autonomous Mobile Robots 2011 - [c2]Sanjukta Bhowmick, Vyacheslav V. Rykov, Vladimir Ufimtsev:
ACM SRC poster: a scalable group testing based algorithm for finding d-highest betweenness centrality vertices in large scale networks. SC Companion 2011: 121-122
2000 – 2009
- 2008
- [j1]Morgan A. Bishop, Anthony J. Macula, Thomas E. Renz, Vladimir Ufimtsev:
Hypothesis group testing for disjoint pairs. J. Comb. Optim. 15(1): 7-16 (2008) - 2007
- [c1]Arkadii G. D'yachkov, Anthony J. Macula, Vyacheslav V. Rykov, Vladimir Ufimtsev:
DNA Codes Based on Stem Similarities Between DNA Sequences. DNA 2007: 146-151
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-09-10 01:14 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: