May 31  Room 420  Room 110 

09:1010:00 
G. Y. Katona Tight paths, cycles in hypergraphs and related problems 

10:0010:10  Break  
10:1010:35 
N. Kakimura, K. Kawarabayashi Packing cycles of length 0 modulo p through prescribed vertices 
B. Engedy, K. Friedl An improved randomized algorithm for the closest pair problem 
10:3511:00 
Z. Füredi, Y. Kim Cyclesaturated graphs with minimum number of edges 
A. Iványi Directed graphs with prescribed score sequences 
11:0011:25 
R. P. Anstee, M. Raggi, A. Sali Forbidden configurations and product constructions 
K. Sejima, T. Fukunaga, H. Nagamochi Algorithms for covering digraphs by lengthbounded paths 
11:2511:50 
A. Bernáth, Z. Király On the tractability of some natural packing, covering and partitioning problems 
A. M. S. Shrestha, S. Tayu, S. Ueno Bandwidth of convex bipartite graphs and related graph classes 
11:5013:30  Break  
13:3014:20 
K. Kawarabayashi TSP in minor closed family of graphs 

14:2014:30  Break  
14:3014:55 
K. Ozeki Prism hamiltonicity of 3connected plane graphs with minimum degree at least 4 
J. Szigeti, G. Gordos, P. Laborczi Benchmarking of GPS sources for generating traffic information 
14:5515:20 
T. Fukunaga Approximating minimum cost source location problems with local vertexconnectivity demands 
Y. Tanaka, S. Imahori, M. Yagiura A Lagrangian heuristic algorithm for the node capacitated intree packing problem 
15:2015:40  Break  
15:4016:05 
T. Szkaliczki, M. Eberhard, H. Hellwagner, L. Szobonya Knapsack problem and piecepicking algorithms for layered video streaming 
Y. Kobayashi, K. Murota, R. Weismantel Cone superadditivity of discrete convex functions 
16:0516:30 
Z. Király, E. R. Kovács Multilayered video broadcast using network coding and a distributed connectivity algorithm 
R. Kápolnai, G. Domokos Inductive generation of convex bodies 
16:3016:55 
B. Dezső, A. Jüttner, P. Kovács, A. Ládanyi Contact center staff scheduling with various constraints 
T. Toda Multipolytopes and their duality 
17:0018:30  Open Problem Session 
June 1  Room 420  Room 110 

09:1010:00 
T. Jordán, G. Domokos, K. Tóth Geometric sensitivity of rigid graphs T. Jordán, V. E. Kaszanitzky On generically affinely rigid hypergraphs 

10:0010:10  Break  
10:1010:35 
H. Ito, S. Tanigawa, Y. Yoshida Testing algorithms for (k,l)sparsity and (k,l)edgeconnectedorientability 
B. Keszegh, D. Pálvölgyi Octants are cover decomposable 
10:3511:00 
Z. Fekete, T. Jordán, V. E. Kaszanitzky Rigid twodimensional frameworks with two coincident points 
S. Fujita Recent progress on proper connection numbers 
11:0011:25 
P. Dóbe, G. Domokos Combinatorial measurement of the geometric sensitivity of plane trusses 
G. Simonyi, A. Zsbán On topological relaxations of chromatic conjectures 
11:2511:50 
A. Recski Is this matrix singular? Part 2 

11:5013:30  Break  
13:3014:20 
N. Kakimura, K. Makino Robust independence systems 

14:2014:30  Break  
14:3014:55 
T. Király Degree bounded matroids and partial forest covering 

14:5515:20 
A. Shioura Polynomialtime approximation schemes for maximizing M♮concave functions under budget constraints 

15:2015:40  Break  
15:4016:05 
D. Erdős, A. Frank, K. Kun Sinkstable sets of digraphs 

16:0516:30 
A. Frank, Cs. Király Treecompositions and submodular flows 

16:3016:55 
K. Bérczi, E. R. Kovács A note on strongly edgedisjoint arborescences 

18:0020:00  Banquet at Kyoto University Clock Tower Centennial Hall 
June 2  Room 420  Room 110 

09:1010:00 
Z. Király Approximation of maximum stable marriage 

10:0010:10  Break  
10:1010:35 
T. Inoshita, R. W. Irving, K. Iwama, S. Miyazaki, T. Nagase Improving manoptimal stable matchings by minimum change of preference lists 
Z. Á. Mann, T. Szép A bestfirstsearch approach to constraint satisfaction problems 
10:3511:00 
K. Cechlárová, T. Fleiner Room assignment, rent division and linear programming 
Z. Zombori, P. Szeredi, G. Lukácsy Loop elimination, a sound optimisation technique for PTTP related theorem proving 
11:0011:25 
T. Fleiner, Z. Jankó College admissions and lattices 
G. De Marco, E. Kranakis, G. Wiener Finding majority with triple queries 
11:2511:50 
T. Király, J. Pap Ideal set functions 
S. Tsuchiya Rooted HIST property on planar triangulations 
11:5013:30  Break  
13:3014:20 
H. Hirai Weighted multiflows 

14:2014:30  Break  
14:3014:55 
G. Pap A polynomial time algorithm for weighted nodedisjoint Spaths 

14:5515:20 
Y. Kobayashi, X. Yin An algorithm for finding a maximum tmatching excluding complete partite subgraphs 

15:2015:40  Break  
15:4016:05 
I. Faragó Matrix maximum principles and their application 

16:0516:30 
S. Iwata, M. Takamatsu On the Kronecker canonical form of mixed matrix pencils 

16:3016:55 
L. Csirmaz, P. Ligeti LP problems in secret sharing 
June 3  Room 420 

09:1010:00 
G. Tóth A better bound for the paircrossing number 
10:0010:10  Break 
10:1010:35 
P. Cheilaris, B. Keszegh, D. Pálvölgyi Uniquemaximum and conflictfree coloring for hypergraphs and tree graphs 
10:3511:00 
Á. Tóth On the asymptotic values of the Hallratio 
11:0011:25 
D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, D. Pálvölgyi,
B. Patkós Saturating Sperner families 
11:2511:50 
T. Iimura, K. Murota, A. Tamura Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope 
11:5013:30  Break 
13:3013:55 
S. Kijima Sampling from logsuper/submodular distributions 
13:5514:20 
Z. Á. Mann, A. Szajko Asymptotic behaviour of the complexity of coloring sparse random graphs 
14:2014:30  Break 
14:3014:55 
N. Tokushige Some results and problems concerning cross intersecting families of sets 
14:5515:20 
G. O. H. Katona, G. Y. Katona, Z. Katona Most probably intersecting families of subsets 