| Publication | Date of Publication | Type |
|---|
Approximation and competitive algorithms for single-minded selling problem
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| Finding the medial axis of a simple polygon in linear time | 2023-03-21 | Paper |
| A new subgraph of minimum weight triangulations | 2023-01-25 | Paper |
A linear-time certifying algorithm for recognizing generalized series-parallel graphs
Discrete Applied Mathematics | 2022-12-08 | Paper |
Constant competitive algorithms for unbounded one-way trading under monotone hazard rate
Mathematical Foundations of Computing | 2022-03-07 | Paper |
Offline and online algorithms for single-minded selling problem
Theoretical Computer Science | 2020-04-22 | Paper |
| Unbounded one-way trading on distributions with monotone hazard rate | 2018-02-26 | Paper |
Minimum Manhattan network is NP-complete
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Constrained pairwise and center-star sequences alignment problems
Journal of Combinatorial Optimization | 2016-10-20 | Paper |
Triangulations without minimum-weight drawing
Information Processing Letters | 2016-06-16 | Paper |
Competitive algorithms for unbounded one-way trading
Theoretical Computer Science | 2015-12-08 | Paper |
| scientific article; zbMATH DE number 6472621 (Why is no real title available?) | 2015-08-14 | Paper |
Competitive algorithms for unbounded one-way trading
Algorithmic Aspects in Information and Management | 2015-05-20 | Paper |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Theoretical Computer Science | 2014-10-06 | Paper |
Online pricing for bundles of multiple items
Journal of Global Optimization | 2014-09-18 | Paper |
A new upper bound 2.5545 on 2D Online Bin Packing
ACM Transactions on Algorithms | 2014-09-09 | Paper |
On the complexity of constrained sequences alignment problems
Frontiers in Algorithmics | 2014-09-02 | Paper |
Algorithms for placing monitors in a flow network
Algorithmica | 2014-03-25 | Paper |
Non-adaptive complex group testing with multiple positive sets
Theoretical Computer Science | 2014-01-16 | Paper |
Constant-competitive tree node assignment
Theoretical Computer Science | 2014-01-13 | Paper |
Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Uniformly inserting points on square grid
Information Processing Letters | 2013-04-04 | Paper |
COMPETITIVE ALGORITHMS FOR ONLINE PRICING
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
Online pricing for multi-type of items
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Online call control in cellular networks revisited
Information Processing Letters | 2012-03-09 | Paper |
Adaptive phenotype testing for AND/OR items
Algorithms and Computation | 2011-12-16 | Paper |
Online tree node assignment with resource augmentation
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
A clique-based algorithm for constructing feasible timetables
Optimization Methods & Software | 2011-10-12 | Paper |
Competitive algorithms for online pricing
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Non-adaptive complex group testing with multiple positive sets
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Minimum Manhattan network is NP-complete
Discrete & Computational Geometry | 2011-06-03 | Paper |
Online algorithm for 1-space bounded multi-dimensional bin packing
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2011-06-03 | Paper |
Improved competitive algorithms for online scheduling with partial job values
Lecture Notes in Computer Science | 2011-03-18 | Paper |
One-space bounded algorithms for two-dimensional bin packing
International Journal of Foundations of Computer Science | 2011-01-19 | Paper |
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
Algorithms and Computation | 2010-12-09 | Paper |
Absolute and asymptotic bounds for online frequency allocation in cellular networks
Algorithmica | 2010-09-16 | Paper |
Deterministic online call control in cellular networks and triangle-free cellular networks
Frontiers in Algorithmics | 2010-09-07 | Paper |
Online uniformly inserting points on grid
Algorithmic Aspects in Information and Management | 2010-07-20 | Paper |
Approximated distributed minimum vertex cover algorithms for bounded degree graphs
Lecture Notes in Computer Science | 2010-07-20 | Paper |
A constant-competitive algorithm for online OVSF code assignment
Algorithmica | 2010-02-23 | Paper |
Greedy online frequency allocation in cellular networks
Information Processing Letters | 2010-01-29 | Paper |
Linear-time haplotype inference on pedigrees without recombinations and mating loops
SIAM Journal on Computing | 2010-01-06 | Paper |
A tight lower bound for job scheduling with cancellation
Information Processing Letters | 2009-12-18 | Paper |
1-bounded space algorithms for 2-dimensional bin packing
Algorithms and Computation | 2009-12-17 | Paper |
A 1-local asymptotic 13/9-competitive algorithm for multicoloring hexagonal graphs
Algorithmica | 2009-11-25 | Paper |
Improved on-line broadcast scheduling with deadlines
Journal of Scheduling | 2009-08-28 | Paper |
Online Tree Node Assignment with Resource Augmentation
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Variable-Size Rectangle Covering
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Algorithms for Placing Monitors in a Flow Network
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Online Frequency Assignment in Wireless Communication Networks
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Dynamic Offline Conflict-Free Coloring for Unit Disks
Approximation and Online Algorithms | 2009-02-12 | Paper |
On-line scheduling of parallel jobs on two machines
Journal of Discrete Algorithms | 2008-11-18 | Paper |
A Constant-Competitive Algorithm for Online OVSF Code Assignment
Algorithms and Computation | 2008-05-27 | Paper |
Frequency Allocation Problems for Linear Cellular Networks
Algorithms and Computation | 2008-04-24 | Paper |
Online bin packing of fragile objects with application in cellular networks
Journal of Combinatorial Optimization | 2008-04-23 | Paper |
Construction of the nearest neighbor embracing graph of a point set
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
Minimum Parent-Offspring Recombination Haplotype Inference in Pedigrees
Transactions on Computational Systems Biology II | 2008-03-19 | Paper |
Online OVSF Code Assignment with Resource Augmentation
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Online competitive algorithms for maximizing weighted throughput of unit jobs
Journal of Discrete Algorithms | 2007-11-05 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Improved On-Line Broadcast Scheduling with Deadlines
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
Journal of Combinatorial Optimization | 2006-08-14 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
Computational Geometry | 2005-09-02 | Paper |
ONLINE SCHEDULING OF UNIT JOBS WITH BOUNDED IMPORTANCE RATIO
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2005-06-15 | Paper |
Approximate and dynamic rank aggregation
Theoretical Computer Science | 2004-10-27 | Paper |
Improved competitive algorithms for online scheduling with partial job values
Theoretical Computer Science | 2004-10-27 | Paper |
Online scheduling with partial job values: does timesharing or randomization help?
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2080989 (Why is no real title available?) | 2004-08-04 | Paper |
Escaping a grid by edge-disjoint paths
Algorithmica | 2003-08-19 | Paper |
Efficient algorithm for transversal of disjoint convex polygons.
Information Processing Letters | 2003-01-21 | Paper |
Transversal of disjoint convex polygons.
Information Processing Letters | 2003-01-21 | Paper |
Maximum weight triangulation and graph drawing
Information Processing Letters | 2002-07-25 | Paper |
| Approximation for minimum triangulation of convex polyhedra | 2002-07-22 | Paper |
Approximation for minimum triangulations of simplicial convex 3-polytopes
Discrete & Computational Geometry | 2002-02-07 | Paper |
| scientific article; zbMATH DE number 1629854 (Why is no real title available?) | 2001-11-06 | Paper |
| scientific article; zbMATH DE number 1629971 (Why is no real title available?) | 2001-10-18 | Paper |
| scientific article; zbMATH DE number 1555973 (Why is no real title available?) | 2001-01-24 | Paper |
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
Journal of Algorithms | 2000-08-28 | Paper |
| scientific article; zbMATH DE number 1445371 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1222816 (Why is no real title available?) | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 30301 (Why is no real title available?) | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4050990 (Why is no real title available?) | 1988-01-01 | Paper |
On embedding rectangular grids in hypercubes
IEEE Transactions on Computers | 1988-01-01 | Paper |
Distributed election in complete networks
Distributed Computing | 1988-01-01 | Paper |
An Information-Based Model for Failure-Handling in Distributed Database Systems
IEEE Transactions on Software Engineering | 1987-01-01 | Paper |
Optimal Termination Protocols for Network Partitioning
SIAM Journal on Computing | 1986-01-01 | Paper |
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
SIAM Journal on Computing | 1984-01-01 | Paper |
Efficient inference control for range SUM queries
Theoretical Computer Science | 1984-01-01 | Paper |
A general program scheme for finding bridges
Information Processing Letters | 1983-01-01 | Paper |
Efficient parallel algorithms for some graph problems
Communications of the ACM | 1982-01-01 | Paper |
Auditing and Inference Control in Statistical Databases
IEEE Transactions on Software Engineering | 1982-01-01 | Paper |
Complexity and Solutions of Some Three-Stage Flow Shop Scheduling Problems
Mathematics of Operations Research | 1982-01-01 | Paper |
On <i>J</i> -maximal and <i>J</i> -minimal Flow-Shop Schedules
Journal of the ACM | 1981-01-01 | Paper |
Bounds on Schedules for Independent Tasks with Similar Execution Times
Journal of the ACM | 1981-01-01 | Paper |
Fast Sorting Algorithms on Uniform Ladders (Multiple Shift-Register Loops)
IEEE Transactions on Computers | 1980-01-01 | Paper |
An <i>O(n)</i> algorithm for determining a near-optimal computation order of matrix chain products
Communications of the ACM | 1978-01-01 | Paper |
The Partial Fraction Expansion Problem and Its Inverse
SIAM Journal on Computing | 1977-01-01 | Paper |
A fast error evaluation algorithm for polynomial approximation
Information Processing Letters | 1977-01-01 | Paper |
An&lt;tex&gt;O(N^2)&lt;/tex&gt;algorithm for partial fraction expansion
IEEE Transactions on Circuits and Systems | 1977-01-01 | Paper |
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
SIAM Journal on Computing | 1976-01-01 | Paper |
