Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
May 31－June 3, 2011
RIMS, Kyoto UniversityMay, 31
09:10-10:00

Room 420

Room 110

G. Y. KatonaTight paths, cycles in hypergraphs and related problems

10:00-10:10
N. Kakimura, K. Kawarabayashi
10:10-10:35 Packing cycles of length 0 modulo p through prescribedvertices
Z. Füredi, Y. Kim
10:35-11:00
Cycle-saturated graphs with minimum number of edges
R. P. Anstee, M. Raggi, A. Sali
11:00-11:25
Forbidden configurations and product constructions
A. Bernáth, Z. Király
11:25-11:50 On the tractability of some natural packing, covering andpartitioning problems
11:50-13:30
K. Kawarabayashi
13:30-14:20
TSP in minor closed family of graphs
14:20-14:30
K. Ozeki
14:30-14:55 Prism hamiltonicity of 3-connected plane graphs withminimum degree at least 4
T. Fukunaga
14:55-15:20 Approximating minimum cost source location problems
with local vertex-connectivity demands
15:20-15:40
T. Szkaliczki, M. Eberhard, H. Hellwagner, L. Szobonya
15:40-16:05 Knapsack problem and piece-picking algorithms forlayered video streaming
Z. Király, E. R. Kovács
16:05-16:30 Multi-layered video broadcast using network coding anda distributed connectivity algorithm
B. Dezső, A. Jüttner, P. Kovács, Á. Ladányi
16:30-16:55
Contact center staff scheduling with various constraints
17:00-18:30
Open Problem Session

Break
B. Engedy, K. Friedl
An improved randomized algorithm for the closest pair problem
A. Iványi
Directed graphs with prescribed score sequences
K. Sejima, T. Fukunaga, H. Nagamochi
Algorithms for covering digraphs by length-bounded paths
A. M. S. Shrestha, S. Tayu, S. Ueno
Bandwidth of convex bipartite graphs and related graph classes
BreakBreakJ. Szigeti, G. Gordos, P. Laborczi
Benchmarking of GPS sources for generating traffic information
Y. Tanaka, S. Imahori, M. Yagiura
A Lagrangian heuristic algorithm for the node capacitatedin-tree packing problem
Break
Y. Kobayashi, K. Murota, R. Weismantel
Cone superadditivity of discrete convex functions
R. Kápolnai, G. Domokos
Inductive generation of convex bodies
T. TodaMultipolytopes and their duality

June, 1

Room 420
Room 110
T. Jordán, G. Domokos, K. Tóth
Geometric sensitivity of rigid graphs
09:10-10:00
T. Jordán, V. E. Kaszanitzky
On generically affinely rigid hypergraphs
Break
10:00-10:10
H. Ito, S. Tanigawa, Y. Yoshida
B. Keszegh, D. Pálvölgyi
10:10-10:35 Testing algorithms for (k ,l )-sparsity andOctants are cover decomposable(k ,l )-edge-connected-orientability
S. Fujita
Z. Fekete, T. Jordán, V. E. Kaszanitzky
10:35-11:00
Rigid two-dimensional frameworks with two coincident points Recent progress on proper connection numbers
P. Dóbe, G. Domokos
G. Simonyi, A. Zsbán
11:00-11:25 Combinatorial measurement of the geometric sensitivity
On topological relaxations of chromatic conjecturesof plane trusses
A. Recski
11:25-11:50
Is this matrix singular? Part 2
Break
11:50-13:30
N. Kakimura, K. Makino
13:30-14:20
Robust independence systems
14:20-14:30
Break
T. Király
14:30-14:55
Degree bounded matroids and partial forest covering
A. Shioura
14:55-15:20 Polynomial-time approximation schemes formaximizing M♮-concave functions under budget constraints
15:20-15:40
BreakD. Erdős, A. Frank, K. Kun
15:40-16:05
Sink-stable sets of digraphs
A. Frank, Cs. Király
16:05-16:30
Tree-compositions and submodular flows
K. Bérczi, E. R. Kovács
16:30-16:55
A note on strongly edge-disjoint arborescences
18:00-20:00

Banquet at Kyoto University Clock Tower Centennial Hall

June, 2

Room 420
Room 110
Z. Király
09:10-10:00
Approximation of maximum stable marriage
Break
10:00-10:10
T. Inoshita, R. W. Irving, K. Iwama, S. Miyazaki, T. Nagase
Z. Á. Mann, T. Szép
10:10-10:35 Improving man-optimal stable matchings
A best-first-search approach to constraint satisfaction problemsby minimum change of preference lists
K. Cechlárová, T. Fleiner
Z. Zombori, P. Szeredi, G. Lukácsy
10:35-11:00 Room assignment, rent division and linear programming
Loop elimination, a sound optimisation techniquefor PTTP related theorem proving
G. De Marco, E. Kranakis, G. Wiener
T. Fleiner, Z. Jankó
11:00-11:25
Finding majority with triple queries
College admissions and lattices
T. Király, J. Pap
S. Tsuchiya
11:25-11:50
Rooted HIST property on planar triangulations
Ideal set functions
Break
11:50-13:30
H. Hirai
13:30-14:20
Weighted multiflows
14:20-14:30
Break
G. Pap14:30-14:55
A polynomial time algorithm for weighted node-disjoint S -paths
Y. Kobayashi, X. Yin
14:55-15:20 An algorithm for finding a maximum t -matchingexcluding complete partite subgraphs
15:20-15:40
Break
I. Faragó
15:40-16:05
Matrix maximum principles and their application
S. Iwata, M. Takamatsu
16:05-16:30
On the Kronecker canonical form of mixed matrix pencils
L. Csirmaz, P. Ligeti
16:30-16:55
LP problems in secret sharing

June, 3

Room 420
G. Tóth
09:10-10:00
A better bound for the pair-crossing number
10:00-10:10
Break
P. Cheilaris, B. Keszegh, D. Pálvölgyi
10:10-10:35 Unique-maximum and conflict-free coloring for hypergraphs
and tree graphs
Á. Tóth
10:35-11:00
On the asymptotic values of the Hall-ratio
D. Gerbner, B. Keszegh, N. Lemons, C. Palmer, D. Pálvölgyi,
11:00-11:25 B. Patkós
Saturating Sperner families
T. Iimura, K. Murota, A. Tamura
11:25-11:50 Sperner's lemma and zero point theorems on adiscrete simplex and a discrete simplotope
11:50-13:30
Break
S. Kijima
13:30-13:55
Sampling from log-super/submodular distributions
Z. Á. Mann, A. Szajkó
13:55-14:20 Asymptotic behaviour of the complexity of coloring sparse
random graphs
14:20-14:30
Break
N. Tokushige
14:30-14:55 Some results and problems concerning cross intersecting
families of sets
G. O. H. Katona, G. Y. Katona, Z. Katona
14:55-15:20
Most probably intersecting families of subsets