18 results on '"Sepp Hartung"'
Search Results
2. The Complexity of Degree Anonymization by Graph Contractions.
3. Improved Upper and Lower Bound Heuristics for Degree Anonymization in Social Networks.
4. Co-Clustering Under the Maximum Norm.
5. The Complexity of Degree Anonymization by Vertex Addition.
6. A Refined Complexity Analysis of Degree Anonymization in Graphs.
7. On the Parameterized and Approximation Hardness of Metric Dimension.
8. On Structural Parameterizations for the 2-Club Problem.
9. The Complexity of Finding a Large Subgraph under Anonymity Constraints.
10. On Explaining Integer Vectors by Few Homogenous Segments.
11. Parameterized Complexity of DAG Partitioning.
12. NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs.
13. Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs.
14. A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
15. Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
16. The Parameterized Complexity of Local Search for TSP, More Refined.
17. Incremental List Coloring of Graphs, Parameterized by Conservation.
18. Exact Algorithms and Experiments for Hierarchical Tree Clustering.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.