Program of HJ2007
April 3 (Tuesday)
09:25—09:30
09:30—10:15

11:00—11:15
11:15—12:00

12:00—13:30
13:30—14:45

14:45—15:15
15:15—16:30

16:30—17:00

Opening [Room AB]
Session 1-1 (invited talks) [Room AB]
Some matroidal results inspired by electrical engineering applications
András Recski
A survey of results on packing A-paths
Gyula Pap
Coffee BreakSession 1-2 (invited talk) [Room AB]
Zonotopes, linear programming, and the LP-Newton method
Satoru Fujishige
Lunch BreakSession 1-3-1 (contributed talks) [Room AB]
Session 1-3-2 (contributed talks) [Room CD]
Integral covering in perfect clutters
Generalized bounds for reconstruction of words
Y. Matsuoka
P. Ligeti and P. Sziklai
λ-supermodular functions and dual packing theory
Is it worth mining association rules?
Z. Király
K. Buza and F. Bodon
A weighted even factor algorithm
Eigen-distribution for deriving randomized complexity ofread-once Boolean functions
K. Takazawa
C.-G. Liu and K. Tanaka
Coffee BreakSession 1-4-1 (contributed talks) [Room AB]
Session 1-4-2 (contributed talks) [Room CD]
An algorithm for a super-stable roommate problem
Line and plane arrangements with large average diameter
T. Fleiner, R. W. Irving, and D. F. Manlove
A. Deza and F. Xie
A provably efficient algorithm for the multi-criteria
The lattice of convex geometries: an introduction tolinear programming
generalized shellings
Y. Okamoto and T. Uno
F. Domenach and M. Hachimori
Stable exchange of indivisible goods with restrictions
Minkowski sums of polytopes relatively in general position
P. Biró
K. Fukuda and C. Weibel
Recognizing almost planar graphs (short talk)
Algorithmic aspects of modern processors (short talk)I. Schlotter
F. BodonWatson-Crick complementarity in DNA computing (short talk) Algorithmic complexity of Sperner’s lemma (short talk)J. Csima
K. Friedl
Railway delay management (short talk)
C. Megyeri

April 4 (Wednesday)
09:30—10:15

11:00—11:15
11:15—12:00

12:00—13:30
13:30—15:10

15:10—15:40
15:40—17:20

18:00—20:00

Session 2-1 (invited talks) [Room AB]
Index minimization of differential-algebraic equations in hybrid analysis for circuit simulation
Satoru Iwata and Mizuyo Takamatsu
3-dimensional RoutingAndrás Recski and Dávid SzeszlérCoffee BreakSession 2-2 (invited talk) [Room AB]
Orientations and detachments of graphs with prescribed degrees and connectivity
Satoru Iwata and Tibor Jordan
Lunch BreakSession 2-3-1 (contributed talks) [Room AB]
Session 2-3-2 (contributed talks) [Room CD]
Computing degrees of all cofactors in mixed polynomial
Practical issues in the implementation of graph patternmatrices
matching
S. Iwata and M. Takamatsu
G. Varró
Operations on M-convex functions on jump systems
Generation of cutter paths for hard material
Y. Kobayashi, K. Murota, and K. Tanaka
S. Imahori, M. Kushiya, T. Nakashima, and K. Sugihara
The greedy algorithm for strict cg-matroids
Two combinatorial optimisation problems in multimedia systems
Y. SanoT. Szkaliczki, P. Kárpáti, and B. Goldschmidt
A max-flow min-cut theorem and a topological representation LEMON: an open source software library for efficient modelingtheorem of convex geometries and antimatroids
and optimization in networks
M. Nakamura
A. JüttnerCoffee BreakSession 2-4-1 (contributed talks) [Room AB]
Session 2-4-2 (contributed talks) [Room CD]
Leaves of spanning trees and vulnerability
On some zero-error problems of information theory
G. Salamon and G. Wiener
G. Simonyi
New 2-tough graphs without Hamilton cycle
Independent sets in bounded-degree hypergraphs
A. Németh and G. Y. Katona
M. M. Halldórsson and E. Losievskaja
Realizations of non-uniform oriented matroids using
Minimum cost single-cover source location problem
generalized mutation graphson undirected networks
H. Nakayama, S. Moriyama, and K. Fukuda
H. W. Hamacher and D. R. Poetranto
Truthful auctions with limited range of bids
The complexity of three-dimensional channel routing
T. Horiyama, K. Iwama, and D. Sumita
S. Tayu and S. Ueno
BanquetApril 5 (Thursday)
09:30—10:15

11:00—11:15
11:15—12:00

12:00—13:30
13:30—14:15

14:15—14:30
14:30—16:00

16:00—16:05

Session 3-1 (invited talks) [Room AB]
Linear time algorithm for computing crossing number
Ken-ichi Kawarabayashi
Applications of Eulerian splitting-offTamás KirályCoffee BreakSession 3-2 (invited talk) [Room AB]
Rooted k-connections in digraphs via matroid intersection
András Frank
Lunch BreakSession 3-3 (invited talk) [Room AB]
Even out degree orientation of a graphMikio KanoCoffee BreakSession 3-4 (invited talks) [Room AB]
Trace Functions
Gábor Wiener
Forbidden inclusion patterns in families of subsets
Gyula O. H. Katona
Closing [Room AB]