Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue |
Max-min greedy matching problem: Hardness for the adversary and fractional variant. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Oliver Bachtler, Tim Bergner, Sven O. Krumke |
Almost disjoint paths and separating by forbidden pairs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Olga G. Parshina, Svetlana Puzynina |
Finite and infinite closed-rich words. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Rabinovich, Michael Amir, Alfred M. Bruckstein |
Optimally reordering mobile agents on parallel rows. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiaojin Zhang 0002 |
Improved algorithm for permutation testing. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Dekel Tsur |
Algorithms for 2-club cluster deletion problems using automated generation of branching rules. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Tian Bai 0003, Mingyu Xiao 0001 |
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Qin Lei, Hong Jin, Jia Lee, Jiang Zhong |
Land use and land cover change simulation enhanced by asynchronous communicating cellular automata. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiaojun Zhao, Qingying Deng, Xiaowang Li |
Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Martin Bullinger, Warut Suksompong |
Topological distance games. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiao-Tao Lü, Jin Chen, Zhi-Xiong Wen, Wen Wu 0002 |
On the 2-binomial complexity of the generalized Thue-Morse words. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos |
Filling crosswords is very hard. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Satyabrata Jana, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma |
Partitioning subclasses of chordal graphs with few deletions. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Rocco Ascone, Giulia Bernardini 0001, Luca Manzoni |
Fixed points and attractors of reactantless and inhibitorless reaction systems. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Caragiannis, Shivika Narang |
Repeatedly matching items to agents fairly and efficiently. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi |
Algorithms and hardness results for edge total domination problem in graphs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Liguan Wang, Yuan Li, Haibin Kan |
Obtaining simulation extractable NIZKs in the updatable CRS model generically. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Sumin Huang, Sergey Kitaev |
On ordering of β-description trees. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Qianru Zhou, Baolei Cheng, Jingya Zhou, Jia Yu 0005, Yan Wang 0078, Jianxi Fan |
Reliability evaluation for a class of recursive match networks. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Elisabeth Remy, Paul Ruet |
From multivalued to Boolean functions: Preservation of soft nested canalization. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Peng Yang, Yuan Huang, Zhiguo Fu |
The computational complexity of Holant problems on 3-regular graphs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ren Tristan A. de la Cruz, Francis George C. Cabarle, Henry N. Adorna |
Steps toward a homogenization procedure for spiking neural P systems. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Naonori Kakimura, Riku Nitta |
Randomized counter-based algorithms for frequency estimation over data streams in O(loglogN) space. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Yi-Jun Chang |
The energy complexity of diameter and minimum cut computation in bounded-genus networks. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Firat Kiyak, A. C. Cem Say |
Energy complexity of regular languages. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Florian Bruse, Maurice Herwig, Martin Lange |
Weights of formal languages based on geometric series with an application to automatic grading. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001 |
Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Hengzhao Ma, Jianzhong Li 0001, Tianpeng Gao, Xiangyu Gao |
Turing machines with two-level memory: New computational models for analyzing the input/output complexity. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis |
Convex grid drawings of planar graphs with constant edge-vertex resolution. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Berend, Liat Cohen, Omrit Filtser |
A tour of general Hanoi graphs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nada Almalki 0002, Othon Michail |
On geometric shape construction via growth operations. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Joan Boyar, Kim S. Larsen, Denis Pankratov |
Advice complexity of adaptive priority algorithms. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Davide Castelnovo, Fabio Gadducci, Marino Miculan |
A simple criterion for M,N-adhesivity. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Yan Lan, Yuan Yuan 0020, Yinling Wang, Xin Han, Yong Zhou |
Flow shop scheduling problems with transportation constraints revisited. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Shengminjie Chen, Donglei Du, Ruiqi Yang, Wenguo Yang, Yapu Zhang |
A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoming Sun 0001, Jialin Zhang, Shuo Zhang, Zhijie Zhang |
Improved deterministic algorithms for non-monotone submodular maximization. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Eléa Thibault Greugny, François Fages, Ovidiu Radulescu, Peter Szmolyan, Georgios N. Stamatas |
A skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Dvorák, Mei-Mei Gu |
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar |
Popular critical matchings in the many-to-many setting. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Shuo Li |
A note on the Lie complexity and beyond. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xianrun Chen, Sai Ji, Chenchen Wu, Yicheng Xu, Yang Yang |
An approximation algorithm for diversity-aware fair k-supplier problem. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch |
Approximating sparse quadratic programs. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Sameep Dahal, Jukka Suomela |
Distributed half-integral matching and beyond. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Binbin Tu, Yu Chen 0003, Hongrui Cui, Xianfang Wang |
Fast two-party signature for upgrading ECDSA to two-party scenario easily. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiaowei Huang, Shihao Zhang, Lvzhou Li |
Quantum algorithms for learning hidden strings with applications to matroid problems. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Rahul Jain 0015, Raghunath Tewari |
Space efficient algorithm for solving reachability using tree decomposition and separators. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Yong Wang 0027 |
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | L'ubomíra Dvoráková |
String attractors of episturmian sequences. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Bhagat, Andrzej Pelc |
Deterministic rendezvous in infinite trees. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Éric Duchêne, Nacim Oijid, Aline Parreau |
Bipartite instances of INFLUENCE. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios Gerontitis, Changxin Mo, Predrag S. Stanimirovic, Vasilios N. Katsikis |
Improved zeroing neural models based on two novel activation functions with exponential behavior. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ling Gai, Weiwei Zhang, Zhao Zhang 0002 |
Selfish bin packing with punishment. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Berend, S. Mamana |
A probabilistic algorithm for vertex cover. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Di Wang 0015, Jinhui Xu 0001 |
Gradient complexity and non-stationary views of differentially private empirical risk minimization. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Syohei Maruyama, Yuichi Sudo, Sayaka Kamei, Hirotsugu Kakugawa |
Self-stabilizing 2-minimal dominating set algorithms based on loop composition. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Hoa T. Vu |
Revisiting maximum satisfiability and related problems in data streams. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Nicola Rizzo 0001, Massimo Equi, Tuukka Norri, Veli Mäkinen |
Elastic founder graphs improved and enhanced. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Di Wu, Qilong Feng, Jianxin Wang 0001 |
Approximation algorithms for fair k-median problem without fairness violation. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann |
Routing schemes for hybrid communication networks. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Kian Mirjalali, Hamid Zarrabi-Zadeh |
Massively parallel and streaming algorithms for balanced clustering. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara |
Computational complexity of jumping block puzzles. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiwen Wang, Kai Zhang 0016, Junqing Gong 0001, Shi-Feng Sun 0001, Jianting Ning |
Updatable searchable symmetric encryption: Definitions and constructions. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol |
Reconstructing parameterized strings from parameterized suffix and LCP arrays. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh |
Counting subwords in circular words and their Parikh matrices. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Wen Yin, Jiarong Liang, Yuhao Xie, Changzhen Li |
The t/k-diagnosability of m-ary n-cube networks. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Yuzuru Tanaka |
Designing aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integers. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Bernard Berthomieu, Dmitry A. Zaitsev |
Sleptsov nets are Turing-complete. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoqing Liu, Baolei Cheng, Yan Wang 0078, Jia Yu 0005, Jianxi Fan |
Enhancing fault tolerance of balanced hypercube networks by the edge partition method. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Shenxing Zhang |
On the linearity of the periods of subtraction games. |
Theor. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
1 | Narendra Kumar, Siddhartha Siddhiprada Bhoi, Abhay Kumar Singh |
A study of primer design with w-constacyclic shift over F4. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Gewu Bu, Zvi Lotker, Maria Potop-Butucaru, Mikaël Rabie |
Lower and upper bounds for deterministic convergecast with labeling schemes. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini |
On the parameterized complexity of s-club cluster deletion problems. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Zsolt Gazdag, Károly Hajagos |
A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kaige Pan |
Star fault tolerance of hypercube. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Riccardo Dondi |
Untangling temporal graphs of bounded degree. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Neel Karia, Faraaz Mallick, Palash Dey |
How hard is safe bribery? |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Alexandre M. Silva, Carlos Pereira dos Santos, João Pedro Neto, Richard J. Nowakowski |
Disjunctive sums of quasi-nimbers. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano |
Iterated uniform finite-state transducers on unary languages. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eddie Cheng 0001, László Lipták, Ke Qiu 0001, Zhizhang Shen, Abhishek Vangipuram |
On the g-extra connectivity of augmented cubes. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Duri Janett, Johannes Lengler |
Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang |
Matroidal connectivity and conditional matroidal connectivity of star graphs. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Carsten Witt |
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha |
The obnoxious facility location game with dichotomous preferences. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Tian Bai 0003, Mingyu Xiao 0001 |
A parameterized algorithm for subset feedback vertex set in tournaments. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Kelvin C. Buño, Henry N. Adorna |
Solving 3-SAT in distributed P systems with string objects. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Longkun Guo, Kewen Liao, Di Xiao 0005, Pei Yao |
Submodular maximization over data streams with differential privacy noise. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eduardo Sany Laber, Lucas Murtinho |
Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | G. Jaykrishnan, Asaf Levin |
EPTAS for the dual of splittable bin packing with cardinality constraint. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Rasha Faqeh, André Martin, Valerio Schiavoni, Pramod Bhatotia, Pascal Felber, Christof Fetzer |
Capacity planning for dependable services. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Thierry Lecroq, Svetlana Puzynina |
TCS special issue: Combinatorics on Words - WORDS 2021. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker |
Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Chunying Ren, Zijun Wu 0001, Dachuan Xu, Wenqing Xu |
A game-theoretic perspective of deep neural networks. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Takkolu Sree Lakshmi, Muthukumarasamy Govindarajan, Asadi Sreenivasulu |
Malware visual resemblance analysis with minimum losses using Siamese neural networks. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Sergio Rajsbaum |
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi 0001, Moritz Mühlenthaler, Akira Suzuki |
Feedback vertex set reconfiguration in planar graphs. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel |
Colouring graphs with no induced six-vertex path or diamond. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Pamela Fleischmann, Lukas Haschke, Jonas Höfer, Annika Huch, Annika Mayrock, Dirk Nowotka |
Nearly k-universal words - Investigating a part of Simon's congruence. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Assaf Rabinowitz, Dror Rawitz |
Overflow management with self-eliminations. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu |
Type-theoretic approaches to ordinals. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle |
Cryptographic hardness under projections for time-bounded Kolmogorov complexity. |
Theor. Comput. Sci. |
2023 |
DBLP DOI BibTeX RDF |
|