default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 923
Volume 923, June 2022
- Kazuhiro Kurita, Kunihiro Wasa
:
Constant amortized time enumeration of Eulerian trails. 1-12 - Hugo A. Akitaya, Matias Korman, Oliver Korten, Diane L. Souvaine, Csaba D. Tóth:
Reconfiguration of connected graph partitions via recombination. 13-26 - Julien Bensmail, Fionn Mc Inerney:
On a vertex-capturing game. 27-46 - El-Mahdi El-Mhamdi, Rachid Guerraoui, Lê-Nguyên Hoang, Alexandre Maurer:
Removing algorithmic discrimination (with minimal individual error). 47-55 - Michel Habib, Fabien de Montgolfier, Lalla Mouatadid, Mengchuan Zou:
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs. 56-73 - Joachim Gudmundsson, Mees van de Kerkhof, André van Renssen, Frank Staals, Lionov Wiratma, Sampson Wong:
Covering a set of line segments with a few squares. 74-98 - Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki:
Complexity results on register context-free grammars and related formalisms. 99-125 - Herman Goulet-Ouellet:
Suffix-connected languages. 126-143 - Jing Liang, Haixing Zhao, Jun Yin:
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks. 144-159 - Wantao Ning, Litao Guo:
Connectivity and super connectivity of the exchanged 3-ary n-cube. 160-166 - You Chen, Xueliang Li:
The proper vertex-disconnection of graphs. 167-178 - Boaz Patt-Shamir, Mor Perry:
Proof-labeling schemes: Broadcast, unicast and in between. 179-195 - Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena:
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. 196-221 - Dieaa I. Nassr, M. Anwar, Hatem M. Bahig:
Improving small private exponent attack on the Murru-Saettone cryptosystem. 222-234 - Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri:
The Connected Critical Node Problem. 235-255 - Xiaofei Liu, Weidong Li, Han Dai:
Approximation algorithms for the minimum power cover problem with submodular/linear penalties. 256-270 - Louis Dublois, Michael Lampis, Vangelis Th. Paschos:
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. 271-291 - Zhen Zhang, Yipeng Zhou, Shaoqian Yu:
Better guarantees for k-median with service installation costs. 292-303 - Eurinardo Rodrigues Costa, Nicolas Almeida Martins, Rudini M. Sampaio:
Spy game: FPT-algorithm, hardness and graph products. 304-317 - Kien Trung Nguyen, Wen Chean Teh, Nguyen Thanh Hung, Huong Nguyen-Thu:
A linear time algorithm for connected p-centdian problem on block graphs. 318-326 - Zhiyi Tang:
Optimal embedding of hypercube into cylinder. 327-336 - Min-Sheng Lin:
Counting dominating sets in some subclasses of bipartite graphs. 337-347 - Morteza Alimi, Amir Daneshgar, Mohammad-Hadi Foroughmand-Araabi:
Mean isoperimetry with control on outliers: Exact and approximation algorithms. 348-365 - Chai Shu, Xiang-Jun Li, Meijie Ma:
Note on reliability of star graphs. 366-375
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.
last updated on 2025-10-22 02:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
