default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Froese
- > Home > Persons > Vincent Froese
Publications
- 2020
[j16]Laurent Bulteau
, Vincent Froese, Rolf Niedermeier:
Tight Hardness Results for Consensus Problems on Circular Strings and Time Series. SIAM J. Discret. Math. 34(3): 1854-1883 (2020)- 2018
- [i15]Laurent Bulteau, Vincent Froese, Rolf Niedermeier:
Hardness of Consensus Problems for Circular Strings and Time Series Averaging. CoRR abs/1804.02854 (2018) - 2017
- [j9]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Partitioning Perfect Graphs into Stars. J. Graph Theory 85(2): 297-335 (2017) - [j8]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. Theory Comput. Syst. 60(2): 253-279 (2017) - 2016
- [j7]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle Counting in Dynamic Graph Streams. Algorithmica 76(1): 259-278 (2016) - [j6]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering under the Maximum Norm. Algorithms 9(1): 17 (2016) - [j5]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. Internet Math. 12(6): 363-380 (2016) - 2015
- [c8]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. TAMC 2015: 200-211 - [c7]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. TAMC 2015: 224-235 - [i7]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. CoRR abs/1512.05693 (2015) - 2014
- [c5]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. ICALP (1) 2014: 174-185 - [c4]Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier:
Co-Clustering Under the Maximum Norm. ISAAC 2014: 298-309 - [i6]René van Bevern, Robert Bredereck, Laurent Bulteau, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger:
Star Partitions of Perfect Graphs. CoRR abs/1402.2589 (2014) - [i4]Laurent Bulteau, Vincent Froese, Konstantin Kutzkov, Rasmus Pagh:
Triangle counting in dynamic graph streams. CoRR abs/1404.4696 (2014) - [i2]Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. CoRR abs/1411.7838 (2014) - [i1]Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-Player Diffusion Games on Graph Classes. CoRR abs/1412.2544 (2014)
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-07-18 21:52 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:
