| Approximability Of The Independent Feedback Vertex Set Problem For Bipartite Graphs | 0 | 0.34 | 2021 |
| Minimization and Parameterized Variants of Vertex Partition Problems on Graphs. | 0 | 0.34 | 2020 |
| Reconfiguration of Minimum Steiner Trees via Vertex Exchanges. | 0 | 0.34 | 2019 |
| The Complexity Of (List) Edge-Coloring Reconfiguration Problem | 0 | 0.34 | 2018 |
| Complexity of Reconfiguration Problems for Constraint Satisfaction. | 0 | 0.34 | 2018 |
| Computational Power Of Threshold Circuits Of Energy At Most Two | 0 | 0.34 | 2018 |
| Algorithms for Coloring Reconfiguration Under Recolorability Constraints. | 0 | 0.34 | 2018 |
| Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters. | 0 | 0.34 | 2017 |
| The Complexity Of (List) Edge-Coloring Reconfiguration Problem | 1 | 0.37 | 2017 |
| Reconfiguration Of Steiner Trees In An Unweighted Graph | 0 | 0.34 | 2017 |
| The Coloring Reconfiguration Problem On Specific Graph Classes | 0 | 0.34 | 2017 |
| Complexity of Coloring Reconfiguration under Recolorability Constraints. | 0 | 0.34 | 2017 |
| Reconfiguration Of Steiner Trees In An Unweighted Graph | 2 | 0.44 | 2017 |
| Threshold Circuits Detecting Global Patterns in Two-dimensional Maps. | 0 | 0.34 | 2016 |
| Reconfiguration Of Vertex Covers In A Graph | 3 | 0.41 | 2016 |
| The minimum vulnerability problem on specific graph classes | 2 | 0.39 | 2016 |
| Threshold Circuits for Global Patterns in 2-Dimensional Maps. | 1 | 0.37 | 2015 |
| Competitive Diffusion on Weighted Graphs. | 1 | 0.36 | 2015 |
| The List Coloring Reconfiguration Problem For Bounded Pathwidth Graphs | 0 | 0.34 | 2015 |
| Algorithms For The Independent Feedback Vertex Set Problem | 3 | 0.40 | 2015 |
| Bandwidth consecutive multicolorings of graphs. | 2 | 0.44 | 2014 |
| Deterministic Algorithms For The Independent Feedback Vertex Set Problem | 1 | 0.37 | 2014 |
| Computational Complexity of Competitive Diffusion on (Un)weighted Graphs. | 0 | 0.34 | 2014 |
| Generalized rainbow connectivity of graphs. | 0 | 0.34 | 2013 |
| Energy-Efficient Threshold Circuits Detecting Global Pattern in 1-Dimentional Arrays. | 0 | 0.34 | 2013 |
| Complexity of counting output patterns of logic circuits | 0 | 0.34 | 2013 |
| On The Minimum Caterpillar Problem In Digraphs | 0 | 0.34 | 2013 |
| On the rainbow connectivity of graphs: complexity and FPT algorithms | 6 | 0.56 | 2013 |
| Energy and fan-in of logic circuits computing symmetric Boolean functions | 2 | 0.40 | 2013 |
| Energy-efficient threshold circuits computing mod functions | 5 | 0.55 | 2013 |
| Small grid drawings of planar graphs with balanced partition | 2 | 0.36 | 2012 |
| An Improved Sufficient Condition Tor Reconfiguration Of List Edge-Colorings In A Tree | 0 | 0.34 | 2012 |
| An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree | 4 | 0.44 | 2012 |
| Reconfiguration of list L (2,1)-labelings in a graph | 13 | 0.70 | 2012 |
| Minimum Cost Partitions of Trees with Supply and Demand | 5 | 0.43 | 2012 |
| Algorithms for Bandwidth Consecutive Multicolorings of Graphs - (Extended Abstract). | 1 | 0.40 | 2012 |
| Partitioning a Weighted Tree into Subtrees with Weights in a Given Range | 4 | 0.48 | 2012 |
| Energy and fan-in of threshold circuits computing mod functions | 2 | 0.38 | 2011 |
| Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings. | 0 | 0.34 | 2011 |
| Small grid drawings of planar graphs with balanced bipartition | 2 | 0.39 | 2010 |
| Convex Drawings of Internally Triconnected Plane Graphs on O(n2) Grids | 0 | 0.34 | 2009 |
| Efficient algorithms for wavelength assignment on trees of rings | 1 | 0.35 | 2009 |
| Approximability of partitioning graphs with supply and demand | 12 | 1.11 | 2008 |
| Partitioning a Weighted Tree to Subtrees of Almost Uniform Size | 8 | 0.61 | 2008 |
| Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size | 3 | 0.48 | 2007 |
| Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs | 0 | 0.34 | 2007 |
| Partitioning graphs of supply and demand | 5 | 0.62 | 2007 |
| Algorithms for finding distance-edge-colorings of graphs | 7 | 0.59 | 2007 |
| Orthogonal Drawings of Series-Parallel Graphs with Minimum Bends | 5 | 0.45 | 2007 |
| Total Colorings Of Degenerate Graphs | 8 | 0.65 | 2007 |
