
Friday, June 03.

Saturday, June 04.

Sunday, June 05.

Monday, June 06.

09:0009:45

Takao Asano

Congestion Minimization Confluent Flow Problem: Experimental Evaluation of Algorithms


László Lovász

Node models and edge models


Satoru Fujishige

Submodularity and Polyhedra


Kazuo Murota

MConvex Functions on Jump Systems: Generalization of Minsquare Factor Problem


09:5010:10

Takehiro Ito

Algorithm for Partitioning Graphs of Bounded TreeWidth of Supply and Demand


Tamás Király

Orientations with parity and capacity constraints


Kiyohito Nagano

A Strongly Polynomial Algorithm for Line Search in Submodular Polyhedra


Zsolt Fekete

Source location with rigidity and tree packing requirements


10:1510:35

Alpár Jüttner

On Resource Constrained Optimization Problems


Gyula Pap

Packing nonreturning Apaths


Mariko Sakashita

Laminar Covering Problem


Tibor Jordan

Uniquely Localizable Networks with Few Anchors



coffee break 
11:0511:50

Hiroshi Nagamochi

A Deterministic Algorithm for Finding All Minimum kWay Cuts


Takeshi Tokuyama

Approximation Algorithms for Computing a Highly Dense Subgraph


Norihide Tokushige

Intersecting families  uniform versus weighted


Satoru Iwata

Linking Systems and Matroid Pencils


11:5512:15

Toshimasa Ishii

Bisecting a FourConnected Graph with Three Resource Sets


Shinichi Nakayama

An O(n^3) Time Algorithm for Obtaining the Minimum Vertex Ranking Spanning Tree on Permutation Graphs


Gyula OH Katona

Improved YBLM for Sperner families


Bill Jackson

On the Rank Function of the 3Dimensional Rigidity


12:2012:40

Gábor Salamon

Spanning Tree Optimization Problems with Degree Based Objective Functions


Dieter Rautenbach

Dominating and Large Induced Trees in Regular Graphs


Gábor Wiener

Approximately Separating Systems


Márton Makai

Rigid graphs from edgepairs



lunch break 
14:2015:05

Toshimasa Watanabe

Improving Performance Ratios by Repeatedly Executing Approximation Algorithms for Several Graph Connectivity Related Problems


Toshihide Ibaraki

Road to "Problem Solving Engines"


Kenichi Kawarabayashi

Algorithmic aspects of Hadwiger's Conjecture


Akihisa Tamura

A TwoSided DiscreteConcave Market with Possibly Bounded Side Payments


15:1015:30

Mihály Bárász

An Algorithm For Source Location In Directed Graphs


Kazuya Haraguchi

Compactness of Classifiers by Iterative Compositions of Features


Yoichi Hanatani

Hajós Calculus on Planar Graphs


Naonori Kakimura

SignSolvable Linear Programs


15:3515:55

Zoltán Király

On wellbalanced orientations


Zoltán Füredi

The distribution of the angles on the plane


Wael El Oraiby

Planar ksets under insertion


Hiroshi Hirai

Greedy Fans: A geometric approach to dual greedy algorithms



coffee break 
16:2516:45

Takuro Fukunaga

Edge packing problem with edge capacity constraints


Shigeaki Harada

Online Allocation with Risk Information


Shinya Fujita

Degree Conditions and Disjoint Cycles in Graphs


Taizo Sadahiro

Circuit Switched Broadcastings and Digit Tilings on Torus Networks


Gábor Simonyi

On the local chromatic number of graphs


Attila Sharinoumi Sali

Color critical hypergraphs and forbidden configurations


Dániel Fogaras

Linear approximation algorithms and space lower bounds for the SimRank similarity function on massive graphs


Yoshio Okamoto

Counting the Independent Sets of a Chordal Graph in Linear Time


16:5017:10

László Végh

Primaldual approach for directed vertex connectivity augmentation and generalizations


Satoshi Takata

Chomp with PoisonStrewn Chocolates


Kiyoshi Yoshimoto

2factors and hamilton cycles in line graphs


Katsuhisa Yamanaka

Coding Floorplans with Fewer Bits


Zsolt Patakfalvi

Line graphs of cubic graphs are normal


Hiroki Nakayama

Comparing the strengths of the nonrealizability certificates for oriented matroids


Péter Sziklai

DNAwords and word posets


Masashi Kiyomi

Enumerating Labeled Chordal Graphs on Complete Graph


17:1517:35

Péter Biró

Stable matching with incremental algorithms  The last one gets his best stable partner


Tsuyoshi Ito

New classes of facets of cut polytope and tightness of I_mm22 Bell inequalities


Jácint Szabó

Some results on the degree prescribed factor problem


Attila Reiss

3dimensional Channel Routing


Masahiko Murakami

Fast Algorithms for Computing Jones Polynomials of Certain Links


Tadashi Sakuma

The Packing Clutter of the Positive Cocircuits of an Oriented Matroid Whose Rank is <= 4


András Telcs

Intersection of Random Walks on hierarchical structures



17:4018:00

Júlia Pap

Total dual integrality of a description of the stable marriage polyhedron


Kazuyuki Amano

Tighter Bounds on the OBDD size of Integer Multiplication


Yoshinori Teshima

Enumeration of Triangles Configuration in Cube Cutting


Gergely Lukácsy

A Generic framework for plagiarism detection in programs


Florent Domenach

Cryptomorphisms of Closure Systems Axiomatization and Structures


András Recski

OneDimensional Synthesis of Graphs as Tensegrity Frameworks




18:30

Welcome party

Rényi Institute




