| Publication | Date of Publication | Type |
|---|
Parameterized algorithms and complexity for scheduling with precedence constraints and time windows
Theoretical Computer Science | 2026-06-15 | Paper |
Better guarantees for individual fairness k-median
Theoretical Computer Science | 2026-05-08 | Paper |
| Improved parameterized algorithms for scheduling with precedence constraints and time windows | 2026-01-28 | Paper |
Parameterized algorithms for the spanning forest isomorphism and containment on tree
Theoretical Computer Science | 2025-12-12 | Paper |
| Exact algorithms for the maximum k-balanced weighted biclique problem | 2025-11-20 | Paper |
| Improved approximation algorithm for individual fairness k-median | 2025-10-29 | Paper |
Approximation algorithms for facility location and k-median with differential privacy
Theoretical Computer Science | 2025-09-16 | Paper |
On well (edge) dominated and equimatchable strong product graphs
Discrete Mathematics | 2025-09-16 | Paper |
Minimum sum vertex cover: difficulty of ordering
Theoretical Computer Science | 2025-07-21 | Paper |
| Parameterized algorithms for planar 2-layer drawing by vertex splitting on a given subset | 2025-06-17 | Paper |
| Minimum sum vertex cover: kernelization and parameterized algorithms | 2025-06-17 | Paper |
| Parameterized algorithms for the spanning forest isomorphism (or containment) on tree problems | 2025-04-15 | Paper |
| Modification problems toward proper (Helly) circular-arc graphs | 2024-12-03 | Paper |
Modification problems toward proper (Helly) circular-arc graphs
Information and Computation | 2024-12-03 | Paper |
| Improved approximation algorithm for the distributed lower-bounded k-center problem | 2024-11-12 | Paper |
Comment on `Criteria for robust finite-time stabilisation of linear singular systems with interval time-varying delay'
IET Control Theory & Applications | 2024-09-05 | Paper |
PTAS for minimum cost multicovering with disks
SIAM Journal on Computing | 2024-08-27 | Paper |
| A PTAS framework for clustering problems in doubling metrics | 2024-08-22 | Paper |
Parameterized algorithms for fixed-order book drawing with few crossings per edge
International Journal of Foundations of Computer Science | 2024-07-09 | Paper |
Study of the effects of fractional order and damping coefficient on the dynamics of giant magnetostrictive actuators
Acta Mechanica | 2024-05-27 | Paper |
New algorithms for fair \(k\)-center problem with outliers and capacity constraints
Theoretical Computer Science | 2024-04-16 | Paper |
On scheduling multiple parallel two-stage flowshops with Johnson's rule
Journal of Combinatorial Optimization | 2024-03-20 | Paper |
| Applying Johnson's rule in scheduling multiple parallel two-stage flowshops | 2024-02-28 | Paper |
| The fair \(k\)-center with outliers problem: FPT and polynomial approximations | 2024-02-28 | Paper |
A 2.57-approximation algorithm for contig-based genomic scaffold filling
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
Exponential time approximation scheme for TSP
Algorithmic Aspects in Information and Management | 2024-02-23 | Paper |
| scientific article; zbMATH DE number 7788391 (Why is no real title available?) | 2024-01-15 | Paper |
| A unified framework of FPT approximation algorithms for clustering problems | 2023-11-14 | Paper |
| Graph Searches and Their End Vertices. | 2023-02-03 | Paper |
| Small candidate set for translational pattern search | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650294 (Why is no real title available?) | 2023-02-03 | Paper |
Improved approximation algorithms for solving the squared metric k-facility location problem
Theoretical Computer Science | 2022-12-21 | Paper |
Characterization and linear-time recognition of paired threshold graphs
(available as arXiv preprint) | 2022-12-21 | Paper |
Small candidate set for translational pattern search
Algorithmica | 2022-10-06 | Paper |
Graph searches and their end vertices
Algorithmica | 2022-08-18 | Paper |
| New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition | 2022-07-21 | Paper |
A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries
Theoretical Computer Science | 2022-05-31 | Paper |
A refined branching algorithm for the maximum satisfiability problem
Algorithmica | 2022-03-22 | Paper |
An improved FPT algorithm for the flip distance problem
Information and Computation | 2021-11-25 | Paper |
An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem
Theoretical Computer Science | 2021-11-01 | Paper |
End vertices of graph searches on bipartite graphs
Information Processing Letters | 2021-10-19 | Paper |
Fixed-parameter tractability for the tree assembly problem
Theoretical Computer Science | 2021-10-06 | Paper |
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
SIAM Journal on Discrete Mathematics | 2021-09-17 | Paper |
Improved approximation for prize-collecting red-blue median
Theoretical Computer Science | 2021-07-22 | Paper |
| On fixed-order book thickness parameterized by the pathwidth of the vertex ordering | 2021-07-05 | Paper |
| Survey on load balancing mechanism in data center | 2021-07-01 | Paper |
On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering
Theoretical Computer Science | 2021-06-22 | Paper |
Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem
Algorithmica | 2021-04-08 | Paper |
Reconstruction and verification of chordal graphs with a distance oracle
Theoretical Computer Science | 2021-02-15 | Paper |
A new approximation algorithm for contig-based genomic scaffold filling
Theoretical Computer Science | 2021-01-25 | Paper |
| Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition | 2020-07-07 | Paper |
| Improved kernels for several problems on planar graphs | 2020-07-07 | Paper |
scientific article; zbMATH DE number 7204399 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
An improved kernel for max-bisection above tight lower bound
Theoretical Computer Science | 2020-04-07 | Paper |
On scheduling multiple two-stage flowshops
Theoretical Computer Science | 2020-04-07 | Paper |
Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem
Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms | 2020-02-11 | Paper |
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
Theoretical Computer Science | 2020-01-16 | Paper |
An approximation algorithm for the \(l\)-pseudoforest deletion problem
Theoretical Computer Science | 2020-01-16 | Paper |
Improved approximation algorithms for two-stage flowshops scheduling problem
Theoretical Computer Science | 2020-01-16 | Paper |
New kernels for several problems on planar graphs
Theoretical Computer Science | 2020-01-16 | Paper |
| Local coloring: new observations and new reductions | 2019-10-11 | Paper |
| An improved approximation algorithm for the \(k\)-means problem with penalties | 2019-10-11 | Paper |
A novel extended Pareto optimality consensus model for predicting essential proteins
Journal of Theoretical Biology | 2019-09-12 | Paper |
An improved linear kernel for complementary maximal strip recovery: simpler and smaller
Theoretical Computer Science | 2019-08-20 | Paper |
On scheduling inclined jobs on multiple two-stage flowshops
Theoretical Computer Science | 2019-08-20 | Paper |
Improved PTAS for the constrained \(k\)-means problem
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
Theoretical Computer Science | 2019-06-25 | Paper |
Scheduling two-stage jobs on multiple flowshops
Theoretical Computer Science | 2019-05-29 | Paper |
Randomized parameterized algorithms for the kidney exchange problem
Algorithms | 2019-05-14 | Paper |
Improved algorithms for several parameterized problems based on random methods
Frontiers in Algorithmics | 2019-04-26 | Paper |
Parameterized algorithms for maximum edge biclique and related problems
Frontiers in Algorithmics | 2019-04-26 | Paper |
On Counting Parameterized Matching and Packing
Frontiers in Algorithmics | 2019-04-26 | Paper |
A 42k kernel for the complementary maximal strip recovery problem
Frontiers in Algorithmics | 2019-04-26 | Paper |
On Approximation Algorithms for Two-Stage Scheduling Problems
Frontiers in Algorithmics | 2019-04-26 | Paper |
Social exposure and trustworthiness: experimental evidence
Economics Letters | 2018-10-05 | Paper |
A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
Journal of Computer and System Sciences | 2018-09-07 | Paper |
| Local Coloring and its Complexity | 2018-09-07 | Paper |
Corrigendum to ``How well does the weighted price contribution measure price discovery?''
Journal of Economic Dynamics and Control | 2018-08-13 | Paper |
How well does the weighted price contribution measure price discovery?
Journal of Economic Dynamics and Control | 2018-08-13 | Paper |
Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
Theoretical Computer Science | 2018-06-05 | Paper |
Dealing with several parameterized problems by random methods
Theoretical Computer Science | 2018-06-05 | Paper |
Parameterized algorithms for edge biclique and related problems
Theoretical Computer Science | 2018-06-05 | Paper |
An improved FPT algorithm for almost forest deletion problem
Information Processing Letters | 2018-05-25 | Paper |
Unit interval vertex deletion: fewer vertices are relevant
Journal of Computer and System Sciences | 2018-05-08 | Paper |
| An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations | 2018-03-26 | Paper |
| Planar vertex-disjoint cycle packing: new structures and improved kernel | 2018-03-26 | Paper |
SDTRLS: predicting drug-target interactions for complex diseases based on chemical substructures
Complexity | 2018-02-01 | Paper |
Complex brain network analysis and its applications to brain disorders: a survey
Complexity | 2018-01-03 | Paper |
| A new kernel for parameterized Max-Bisection above tight lower bound | 2017-10-23 | Paper |
| Approximation algorithms for scheduling multiple two-stage flowshops | 2017-10-23 | Paper |
| Construction of low delay maximal rate single-symbol decodable distributed STBC with channel phase information | 2017-10-20 | Paper |
| scientific article; zbMATH DE number 6745933 (Why is no real title available?) | 2017-07-14 | Paper |
A local average connectivity-based method for identifying essential proteins from the network level
Computational Biology and Chemistry | 2017-07-10 | Paper |
On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms
IEEE Transactions on Computers | 2017-06-20 | Paper |
Dealing with 4-variables by resolution: an improved MaxSAT algorithm
Theoretical Computer Science | 2017-03-16 | Paper |
Approximate association via dissociation
Discrete Applied Mathematics | 2017-01-23 | Paper |
Approximate association via dissociation
Lecture Notes in Computer Science | 2016-12-22 | Paper |
Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
Information and Computation | 2016-12-22 | Paper |
Approximating maximum agreement forest on multiple binary trees
Algorithmica | 2016-12-21 | Paper |
