|
Battery Scheduling Problem |
|
|
1 | (12) |
|
|
|
|
|
|
|
|
|
The Volume of a Crosspolytope Truncated by a Halfspace |
|
|
13 | (15) |
|
|
|
|
|
Computable Isomorphisms of Distributive Lattices |
|
|
28 | (14) |
|
|
|
|
|
|
|
Minmax-Regret Evacuation Planning for Cycle Networks |
|
|
42 | (17) |
|
|
|
|
|
|
|
|
|
|
|
Planar Digraphs for Automatic Complexity |
|
|
59 | (15) |
|
|
|
|
|
|
|
Approximation Algorithms for Graph Burning |
|
|
74 | (19) |
|
|
|
|
|
Sublinear Decoding Schemes for Non-adaptive Group Testing with Inhibitors |
|
|
93 | (21) |
|
|
|
|
|
|
|
|
|
Compacting and Grouping Mobile Agents on Dynamic Rings |
|
|
114 | (20) |
|
|
|
|
|
|
|
|
|
Maximum Independent and Disjoint Coverage |
|
|
134 | (20) |
|
|
|
Raghunath Reddy Madireddy |
|
|
|
|
|
|
Algorithms for Closest and Farthest String Problems via Rank Distance |
|
|
154 | (18) |
|
|
|
|
|
|
|
Computable Analysis of Linear Rearrangement Optimization |
|
|
172 | (16) |
|
|
|
On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence |
|
|
188 | (20) |
|
|
|
|
|
|
|
|
|
Stochastic Programming for Energy Plant Operation |
|
|
208 | (14) |
|
|
|
|
|
|
|
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts |
|
|
222 | (20) |
|
|
|
|
|
Unshuffling Permutations: Trivial Bijections and Compositions |
|
|
242 | (20) |
|
|
|
|
|
|
|
|
|
Continuous Team Semantics |
|
|
262 | (17) |
|
|
|
|
|
|
|
Exact Satisfiability with Jokers |
|
|
279 | (16) |
|
|
|
|
|
|
|
|
|
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators |
|
|
295 | (18) |
|
|
|
|
|
|
|
On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary |
|
|
313 | (12) |
|
|
|
|
|
|
|
Online Travelling Salesman Problem on a Circle |
|
|
325 | (12) |
|
|
|
|
|
|
|
Second-Order Linear-Time Computability with Applications to Computable Analysis |
|
|
337 | (22) |
|
|
|
|
|
|
|
Consistency as a Branching Time Notion |
|
|
359 | (19) |
|
|
|
|
|
Finite Choice, Convex Choice and Sorting |
|
|
378 | (16) |
|
|
|
|
|
The Number of Languages with Maximum State Complexity |
|
|
394 | (16) |
|
|
|
|
|
Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank |
|
|
410 | (14) |
|
|
|
|
|
|
|
|
|
|
|
|
|
GPU Based Hom-Schunck Method to Estimate Optical Flow and Occlusion |
|
|
424 | (14) |
|
|
|
|
|
Robot Computing for Music Visualization |
|
|
438 | (10) |
|
|
|
|
|
|
|
|
|
Combinatorial Properties of Fibonacci Arrays |
|
|
448 | (19) |
|
|
|
|
|
|
|
Watson-Crick Jumping Finite Automata |
|
|
467 | (14) |
|
|
|
|
|
|
|
Dispersion of Mobile Robots: The Power of Randomness |
|
|
481 | (20) |
|
|
|
|
|
Building Resource Auto-scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization |
|
|
501 | (17) |
|
|
|
|
|
|
|
On the Enumeration of Bicriteria Temporal Paths |
|
|
518 | (18) |
|
|
|
|
|
An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers |
|
|
536 | (14) |
|
|
|
|
|
Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection |
|
|
550 | (16) |
|
|
|
|
|
Card-Based Cryptography with Invisible Ink |
|
|
566 | (12) |
|
|
|
Read-Once Certification of Linear Infeasibility in UTVPI Constraints |
|
|
578 | (16) |
|
|
|
|
|
Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function |
|
|
594 | (21) |
|
|
|
The Complexity of Synthesis for 43 Boolean Petri Net Types |
|
|
615 | (20) |
|
|
|
|
|
Space Lower Bounds for Graph Stream Problems |
|
|
635 | (12) |
|
|
|
Bounded Jump and the High/Low Hierarchy |
|
|
647 | (12) |
|
|
|
|
|
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P |
|
|
659 | (15) |
|
|
|
Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management |
|
|
674 | (10) |
|
|
|
|
|
First-Order vs. Second-Order Encodings for LTLf-to-Automata Translation |
|
|
684 | (23) |
|
|
|
|
|
|
| Author Index |
|
707 | |
Biežāk uzdotie jautājumi par e-grāmatām