| Publication | Date of Publication | Type |
|---|
| On online approximation algorithms for two-stage bins | 2026-01-28 | Paper |
On the complexity of destructive bribery in approval-based multiwinner voting
ACM Transactions on Computation Theory | 2026-01-20 | Paper |
| A polynomial-time algorithm for MCS partial search order on chordal graphs | 2024-12-03 | Paper |
| The nonmanipulative vote-deficits of voting rules | 2023-03-31 | Paper |
Group control for consent rules with consecutive qualifications
Mathematical Social Sciences | 2023-01-31 | Paper |
| A Polynomial-Time Algorithm for MCS Partial Search Order on Chordal Graphs | 2022-12-09 | 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 |
Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
Theoretical Computer Science | 2022-02-21 | Paper |
An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses
Journal of Combinatorial Optimization | 2021-11-25 | Paper |
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
SIAM Journal on Discrete Mathematics | 2021-09-17 | Paper |
On the complexity of constructive control under nearly single-peaked preferences
(available as arXiv preprint) | 2021-07-06 | Paper |
A \((2 + \epsilon ) k\)-vertex kernel for the dual coloring problem
Theoretical Computer Science | 2021-05-10 | Paper |
Reconstruction and verification of chordal graphs with a distance oracle
Theoretical Computer Science | 2021-02-15 | Paper |
Parameterized complexity of voter control in multi-peaked elections
Theory of Computing Systems | 2019-09-05 | Paper |
An improved linear kernel for complementary maximal strip recovery: simpler and smaller
Theoretical Computer Science | 2019-08-20 | Paper |
Reoptimization of minimum latency problem revisited: don't panic when asked to revisit the route after local modifications
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
The complexity of shelflisting
Theory and Decision | 2019-05-08 | Paper |
A 42k Kernel for the Complementary Maximal Strip Recovery Problem
Frontiers in Algorithmics | 2019-04-26 | Paper |
Kernelization of two path searching problems on split graphs
Frontiers in Algorithmics | 2019-04-26 | Paper |
On the complexity of bribery with distance restrictions
Theoretical Computer Science | 2019-01-25 | Paper |
| Complexity of group identification with partial information | 2018-10-25 | Paper |
Gender consistent resolving rules in marriage problems
Discrete Applied Mathematics | 2018-09-06 | Paper |
| How hard is bribery with distance restrictions? | 2018-07-12 | Paper |
On the kernelization of split graph problems
Theoretical Computer Science | 2018-06-05 | Paper |
| An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations | 2018-03-26 | Paper |
The control complexity of \(r\)-Approval: from the single-peaked case to the general case
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Possible winner problems on partial tournaments: a parameterized study
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
| A Further Step Towards an Understanding of the Tournament Equilibrium Set | 2016-11-12 | Paper |
Exact algorithms for weighted and unweighted Borda manipulation problems
Theoretical Computer Science | 2016-02-26 | Paper |
Distributed state estimation in sensor networks with event-triggered communication
Nonlinear Dynamics | 2015-08-26 | Paper |
| Election Attacks with Few Candidates | 2014-05-26 | Paper |
Towards optimal kernel for edge-disjoint triangle packing
Information Processing Letters | 2014-04-17 | Paper |
Possible winner problems on partial tournaments: a parameterized study
Algorithmic Decision Theory | 2013-12-17 | Paper |
Planar graph vertex partition for linear problem kernels
Journal of Computer and System Sciences | 2013-07-24 | Paper |
Linear problem kernels for planar graph problems with small distance property
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
