Combinatorial Optimization Group - seminars

research

Research groups
- LIGHT
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Computational Intelligence Research Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Independent employees
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Division of Software Engineering
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Programming Languages Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Numerical Analysis Research Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Combinatorial Optimization Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Foundations of Computer Science and Databases Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers
- Complexity and Algorithms Research Group
  - About
  - Employees
  - Grants
  - Seminars
  - Papers

Awards

Grants

Seminars

Papers

Open positions

Research activities

12

April

[COG Seminar] Kamyar Khodamoradi: "Approximation Algorithms for Demand Strip Packing"
12

Oct.

[COG Seminar] Marcin Bieńkowski: "A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location"
05

Oct.

[COG Seminar] Guy Even: "An extendable data structure for dynamic stable perfect hashing"
28

Sept.

[COG Seminar] Jarosław Byrka: "Submodularity Gaps for Selected Network Design and Matching Problems"
17

Dec.

[COG Seminar] Jarosław Byrka on "Breaching the 2-Approximation Barrier for Connectivity Augmentation: a Reduction to Steiner Tree" (unpublished)
10

Dec.

[COG Seminar] Tobias Moemke on "Beating the 2.5-Barrier for TSP with Linear Precedence Constraints" (unpublished)
22

Oct.

[COG Seminar] Christian Coester on "Pure entropic regularization for metrical task systems" (COLT 2019, joint work with James R. Lee)
15

Oct.

[COG Seminar] Przemysław Uznański on "Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling" (PODC 2019, joint work with Adrian Kosowski and Laurent Viennot)
25

June

Pasin Manurangsi on "Parameterized Inapproximability"
28

May

!!! CANCELED!!! [COG Seminar] Marek Adamczyk on "Random Order Contention Resolution Schemes" (FOCS'18)
15

Feb.

[COG Seminar] Łukasz Jeż: "A ϕ-Competitive Algorithm for Scheduling Packets with Deadlines" (SODA'19)
11

Dec.

[COG Seminar] Adam Kunysz on "An Algorithm for the Maximum Weight Strongly Stable Matching Problem"
16

Oct.

Stefan Schmid on "Networks in the Disco: Algorithms for Demand-Aware and Self-Adjusting Networks"
02

Oct.

Joachim Spoerhase on "Approximation Schemes for Geometric Coverage Problems"
27

Sept.

[COG Seminar] Gleb Polevoy: "The Game of Reciprocation Habits" and "Reciprocation Effort Games"
06

Sept.

Marek Chrobak on "Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability"
12

June

[C⚙G Seminar] Michał Włodarczyk: "Losing Treewidth by Separating Subsets"
10

April

Jakub Tarnawski: "A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem" (STOC 2018 Best Paper)
13

Feb.

[COG Seminar] Pavel Veselý: "On Packet Scheduling with Adversarial Jamming and Speedup"
30

Jan.

[COG Seminar] Meesum Syed Mohammad: "Matrix Rigidity from the Viewpoint of Parameterized Complexity"
21

Nov.

[COG Seminar] Prudence Wong: "Scheduling jobs to minimize energy, electricity, and other resources"
07

Nov.

[COG Seminar ] Matthias Englert: "Reordering Buffer Management in Trees and General Metric Spaces"
17

Oct.

[COG seminar] Marek Adamczyk: "When the Optimum is also Blind: A New Perspective on Universal Optimization" (joint work with Fabrizio Grandoni, Stefano Leonardi and Michał Włodarczyk)
10

Oct.

[COG seminar] Marcin Bieńkowski: "On phase-based algorithms for file migration" (joint work with Jarosław Byrka, and Marcin Mucha)
26

Sept.

[COG seminar] Krzysztof Sornat: Ordered k-median as a generalization of k-median and k-center
27

June

[COG seminar] Artur Kraska: A Match in Time Saves Nine: Deterministic Online Matching With Delays
27

June

[COG seminar] Bartłomiej Dudek: A Family of Approximation Algorithms for the Maximum Duo-Preservation String Mapping Problem
16

May

[COG seminar] Krzysztof Sornat: "Proportional Approval Voting, Harmonic k-median, and Negative Association"
25

April

[COG seminar] Marcin Mucha on "Problems equivalent to (min,+)-convolution"
11

April

[COG seminar] Joachim Spoerhase on "New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness" (joint work with Krzysztof Fleszar and Matthias Mnich)
14

March

[COG Seminar] Piotr Skowron, "Multiwinner Elections: Overview and Challenges"
07

March

[COG Seminar] Paweł Garncarek: Fault-Tolerant Online Packet Scheduling on Parallel Channels
29

Nov.

[COG seminar]. Maciej Pacut: Online Balanced Repartitioning
19

Aug.

[COG seminar]. Marcin Bieńkowski, Adam Kunysz, Krzysztof Sornat: Our ESA'16 & MFCS'16 papers
31

May

[COG seminar]. Artur Czumaj: Efficient communication in radio networks
12

April

[COG seminar]. Pavel Veselý, Martin Böhm: Online Packet Scheduling With and Without Lookahead
12

Jan.

[COG seminar]. Krzysztof Sornat: Pricing in Social Networks with Inequity Aversion
01

Dec.

[COG seminar]. Bartosz Rybicki: An approximation algorithm for Uniform Capacitated k-Median problem with 1+ε capacity violation
17

Nov.

[COG seminar]. Adam Kunysz: Characterisation of Strongly Stable Matchings
27

Oct.

[COG seminar]. Artur Kraska: A Randomized Algorithm for Online Scheduling with Interval Conflicts
20

Oct.

[COG seminar]. Mateusz Lewandowski: Approximation algorithms for the node-weighted prize-collecting Steiner tree problem (NWPCST) on planar graphs
13

Oct.

[COG seminar]. Jarek Byrka: Online Algorithms for Multi-Level Aggregation
08

Sept.

[COG seminar]. Sumedha Uniyal: Improved Approximation Algorithms for Unsplittable Flow on a Path with Time Windows
02

June

[COG seminar]. Joachim Spoerhase: Facility location with nonuniform hard capacities
19

May

[COG seminar]. Bartosz Rybicki:An Improved Approximation Algorithm for Knapsack Median Using Sparsification
17

March

[COG seminar]. Mateusz Lewandowski: Constant Approximation Algorithm for Node-Weighted Prize-Collecting Steiner Forest on Planar Graphs
10

March

[COG seminar]. Jakub Łącki: Dynamic Steiner Tree
27

Jan.

[COG seminar]. Łukasz Jeż: Pricing Online Decisions: Beyond Auctions
11

Dec.

[COG seminar]. Bartosz Rybicki: Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
27

Nov.

[COG seminar]. Krzysztof Sornat: PTAS for Minimax Approval Voting

research

research

Seminars

12

April

12

Oct.

05

Oct.

28

Sept.

17

Dec.

10

Dec.

22

Oct.

15

Oct.

25

June

28

May

15

Feb.

11

Dec.

16

Oct.

02

Oct.

27

Sept.

06

Sept.

12

June

10

April

13

Feb.

30

Jan.

21

Nov.

07

Nov.

17

Oct.

10

Oct.

26

Sept.

27

June

27

June

16

May

25

April

11

April

14

March

07

March

29

Nov.

19

Aug.

31

May

12

April

12

Jan.

01

Dec.

17