| Publication | Date of Publication | Type |
|---|
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
Operations Research Letters | 2024-06-17 | Paper |
A single machine group scheduling problem with due date assignment and position-dependent costs
Asia-Pacific Journal of Operational Research | 2024-05-23 | Paper |
Magnetic Field Dependent Kondo Transport through Double Quantum Dots System
Annalen der Physik | 2023-11-23 | Paper |
An online trading problem with an increasing number of available products
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
The work function algorithm for the paging problem
Theoretical Computer Science | 2022-08-25 | Paper |
Thermoelectric transport through strongly correlated double quantum dots with Kondo resonance
Physics Letters. A | 2021-10-21 | Paper |
On optimal randomized group testing with one defective item and a constrained number of positive responses
Discrete Optimization | 2021-04-21 | Paper |
| scientific article; zbMATH DE number 7234490 (Why is no real title available?) | 2020-08-12 | Paper |
A new upper bound on the work function algorithm for the \(k\)-server problem
Journal of Combinatorial Optimization | 2020-02-03 | Paper |
A class of asymptotically optimal group screening strategies with limited item participation
Discrete Applied Mathematics | 2019-11-06 | Paper |
A class of asymptotically optimal group testing strategies to identify good items
Discrete Applied Mathematics | 2019-05-03 | Paper |
An improved online evacuation strategy from a convex region on grid networks
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
A randomized competitive group testing procedure
Journal of Combinatorial Optimization | 2018-04-13 | Paper |
Online interval scheduling on a single machine with finite lookahead
Computers & Operations Research | 2016-11-11 | Paper |
Online integrated production-distribution scheduling problems without preemption
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
A new strongly competitive group testing algorithm with small sequentiality
Annals of Operations Research | 2015-08-21 | Paper |
Competitive strategies for an online generalized assignment problem with a service consecution constraint
European Journal of Operational Research | 2015-07-28 | Paper |
A new randomized algorithm for group testing with unknown number of defective items
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
A zig-zag approach for competitive group testing
INFORMS Journal on Computing | 2015-01-26 | Paper |
An efficient FPRAS type group testing procedure to approximate the number of defectives
Journal of Combinatorial Optimization | 2014-04-08 | Paper |
Solving haplotype inference problem with non-genotyped founders via integer linear programming
Journal of Combinatorial Optimization | 2012-07-10 | Paper |
A generalization of Boesch's theorem
Discrete Mathematics | 2012-04-13 | Paper |
An efficient randomized group testing procedure to determine the number of defectives
Operations Research Letters | 2012-04-05 | Paper |
Surviving rates of graphs with bounded treewidth for the firefighter problem
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Efficient haplotype inference algorithms in one whole genome scan for pedigree data with non-genotyped founders
Acta Mathematicae Applicatae Sinica. English Series | 2009-11-13 | Paper |
Lattice grids and prisms are antimagic
Theoretical Computer Science | 2009-06-22 | Paper |
On the upper bounds of the minimum number of rows of disjunct matrices
Optimization Letters | 2009-06-17 | Paper |
Transforming an error-tolerant separable matrix to an error-tolerant disjunct matrix
Discrete Applied Mathematics | 2009-03-04 | Paper |
A new class of antimagic Cartesian product graphs
Discrete Mathematics | 2009-01-28 | Paper |
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
Theoretical Computer Science | 2008-05-28 | Paper |
Searching monotone multi-dimensional arrays
Discrete Mathematics | 2008-04-28 | Paper |
On the complexity of non-unique probe selection
Theoretical Computer Science | 2008-03-05 | Paper |
On searching a table consistent with division poset
Theoretical Computer Science | 2007-02-26 | Paper |
| Cartesian Products of Regular Graphs are Antimagic | 2006-02-14 | Paper |
An Improved Adaptive Algorithm for Competitive Group Testing
(available as arXiv preprint) | N/A | Paper |
