Pages that link to "Item:Q3075505"
From MaRDI portal
The following pages link to SOFSEM 2011: Theory and Practice of Computer Science (Q3075505):
Displaying 34 items.
- Integrity and Consistency for Untrusted Services (Q3075506) (← links)
- Verification of Timed-Arc Petri Nets (Q3075507) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- Combining Traditional Map Labeling with Boundary Labeling (Q3075509) (← links)
- On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510) (← links)
- Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size (Q3075511) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- Sequential Optimization of Matrix Chain Multiplication Relative to Different Cost Functions (Q3075513) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- Collisionless Gathering of Robots with an Extent (Q3075515) (← links)
- Min-Max Coverage in Multi-interface Networks (Q3075516) (← links)
- Bandwidth Constrained Multi-interface Networks (Q3075517) (← links)
- A Privacy-Preserving ID-Based Group Key Agreement Scheme Applied in VPAN (Q3075519) (← links)
- White Space Regions (Q3075521) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- In-Place Sorting (Q3075523) (← links)
- On d-Regular Schematization of Embedded Paths (Q3075524) (← links)
- Upward Point-Set Embeddability (Q3075525) (← links)
- Cooperative Query Answering by Abstract Interpretation (Q3075526) (← links)
- Advice Complexity and Barely Random Algorithms (Q3075527) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks (Q3075529) (← links)
- Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks (Q3075530) (← links)
- On the Complexity of the Metric TSP under Stability Considerations (Q3075531) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- An Automata-Theoretical Characterization of Context-Free Trace Languages (Q3075533) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- A Local Search Algorithm for Branchwidth (Q3075536) (← links)
- Finding the Description of Structure by Counting Method: A Case Study (Q3075538) (← links)
- On Approximating the d-Girth of a Graph (Q3075539) (← links)
- Folk Theorems on the Correspondence between State-Based and Event-Based Systems (Q3075540) (← links)
- Minimizing Interference for the Highway Model in Wireless Ad-Hoc and Sensor Networks (Q3075541) (← links)
- Information Leakage Analysis by Abstract Interpretation (Q3075542) (← links)
- Partition into Triangles on Bounded Degree Graphs (Q3075543) (← links)
