Day 1

May 22, Monday
10:00

Opening

10:10

Shuji Kijima

10:55

Approximating volume – randomized vs. deterministic

10:55

Coffee break

11:15

Satoru Fujishige

Dömötör Pálvölgyi

11:35

The random assignment problem with submodular constraints on goods

Weak embeddings of posets to the Boolean lattice

11:40

Naonori Kakimura

12:00

Streaming submodular maximization under a knapsack constraint

Máté Vizer
Rounds in a combinatorial search problem

12:05

Lunch break

14:00

Yusuke Kobayashi

14:45

The weighted linear matroid parity problem

14:50

Yutaro YamaguchiHaruhide Matsuda

15:10

On applications of weighted linear matroid parity

On spanning trees with constraints on the leaf degree

15:15

Hanna Sumita

Gábor Wiener

15:35

The min-sum-max matroid partitioning problem

Spanning trees with few leaves in claw-free graphs

15:40

Coffee break

16:00

Mizuyo Takamatsu

Tamás Király

16:20

Index reduction via unimodular transformations

Finding strongly popular matchings in certain bipartite preference systems

16:25

So Nakashima

Péter Biró

16:45

A compact representation for modular semilattices and its applications

Stable project allocation under distributional constraints

17:30

Reception

Page 1

Day 2

May 23, Tuesday
09:00

Hiroshi Hirai

09:45

The maximum vanishing subspace problem, CAT(0)-space relaxation, and block-triangularization of partitioned matrices

09:50

Akiyoshi Shioura

Richárd Palincza

10:10

Time bounds of two-phase algorithms for L-convex function minimization

Designing chess pairing mechanisms

10:15

Tasuku Soma

Erzsébet Romsics

10:35

Regret minimization in multi-objective submodular function maximization

New algorithms for cake cutting with equal and unequal shares

10:40

Coffee break

11:00

Kazuo Murota

Imre Bárány11:20

Multiple exchange in M♮-concave functions and its implication in economics

Tverberg plus minus

11:25

Yuni Iwamasa

Noriyoshi Sukegawa

11:45

The quadratic M-convexity testing problem

An asymptotically improved upper bound on the diameter of polyhedra

11:50

Hiroki Oshima

Péter Szabó

12:10

Derandomization for monotone k-submodular maximization

Three theorems on the combinatorics of finite metric spaces

Page 2

Day 3

May 24, Wednesday
09:00

Shin-ichi Tanigawa

09:45

Global rigidity of triangulations with braces

09:50

Yuya Higashikawa

Yu Yokoi

10:10

Characterizing brace-minimal rigidity of square-grid frameworks with holes

List supermodular coloring

10:15

Tibor Jordán

Tamás Fleiner

10:35

Extremal problems and results in combinatorial rigidity

List colourings with restricted lists

10:40

Coffee break

11:00

Bill Jackson

Ervin Győri

11:20

Equivalent realisations of rigid graphs

Linear cycle-free hypergraphs, covers by linear cycles

11:25

Anthony Nixon

Zoltán Király

11:45

Global rigidity of generic frameworks on the cylinder

On Ryser's conjecture

11:50

Viktória Kaszanitzky

Kristóf Bérczi

12:10

Sufficient connectivity conditions for rigidity of symmetric frameworks

Directed hypergraphs and Horn minimization

12:15

Lunch break

14:10

Naoyuki Kamiyama

14:55

Practical Algorithms and Models for Evacuation Problems

15:00

Kenjiro Takazawa

15:20

Excluding t -factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings Reconfiguring optimal ladder lotteries

Katsuhisa Yamanaka

15:25

Coffee break

15:45

Gyula O. H. Katona

Hiroyuki Umeda

16:05

A general 2-part Erdős-Ko-Rado theorem

Nash equilibria in combinatorial auctions with item bidding and subadditive valuations

16:10

Attila Sali

Sándor Bozóki

16:30

Forbidden pairs of minimal quadratic and cubic configurations

Spanning trees and logarithmic least squares optimality for complete and incomplete pairwise comparison matrices

16:35

Tamás Mészáros

László Csató

16:55

A note on a conjecture about shattering-extremal set systems

An impossibility theorem for paired comparisonsTrófea Restaurant, Újbuda
18:00

András Frank - András Recski

18:20

TBA

18:25

BanquetPage 3

Day 4

May 25, Thursday
09:00

Takuro Fukunaga

09:45

Recent progress on the network activation problem

09:50

Carol T. Zamfirescu

András Recski

10:10

Two extensions of a theorem of Tutte

The importance of having feedback – an application of matroid union in network analysis

10:15

Bálint Hujter

Dávid Szeszlér

10:35

On the chip-firing halting problem for undirected multigraphs

Measuring graph robustness via game theory

10:40

Coffee break

11:00

Zoltán Szigeti

Endre Csóka

11:20

Reachability-based matroid-restricted packing of arborescences

Limit theory of discrete mathematics problems

11:25

Csaba Király

Péter Madarasi

11:45

On packing spanning arborescences with matroid constraint

A Primal-Dual Approach for Large Scale Integer Problems

11:50

Attila Joó

László Kabódi

12:10

Branching packing theorems in finite and infinite digraphs

Embedding logical functions into the Chimera graph

12:15

Lunch break

14:10

András Sebő14:55

Matroids and Matchings for some Approximation Results

15:00

Péter Pál Pach

15:20

Progression-free sets and the polynomial method

15:25

Coffee break

15:45

Mikio Kano

Gyula Pap

16:05

Characterization of 1-tough graphs using factors

Some observations on the traveling salesman problem

16:10

Gyula Y. Katona

Attila Bernáth

16:30

The complexity of recognizing minimally tough graphs

Blocking optimal structures

16:35

Kitti Varga

Tatsuya Matsuoka

16:55

Strengthening some complexity results on toughness of graphs

Making bidirected graphs strongly connected

17:00

László Papp

Koyo Hayashi

17:20

Optimal pebbling and rubbling of graphs with given diameter

Counting minimum weight arborescences

17:25

ClosingPage 4