dblp: Acta Informatica, Volume 62 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Acta Informatica

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 62, Number 1, March 2025

• 
  • 
  • 
  • 
  • 
    Lucas P. Ramos, Felipe A. Louza, Guilherme P. Telles:
    Comparative genomics with succinct colored de Bruijn graphs. 1
• 
  • 
  • 
  • 
  • 
    Joydeep Mukherjee, Tamojit Saha:
    Connected feedback vertex set on AT-free graphs. 2
• 
  • 
  • 
  • 
  • 
    Yueguo Luo, Yuzhen Zhao, Wenqin Li, Ping Guo:
    Homeostasis tissue-like P systems with cell separation. 3
• 
  • 
  • 
  • 
  • 
    Hui Jiang, Jianling Fu, Yuxin Deng, Jun Wu:
    A binary integer programming-based method for qubit mapping in sparse architectures. 4
• 
  • 
  • 
  • 
  • 
    Zhongzheng Tang, Haoyang Zou, Zhuo Diao:
    A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R. 5
• 
  • 
  • 
  • 
  • 
    Sugyani Mahapatra, Manikandan Narayanan, N. S. Narayanaswamy:
    Parameterized algorithms for the Steiner arborescence problem on a hypercube. 6
• 
  • 
  • 
  • 
  • 
    Shengyang Zhong:
    Birkhoff-von Neumann quantum logic as an assertion language for quantum programs. 7
• 
  • 
  • 
  • 
  • 
    Shmuel T. Klein, Dana Shapira:
    Dense non-binary Fibonacci codes. 8
• 
  • 
  • 
  • 
  • 
    Chenxu Yang, Yaping Mao, Ralf Klasing, Gang Yang, Yuzhi Xiao, Xiaoyan Zhang:
    Fault-tolerance in distance-edge-monitoring sets. 9
• 
  • 
  • 
  • 
  • 
    Markus Chimani, Max Ilsen:
    Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms. 10
• 
  • 
  • 
  • 
  • 
    Shengyang Zhong:
    Correction: Birkhoff-von Neumann quantum logic enriched with entanglement quantifiers: coincidence theorem and semantic consequence. 11
• 
  • 
  • 
  • 
  • 
    Hiroto Fujimaru, Yuto Nakashima, Shunsuke Inenaga:
    Tight bounds for the sensitivity of CDAWGs with left-end edits. 12
• 
  • 
  • 
  • 
  • 
    Bhisham Dev Verma, Rameshwar Pratap:
    Improving LSH via tensorized random projection. 13
• 
  • 
  • 
  • 
  • 
    Gonzalo Navarro, Francisco Olivares, Cristian Urbina:
    Generalized straight-line programs. 14
• 
  • 
  • 
  • 
  • 
    Philippe Schnoebelen, Isa Vialard:
    On the piecewise complexity of words. 15
• 
  • 
  • 
  • 
  • 
    Sounaka Mishra:
    On minimum t-claw deletion in split graphs. 16

Volume 62, Number 2, June 2025

• 
  • 
  • 
  • 
  • 
    Angelo Monti, Blerina Sinaimeri:
    On star-k-PCGs: exploring class boundaries for small k values. 17
• 
  • 
  • 
  • 
  • 
    Andrew Bloch-Hansen, Roberto Solis-Oba:
    The thief orienteering problem on 2-terminal series-parallel graphs. 18
• 
  • 
  • 
  • 
  • 
    Alon Efrat, William S. Evans, Kassian Köck, Stephen G. Kobourov, Jacob Miller:
    Visualization of bipartite graphs in limited window size. 19
• 
  • 
  • 
  • 
  • 
    Chunhua Cao, Lei Liao, Zhongmei Yan, Di Yang, Yuguang Yuan:
    Three-word codes a,aba,u\{a,\ aba,\ u\}a,aba,u and a,ab,v\{a,\ ab,\ v\}a,ab,v having finite completions. 20
• 
  • 
  • 
  • 
  • 
    Martin Kutrib, Uwe Meyer:
    Deterministic real-time tree-walking-storage automata. 21
• 
  • 
  • 
  • 
  • 
    Masood Ur Rehman, Muhammad Ajmal:
    Effects on distance energy of some special complete multipartite graphs by embedding an edge. 22
• 
  • 
  • 
  • 
  • 
    Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
    Row-column combination of Dyck words. 23
• 
  • 
  • 
  • 
  • 
    Ivan Bliznets, Jesper Nederlof:
    Exact and parameterized algorithms for choosability. 24
• 
  • 
  • 
  • 
  • 
    Jona Dirks, Enna Gerhard, Mario Grobler, Amer E. Mouawad, Sebastian Siebertz:
    Data reduction for directed feedback vertex set on graphs without long induced cycles. 25

Volume 62, Number 3, September 2025

• 
  • 
  • 
  • 
  • 
    Othman Echi:
    The Primitive Deficiency of two Primitive Strings. 26
• 
  • 
  • 
  • 
  • 
    Markus Chimani, Max Ilsen:
    Correction: Directed capacity-preserving subgraphs: hardness and exact polynomial algorithms. 27
• 
  • 
  • 
  • 
  • 
    Zhengyang John Lu, Joel D. Day, Piyush Jha, Paul Sarnighausen-Cahn, Stefan Siemer, Florin Manea, Vijay Ganesh:
    Novel tree-search method for synthesizing SMT strategies. 28
• 
  • 
  • 
  • 
  • 
    Hagit Attiya, Armando Castañeda, Constantin Enea:
    Preserving hyperproperties of programs using primitives with consensus number 2. 29
• 
  • 
  • 
  • 
  • 
    Tzu-Han Hsu, Ana Oliveira da Costa, Andrew Wintenberg, Ezio Bartocci, Borzoo Bonakdarpour:
    Gray-box runtime enforcement of hyperproperties. 30
• 
  • 
  • 
  • 
  • 
    Sarah Winter, Martin Zimmermann:
    Tracy, traces, and transducers: computable counterexamples and explanations for HyperLTL model-checking. 31
• 
  • 
  • 
  • 
  • 
    Debajyoti Mondal, Md. Saidur Rahman:
    On the 3-tree core of plane graphs. 32
• 
  • 
  • 
  • 
  • 
    Hichem Rami Ait El Hara, François Bobot, Guillaume Bury:
    Reasoning over n-indexed sequences in SMT. 33
• 
  • 
  • 
  • 
  • 
    Sven Mallach:
    On integer linear programs for treewidth based on perfect elimination orderings (extended version). 34
• 
  • 
  • 
  • 
  • 
    Piotr Wojciechowski, K. Subramani:
    Parameterized lower bounds for the weighted vertex cover problem in trees. 35
• 
  • 
  • 
  • 
  • 
    Jan Janousek, Stepán Plachý:
    Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching. 36

Volume 62, Number 4, December 2025

• 
  • 
  • 
  • 
  • 
    Chinmay Debnath, Alak Kumar Datta:
    Spanning cactus and spanning cactus extension of outerplanar graphs. 37
• 
  • 
  • 
  • 
  • 
    Bernd Finkbeiner, Julian Siber:
    Explainability requirements as hyperproperties. 38
• 
  • 
  • 
  • 
  • 
    András Murvai, György Vaszil:
    Watson-Crick finite automata of small size and variants of string assembling systems. 39
• 
  • 
  • 
  • 
  • 
    Arthur Correnson, Tobias Nießen, Bernd Finkbeiner, Georg Weissenbacher:
    Symbolic execution for refuting ∀∃ hyperproperties. 40
• 
  • 
  • 
  • 
  • 
    Marcos M. Salvatierra, Juan Gabriel Colonna, Mario Salvatierra, Alcides de C. Amorim Neto:
    An efficient alternative strategy for finding prices in envy-free perfect matchings. 41
• 
  • 
  • 
  • 
  • 
    Henning Fernau:
    Editorial 2025: Going Beyond 40. 42
• 
  • 
  • 
  • 
  • 
    Ezio Bartocci, Marek Chalupa, Thomas A. Henzinger, Dejan Nickovic, Ana Oliveira da Costa:
    Hypernode automata. 43

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: