| Accept Papers
|
| MAX-SNP Hardness
and Approximation of Selected-Internal Steiner Trees
|
Sun-Yuan Hsieh
(National Cheng Kung University)
|
| On Indecomposability
Preserving Elimination Sequences |
Chandan K. Dubey
(Indian Institute of Technology, Kanpur)
Shashank Kantilal Mehta
(Indian Institute of Technology. Kanpur)
|
| Reconstructing Evolution
of Natural Languages: Complexity and Parameterized Algorithms
|
Iyad A Kanj (DePaul
University)
Luay Nakhleh
(Rice University)
Ge Xia (Lafayette
College)
|
| A Detachment Algorithm
for Inferring a Graph from Path Frequency |
Hiroshi Nagamochi
(Kyoto University)
|
| The On-Line Heilbronn's
Triangle Problem in $d$ Dimensions |
Gill Barequet
(Technion---Israel Inst. of Technology)
Alina Shaikhet
(Technion---Israel Inst. of Technology)
|
| Counting $d$-Dimensional
Polycubes and Nonrectangular Planar Polyominoes
|
Gill Barequet
(Technion---Israel Inst. of Technology)
Gadi Aleksandrowicz
(Technion)
|
| Iterated TGR languages:
Membership problem and effective closure properties
|
Kai Salomaa
(Queen's University)
Ian McQuillan
(University of Saskatchewan)
Mark Daley
(University of Western Ontario)
|
| Improved Algorithms
for the Minmax Regret 1-Median Problem |
Biing-Feng Wang
(National Tsing Hua University)
|
| Bimodal Crossing
Minimization |
Merijam Percan
(University of Cologne)
Christoph Buchheim
(University of Cologne)
Michael Jünger
(University of Cologne)
Annette Menze
(University of Cologne)
|
| Approximating min-max
(regret) versions of some polynomial problems
|
Cristina Bazgan
(University Paris Dauphine)
Hassene Aissi
(University Paris Dauphine)
Daniel Vanderpooten
(University Paris Dauphine)
|
| Restricted Mesh
Simplification using Edge Contractions |
Mattias Hans Andersson
(Lund University)
Christos Levcopoulos
(Lund University)
Joachim Gudmundsson
(National ICT Australia)
|
| Edge pricing of
multicommodity networks for selfish users with elastic demands
|
George Karakostas
(McMaster University)
Stavros Kolliopoulos
(University of Athens)
|
| Characterizations
and Linear Time Recognition of Helly Circular-Arc Graphs
|
Min Chih Lin
(Universidad de Buenos Aires - Facultad de Cs. Exactas y Naturales)
Jayme Luiz Szwarcfiter
(Universidade Federal do Rio de Janeiro)
|
| Finding small OBDDs
for incompletely specified truth tables is hard
|
Peter Bro Miltersen
(University of Aarhus)
Jesper Torp Kristensen
(University of Aarhus)
|
| Minimum Clique Partition
Problem with Constrained Weight for Interval Graphs
|
Jianping Li
(Yunnan University)
Jianbo Li
(Kunming University of Science and Technology)
Weidong Li
(Yunnan University)
|
| Lower Bounds and
Parameterized Approach for Longest Common Subsequence
|
Xiuzhen Huang
(Arkansas State University)
|
| The $d$-Identifying Codes Problem
for Vertex Identification in Graphs: Probabilistic Analysis and an Approximation
Algorithm |
Ying Xiao (University
of Oklahoma)
Christoforos Hadjicostis
(University of Illinois at Urbana-Champaign)
Krishnaiyan Thulasiraman
(University of Oklahoma)
|
| On Dynamic Bin Packing:
An Improved Lower Bound and Resource Augmentation Analysis
|
Wun-Tat Chan
(University of Hong Kong)
Prudence W.H. Wong
(The University of Liverpool)
Fencol Yung
(The University of Hong Kong)
|
| Efficient Partially
Blind Signature Scheme with Provable Security
|
Zheng Gong (Shanghai
Jiaotong University)
|
| A PTAS for cutting
out polygons with lines |
Minghui Jiang
(Utah State University)
Sergey Bereg
(University of Texas at Dallas)
Ovidiu Daescu
(University of Texas at Dallas)
|
| Varieties Generated
by Certain Models of Reversible Finite Automata
|
Marats Golovkins
(University of Latvia)
Jean-Éric Pin
(Université Paris VII and CNRS)
|
| The class constrained
bin packing problem with applications to video-on-demand
|
eduardo candido xavier
(State University of Campinas- (Unicamp))
flavio miyazawa
(Unicamp)
|
| On the Threshold
of Having a Linear Treewidth in Random Graphs
|
Yong Gao (University
of British Columbia Okanagan)
|
| On Lazy Bin Covering
and Packing Problems |
Mingen Lin (University
at Buffalo, the State University of New York)
Yang Yang
(University at Buffalo, the State University of New York)
Jinhui Xu
(University at Buffalo, the State University of New York)
|
| A rigorous analysis
for set-up time models - a metric perspective
|
avner magen
(university of toronto)
|
| On the Combinatorial
Representation of Information |
Joel Ratsaby
(Ben Gurion University of the Negev)
|
| Overlap-Free Regular
Languages |
YO-SUB HAN (Korea
Institute of Science and Technology)
|
| Fixed linear crossing
minimization by reduction to the maximum cut problem
|
Lanbo Zheng
(University of Sydney)
Christoph Buchheim
(University of Cologne)
|
| Robust quantum algorithms
with $\epsilon$-biased oracles |
Tomoya Suzuki
(Nara Institute of Science and Technology)
Shigeru Yamashita
(Nara Institute of Science and Technology)
Katsumasa Watanabe
(Nara Institute of Science and Technology)
Masaki Nakanishi
(Nara Institute of Science and Technology)
|
| Optimal acyclic
edge colouring of grid like graphs |
Narayanan Narayanan
(Institute of Mathematical Sciences)
Rahul Muthu
(Institute of Mathematical Sciences)
Chinthamani R Subramanian
(Institute of Mathematical Sciences)
|
| A Tight Analysis
of Most-Requested-First for On-demand Data Broadcast
|
Yee Shing Regant Hung
(Department of Computer Science, The University of Hong Kong)
Hing Fung Ting
(The University of Hong Kong)
|
| A Simplicial Approach
for Discrete Fixed Point Theorems |
Xi Chen (Tsinghua
University, Beijing, P.R.China)
Xiaotie Deng
(City University of Hong Kong, Hong Kong, China)
|
| Improved on-line
broadcast scheduling with deadlines |
Stanley P Y Fung
(University of Leicester)
Feifeng Zheng
(Xi'an JiaoTong University, China)
Wun-Tat Chan
(University of Hong Kong)
Francis Chin
(The University of Hong Kong)
Chung Keung Poon
(City University of Hong Kong)
Prudence W.H. Wong
(The University of Liverpool)
|
| Enumerating Non-crossing Minimally Rigid Frameworks |
Naoki Katoh
(Kyoto University)
David Avis
(McGill University)
Makoto Ohsaki
(Kyoto University)
Ileana Streinu
(Smith College)
Shin-ichi Tanigawa
(Kyoto University)
|
| Partitioning a Multi-Weighted
Graph to Connected Subgraphs of Almost Uniform Size
|
Takehiro Ito
(Tohoku University)
Kazuya Goto
(Tohoku University)
Xiao Zhou
(Tohoku University)
Takao Nishizeki
(Tohoku University)
|
| On the Negation-Limited
Circuit Complexity of Sorting and Inverting K-tonic Sequences
|
Kazuyuki Amano
(Tohoku University)
Takayuki Sato
(Sendai National Colledge of Technology)
Akira Maruoka
(Tohoku University)
|
| Effectiveness of the Linear
Programming Relaxation of the 0-1 Multi-commodity Minimum Cost Network Flow
Problem |
Dae-Sik Choi
(Korea University)
In-chan Choi
(Korea University)
|
| On Incentive Compatible
Competitive Selection Protocol |
Xi Chen (Tsinghua
University, Beijing, P.R.China)
Xiaotie Deng
(City University of Hong Kong, Hong Kong, China)
|
| Geometric representation
of graphs in low dimension |
L. Sunil Chandran
(Indian Institute of Science)
Naveen Sivadasan
(Strand Life Sciences)
|
| The Complexity of
Black-Box Ring Problems |
Vikraman Arvind
(Institute of Mathematical Sciences, Chennai, India)
Bireswar Das
(Institute of Mathematical Sciences, Chennai)
Partha Mukhopadhyay
(Institute of Mathematical Sciences, Chennai)
|
| Reconciling Gene
Trees with Apparent Polytomies |
Oliver Eulenstein
(Iowa State University)
Wen-Chieh Chang
(Iowa State University)
|
| Enumerate and Expand:
New Runtime Bounds for Vertex Cover Variants
|
Stefan Richter
(RWTH Aachen University)
Peter Rossmanith
(RWTH Aachen University)
Daniel Moelle
(RWTH Aachen University)
|
| Finding Patterns
with Variable Length Gaps or Don't Cares |
Mohammad Sohel Rahman
(King's College London)
Costas Iliopoulos
(King's College London)
Inbok Lee
(Seoul National University)
Manal Mohamed
(King's College London)
William F. Smyth
(McMaster University)
|
| On Unfolding Lattice
Polygons and Trees + Straightening 2D Trees of Diameter 4
|
Sheung-Hung Poon
(TU Eindhoven)
|
| k-tree characterizing
sequences |
N.S. Narayanaswamy
(I.I.T Madras)
Lotker Zvi
(CWI)
ingmar weber
(mpi)
debapriyo majumdar
(mpi)
|
| A polynomial-time
approximation algorithm for a geometric dispersion problem
|
Joachim Gudmundsson
(National ICT Australia Ltd)
Marc Benkert
(Karlsruhe University)
Rene van Oostrum
(Utrecht University)
Christian Knauer
(Freie University, Berlin)
Alexander Wolff
(Karlsruhe University)
Esther Moet
(Utrecht University)
|
| An Edge Ordering
Problem of Regular Hypergraphs |
Hongbing Fan
(Wilfrid Laurier University)
Robert Kalbfleisch
(Wilfrid Laurier University)
|
| Lower Bounds on the Approximation
of the Exemplar Conserved Interval Distance Problem of Genomes |
Zhixiang Chen
(University of Texas - Pan American)
Richard H Fowler
(University of Texas - Pan American)
Bin Fu (University
of New Orleans)
Binhai Zhu
(Montana State University)
|
| Creation and growth
of components in a random hypergraph process
|
Vlady RAVELOMANANA
(Institut Galilée -- University of Paris Nord)
|
| Computing Maximum-Scoring
Segments in Almost Linear Time |
Fredrik Bengtsson
(Luleå University of Technology)
Jingsen Chen
(Luleå University of Technology)
|
| The Matrix Orthogonal
Decomposition Problem in Intensity-Modulated Radiation Therapy
|
Xiaodong Wu
(The University of Iowa)
Xin Dou (The
University of Iowa)
John E Bayouth
(The University of Iowa)
John M Buatti
(The University of Iowa)
|
| Aggregating Strategy
for Online Auctions |
Eiji Takimoto
(Tohoku University)
Shigeaki Harada
(Tohoku University)
Akira Maruoka
(Tohoku University)
|
| Total: 52 papers |