668 results
Search Results
2. Selected papers of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017.
3. Hardness amplification within NP
4. Papers to Appear
5. Papers to Appear
6. Papers to Appear
7. Papers to Appear
8. Papers to Appear
9. Papers to Appear
10. Papers to Appear
11. Papers to Appear
12. Papers to Appear
13. Papers to Appear
14. Papers to Appear
15. Papers to Appear
16. Papers to Appear
17. Papers to Appear.
18. Papers to Appear.
19. Papers to Appear in Forthcoming Issues.
20. Papers to Appear in Forthcoming Issues.
21. Papers to Appear in Forthcoming Issues.
22. Papers to Appear in Forthcoming Issues.
23. Papers to Appear in Forthcoming Issues.
24. Papers to Appear in Forthcoming Issues.
25. Almost optimal query algorithm for hitting set using a subset query.
26. On convergence and threshold properties of discrete Lotka-Volterra population protocols.
27. Temporal cliques admit sparse spanners.
28. Markov chains and unambiguous automata.
29. Deletion to scattered graph classes II - improved FPT algorithms for deletion to pairs of graph classes.
30. Synchronizing Boolean networks asynchronously.
31. Galactic token sliding.
32. Grid recognition: Classical and parameterized computational perspectives.
33. Complexity of word problems for HNN-extensions.
34. On the exact amount of missing information that makes finding possible winners hard.
35. How heavy independent sets help to find arborescences with many leaves in DAGs.
36. On temporal graph exploration.
37. Mengerian graphs: Characterization and recognition.
38. Deterministic non-adaptive contention resolution on a shared channel.
39. Circular pattern matching with k mismatches.
40. Faster compressed quadtrees.
41. Eccentricity terrain of δ-hyperbolic graphs.
42. Faster Graph bipartization.
43. Covering metric spaces by few trees.
44. A maximum clique based approximation algorithm for wireless link scheduling under SINR model.
45. Preprocessing to reduce the search space: Antler structures for feedback vertex set.
46. On kernels for d-path vertex cover.
47. Monitoring the edges of a graph using distances with given girth.
48. Decidable problems in substitution shifts.
49. A modeling approach for estimating performance and energy consumption of storage systems.
50. Non-essential arcs in phylogenetic networks.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.