Campus Event Calendar: Magnus Wahlström (08/26/2011 in E1 4/AG1 rotunda (3rd floor))

Campus Event Calendar

Campus Event Calendar:
- All Upcoming:
  - only for D1
  - only for D2
  - only for INET
  - only for D4
  - only for D5
  - only for D6
  - only for RG1
  - Mailing Lists
  - by Speaker
  - by Type
  - by Category
  - by Title
  - Calendar
  - RSS Feed
- History of Events:

Event Entry

New for: D3

What and Who

Polynomial kernels for some graph cut problems

Magnus Wahlström

Max-Planck-Institut für Informatik - D1

AG1 Mittagsseminar (own work)

AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI

AG Audience

English

Note: We use this to send email in the morning.

Date, Time and Location

Friday, 26 August 2011

15:00

30 Minutes

E1 4

AG1 rotunda (3rd floor)

Saarbrücken

Abstract

Parameterized graph cut problems contain many problems for which the existence of polynomial kernels has so far been unsettled. We show how many of these problems can be successfully attacked using tools from matroid theory.

Joint work with Stefan Kratsch. This is the AG1 version of a talk I will give at the WorKer 2011 workshop on kernelization.

Contact

Magnus Wahlström

--email hidden

System used:

Meeting URL:

Meeting ID:

Passcode:

passcode not visible

Code Visible for:

logged in users only

Magnus Wahlström, 08/25/2011 16:57 -- Created document.

Imprint / Impressum | Data Protection / Datenschutzhinweis