| Publication | Date of Publication | Type |
|---|
| Modification problems toward proper (Helly) circular-arc graphs | 2024-12-03 | Paper |
| Modification problems toward proper (Helly) circular-arc graphs | 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' | 2024-09-05 | Paper |
| PTAS for minimum cost multicovering with disks | 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 | 2024-07-09 | Paper |
| Study of the effects of fractional order and damping coefficient on the dynamics of giant magnetostrictive actuators | 2024-05-27 | Paper |
| New algorithms for fair \(k\)-center problem with outliers and capacity constraints | 2024-04-16 | Paper |
| On scheduling multiple parallel two-stage flowshops with Johnson's rule | 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 | 2024-02-23 | Paper |
| Exponential time approximation scheme for TSP | 2024-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147303 | 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 |
| https://portal.mardi4nfdi.de/entity/Q5875629 | 2023-02-03 | Paper |
| Small candidate set for translational pattern search | 2023-02-03 | Paper |
| Characterization and linear-time recognition of paired threshold graphs | 2022-12-21 | Paper |
| Improved approximation algorithms for solving the squared metric \(k\)-facility location problem | 2022-12-21 | Paper |
| Small candidate set for translational pattern search | 2022-10-06 | Paper |
| Graph searches and their end vertices | 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 | 2022-05-31 | Paper |
| A refined branching algorithm for the maximum satisfiability problem | 2022-03-22 | Paper |
| An improved FPT algorithm for the flip distance problem | 2021-11-25 | Paper |
| An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses | 2021-11-25 | Paper |
| Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem | 2021-11-01 | Paper |
| End vertices of graph searches on bipartite graphs | 2021-10-19 | Paper |
| Fixed-parameter tractability for the Tree Assembly problem | 2021-10-06 | Paper |
| Cycle Extendability of Hamiltonian Strongly Chordal Graphs | 2021-09-17 | Paper |
| Improved approximation for prize-collecting red-blue median | 2021-07-22 | Paper |
| On fixed-order book thickness parameterized by the pathwidth of the vertex ordering | 2021-07-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4996227 | 2021-07-01 | Paper |
| On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering | 2021-06-22 | Paper |
| Runtime performances of randomized search heuristics for the dynamic weighted vertex cover problem | 2021-04-08 | Paper |
| Reconstruction and verification of chordal graphs with a distance oracle | 2021-02-15 | Paper |
| A new approximation algorithm for contig-based genomic scaffold filling | 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 |
| https://portal.mardi4nfdi.de/entity/Q5111282 | 2020-05-26 | Paper |
| An improved kernel for max-bisection above tight lower bound | 2020-04-07 | Paper |
| On scheduling multiple two-stage flowshops | 2020-04-07 | Paper |
| Runtime analysis of evolutionary algorithms for the depth restricted (1,2)-minimum spanning tree problem | 2020-02-11 | Paper |
| Improved approximation algorithms for two-stage flowshops scheduling problem | 2020-01-16 | Paper |
| Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition | 2020-01-16 | Paper |
| An approximation algorithm for the \(l\)-pseudoforest deletion problem | 2020-01-16 | Paper |
| New kernels for several problems on planar graphs | 2020-01-16 | Paper |
| An improved approximation algorithm for the \(k\)-means problem with penalties | 2019-10-11 | Paper |
| Local coloring: new observations and new reductions | 2019-10-11 | Paper |
| A novel extended Pareto optimality consensus model for predicting essential proteins | 2019-09-12 | Paper |
| On scheduling inclined jobs on multiple two-stage flowshops | 2019-08-20 | Paper |
| An improved linear kernel for complementary maximal strip recovery: simpler and smaller | 2019-08-20 | Paper |
| Improved PTAS for the constrained \(k\)-means problem | 2019-06-25 | Paper |
| Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms | 2019-06-25 | Paper |
| Scheduling two-stage jobs on multiple flowshops | 2019-05-29 | Paper |
| Randomized parameterized algorithms for the kidney exchange problem | 2019-05-14 | Paper |
| Parameterized Algorithms for Maximum Edge Biclique and Related Problems | 2019-04-26 | Paper |
| On Counting Parameterized Matching and Packing | 2019-04-26 | Paper |
| Improved Algorithms for Several Parameterized Problems Based on Random Methods | 2019-04-26 | Paper |
| On Approximation Algorithms for Two-Stage Scheduling Problems | 2019-04-26 | Paper |
| A 42k Kernel for the Complementary Maximal Strip Recovery Problem | 2019-04-26 | Paper |
| Social exposure and trustworthiness: experimental evidence | 2018-10-05 | Paper |
| A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees | 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? | 2018-08-13 | Paper |
| How well does the weighted price contribution measure price discovery? | 2018-08-13 | Paper |
| Dealing with several parameterized problems by random methods | 2018-06-05 | Paper |
| Parameterized algorithms for edge biclique and related problems | 2018-06-05 | Paper |
| Parameterized counting matching and packing: a family of hard problems that admit FPTRAS | 2018-06-05 | Paper |
| An improved FPT algorithm for almost forest deletion problem | 2018-05-25 | Paper |
| Unit interval vertex deletion: fewer vertices are relevant | 2018-05-08 | Paper |
| Planar vertex-disjoint cycle packing: new structures and improved kernel | 2018-03-26 | Paper |
| An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations | 2018-03-26 | Paper |
| SDTRLS: predicting drug-target interactions for complex diseases based on chemical substructures | 2018-02-01 | Paper |
| Complex brain network analysis and its applications to brain disorders: a survey | 2018-01-03 | Paper |
| Approximation algorithms for scheduling multiple two-stage flowshops | 2017-10-23 | Paper |
| A new kernel for parameterized Max-Bisection above tight lower bound | 2017-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5371890 | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5276238 | 2017-07-14 | Paper |
| A local average connectivity-based method for identifying essential proteins from the network level | 2017-07-10 | Paper |
| On the Minimum Link-Length Rectilinear Spanning Path Problem: Complexity and Algorithms | 2017-06-20 | Paper |
| Dealing with 4-variables by resolution: an improved MaxSAT algorithm | 2017-03-16 | Paper |
| Approximate association via dissociation | 2017-01-23 | Paper |
| Approximate association via dissociation | 2016-12-22 | Paper |
| Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree | 2016-12-22 | Paper |
| Approximating maximum agreement forest on multiple binary trees | 2016-12-21 | Paper |
| A discrete-time Geo/G/1 retrial queue with preferred and impatient customers | 2016-12-05 | Paper |
| Kernelization and randomized parameterized algorithms for co-path set problem | 2016-10-20 | Paper |
| Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees | 2016-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2993235 | 2016-08-10 | Paper |
| Improved MaxSAT Algorithms for Instances of Degree 3 | 2016-02-05 | Paper |
| Kernelization and parameterized algorithms for covering a tree by a set of stars or paths | 2015-12-08 | Paper |
| On the parameterized vertex cover problem for graphs with perfect matching | 2015-11-20 | Paper |
| High-sum-rate beamformers for multi-pair two-way relay networks with amplify-and-forward relaying strategy | 2015-11-20 | Paper |
| Dealing with 4-Variables by Resolution: An Improved MaxSAT Algorithm | 2015-10-30 | Paper |
| A 2k-vertex Kernel for Maximum Internal Spanning Tree | 2015-10-30 | Paper |
| An Improved Kernel for the Complementary Maximal Strip Recovery Problem | 2015-10-29 | Paper |
| Parameterized complexity of control and bribery for \(d\)-approval elections | 2015-07-24 | Paper |
| Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems | 2015-07-10 | Paper |
| An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs | 2015-07-10 | Paper |
| Fractional Factorial Split-plot Designs with Two- and Four-level Factors Containing Clear Effects | 2015-06-24 | Paper |
| Edge deletion problems: branching facilitated by modular decomposition | 2015-02-24 | Paper |
| Improved parameterized algorithms for minimum link-length rectilinear spanning path problem | 2014-12-02 | Paper |
| Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees | 2014-10-08 | Paper |
| Algorithms for parameterized maximum agreement forest problem on multiple trees | 2014-10-06 | Paper |
| Approximation Algorithms for Maximum Agreement Forest on Multiple Trees | 2014-09-26 | Paper |
| Kernelization and Lower Bounds of the Signed Domination Problem | 2014-04-03 | Paper |
| Matching and weighted \(P_2\)-packing: algorithms and kernels | 2014-01-24 | Paper |
| Improved linear problem kernel for planar connected dominating set | 2014-01-13 | Paper |
| Parameterized complexity of max-lifetime target coverage in wireless sensor networks | 2014-01-13 | Paper |
| Parameterized complexity of Min-power multicast problems in wireless ad hoc networks | 2013-12-19 | Paper |
| Parameterized Complexity of Control and Bribery for d-Approval Elections | 2013-12-10 | Paper |
| Planar graph vertex partition for linear problem kernels | 2013-07-24 | Paper |
| Random Methods for Parameterized Problems | 2013-06-11 | Paper |
| Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees | 2013-06-11 | Paper |
| An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs | 2013-06-11 | Paper |
| Performance analysis for \((X,S)\)-bottleneck cell in large-scale wireless networks | 2013-04-04 | Paper |
| Complexity and parameterized algorithms for cograph editing | 2012-11-27 | Paper |
| Identification of essential nodes based on topology of a bionetwork | 2012-10-05 | Paper |
| Kernels for Packing and Covering Problems | 2012-07-16 | Paper |
| Improved FPT Algorithms for Rectilinear k-Links Spanning Path | 2012-07-16 | Paper |
| FPT Results for Signed Domination | 2012-07-16 | Paper |
| A parameterized algorithm for the hyperplane-cover problem | 2012-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3110754 | 2012-01-27 | Paper |
| Linear Problem Kernels for Planar Graph Problems with Small Distance Property | 2011-08-17 | Paper |
| Cograph Editing: Complexity and Parameterized Algorithms | 2011-08-17 | Paper |
| Matching and P 2-Packing: Weighted Versions | 2011-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3014297 | 2011-07-19 | Paper |
| An Improved Kernel for Planar Connected Dominating Set | 2011-07-01 | Paper |
| The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View | 2011-06-03 | Paper |
| Improved deterministic algorithms for weighted matching and packing problems | 2011-05-18 | Paper |
| An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem | 2011-04-05 | Paper |
| Improved Algorithms for Weighted 3-Set Packing | 2011-02-05 | Paper |
| A practical parameterised algorithm for the individual haplotyping problem MLF | 2010-12-01 | Paper |
| Kernelization Techniques and Its Applications to Parameterized Computation | 2010-11-05 | Paper |
| An improved kernelization for \(P_{2}\)-packing | 2010-09-07 | Paper |
| An analytical model for end-to-end communication channel over PLCN based on QBDs | 2010-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3573742 | 2010-07-08 | Paper |
| An improved lower bound on approximation algorithms for the closest substring problem | 2010-04-19 | Paper |
| A practical exact algorithm for the individual haplotyping problem MEC/GI | 2010-02-23 | Paper |
| On counting 3-D matchings of size \(k\) | 2009-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3644675 | 2009-11-11 | Paper |
| The cost of becoming anonymous: on the participant payload in crowds | 2009-07-21 | Paper |
| An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set | 2009-07-14 | Paper |
| Improved Deterministic Algorithms for Weighted Matching and Packing Problems | 2009-06-03 | Paper |
| A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem | 2009-06-03 | Paper |
| A practical algorithm based on particle swarm optimization for haplotype reconstruction | 2009-03-10 | Paper |
| A Randomized Approximation Algorithm for Parameterized 3-D Matching Counting Problem | 2009-03-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3610987 | 2009-03-06 | Paper |
| An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem | 2009-03-03 | Paper |
| A Lower Bound on Approximation Algorithms for the Closest Substring Problem | 2009-03-03 | Paper |
| An improved (and practical) parameterized algorithm for the individual haplotyping problem MFR with mate-pairs | 2008-12-02 | Paper |
| Parameterized algorithms for weighted matching and packing problems | 2008-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3513558 | 2008-08-06 | Paper |
| Improved Parameterized Algorithms for Weighted 3-Set Packing | 2008-07-10 | Paper |
| A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI | 2008-07-10 | Paper |
| A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem | 2008-06-19 | Paper |
| Foreign ownership and volatility dynamics of Indonesian stocks | 2008-06-11 | Paper |
| An Improved Parameterized Algorithm for a Generalized Matching Problem | 2008-05-27 | Paper |
| An O *(3.523k ) Parameterized Algorithm for 3-Set Packing | 2008-05-27 | Paper |
| A Practical Parameterized Algorithm for the Individual Haplotyping Problem MLF | 2008-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5453224 | 2008-04-04 | Paper |
| Parameterized Algorithms for Weighted Matching and Packing Problems | 2007-11-13 | Paper |
| An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs | 2007-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5423396 | 2007-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5754299 | 2007-08-22 | Paper |
| A simple linear time approximation algorithm for multi-processor job scheduling on four processors | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5702092 | 2005-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4825751 | 2004-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823913 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823953 | 2004-10-28 | Paper |
| An effective randomized QoS routing algorithm on networks with inaccurate parameters | 2002-06-05 | Paper |
| QOS routing algorithms for anycast services | 2001-10-21 | Paper |
| The Unbounded Energy Solution for Free Vibration of an Axially Moving String | 2000-11-09 | Paper |
| Spatio-temporal target identification method of high-range resolution radar | 2000-01-04 | Paper |
| Order flow and the bid-ask spread: an empirical probability model of screen-based trading | 1998-07-22 | Paper |
| Auctions as algorithms. Computerized trade execution and price discovery | 1994-01-16 | Paper |
| An equivalent canonical form for multiple time series | 1987-01-01 | Paper |
