Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDBenjamin Bergougnoux
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Benjamin Bergougnoux
, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84(5): 1385-1417 (2022)- [i10]Benjamin Bergougnoux, Jan Dreier, Lars Jaffke:
A logic-based algorithmic meta-theorem for mim-width. CoRR abs/2202.13335 (2022) - 2021
- [j5]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. Algorithmica 83(5): 1201-1221 (2021) - [j4]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Acyclicity and Connectivity Constraints. SIAM J. Discret. Math. 35(3): 1881-1926 (2021) - [c7]Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle:
On Dasgupta's Hierarchical Clustering Objective and Its Relation to Other Graph Parameters. FCT 2021: 287-300 - [i9]Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes, Christophe Paul, Jan Arne Telle:
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters. CoRR abs/2105.12093 (2021) - [i8]Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle, Martin Vatshelle:
On Alternative Models for Leaf Powers. CoRR abs/2105.12407 (2021) - 2020
- [j3]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. Algorithmica 82(6): 1654-1674 (2020) - [c6]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. IPEC 2020: 3:1-3:17 - [c5]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG 2020: 388-400 - [i7]Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon:
Close relatives of Feedback Vertex Set without single-exponential algorithms parameterized by treewidth. CoRR abs/2007.14179 (2020)
2010 – 2019
- 2019
- [b1]Benjamin Bergougnoux:
Matrix decompositions and algorithmic applications to (hyper)graphs. (Décomposition de matrices et applications algorithmiques aux (hyper)graphes). University of Clermont Auvergne, Clermont-Ferrand, France, 2019 - [j2]Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté:
Counting minimal transversals of β-acyclic hypergraphs. J. Comput. Syst. Sci. 101: 21-30 (2019) - [j1]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782: 30-53 (2019) - [c4]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More Applications of the d-Neighbor Equivalence: Connectivity and Acyclicity Constraints. ESA 2019: 17:1-17:14 - [i6]Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle:
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR abs/1910.00887 (2019) - 2018
- [c3]Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. WG 2018: 40-51 - [i5]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
More applications of the d-neighbor equivalence: acyclicity and connectivity constraints. CoRR abs/1805.11275 (2018) - [i4]Thomas Bellitto, Benjamin Bergougnoux:
On Minimum Connecting Transition Sets in Graphs. CoRR abs/1807.08463 (2018) - [i3]Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté:
Counting Minimal Transversals of β-Acyclic Hypergraphs. CoRR abs/1808.05017 (2018) - 2017
- [c2]Benjamin Bergougnoux, Eduard Eiben, Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan:
Towards a Polynomial Kernel for Directed Feedback Vertex Set. MFCS 2017: 36:1-36:15 - [c1]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width. WADS 2017: 121-132 - [i2]Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon:
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width. CoRR abs/1702.06095 (2017) - [i1]Benjamin Bergougnoux, Mamadou Moustapha Kanté:
Fast exact algorithms for some connectivity problems parametrized by clique-width. CoRR abs/1707.03584 (2017)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-05-19 22:03 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
