Online Tree Node Assignment with Resource AugmentationAbsolute and Asymptotic Bounds for Online Frequency Allocation in Cellular NetworksAlgorithmica, Online First
Linear-time Haplotype Inference on Pedigree
without Recombinations and Mating Loops SIAM Journal on Computing, 38(6):2179-2197, March 2009
On Dynamic Bin Packing: An Improved Lower
Bound and Resource Augmentation Analysis
Algorithmica, 53(2):172-206, February 2009
Dynamic
Bin Packing of Unit Fractions Items Theoretical
Computer Science, 409(3):521-529, December 2008
Improved on-line broadcast scheduling with
deadlinesJournal
of Scheduling, 11(4):299-308, August 2008
On-line
Scheduling of Parallel Jobs on Two Machines
On-line
Bin Packing of Fragile Objects with Application in Cellular Networks
Journal
of Combinatorial Optimization, 14(4):427-435, November 2007
Efficient
Algorithms for Finding a Longest Common Increasing Subsequence
Journal
of Combinatorial Optimization (Special Issue on Bioinformatics), 13(3):277-288, April 2007
Greedy Online Frequency Allocation in Cellular
Networks
Information
Processing Letter, 102(2-3):55-61, April 2007
New
Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in
Multiprocessor Scheduling
Theoretical
Computer Science,
359(1-3):430-439, August 2006
A Dynamic Programming Approach of Finding an Optimal Broadcast Schedule in Minimizing Total Flow Time
Journal of Combinatorial
Optimization (Speical Issue for COCOON 2005),
11(2):177-187, March 2006
On-line Stream Merging with Max Span and Min
Coverage
Theory of
Computing Systems (Speical Issue for CIAC 2003),
38(4):461-479, July 2005
On-line Stream Merging in a General Setting
Theoretical
Computer Science (Speical Issue for COCOON 2001),
296(1):27-46, March 2003
Escaping
a grid by edge-disjoint paths
Algorithmica, 36(4):343-359, May 2003
Efficient
Algorithms for finding the maximum number of disjoint paths in grids
Journal
of Algorithms,
34(2):337-369, February 2000
Dynamic Offline Conflict-free Coloring for Unit DiscsIn the 6th Workshop of Approximation and Online Algorithms (WAOA 2008),
Universität Karlsruhe, Germany, 18-19 Sep 2008
Lecture
Notes in Computer Science (LNCS) Vol.5426, 241-252
Erratic DancingIn the 5th International Symposium on Computer Music Modeling and Retrieval (CMMR 2008), Copenhagen, Denmark, 19-23 May 2008
Online Frequency Allocation in Cellular
NetworksOnline Deadline Scheduling with Bounded Energy
EfficiencyEnergy Efficient Online Deadline SchedulingFrequency Allocation Problem for Linear
Cellular Networks
Linear-time Haplotype Inference on Pedigree
without Recombinations
The 6th Workshop on Algorithms in Bioinformatics (WABI 2006),
Zurich, Switzerland, Sep 2006
Lecture
Notes in Computer Science (LNCS) Vol.4175, 56-67
On Dynamic Bin Packing: An Improved Lower
Bound and Resource Augmentation Analysis
The 12th Annual International Computing and Combinatorics Conference (COCOON 2006),
Taipei, Taiwan, Aug 2006
Lecture
Notes in Computer Science (LNCS) Vol.4112, 309-319
Improved on-line broadcast scheduling with
deadlinesThe 12th
Annual International Computing and Combinatorics Conference (COCOON 2006),
Taipei, Taiwan, Aug 2006
Lecture
Notes in Computer Science (LNCS) Vol.4112, 320-329
Efficient Algorithms for Finding a Longest
Common Increasing Subsequence
On-line
Bin Packing of Fragile Objects with Application in Cellular Networks
The 1st Workshop on Internet and Network Economics (WINE 2005),
Hong Kong, 15-17 Dec 2005
Lecture
Notes in Computer Science (LNCS) Vol.3828, 564-573
On-line
Scheduling of Parallel Jobs on Two Machines
Proc. the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA
2005), p.369-380, Ballarat, Victoria, Australia, 18-21, Sep
2005
Off-line
Algorithms for Minimizing the Total Flow Time in Broadcast Scheduling
The 11th Annual International Computing and Combinatorics Conference (COCOON
2005), Kunming, Yunnan, China, Aug 2005
Lecture
Notes in Computer Science (LNCS) Vol.3595, 318-328
New
Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in
Multiprocessor Scheduling
The 30th International Symposium on Mathematical Foundations of
Computer Science (MFCS2005),
Gdansk, Poland, Aug 2005
Lecture
Notes in Computer Science (LNCS) Vol.3618, 236-247
Dynamic
Bin Packing of Unit Fractions Items
The 32nd International Colloquium on Automata, Languages and
Programming (ICALP
2005), Lisboa, Portugal, Jul 2005
Lecture
Notes in Computer Science (LNCS) Vol.3580, 614-626
On-line
Windows Scheduling of Temporary Items
The 15th Annual International Symposium on Algorithms and Computation (ISAAC 2004),
Hong Kong, Dec 2004
Lecture
Notes in Computer Science (LNCS) Vol.3341, 259-270
New
Results on On-demand Broadcasting with Deadline via Job Scheduling with
Cancellation
The 10th Annual International Computing and Combinatorics Conference (COCOON 2004),
Jeju Island, Korea, Aug 2004
Lecture
Notes in Computer Science (LNCS) Vol.3106, 210-218
On-line
Stream Merging with Max Span and Min Coverage
The 5th Italian Conference on Algorithms and Complexity (CIAC 2003),
Rome, Italy, May 2003
Lecture
Notes in Computer Science (LNCS) Vol.2653, 78-82
Competitive
Analysis of On-line Stream Merging Algorithms
The 27th International Symposium on Mathematical Foundations of
Computer Science (MFCS 2002), Warszawa - Otwock, Poland, Aug 2002.
Lecture
Notes in Computer Science (LNCS) Vol.2420, 188-200
A
Unified Analysis of Hot Video Schedulers
Proc.
the 34th ACM Symposium Theory of Computing (STOC 2002),
p.179-188, Qubec, Canada, May 2002
Improved
On-line Stream Merging: from a Restricted to a General Setting
The 7th Annual International Computing and Combinatorics Conference
(COCOON 2001), Guilin, China, Aug 2001
Lecture
Notes in Computer Science (LNCS) Vol.2108, 432-442
A
5-competitive on-line scheduler for merging video streams
Proc.
the 15th Parallel and Distributed Processing Symposium IPDPS
(Workshop on Scheduling and Telecommunications), p.2165-2172, San
Francisco, USA, Apr 2001
Escaping
a grid by edge-disjoint paths
Proc.
the 11th Annual ACM-SIAM Symposium on Discrete Algorithms
(SODA 2000), p.726-734, San Francisco, USA, Jan 2000
A
Faster Algorithm for Finding Disjoint Paths in Grids
The 10th Annual International Symposium on Algorithms and Computation
(ISAAC 1999), Madras, India, Dec 1999
Lecture
Notes in Computer Science (LNCS) Vol.1741, 393-402
Efficient
Algorithms for Finding Disjoint Paths in Grids
Proc. the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA
1997), p.454-463, New Orleans, USA, Jan 1997
Algorithms
for finding optimal disjoint paths around a rectangle
Proc. of 8th Annual International Symposium on Algorithms and
Computation (ISAAC 1997), p.314-323, Singapore, Dec 1997
Lecture Notes in Computer Science (LNCS) Vol.1350, 314-323
Linear-Time
Algorithms for Unspecified Routing in Grids
Proc. of Int. Computer Symposium (ICS 1996), p.79-85, Taiwan, Dec 1996
Efficient Algorithms for Disjoint Paths
Problems in Grids