| Embedding Phylogenetic Trees in Networks of Low Treewidth | 0 | 0.34 | 2022 |
| Combining Networks Using Cherry Picking Sequences. | 0 | 0.34 | 2020 |
| Treewidth of display graphs: bounds, brambles and applications | 0 | 0.34 | 2018 |
| Consistency of orthology and paralogy constraints in the presence of gene transfers. | 0 | 0.34 | 2017 |
| The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth. | 0 | 0.34 | 2016 |
| Chinese Postman Problem on Edge-Colored Multigraphs | 3 | 0.38 | 2015 |
| Linear-Vertex Kernel for the Problem of Packing $r$-Stars into a Graph without Long Induced Paths | 0 | 0.34 | 2015 |
| Parameterized and Approximation Algorithms for the Load Coloring Problem. | 1 | 0.36 | 2015 |
| Parameterized Complexity of the $k$-Arc Chinese Postman Problem. | 2 | 0.35 | 2014 |
| Structural Parameterizations of the Mixed Chinese Postman Problem. | 7 | 0.65 | 2014 |
| Parameterized Algorithms for Load Coloring Problem. | 4 | 0.43 | 2013 |
| Note on Existence and Non-Existence of Large Subsets of Binary Vectors with Similar Distances | 0 | 0.34 | 2012 |
| Directed Acyclic Subgraph Problem Parameterized above Raman-Saurabh Bound | 0 | 0.34 | 2012 |
| Education At The Edge: Preparing Students To Build Quality Systems | 0 | 0.34 | 2007 |
| Human computer (sexual) interactions | 7 | 1.14 | 2004 |
| A Reconfigurable Approach to Structural Engineering Design Computations | 0 | 0.34 | 2004 |
| Electronic Textiles: A Platform For Pervasive Computing | 1 | 0.40 | 2003 |
