|
Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes |
|
|
1 | (9) |
|
|
|
|
|
|
|
|
|
On the Maximal Sum of Exponents of Runs in a String |
|
|
10 | (10) |
|
|
|
|
|
|
|
|
|
|
|
Path-Based Supports for Hypergraphs |
|
|
20 | (14) |
|
|
|
|
|
|
|
|
|
On Improved Exact Algorithms for L(2, 1)-Labeling of Graphs |
|
|
34 | (4) |
|
Konstanty Junosza-Szaniawski |
|
|
|
|
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications |
|
|
38 | (5) |
|
|
|
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three |
|
|
43 | (13) |
|
|
|
|
|
|
|
Shortest Paths between Shortest Paths and Independent Sets |
|
|
56 | (12) |
|
|
|
|
|
|
|
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism |
|
|
68 | (14) |
|
|
|
|
|
Dichotomy for Coloring of Dart Graphs |
|
|
82 | (8) |
|
|
|
|
|
Worst Case Efficient Single and Multiple String Matching in the RAM Model |
|
|
90 | (13) |
|
|
|
The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2 |
|
|
103 | (4) |
|
|
|
|
|
|
|
|
|
Upper and Lower I/O Bounds for Pebbling r-Pyramids |
|
|
107 | (14) |
|
|
|
|
|
|
|
Single Parameter FPT-Algorithms for Non-trivial Games |
|
|
121 | (4) |
|
|
|
|
|
The Complexity Status of Problems Related to Sparsest Cuts |
|
|
125 | (11) |
|
|
|
|
|
|
|
|
|
On Approximation Complexity of Metric Dimension Problem |
|
|
136 | (4) |
|
|
|
|
|
|
|
Collision-Free Routing in Sink-Centric Sensor Networks with Coarse-Grain Coordinates |
|
|
140 | (14) |
|
|
|
|
|
Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures |
|
|
154 | (13) |
|
|
|
|
|
|
|
Computing Role Assignments of Proper Interval Graphs in Polynomial Time |
|
|
167 | (14) |
|
|
|
|
|
|
|
Efficient Connectivity Testing of Hypercubic Networks with Faults |
|
|
181 | (11) |
|
|
|
|
|
|
|
|
|
|
|
Reductions of Matrices Associated with Nowhere-Zero Flows |
|
|
192 | (9) |
|
|
|
|
|
|
|
|
|
Blocks of Hypergraphs: Applied to Hypergraphs and Outerplanarity |
|
|
201 | (11) |
|
|
|
|
|
|
|
|
|
Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree |
|
|
212 | (14) |
|
|
|
|
|
|
|
|
|
|
|
Skip Lift: A Probabilistic Alternative to Red-Black Trees |
|
|
226 | (12) |
|
|
|
|
|
|
|
On a Relationship between Completely Separating Systems and Antimagic Labeling of Regular Graphs |
|
|
238 | (4) |
|
|
|
|
|
|
|
|
|
Parameterized Complexity of k-Anonymity: Hardness and Tractability |
|
|
242 | (14) |
|
|
|
|
|
|
|
|
|
On Fast Enumeration of Pseudo Bicliques |
|
|
256 | (4) |
|
|
|
|
|
|
|
Efficient Chaining of Seeds in Ordered Trees |
|
|
260 | (14) |
|
|
|
|
|
|
|
|
|
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs |
|
|
274 | (12) |
|
|
|
|
|
|
|
Recognition of Probe Ptolemaic Graphs (Extended Abstract) |
|
|
286 | (5) |
|
|
|
|
|
Graphs of Separability at Most Two: Structural Characterizations and Their Consequences |
|
|
291 | (12) |
|
|
|
|
|
On Antimagic Labeling for Generalized Web and Flower Graphs |
|
|
303 | (11) |
|
|
|
|
|
|
|
|
|
Chains-into-Bins Processes |
|
|
314 | (12) |
|
|
|
|
|
|
|
Complexity of Locally Injective Homomorphism to the Theta Graphs |
|
|
326 | (11) |
|
|
|
|
|
Ranking and Drawing in Subexponential Time |
|
|
337 | (12) |
|
|
|
|
|
|
|
|
|
|
|
|
|
Efficient Reconstruction of RC-Equivalent Strings |
|
|
349 | (14) |
|
|
|
|
|
|
|
Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures |
|
|
363 | (14) |
|
|
|
|
|
The Cover Time of Cartesian Product Graphs |
|
|
377 | (13) |
|
|
|
|
|
|
|
Dictionary-Symbolwise Flexible Parsing |
|
|
390 | (14) |
|
|
|
|
|
|
|
|
|
|
|
Regular Language Constrained Sequence Alignment Revisited |
|
|
404 | (13) |
|
|
|
|
|
|
| Author Index |
|
417 | |
