On minimum t-claw deletion in split graphs: On minimum t-claw deletion in split graphs: S. Mishra.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-025-00482-2
- By:
- Publication type:
- Article
Works matching IS 00015903 AND DT 2025 AND VI 62 AND IP 1
Results: 16
1
2
On the piecewise complexity of words.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-025-00480-4
- By:
- Publication type:
- Article
3
Fault-tolerance in distance-edge-monitoring sets: Fault-tolerance in distance-edge-monitoring sets: C. Yang et al.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00476-6
- By:
- Publication type:
- Article
4
Improving LSH via tensorized random projection: Improving LSH via tensorized random projection: B. D. Verma, R. Pratap.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-025-00479-x
- By:
- Publication type:
- Article
5
Tight bounds for the sensitivity of CDAWGs with left-end edits: Tight bounds for the sensitivity of CDAWGs with left-end edits: H. Fujimaru et al.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-025-00478-y
- By:
- Publication type:
- Article
6
Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence.
- Published in:
- 2025
- By:
- Publication type:
- Correction Notice
7
Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00475-7
- By:
- Publication type:
- Article
8
Generalized straight-line programs: Generalized straight-line programs: G. Navarro et al.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-025-00481-3
- By:
- Publication type:
- Article
9
Dense non-binary Fibonacci codes.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00473-9
- By:
- Publication type:
- Article
10
Birkhoff-von Neumann quantum logic as an assertion language for quantum programs.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00472-w
- By:
- Publication type:
- Article
11
Parameterized algorithms for the Steiner arborescence problem on a hypercube: Parameterized algorithms for the Steiner arborescence...: S. Mahapatra et al.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00474-8
- By:
- Publication type:
- Article
12
A binary integer programming-based method for qubit mapping in sparse architectures.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00471-x
- By:
- Publication type:
- Article
13
Homeostasis tissue-like P systems with cell separation.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00470-y
- By:
- Publication type:
- Article
14
Connected feedback vertex set on AT-free graphs.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00469-5
- By:
- Publication type:
- Article
15
A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00468-6
- By:
- Publication type:
- Article
16
Comparative genomics with succinct colored de Bruijn graphs.
- Published in:
- Acta Informatica, 2025, v. 62, n. 1, p. 1, doi. 10.1007/s00236-024-00467-7
- By:
- Publication type:
- Article