CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Parameterized Complexity of Fair Bisection: (FPT-Approximation meets Unbreakability)
Authors
Tanmay Inamdar
Daniel Lokshtanov
Saket Saurabh
Vaishali Surianarayanan
Publication date
1 January 2023
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 31st Annual European Symposium on Algorithms (ESA 2023)
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:1871...
Last time updated on 12/09/2023
