English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Madathil, J., Sharma, R., & Zehavi, M. (2021). A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs. Algorithmica, 83, 1861-1884. doi:10.1007/s00453-021-00806-x.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0008-2C54-9 Version Permalink: https://hdl.handle.net/21.11116/0000-000C-AE0A-6
Genre: Journal Article
Latex : A Sub-exponential {FPT} Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Madathil, Jayakrishnan1, Author
Sharma, Roohani2, Author           
Zehavi, Meirav1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2021
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Madathil2021
DOI: 10.1007/s00453-021-00806-x
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : Springer
Pages: 24 p. Volume / Issue: 83 Sequence Number: - Start / End Page: 1861 - 1884 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793