| Algorithms that Access the Input via Queries
|
2021 |
Erlebach, Thomas |
| Asymptotic Approximation by Regular Languages
|
2021 |
Sin’ya, Ryoma |
| Using the Metro-Map Metaphor for Drawing Hypergraphs
|
2021 |
Frank, Fabian |
| Clusters of Repetition Roots: Single Chains
|
2021 |
Fazekas, Szilárd Zsolt |
| Web Test Automation: Insights from the Grey Literature
|
2021 |
Ricca, Filippo |
| Metadata Management on Data Processing in Data Lakes
|
2021 |
Megdiche, Imen |
| Sorting by Multi-cut Rearrangements
|
2021 |
Bulteau, Laurent |
| Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SETH Fails
|
2021 |
Equi, Massimo |
| Amnesiac Flooding: Synchronous Stateless Information Dissemination
|
2021 |
Turau, Volker |
| Balanced Independent and Dominating Sets on Colored Interval Graphs
|
2021 |
Bhore, Sujoy |
| Complexity of Limit-Cycle Problems in Boolean Networks
|
2021 |
Bridoux, Florian |
| Distributed Independent Sets in Interval and Segment Intersection Graphs
|
2021 |
Gorain, Barun |
| Improved Algorithms for Online Load Balancing
|
2021 |
Liu, Yaxiong |
| Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
|
2021 |
Giuliani, Sara |
| Parameterizing Role Coloring on Forests
|
2021 |
Pandey, Sukanya |
| The Balanced Satisfactory Partition Problem
|
2021 |
Gaikwad, Ajinkya |
| Weighted Microscopic Image Reconstruction
|
2021 |
Bar-Noy, Amotz |
| The Complexity of Flow Expansion and Electrical Flow Expansion
|
2021 |
Wagner, Dorothea |
| Semi-automatic Column Type Inference for CSV Table Understanding
|
2021 |
Bonfitto, Sara |
| S2CFT: A New Approach for Paper Submission Recommendation
|
2021 |
Nguyen, Dac |
Tag hinzufügen