publication venue for
- Profit maximization in social networks and non-monotone DR-submodular maximization. 957:113847-113847. 2023
- A constrained two-stage submodular maximization. 853:57-64. 2021
- On scheduling multiple two-stage flowshops. 818:74-82. 2020
- Improved approximation algorithms for two-stage flowshops scheduling problem. 806:509-515. 2020
- Interaction-aware influence maximization and iterated sandwich method. 821:23-33. 2020
- On the broadcast domination number of permutation graphs. 806:171-183. 2020
- The connected metric dimension at a vertex of a graph. 806:53-69. 2020
- On scheduling inclined jobs on multiple two-stage flowshops. 786:67-77. 2019
- Resolution and linear CNF formulas: Improved (n, 3)-MAxSAT algorithms. 774:113-123. 2019
- Perennial secure multi-party computation of universal Turing machine. 769:43-62. 2019
- Dealing with 4-variables by resolution: An improved MaxSAT algorithm. 670:33-44. 2017
- Improved kernel results for some FPT problems based on simple observations. 657:20-27. 2017
- Partition on trees with supply and demand: Kernelization and algorithms. 657:11-19. 2017
- Frontiers of Algorithmics. 607:125-125. 2015
- Parameterized complexity of control and bribery for d-approval elections. 595:82-91. 2015
- Edge deletion problems: Branching facilitated by modular decomposition. 573:63-70. 2015
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees. 562:496-512. 2015
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem. 560:158-171. 2014
- Algorithms for parameterized maximum agreement forest problem on multiple trees. 554:207-216. 2014
- Matching and Weighted P2-Packing: Algorithms and Kernels. 522:85-94. 2014
- Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. 518:32-41. 2014
- Improved linear problem kernel for planar connected dominating set. 511:2-12. 2013
- Dynamic regular registers in systems with churn. 512:84-97. 2013
- Parameterized top-K algorithms. 470:105-119. 2013
- Algorithms, complexity and computational models Preface. 412:2457-2458. 2011
- Improved deterministic algorithms for weighted matching and packing problems. 412:2503-2512. 2011
- A parameterized algorithm for the hyperplane-cover problem. 411:4005-4009. 2010
- Improved upper bounds for vertex cover. 411:3736-3756. 2010
- On parameterized exponential time complexity. 410:2641-2648. 2009
- On the pseudo-achromatic number problem. 410:818-829. 2009
- Untitled. 408:97-98. 2008
- On product covering in 3-tier supply chain models: Natural complete problems for W[3] and W[4]. 363:278-288. 2006
- On approximating minimum vertex cover for graphs with perfect matching. 337:305-318. 2005
- High probability analysis of the condition number of sparse polynomial systems. 315:525-555. 2004
- Secure distributed storage and retrieval. 243:363-389. 2000
- Uncomputably large integral points on algebraic plane curves?. 235:145-162. 2000
- Algorithmic graph embeddings. 181:247-266. 1997
- On input read-modes of alternating Turing machines. 148:33-55. 1995
- A convex geometric approach to counting the roots of a polynomial system. 133:105-140. 1994
- The difference between one tape and two tapes: With respect to reversal complexity. 73:265-278. 1990
- On probabilistic analog automata. 320:449-464.
- Complexity and parameterized algorithms for Cograph Editing 2012
- An O*(3.53(3k))-time parameterized algorithm for the 3-set packing problem 2011