Browse Books

Li W (2024). Optimizing with Attractor: A Tutorial, ACM Computing Surveys, 56:9, (1-41), Online publication date: 31-Oct-2024.

Boehmer N and Koana T (2024). The Complexity of Finding Fair Many-to-One Matchings, ACM Transactions on Algorithms, 20:2, (1-37), Online publication date: 30-Apr-2024.

Jean D and Seo S Open-Locating-Dominating Sets with Error Correction Proceedings of the 2024 ACM Southeast Conference on ZZZ, (297-301)

Raczek J (2024). Complexity Issues on of Secondary Domination Number, Algorithmica, 86:4, (1163-1172), Online publication date: 1-Apr-2024.

Huang L, Yu W and Liu Z (2024). Approximation Algorithms for the Min–Max Mixed Rural Postmen Cover Problem and Its Variants, Algorithmica, 86:4, (1135-1162), Online publication date: 1-Apr-2024.

Fan W, Lu P, Pang K, Jin R and Yu W (2024). Linking Entities across Relations and Graphs, ACM Transactions on Database Systems, 49:1, (1-50), Online publication date: 31-Mar-2024.

Numaguchi H, Wu W and Hu Y (2024). Two-machine job-shop scheduling with one joint job, Discrete Applied Mathematics, 346:C, (30-43), Online publication date: 31-Mar-2024.

Gima T, Hanaka T, Kobayashi Y, Murai R, Ono H and Otachi Y Structural Parameterizations of Vertex Integrity [Best Paper] WALCOM: Algorithms and Computation, (406-420)

Brešar B and Yero I (2024). Lower (total) mutual-visibility number in graphs, Applied Mathematics and Computation, 465:C, Online publication date: 15-Mar-2024.

Zecchini L, Bleifuß T, Simonini G, Bergamaschi S and Naumann F (2024). Determining the Largest Overlap between Tables, Proceedings of the ACM on Management of Data, 2:1, (1-26), Online publication date: 12-Mar-2024.

Yang B, Zheng W, Lian X, Cai Y and Wang X (2024). HERO: A Hierarchical Set Partitioning and Join Framework for Speeding up the Set Intersection Over Graphs, Proceedings of the ACM on Management of Data, 2:1, (1-25), Online publication date: 12-Mar-2024.

An S and Cao Y (2024). Relative Keys: Putting Feature Explanation into Context, Proceedings of the ACM on Management of Data, 2:1, (1-28), Online publication date: 12-Mar-2024.

Liu L, Qi X and Xu Z (2024). Stabilizing Grand Cooperation via Cost Adjustment, INFORMS Journal on Computing, 36:2, (635-656), Online publication date: 1-Mar-2024.

Raghunathan A, Bergman D, Hooker J, Serra T and Kobori S (2024). Seamless Multimodal Transportation Scheduling, INFORMS Journal on Computing, 36:2, (336-358), Online publication date: 1-Mar-2024.

Pourhossein F, Huh W and Shechter S (2024). Assortment Planning with Satisficing Customers, Decision Analysis, 21:1, (48-73), Online publication date: 1-Mar-2024.

Kimelfeld B and Kolaitis P (2024). A Unifying Framework for Incompleteness, Inconsistency, and Uncertainty in Databases, Communications of the ACM, 67:3, (74-83), Online publication date: 1-Mar-2024.

Santini P, Baldi M and Chiaraluce F (2024). Computational Hardness of the Permuted Kernel and Subcode Equivalence Problems, IEEE Transactions on Information Theory, 70:3, (2254-2270), Online publication date: 1-Mar-2024.

Çağırıcı O, Hliněný P and Roy B (2024). On colourability of polygon visibility graphs, European Journal of Combinatorics, 117:C, Online publication date: 1-Mar-2024.

Wu G, Zuo F, Shi F and Wang J (2024). On scheduling multiple parallel two-stage flowshops with Johnson’s Rule, Journal of Combinatorial Optimization, 47:2, Online publication date: 1-Mar-2024.

Fomin F, Golovach P, Panolan F, Philip G and Saurabh S (2024). Diverse collections in matroids and graphs, Mathematical Programming: Series A and B, 204:1-2, (415-447), Online publication date: 1-Mar-2024.

Wang J, Chai C, Liu J and Li G (2024). Cardinality estimation using normalizing flow, The VLDB Journal — The International Journal on Very Large Data Bases, 33:2, (323-348), Online publication date: 1-Mar-2024.

Lucke F and Mann F (2024). Reducing Graph Parameters by Contractions and Deletions, Algorithmica, 86:3, (825-851), Online publication date: 1-Mar-2024.

Mattes C, Ushakov A and Weiß A Complexity of Spherical Equations in Finite Groups SOFSEM 2024: Theory and Practice of Computer Science, (383-397)

Divya D and Vijayakumar S On Star Partition of Split Graphs Algorithms and Discrete Applied Mathematics, (209-223)

Happach F and Schulz A (2024). Approximation Algorithms and Linear Programming Relaxations for Scheduling Problems Related to Min-Sum Set Cover, Mathematics of Operations Research, 49:1, (578-598), Online publication date: 1-Feb-2024.

Tian X and Zhu Z (2024). On the Fine-Grained Distributed Routing and Data Scheduling for Interplanetary Data Transfers, IEEE Transactions on Network and Service Management, 21:1, (451-462), Online publication date: 1-Feb-2024.

Maruyama S, Sudo Y, Kamei S and Kakugawa H (2024). Self-stabilizing 2-minimal dominating set algorithms based on loop composition, Theoretical Computer Science, 983:C, Online publication date: 1-Feb-2024.

Poureidi A and Farshi M (2024). On algorithmic complexity of imprecise spanners, Computational Geometry: Theory and Applications, 117:C, Online publication date: 1-Feb-2024.

Kawase Y and Sumita H (2024). Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation, Algorithmica, 86:2, (566-584), Online publication date: 1-Feb-2024.

Bläsius T and Fischbeck P (2024). On the External Validity of Average-case Analyses of Graph Algorithms, ACM Transactions on Algorithms, 20:1, (1-42), Online publication date: 31-Jan-2024.

Gottesbüren L, Heuer T, Maas N, Sanders P and Schlag S (2024). Scalable High-Quality Hypergraph Partitioning, ACM Transactions on Algorithms, 20:1, (1-54), Online publication date: 31-Jan-2024.

Myung Y (2024). A polynomial time algorithm for the triangle packing problem on interval graphs, Discrete Applied Mathematics, 343:C, (180-183), Online publication date: 30-Jan-2024.

Hua Y, Fu Y and Zhu Q (2024). On the design of cost minimization for D2D‐enabled wireless caching networks, IET Communications, 18:2, (129-144), Online publication date: 24-Jan-2024.

Dasari K, Singh A and Mallipeddi R A General Variable Neighborhood Search Approach for the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule Distributed Computing and Intelligent Technology, (356-370)

Leaños J, Ndjatchi C and Ríos-Castro L (2024). Disjointness graphs of segments in R 2 are almost all hamiltonian, Discrete Applied Mathematics, 342:C, (168-173), Online publication date: 15-Jan-2024.

Wojciechowski P, Subramani K, Velasquez A and Caskurlu B (2024). Priority-based bin packing with subset constraints, Discrete Applied Mathematics, 342:C, (64-75), Online publication date: 15-Jan-2024.

Gourvès L, Harutyunyan A, Lampis M and Melissinos N (2024). Filling crosswords is very hard, Theoretical Computer Science, 982:C, Online publication date: 8-Jan-2024.

Bachtler O, Bergner T and Krumke S (2024). Almost disjoint paths and separating by forbidden pairs, Theoretical Computer Science, 982:C, Online publication date: 8-Jan-2024.

Caragiannis I and Narang S (2024). Repeatedly matching items to agents fairly and efficiently, Theoretical Computer Science, 981:C, Online publication date: 4-Jan-2024.

Raghavan S and Zhang R (2024). The Driver-Aide Problem, Manufacturing & Service Operations Management, 26:1, (291-311), Online publication date: 1-Jan-2024.

Sidiropoulos N, Karakasis P and Konar A (2024). Minimizing Low-Rank Models of High-Order Tensors: Hardness, Span, Tight Relaxation, and Applications, IEEE Transactions on Signal Processing, 72, (129-142), Online publication date: 1-Jan-2024.

Zhang F, Guo H, Ouyang D, Yang S, Lin X and Tian Z (2024). Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution, IEEE Transactions on Knowledge and Data Engineering, 36:1, (356-371), Online publication date: 1-Jan-2024.

Dvořák Z, Král' D and Thomas R (2024). Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations, Journal of Combinatorial Theory Series B, 164:C, (517-548), Online publication date: 1-Jan-2024.

Araujo J, Campos V, Girão D, Nogueira J, Salgueiro A and Silva A (2024). On the hull number on cycle convexity of graphs, Information Processing Letters, 183:C, Online publication date: 1-Jan-2024.

Rosati R, Bouamama S and Blum C (2024). Multi-constructor CMSA for the maximum disjoint dominating sets problem, Computers and Operations Research, 161:C, Online publication date: 1-Jan-2024.

Xi W, Lin W and Lin Y (2024). Packing 2- and 3-stars into cubic graphs, Applied Mathematics and Computation, 460:C, Online publication date: 1-Jan-2024.

Khiat A, Haddadi M and Bahnes N (2023). Genetic-Based Algorithm for Task Scheduling in Fog–Cloud Environment, Journal of Network and Systems Management, 32:1, Online publication date: 1-Jan-2024.

Aissi H and Mahjoub A (2024). On the minimum cut problem with budget constraints, Mathematical Programming: Series A and B, 203:1-2, (421-442), Online publication date: 1-Jan-2024.

Ceberio J and Santucci V (2023). Model-based Gradient Search for Permutation Problems, ACM Transactions on Evolutionary Learning and Optimization, 3:4, (1-35), Online publication date: 31-Dec-2024.

Çatalyürek Ü, Devine K, Faraj M, Gottesbüren L, Heuer T, Meyerhenke H, Sanders P, Schlag S, Schulz C, Seemaier D and Wagner D (2022). More Recent Advances in (Hyper)Graph Partitioning, ACM Computing Surveys, 55:12, (1-38), Online publication date: 31-Dec-2024.

Djebrouni Y, Benarba N, Touat O, De Rosa P, Bouchenak S, Bonifati A, Felber P, Marangozova V and Schiavoni V (2024). Bias Mitigation in Federated Learning for Edge Computing, Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies, 7:4, (1-35), Online publication date: 19-Dec-2023.

Zheng J and Tan W AIGPU: An Arithmetic-Intensity-Guided Single-GPU Scheduling Model Proceedings of the 2023 International Conference on Mathematics, Intelligent Computing and Machine Learning, (64-69)

Casel K, Fernau H, Khosravian Ghadikolaei M, Monnot J and Sikora F (2023). Extension of some edge graph problems, Discrete Applied Mathematics, 340:C, (183-201), Online publication date: 15-Dec-2023.

Hanaka T, Ikeyama A and Ono H Maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs Combinatorial Optimization and Applications, (392-405)

Vasilchikov V (2023). Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem, Automatic Control and Computer Sciences, 57:7, (672-682), Online publication date: 1-Dec-2023.

Sadeh Y, Rottenstreich O and Kaplan H (2023). Load Balancing With Minimal Deviation in Switch Memories, IEEE Transactions on Network and Service Management, 20:4, (4283-4296), Online publication date: 1-Dec-2023.

Chen B, Chen F, Tang S, Zheng Q and Zhu Z (2023). On Orchestration of Segment Routing and In-Band Network Telemetry, IEEE Transactions on Network and Service Management, 20:4, (4047-4060), Online publication date: 1-Dec-2023.

Lv Q and Zhu Z (2023). On the Multilayer Planning of Filterless Optical Networks With OTN Encryption, IEEE/ACM Transactions on Networking, 31:6, (2529-2544), Online publication date: 1-Dec-2023.

Dou S, Qi L, Yao C and Guo Z (2023). Exploring the Impact of Critical Programmability on Controller Placement for Software-Defined Wide Area Networks, IEEE/ACM Transactions on Networking, 31:6, (2575-2588), Online publication date: 1-Dec-2023.

Sun R, Wu Y, Wang X, Chen C, Zhang W and Lin X (2023). Clique Identification in Signed Graphs: A Balance Theory Based Model, IEEE Transactions on Knowledge and Data Engineering, 35:12, (12513-12527), Online publication date: 1-Dec-2023.

Gillioz A and Riesen K (2023). Graph-based pattern recognition on spectral reduced graphs, Pattern Recognition, 144:C, Online publication date: 1-Dec-2023.

Baumeister D, Neveling M, Roos M, Rothe J, Schend L, Weishaupt R and Xia L (2023). The possible winner with uncertain weights problem, Journal of Computer and System Sciences, 138:C, Online publication date: 1-Dec-2023.

Wang C, Yang Y and Xu S (2023). Algorithmic aspects of secure domination in unit disk graphs, Information and Computation, 295:PB, Online publication date: 1-Dec-2023.

Ganian R, Hamm T, Knop D, Schierreich Š and Suchý O (2023). Hedonic diversity games, Artificial Intelligence, 325:C, Online publication date: 1-Dec-2023.

Yu W, Golin M and Zhang G (2023). Scheduling on a graph with release times, Journal of Scheduling, 26:6, (571-580), Online publication date: 1-Dec-2023.

Lewis R, Corcoran P and Gagarin A (2023). Methods for determining cycles of a specific length in undirected graphs with edge weights, Journal of Combinatorial Optimization, 46:5, Online publication date: 1-Dec-2023.

Li J, Chen R, Wang C, Chen Y, Huang Y and Wang X (2023). A performance-impact based multi-task distributed scheduling algorithm with task removal inference and deadlock avoidance, Autonomous Agents and Multi-Agent Systems, 37:2, Online publication date: 1-Dec-2023.

Gupta S, Jain P, Saurabh S and Talmon N (2023). Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules, Algorithmica, 85:12, (3717-3740), Online publication date: 1-Dec-2023.

Yıldız E, Karaoğlan İ and Altiparmak F (2023). An exact algorithm for Two-Echelon Location-Routing problem with simultaneous pickup and delivery, Expert Systems with Applications: An International Journal, 231:C, Online publication date: 30-Nov-2023.

Schmitz Y, Vietz D and Wanke E (2023). A note on the complexity of k-metric dimension , Applied Mathematics and Computation, 457:C, Online publication date: 15-Nov-2023.

Lyu Y (2023). Labeling algorithm for power domination problem of trees, Applied Mathematics and Computation, 457:C, Online publication date: 15-Nov-2023.

Fan L, Fan W, Lu P, Tian C and Yin Q (2023). Enriching Recommendation Models with Logic Conditions, Proceedings of the ACM on Management of Data, 1:3, (1-28), Online publication date: 13-Nov-2023.

Lee H, Guo L, Tang M, Firoz J, Tallent N, Kougkas A and Sun X Data Flow Lifecycles for Optimizing Workflow Coordination Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-15)

Zhen L, Tan Z, de Koster R and Wang S (2023). How to Deploy Robotic Mobile Fulfillment Systems, Transportation Science, 57:6, (1671-1695), Online publication date: 1-Nov-2023.

Bendotti P, Chrétienne P, Fouilhoux P and Pass-Lanneau A (2023). The Anchor-Robust Project Scheduling Problem, Operations Research, 71:6, (2267-2290), Online publication date: 1-Nov-2023.

Gao Y, Yang S, Li F, Trajanovski S, Zhou P, Hui P and Fu X (2023). Video Content Placement at the Network Edge: Centralized and Distributed Algorithms, IEEE Transactions on Mobile Computing, 22:11, (6843-6859), Online publication date: 1-Nov-2023.

Lai P, He Q, Chen F, Abdelrazek M, Hosking J, Grundy J and Yang Y (2023). Online User and Power Allocation in Dynamic NOMA-Based Mobile Edge Computing, IEEE Transactions on Mobile Computing, 22:11, (6676-6689), Online publication date: 1-Nov-2023.

Lagos T and Prokopyev O (2023). On complexity of finding strong-weak solutions in bilevel linear programming, Operations Research Letters, 51:6, (612-617), Online publication date: 1-Nov-2023.

Janota M, Morgado A and Vojtěchovský P (2023). Computing generating sets of minimal size in finite algebras, Journal of Symbolic Computation, 119:C, (50-63), Online publication date: 1-Nov-2023.

Fomin F, Golovach P, Lochet W, Sagunov D, Saurabh S and Simonov K (2023). Detours in directed graphs, Journal of Computer and System Sciences, 137:C, (66-86), Online publication date: 1-Nov-2023.

Mertzios G, Molter H, Niedermeier R, Zamaraev V and Zschoche P (2023). Computing maximum matchings in temporal graphs, Journal of Computer and System Sciences, 137:C, (1-19), Online publication date: 1-Nov-2023.

Sun L, Chang Y, Lyu C, Shi Y, Shi Y and Lin C (2023). Toward multi-target self-organizing pursuit in a partially observable Markov game, Information Sciences: an International Journal, 648:C, Online publication date: 1-Nov-2023.

Álvarez-Miranda E, Pereira J and Vilà M (2023). Analysis of the simple assembly line balancing problem complexity, Computers and Operations Research, 159:C, Online publication date: 1-Nov-2023.

Benini M, Blasi E, Detti P and Fosci L (2023). Solving crop planning and rotation problems in a sustainable agriculture perspective, Computers and Operations Research, 159:C, Online publication date: 1-Nov-2023.

Hu Q, Lin Z, Fu J and Luan C (2023). Optimizing Cutting Sequences and Paths for Common-Edge Nested Parts, Computer-Aided Design, 164:C, Online publication date: 1-Nov-2023.

Xu C and Zhang G (2023). Learning-augmented algorithms for online subset sum, Journal of Global Optimization, 87:2-4, (989-1008), Online publication date: 1-Nov-2023.

Castoldi A, Martinhão A, Monte Carmelo E and dos Santos O (2023). Covering schemes of strength t, Designs, Codes and Cryptography, 91:11, (3563-3580), Online publication date: 1-Nov-2023.

Lamprakos C, Xydis S, Kourzanov P, Perumkunnil M, Catthoor F and Soudris D Beyond RSS: Towards Intelligent Dynamic Memory Management (Work in Progress) Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes, (158-164)

Chang F, Chia M, Kuo D, Liaw S and Lin Y (2023). [ 1 , 2 ]-dimension of graphs, Discrete Applied Mathematics, 337:C, (232-245), Online publication date: 15-Oct-2023.

Fleischmann P, Kim S, Koß T, Manea F, Nowotka D, Siemer S and Wiedenhöft M Matching Patterns with Variables Under Simon’s Congruence Reachability Problems, (155-170)

Bujtás C, Ghanbari N and Klavžar S (2023). Computational complexity aspects of super domination, Theoretical Computer Science, 975:C, Online publication date: 9-Oct-2023.

Galyaev A, Yakhno V, Lysenko P, Berlin L and Buzikov M (2023). Optimization of Interception Plan for Rectilinearly Moving Targets, Automation and Remote Control, 84:10, (1026-1038), Online publication date: 1-Oct-2023.

Ruß M and Gust G (2023). Reliable route planning and time savings in real-world urban intermodal transportation networks, Expert Systems with Applications: An International Journal, 227:C, Online publication date: 1-Oct-2023.

Yan S, Hsieh K and Hsieh C (2023). An integrated model with a solution algorithm for improving an existing public bicycle sharing system, Computers and Industrial Engineering, 184:C, Online publication date: 1-Oct-2023.

Baruah S and Marchetti-Spaccamela A (2023). The Computational Complexity of Feasibility Analysis for Conditional DAG Tasks, ACM Transactions on Parallel Computing, 10:3, (1-22), Online publication date: 30-Sep-2023.

Dai W, Foerster K, Fuchssteiner D and Schmid S (2023). Load-optimization in Reconfigurable Data-center Networks: Algorithms and Complexity of Flow Routing, ACM Transactions on Modeling and Performance Evaluation of Computing Systems, 8:3, (1-30), Online publication date: 30-Sep-2023.

Bang-Jensen J, Hörsch F and Kriesell M (2023). Complexity of (arc)-connectivity problems involving arc-reversals or deorientations, Theoretical Computer Science, 973:C, Online publication date: 21-Sep-2023.

Chakraborty D and Sandeep R Contracting Edges to Destroy a Pattern: A Complexity Study Fundamentals of Computation Theory, (118-131)

Gorain B, Gupta A, Lokhande S, Mondal K and Pandit S (2023). Burning and w-burning of geometric graphs, Discrete Applied Mathematics, 336:C, (83-98), Online publication date: 15-Sep-2023.

Dey P (2023). Priced Gerrymandering, Theoretical Computer Science, 972:C, Online publication date: 13-Sep-2023.

Vilmin S, Faure–Giovagnoli P, Petit J and Scuturici V Functional Dependencies with Predicates: What Makes the g3-error Easy to Compute? Graph-Based Representation and Reasoning, (3-16)

Aziz H, Csáji G and Cseh Á Computational Complexity of k-Stable Matchings Algorithmic Game Theory, (311-328)

Huchette J and Vielma J (2023). Nonconvex Piecewise Linear Functions, Operations Research, 71:5, (1835-1856), Online publication date: 1-Sep-2023.

Lai X, Xu L, Xu Z and Du Y (2023). An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem, INFORMS Journal on Computing, 35:5, (1179-1194), Online publication date: 1-Sep-2023.

Cohen I, Einziger G, Goldstein M, Sa’ar Y, Scalosub G and Waisbard E (2023). High Throughput VMs Placement With Constrained Communication Overhead and Provable Guarantees, IEEE Transactions on Network and Service Management, 20:3, (3148-3161), Online publication date: 1-Sep-2023.

Sato T, Kurimoto T, Urushidani S and Oki E (2023). Virtualized Network Graph Design and Embedding Model to Minimize Provisioning Cost, IEEE Transactions on Network and Service Management, 20:3, (3562-3584), Online publication date: 1-Sep-2023.

Kunal K, Dhar T, Madhusudan M, Poojary J, Sharma A, Xu W, Burns S, Hu J, Harjani R and Sapatnekar S (2023). GNN-Based Hierarchical Annotation for Analog Circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 42:9, (2801-2814), Online publication date: 1-Sep-2023.

Çela E, Deineko V and Woeginger G (2023). Recognising permuted Demidenko matrices, Operations Research Letters, 51:5, (494-500), Online publication date: 1-Sep-2023.

Hannula M, Li X and Link S (2023). Controlling entity integrity with key sets, Journal of Computer and System Sciences, 136:C, (195-219), Online publication date: 1-Sep-2023.

Fomin F, Golovach P and Purohit N (2023). Parameterized complexity of categorical clustering with size constraints, Journal of Computer and System Sciences, 136:C, (171-194), Online publication date: 1-Sep-2023.

Zhao Y, Shen Y, Liu X, Luo Y, Zang W and Liu X (2023). Spiking neural P systems with long-term potentiation and depression, Information Sciences: an International Journal, 640:C, Online publication date: 1-Sep-2023.

Chao K, Zhao H, Xu Z and Cui F (2023). Robust hesitant fuzzy partitional clustering algorithms and their applications in decision making, Applied Soft Computing, 145:C, Online publication date: 1-Sep-2023.

Arulperumjothi M, Klavžar S and Prabhu S (2023). Redefining fractal cubic networks and determining their metric dimension and fault-tolerant metric dimension, Applied Mathematics and Computation, 452:C, Online publication date: 1-Sep-2023.

Mehta R, Sahni J and Khanna K (2023). Task scheduling for improved response time of latency sensitive applications in fog integrated cloud environment, Multimedia Tools and Applications, 82:21, (32305-32328), Online publication date: 1-Sep-2023.

Grübel J, Krug R, Schmidt M and Wollner W (2023). A Successive Linear Relaxation Method for MINLPs with Multivariate Lipschitz Continuous Nonlinearities, Journal of Optimization Theory and Applications, 198:3, (1077-1117), Online publication date: 1-Sep-2023.

Acikalin U, Caskurlu B and Subramani K (2023). Security-Aware Database Migration Planning, Constraints, 28:3, (472-505), Online publication date: 1-Sep-2023.

Fedtke S, Boysen N and Schumacher P (2023). In-line kitting for part feeding of assembly lines: workload balancing and storage assignment to reduce the workers’ walking effort, OR Spectrum, 45:3, (717-758), Online publication date: 1-Sep-2023.

Fleiner T, Jankó Z, Schlotter I and Teytelboym A (2023). Complexity of stability in trading networks, International Journal of Game Theory, 52:3, (629-648), Online publication date: 1-Sep-2023.

Qu W, Xiu X, Sun J and Kong L (2023). A new formulation of sparse multiple kernel k$$ k $$‐means clustering and its applications, Statistical Analysis and Data Mining, 16:5, (436-455), Online publication date: 1-Sep-2023.

Elkind E, Faliszewski P, Igarashi A, Manurangsi P, Schmidt-Kraepelin U and Suksompong W (2023). Justifying groups in multiwinner approval voting, Theoretical Computer Science, 969:C, Online publication date: 21-Aug-2023.

Van Der Zander B, Bläser M and Liśkiewicz M The hardness of reasoning about probabilities and causality Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5730-5738)

Wang Y, Jin C, Cai S and Lin Q PathLAD+ Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5639-5647)

Jiang H, Xu F, Zheng Z, Wang B and Zhou W A refined upper bound and inprocessing for the maximum k-plex problem Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5613-5621)

Jiang H and Zheng Z An exact algorithm for the minimum dominating set problem Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5604-5612)

Garvardt J, Grüttemeier N, Komusiewicz C and Morawietz N Parameterized local search for max c-cut Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (5586-5594)

Moraes R, Aleixo D, Ferreira L and Lelis L Choosing well your opponents Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (4847-4854)

Bhattacharyya A, Gayen S, Meel K, Myrisiotis D, Pavan A and Vinodchandran N On approximating total variation distance Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (3479-3487)

Hosseini H, Mammadov A and Wąs T Fairly allocating goods and (terrible) chores Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (2738-2746)

Faliszewski P, Lackner M, Sornat K and Szufa S An experimental comparison of multiwinner voting rules on approval elections Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (2675-2683)

Deltl E, Fluschnik T and Bredereck R Algorithmics of egalitarian versus equitable sequences of committees Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (2651-2658)

Deligkas A, Eiben E, Gutin G, Neary P and Yeo A Complexity of efficient outcomes in binary-action polymatrix games and implications for coordination problems Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (2642-2650)

Caragiannis I, Garg J, Rathi N, Sharma E and Varricchio G New fairness concepts for allocating indivisible items Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, (2554-2562)

Dasari K and Singh A (2023). Two heuristic approaches for clustered traveling salesman problem with d-relaxed priority rule, Expert Systems with Applications: An International Journal, 224:C, Online publication date: 15-Aug-2023.

Schulz A (2023). The balanced maximally diverse grouping problem with attribute values, Discrete Applied Mathematics, 335:C, (82-103), Online publication date: 15-Aug-2023.

Yi E (2023). On the edge dimension and the fractional edge dimension of graphs, Discrete Applied Mathematics, 335:C, (120-130), Online publication date: 15-Aug-2023.

Nip K On the NP-Hardness of Two Scheduling Problems Under Linear Constraints Frontiers of Algorithmics, (58-70)

Wu G, Zuo F, Shi F and Wang J Applying Johnson’s Rule in Scheduling Multiple Parallel Two-Stage Flowshops Frontiers of Algorithmics, (212-224)

Khan A (2023). Knowledge Graphs Querying, ACM SIGMOD Record, 52:2, (18-29), Online publication date: 10-Aug-2023.

Advani R, Papotti P and Asudeh A Maximizing Neutrality in News Ordering Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (11-24)

Arribas E, Cholvi V and Mancuso V (2023). Optimizing UAV Resupply Scheduling for Heterogeneous and Persistent Aerial Service, IEEE Transactions on Robotics, 39:4, (2639-2653), Online publication date: 1-Aug-2023.

Zhou Y, Zhang X, Geng N, Jiang Z, Wang S and Zhou M (2023). Frequent Itemset-Driven Search for Finding Minimal Node Separators and its Application to Air Transportation Network Analysis, IEEE Transactions on Intelligent Transportation Systems, 24:8, (8348-8360), Online publication date: 1-Aug-2023.

Maack N, Molter H, Niedermeier R and Renken M (2023). On finding separators in temporal split and permutation graphs, Journal of Computer and System Sciences, 135:C, (1-14), Online publication date: 1-Aug-2023.

Poureidi A and Fathali J (2023). Algorithmic results in Roman dominating functions on graphs, Information Processing Letters, 182:C, Online publication date: 1-Aug-2023.

Bédard A and Hallé S (2023). Formal verification for event stream processing, Information and Computation, 293:C, Online publication date: 1-Aug-2023.

Fomin F, Golovach P and Thilikos D (2023). Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs, Information and Computation, 293:C, Online publication date: 1-Aug-2023.

Tellache N and Kerbache L (2023). A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, Computers and Operations Research, 156:C, Online publication date: 1-Aug-2023.

De M and Lahiri A (2023). Geometric dominating-set and set-cover via local-search, Computational Geometry: Theory and Applications, 113:C, Online publication date: 1-Aug-2023.

Li J, Li W, Yang Y and Yang X (2023). On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs, Frontiers of Computer Science: Selected Publications from Chinese Universities, 17:4, Online publication date: 1-Aug-2023.

Pan S, Ma Y, Wang Y, Zhou Z, Ji J, Yin M and Hu S (2023). An improved master-apprentice evolutionary algorithm for minimum independent dominating set problem, Frontiers of Computer Science: Selected Publications from Chinese Universities, 17:4, Online publication date: 1-Aug-2023.

Nizam F, Chuah T and Lee Y (2023). Quality of service driven hierarchical resource allocation for network slicing-enabled hybrid wireless–wireline access networks, Telecommunications Systems, 83:4, (339-355), Online publication date: 1-Aug-2023.

Machovec D, Siegel H, Crowder J, Pasricha S, Maciejewski A and Friese R (2023). Surveillance mission scheduling with unmanned aerial vehicles in dynamic heterogeneous environments, The Journal of Supercomputing, 79:12, (13864-13888), Online publication date: 1-Aug-2023.

Salto C, Minetti G, Alba E and Luque G (2023). Big optimization with genetic algorithms: Hadoop, Spark, and MPI, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 27:16, (11469-11484), Online publication date: 1-Aug-2023.

Sun X, Masur J, Abramowitz B, Mattei N and Zheng Z Pandering in a (flexible) representative democracy Proceedings of the Thirty-Ninth Conference on Uncertainty in Artificial Intelligence, (2058-2068)

Dumitrescu A and Tóth C Observation Routes and External Watchman Routes Algorithms and Data Structures, (401-415)

Abu-Affash A, Carmi P, Luwisch O and Mitchell J Geometric Spanning Trees Minimizing the Wiener Index Algorithms and Data Structures, (1-14)

Majumder S and Singh A Heuristics for K-Independent Average Traveling Salesperson Problem Multi-disciplinary Trends in Artificial Intelligence, (25-35)

Yuan Y, Ma D, Wu A and Qin J Subgraph Search over Neural-Symbolic Graphs Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, (612-621)

Da Ros F and Di Gaspero L Exploring the Potential of JuLeS: A White Box Framework for Local Search Metaheuristics Proceedings of the Companion Conference on Genetic and Evolutionary Computation, (191-194)

Muniasamy R, Singh S, Nasre R and Narayanaswamy N Effective Parallelization of the Vehicle Routing Problem Proceedings of the Genetic and Evolutionary Computation Conference, (1036-1044)

Großmann E, Lamm S, Schulz C and Strash D Finding Near-Optimal Weight Independent Sets at Scale Proceedings of the Genetic and Evolutionary Computation Conference, (293-302)

Ito T, Ono H and Otachi Y (2023). Reconfiguration of cliques in a graph, Discrete Applied Mathematics, 333:C, (43-58), Online publication date: 15-Jul-2023.

Klimm M and Stahlberg M Complexity of equilibria in binary public goods games on undirected graphs Proceedings of the 24th ACM Conference on Economics and Computation, (938-955)

Horn M, Demirović E and Yorke-Smith N Solving the multi-choice two dimensional shelf strip packing problem with time windows Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, (491-499)

Jastrząb T, Lardeux F and Monfroy E Inference of Over-Constrained NFA of Size to Efficiently and Systematically Derive NFA of Size k for Grammar Learning Computational Science – ICCS 2023, (134-147)

Gimadi E and Shtepa A (2023). On Asymptotically Optimal Approach for Finding of the Minimum Total Weight of Edge-Disjoint Spanning Trees with a Given Diameter, Automation and Remote Control, 84:7, (772-787), Online publication date: 1-Jul-2023.

Hannula M, Zhang Z, Song B and Link S (2023). Discovery of Cross Joins, IEEE Transactions on Knowledge and Data Engineering, 35:7, (6839-6851), Online publication date: 1-Jul-2023.

Wang L, Liu X, Sun M and Zhao Y (2023). Evolution-communication spiking neural P systems with energy request rules, Neural Networks, 164:C, (476-488), Online publication date: 1-Jul-2023.

Tang Z, Yu N, Jia X and Hu X (2023). Data Placement and Transmission Scheduling for coded multicast in mobile edge networks, Computer Communications, 207:C, (140-149), Online publication date: 1-Jul-2023.

Schulz A (2023). The balanced maximally diverse grouping problem with integer attribute values, Journal of Combinatorial Optimization, 45:5, Online publication date: 1-Jul-2023.

Davidson I, Bai Z, Tran C and Ravi S (2023). Making clusterings fairer by post-processing: algorithms, complexity results and experiments, Data Mining and Knowledge Discovery, 37:4, (1404-1440), Online publication date: 1-Jul-2023.

Liu P, Fattahi S, Gómez A and Küçükyavuz S (2023). A graph-based decomposition method for convex quadratic optimization with indicators, Mathematical Programming: Series A and B, 200:2, (669-701), Online publication date: 1-Jul-2023.

Koana T, Komusiewicz C and Sommer F (2023). Computing Dense and Sparse Subgraphs of Weakly Closed Graphs, Algorithmica, 85:7, (2156-2187), Online publication date: 1-Jul-2023.

Gomes G, Guedes M and dos Santos V (2023). Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization, Algorithmica, 85:7, (1912-1947), Online publication date: 1-Jul-2023.

Fluschnik T, Niedermeier R, Schubert C and Zschoche P (2023). Multistage s–t Path: Confronting Similarity with Dissimilarity, Algorithmica, 85:7, (2028-2064), Online publication date: 1-Jul-2023.

Azar Y, Machluf C, Patt-Shamir B and Touitou N (2023). Competitive Vertex Recoloring, Algorithmica, 85:7, (2001-2027), Online publication date: 1-Jul-2023.

Cheng Y, Zhou H, Gao X, Zheng J and Chen G (2023). Optimizing incremental SDN upgrades for load balancing in ISP networks, Theoretical Computer Science, 962:C, Online publication date: 22-Jun-2023.

Figueira D and Romero M Conjunctive Regular Path Queries under Injective Semantics Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (231-240)

Goodrich M and Jacob R Optimal Parallel Sorting with Comparison Errors Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, (355-365)

Hermelin D, Itzhaki Y, Molter H and Niedermeier R (2023). Temporal interval cliques and independent sets, Theoretical Computer Science, 961:C, Online publication date: 15-Jun-2023.

Amano H Efficient FPGA Implementation of Amoeba-inspired SAT Solver with Feedback and Bounceback Control: Harnessing Variable-Level Parallelism for Large-Scale Problem Solving in Edge Computing Proceedings of the 13th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies, (41-48)

Sun X and Luo Q (2023). Efficient GPU-Accelerated Subgraph Matching, Proceedings of the ACM on Management of Data, 1:2, (1-26), Online publication date: 13-Jun-2023.

Harutyunyan H and Hovhannisyan N Broadcasting in Split Graphs Algorithms and Complexity, (278-292)

Fernau H, Foucaud F, Mann K, Padariya U and Rao K Parameterizing Path Partitions Algorithms and Complexity, (187-201)

Dumitrescu A and Lingas A Finding Small Complete Subgraphs Efficiently Combinatorial Algorithms, (185-196)

Lamprakos C, Xydis S, Catthoor F and Soudris D The Unexpected Efficiency of Bin Packing Algorithms for Dynamic Storage Allocation in the Wild: An Intellectual Abstract Proceedings of the 2023 ACM SIGPLAN International Symposium on Memory Management, (58-70)

Bar-Noy A, Böhnlein T, Peleg D and Rawitz D Degree Realization by Bipartite Multigraphs Structural Information and Communication Complexity, (3-17)

Liu X, Wang W, Chen X, Sterna M and Blazewicz J (2023). Exact Approaches to Late Work Scheduling on Unrelated Machines, International Journal of Applied Mathematics and Computer Science, 33:2, (285-295), Online publication date: 1-Jun-2023.

Wallinger M, Dobler A and Nöllenburg M (2023). LinSets.zip: Compressing Linear Set Diagrams, IEEE Transactions on Visualization and Computer Graphics, 29:6, (2875-2887), Online publication date: 1-Jun-2023.

Xu J, Guo H, Shen H, Raj M, Wurster S and Peterka T (2023). Reinforcement Learning for Load-Balanced Parallel Particle Tracing, IEEE Transactions on Visualization and Computer Graphics, 29:6, (3052-3066), Online publication date: 1-Jun-2023.

Wu Z, Han L, Liu J, Robert Y and Vivien F (2023). Energy-aware mapping and scheduling strategies for real-time workflows under reliability constraints, Journal of Parallel and Distributed Computing, 176:C, (1-16), Online publication date: 1-Jun-2023.

Gonthier M, Marchal L and Thibault S (2023). Taming data locality for task scheduling under memory constraint in runtime systems, Future Generation Computer Systems, 143:C, (305-321), Online publication date: 1-Jun-2023.

Cerdeira J, Martins M and Raydan M (2023). The max-out min-in problem, Computers and Operations Research, 154:C, Online publication date: 1-Jun-2023.

Issa S, Patterson R and Tu Y (2023). Solving resource-constrained project scheduling problems under different activity assumptions, Computers and Industrial Engineering, 180:C, Online publication date: 1-Jun-2023.

Albert-Smet J, Torrente A and Romo J (2023). Band depth based initialization of K-means for functional data clustering, Advances in Data Analysis and Classification, 17:2, (463-484), Online publication date: 1-Jun-2023.

Dong B, Su Y, Zhou Y, Cheng S and Wu X (2023). A discrete collaborative swarm optimizer for resource scheduling problem in mobile cellular networks, Neural Computing and Applications, 35:17, (12319-12329), Online publication date: 1-Jun-2023.

Xia M, Jin J, Liu B, Hu Y, Wang X and Chi K (2022). Physical-Assisted Routing for Proactive Avoidance of Nomadic Obstacles in IoT, ACM Transactions on Sensor Networks, 19:2, (1-29), Online publication date: 31-May-2023.

Liu M, Yang K, Fu Y, Wu D and Du W (2023). Driving Maneuver Anomaly Detection Based on Deep Auto-Encoder and Geographical Partitioning, ACM Transactions on Sensor Networks, 19:2, (1-22), Online publication date: 31-May-2023.

Groth M, Dippel A and Schumann M Enabling the Evaluation of Production Scheduling Algorithms in Complex Production Environments Using Individually Deployable Scheduling Services Design Science Research for a New Society: Society 5.0, (18-32)

Deligkas A, Eiben E, Goldsmith T and Skretas G Being an Influencer is Hard: The Complexity of Influence Maximization in Temporal Graphs with a Fixed Source Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (2222-2230)

Maass J, Mousseau V and Wilczynski A A Hotelling-Downs Game for Strategic Candidacy with Binary Issues Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (2076-2084)

Lackner M, Maly J and Nardi O Free-Riding in Multi-Issue Decisions Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (2040-2048)

Baumeister D, Boes L, Laußmann C and Rey S Bounded Approval Ballots: Balancing Expressiveness and Simplicity for Multiwinner Elections Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (1400-1408)

Wen Y, Zhang Z and Guo J Stable Marriage in Euclidean Space Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (994-1002)

Knop D and Schierreich S Host Community Respecting Refugee Housing Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (966-975)

Livne Y, Atzmon D, Skyler S, Boyarski E, Shapiro A and Felner A Optimally Solving the Multiple Watchman Route Problem with Heuristic Search Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (905-913)

Fan W, Fu W, Jin R, Liu M, Lu P and Tian C (2023). Making It Tractable to Catch Duplicates and Conflicts in Graphs, Proceedings of the ACM on Management of Data, 1:1, (1-28), Online publication date: 26-May-2023.

Tang X, Wu S, Zhang D, Li F and Chen G (2023). Detecting Logic Bugs of Join Optimizations in DBMS, Proceedings of the ACM on Management of Data, 1:1, (1-26), Online publication date: 26-May-2023.

Lei X and Tripunitara M The Hardness of Learning Access Control Policies Proceedings of the 28th ACM Symposium on Access Control Models and Technologies, (133-144)

Liu H, Zhang M and Xu X (2023). Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses, Theoretical Computer Science, 957:C, Online publication date: 12-May-2023.

Venkatesh S, Macaluso A and Klusch M QuACS Proceedings of the 20th ACM International Conference on Computing Frontiers, (197-200)

Wan Y, Lin X, Sabur A, Chang A, Xu K and Xue G IoT System Vulnerability Analysis and Network Hardening with Shortest Attack Trace in a Weighted Attack Graph Proceedings of the 8th ACM/IEEE Conference on Internet of Things Design and Implementation, (315-326)

Hung R (2023). Restrained domination and its variants in extended supergrid graphs, Theoretical Computer Science, 956:C, Online publication date: 4-May-2023.

Gomes G, Masquio B, Pinto P, dos Santos V and Szwarcfiter J (2023). Disconnected matchings, Theoretical Computer Science, 956:C, Online publication date: 4-May-2023.

Choi Y, Park K and Kim H (2023). BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification, Proceedings of the VLDB Endowment, 16:9, (2186-2198), Online publication date: 1-May-2023.

Zhu X, Liu Y, Liu S and Fan W (2023). MiniGraph: Querying Big Graphs with a Single Machine, Proceedings of the VLDB Endowment, 16:9, (2172-2185), Online publication date: 1-May-2023.

Fattahi A, Dasu S and Ahmadi R (2023). Peak-Load Energy Management by Direct Load Control Contracts, Management Science, 69:5, (2788-2813), Online publication date: 1-May-2023.

Hakert C, Khan A, Chen K, Hameed F, Castrillon J and Chen J (2023). ROLLED: Racetrack Memory Optimized Linear Layout and Efficient Decomposition of Decision Trees, IEEE Transactions on Computers, 72:5, (1488-1502), Online publication date: 1-May-2023.

Grout L, Cheriyan J and Laekhanukit B (2023). On a partition LP relaxation for min-cost 2-node connected spanning subgraphs, Operations Research Letters, 51:3, (289-295), Online publication date: 1-May-2023.

Zhao R, Feng J and Wang B (2023). Approximate synchronization of coupled multi-valued logical networks, Information Sciences: an International Journal, 626:C, (19-41), Online publication date: 1-May-2023.

Wojciechowski P, Subramani K and Velasquez A (2023). Reachability in choice networks, Discrete Optimization, 48:P1, Online publication date: 1-May-2023.

Ruth P and Lladser M (2023). Levenshtein graphs, Discrete Mathematics, 346:5, Online publication date: 1-May-2023.

Lu C, Deng Z, Fang S and Xing W (2023). A New Global Algorithm for Max-Cut Problem with Chordal Sparsity, Journal of Optimization Theory and Applications, 197:2, (608-638), Online publication date: 1-May-2023.

Ganian R, Ordyniak S and Rahul C (2023). Group Activity Selection with Few Agent Types, Algorithmica, 85:5, (1111-1155), Online publication date: 1-May-2023.

Jean D and Seo S (2023). On redundant locating-dominating sets, Discrete Applied Mathematics, 329:C, (106-125), Online publication date: 15-Apr-2023.

Glück R Compatibility of Refining and Controlling Plant Automata with Bisimulation Quotients Relational and Algebraic Methods in Computer Science, (87-104)

Bichler M, Milgrom P and Schwarz G (2023). Taming the Communication and Computation Complexity of Combinatorial Auctions, Management Science, 69:4, (2217-2238), Online publication date: 1-Apr-2023.

Liu J, Ren J, Zhang Y, Peng X, Zhang Y and Yang Y (2023). Efficient Dependent Task Offloading for Multiple Applications in MEC-Cloud System, IEEE Transactions on Mobile Computing, 22:4, (2147-2162), Online publication date: 1-Apr-2023.

Roy S, Devaraj R and Sarkar A (2023). SAFLA: Scheduling Multiple Real-Time Periodic Task Graphs on Heterogeneous Systems, IEEE Transactions on Computers, 72:4, (1067-1080), Online publication date: 1-Apr-2023.

Benoit A, Canon L, Elghazi R and Héam P (2023). List and shelf schedules for independent parallel tasks to minimize the energy consumption with discrete or continuous speeds, Journal of Parallel and Distributed Computing, 174:C, (100-117), Online publication date: 1-Apr-2023.

Li Y and Spirkl S (2023). The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size, Discrete Mathematics, 346:4, Online publication date: 1-Apr-2023.

Qiu F, Geng N and Wang H (2023). An improved memetic algorithm for integrated production scheduling and vehicle routing decisions, Computers and Operations Research, 152:C, Online publication date: 1-Apr-2023.

Bhore S, Li G, Nöllenburg M, Rutter I and Wu H (2023). Untangling circular drawings, Computational Geometry: Theory and Applications, 111:C, Online publication date: 1-Apr-2023.

Dabrowski K, Jonsson P, Ordyniak S and Osipov G (2023). Solving infinite-domain CSPs using the patchwork property, Artificial Intelligence, 317:C, Online publication date: 1-Apr-2023.

Nie K and Xu K (2023). Mixed metric dimension of some graphs, Applied Mathematics and Computation, 442:C, Online publication date: 1-Apr-2023.

Heeger K, Hermelin D, Mertzios G, Molter H, Niedermeier R and Shabtay D (2023). Equitable scheduling on a single machine, Journal of Scheduling, 26:2, (209-225), Online publication date: 1-Apr-2023.

Wang J, Tian F, Liu Y, Pang J and Miao L (2023). On Graphs of Order n with Metric Dimension , Graphs and Combinatorics, 39:2, Online publication date: 1-Apr-2023.

Wareham T, de Haan R, Vardy A and van Rooij I (2022). Swarm Control for Distributed Construction: A Computational Complexity Perspective, ACM Transactions on Human-Robot Interaction, 12:1, (1-45), Online publication date: 31-Mar-2023.

Rusu I (2023). On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs, Theoretical Computer Science, 952:C, Online publication date: 31-Mar-2023.

Zaidi I, Oulamara A, Idoumghar L and Basset M (2023). Electric Vehicle Charging Scheduling Problem: Heuristics and Metaheuristic Approaches, SN Computer Science, 4:3, Online publication date: 23-Mar-2023.

Mohanapriya A, Renjith P and Sadagopan N Roman k-Domination: Hardness, Approximation and Parameterized Results WALCOM: Algorithms and Computation, (343-355)

Schlotter I Recognizing When a Preference System is Close to Admitting a Master List WALCOM: Algorithms and Computation, (317-329)

Saito R, Eto H, Ito T and Uehara R Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs WALCOM: Algorithms and Computation, (191-201)

Aggarwal D, Saxena D, Bäck T and Emmerich M Real-World Airline Crew Pairing Optimization: Customized Genetic Algorithm Versus Column Generation Method Evolutionary Multi-Criterion Optimization, (518-531)

Long W, Li X, Wang L, Zhang F, Lin Z and Lin X (2023). Efficient m-closest entity matching over heterogeneous information networks, Knowledge-Based Systems, 263:C, Online publication date: 5-Mar-2023.

Cao Y, Rusmevichientong P and Topaloglu H (2023). Revenue Management Under a Mixture of Independent Demand and Multinomial Logit Models, Operations Research, 71:2, (603-625), Online publication date: 1-Mar-2023.

Farahani R, Shojafar M, Timmerer C, Tashtarian F, Ghanbari M and Hellwagner H (2023). ARARAT: A Collaborative Edge-Assisted Framework for HTTP Adaptive Video Streaming, IEEE Transactions on Network and Service Management, 20:1, (625-643), Online publication date: 1-Mar-2023.

Teran-Somohano A and Smith A (2023). A sequential space syntax approach for healthcare facility layout design, Computers and Industrial Engineering, 177:C, Online publication date: 1-Mar-2023.

Pai K, Wu R, Peng S and Chang J (2023). Three edge-disjoint Hamiltonian cycles in crossed cubes with applications to fault-tolerant data broadcasting, The Journal of Supercomputing, 79:4, (4126-4145), Online publication date: 1-Mar-2023.

Lendl S, Woeginger G and Wulf L (2023). Non-Preemptive Tree Packing, Algorithmica, 85:3, (783-804), Online publication date: 1-Mar-2023.

Bumpus B and Meeks K (2023). Edge Exploration of Temporal Graphs, Algorithmica, 85:3, (688-716), Online publication date: 1-Mar-2023.

VenkataKeerthy S, Jain S, Kundu A, Aggarwal R, Cohen A and Upadrasta R RL4ReAl: Reinforcement Learning for Register Allocation Proceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction, (133-144)

Greene J FPGA Mux Usage and Routability Estimates without Explicit Routing Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays, (141-147)

Mafuta P, Mukwembi S and Rodrigues B (2023). A note on connected domination number and leaf number, Discrete Mathematics, 346:2, Online publication date: 1-Feb-2023.

Srivastava G and Singh A (2023). Two evolutionary approaches with objective-specific variation operators for vehicle routing problem with time windows and quality of service objectives, Applied Soft Computing, 134:C, Online publication date: 1-Feb-2023.

Boysen N, Briskorn D and Schwerdfeger S (2023). How to charge while driving: scheduling point-to-point deliveries of an electric vehicle under overhead wiring, Journal of Scheduling, 26:1, (19-41), Online publication date: 1-Feb-2023.

de Andrade J and Menezes G (2023). A column generation-based heuristic to solve the integrated planning, scheduling, yard allocation and berth allocation problem in bulk ports, Journal of Heuristics, 29:1, (39-76), Online publication date: 1-Feb-2023.

Fradet P, Girault A, Krishnaswamy R, Nicollin X and Shafiei A (2022). RDF: A Reconfigurable Dataflow Model of Computation, ACM Transactions on Embedded Computing Systems, 22:1, (1-30), Online publication date: 31-Jan-2023.

Berzish M, Day J, Ganesh V, Kulczynski M, Manea F, Mora F and Nowotka D (2023). Towards more efficient methods for solving regular-expression heavy string constraints, Theoretical Computer Science, 943:C, (50-72), Online publication date: 17-Jan-2023.

Bentert M, Koana T and Niedermeier R (2023). The complexity of gerrymandering over graphs, Discrete Applied Mathematics, 324:C, (103-112), Online publication date: 15-Jan-2023.

Klawitter J, Klesen F, Niederer M and Wolff A Visualizing Multispecies Coalescent Trees: Drawing Gene Trees Inside Species Trees SOFSEM 2023: Theory and Practice of Computer Science, (96-110)

Laforest C and Martinod T Introduction to Routing Problems with Mandatory Transitions SOFSEM 2023: Theory and Practice of Computer Science, (254-266)

Bilò V, Gourvès L and Monnot J (2023). Project games, Theoretical Computer Science, 940:PA, (97-111), Online publication date: 9-Jan-2023.

Priyadarsini M, Mittal P, Mukherjee J and Bera P Budget-constrained Controller Placement in Software-defined Network Proceedings of the 24th International Conference on Distributed Computing and Networking, (217-226)

Kumar R and Mukherjee J An Approximation Algorithm for Path Planning of Vehicles for Data Collection in Wireless Rechargeable Sensor Networks Proceedings of the 24th International Conference on Distributed Computing and Networking, (207-216)

Ganesan A Structured Hypergraphs in Cellular Mobile Communication Systems Proceedings of the 24th International Conference on Distributed Computing and Networking, (188-196)

Lichen J, Cai L, Li J, Liu S, Pan P and Wang W (2023). Delay-constrained minimum shortest path trees and related problems, Theoretical Computer Science, 941:C, (191-201), Online publication date: 4-Jan-2023.

Zhang A, Zhang L, Chen Y, Chen G and Wang X (2023). Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints, Theoretical Computer Science, 941:C, (167-179), Online publication date: 4-Jan-2023.

Nakprasit K, Ruksasakchai W and Sittitrai P (2023). Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles, Theoretical Computer Science, 941:C, (131-139), Online publication date: 4-Jan-2023.

Xiao M (2023). Upper and lower bounds on approximating weighted mixed domination, Theoretical Computer Science, 939:C, (292-302), Online publication date: 4-Jan-2023.

Karaca T, Samanlioglu F, Altay A and Tang Y (2023). A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process, Applied Computational Intelligence and Soft Computing, 2023, Online publication date: 1-Jan-2023.

Hapka A, Wojszczyk R and Królikowski T (2024). A Multi-Criteria Optimisation Algorithm for the Evaluation of Scientific Activity, Procedia Computer Science, 225:C, (3987-3995), Online publication date: 1-Jan-2023.

Cazzola W and Favalli L (2023). The language mutation problem, Journal of Systems and Software, 195:C, Online publication date: 1-Jan-2023.

Dvořák Z and Kawarabayashi K (2023). Additive non-approximability of chromatic number in proper minor-closed classes, Journal of Combinatorial Theory Series B, 158:P1, (74-92), Online publication date: 1-Jan-2023.

Robles-Enciso A and Skarmeta A (2023). A multi-layer guided reinforcement learning-based tasks offloading in edge computing, Computer Networks: The International Journal of Computer and Telecommunications Networking, 220:C, Online publication date: 1-Jan-2023.

Keshavarz-Kohjerdi F and Bagheri A (2023). Finding Hamiltonian cycles of truncated rectangular grid graphs in linear time, Applied Mathematics and Computation, 436:C, Online publication date: 1-Jan-2023.

Sirisha D (2023). Complexity versus quality: a trade-off for scheduling workflows in heterogeneous computing environments, The Journal of Supercomputing, 79:1, (924-946), Online publication date: 1-Jan-2023.

Liu X, Li Y, Li W and Yang J (2023). Combinatorial approximation algorithms for the maximum bounded connected bipartition problem, Journal of Combinatorial Optimization, 45:1, Online publication date: 1-Jan-2023.

Sun Y, Yu W and Liu Z (2023). Approximation algorithms for some min–max and minimum stacker crane cover problems, Journal of Combinatorial Optimization, 45:1, Online publication date: 1-Jan-2023.

Barbato M, Grappe R, Lacroix M and Lancini E (2023). Box-total dual integrality and edge-connectivity, Mathematical Programming: Series A and B, 197:1, (307-336), Online publication date: 1-Jan-2023.

Fan W, Li Y, Liu M and Lu C (2022). Making graphs compact by lossless contraction, The VLDB Journal — The International Journal on Very Large Data Bases, 32:1, (49-73), Online publication date: 1-Jan-2023.

Aboulker P, Bonnet É, Kim E and Sikora F (2023). Grundy Coloring and Friends, Half-Graphs, Bicliques, Algorithmica, 85:1, (1-28), Online publication date: 1-Jan-2023.

Bartholdi L, Figelius M, Lohrey M and Weiß A (2022). Groups with ALOGTIME-hard Word Problems and PSPACE-complete Compressed Word Problems, ACM Transactions on Computation Theory, 14:3-4, (1-41), Online publication date: 31-Dec-2022.

Coudert D, Nusser A and Viennot L (2022). Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation, ACM Journal of Experimental Algorithmics, 27, (1-29), Online publication date: 31-Dec-2022.

Lin F and Hsieh H (2022). A Grid-Based Two-Stage Parallel Matching Framework for Bi-Objective Euclidean Traveling Salesman Problem, ACM Transactions on Spatial Algorithms and Systems, 8:4, (1-33), Online publication date: 31-Dec-2022.

Braga M and Marenco J (2022). Facet-generating procedures for the maximum-impact coloring polytope, Discrete Applied Mathematics, 323:C, (96-112), Online publication date: 31-Dec-2022.

Abreu A, Cunha L, Figueiredo C, Marquezino F, Posner D and Portugal R (2022). Total tessellation cover, Discrete Applied Mathematics, 323:C, (149-161), Online publication date: 31-Dec-2022.

de Figueiredo C, de Melo A, Sasaki D and Silva A (2022). Revising Johnson’s table for the 21st century, Discrete Applied Mathematics, 323:C, (184-200), Online publication date: 31-Dec-2022.

Araújo J and Arraes P (2022). Hull and geodetic numbers for some classes of oriented graphs, Discrete Applied Mathematics, 323:C, (14-27), Online publication date: 31-Dec-2022.

Han S and Yu J Integer Programming as a General Solution Methodology for Path-Based Optimization in Robotics: Principles, Best Practices, and Applications 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (1890-1897)

Tymoshenko A, Kochkarov R and Kochkarov A (2022). Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs, Automatic Control and Computer Sciences, 56:7, (807-814), Online publication date: 1-Dec-2022.

Smirnov A (2022). NP-Completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3, Automatic Control and Computer Sciences, 56:7, (788-799), Online publication date: 1-Dec-2022.

An S and Cao Y (2022). Making Cache Monotonic and Consistent, Proceedings of the VLDB Endowment, 16:4, (891-904), Online publication date: 1-Dec-2022.

Zhang X and Wang T (2022). Elastic and Reliable Bandwidth Reservation Based on Distributed Traffic Monitoring and Control, IEEE Transactions on Parallel and Distributed Systems, 33:12, (4563-4580), Online publication date: 1-Dec-2022.

Bankhamer G, Elsässer R and Schmid S (2022). Local Fast Rerouting With Low Congestion: A Randomized Approach, IEEE/ACM Transactions on Networking, 30:6, (2403-2418), Online publication date: 1-Dec-2022.

Lai P, He Q, Cui G, Chen F, Grundy J, Abdelrazek M, Hosking J and Yang Y (2022). Cost-Effective User Allocation in 5G NOMA-Based Mobile Edge Computing Systems, IEEE Transactions on Mobile Computing, 21:12, (4263-4278), Online publication date: 1-Dec-2022.

Dimitrova E, Stigler B, Kadelka C and Murrugarra D (2022). Revealing the canalizing structure of Boolean functions, Automatica (Journal of IFAC), 146:C, Online publication date: 1-Dec-2022.

Davis R, Griffin D and Bate I (2022). A framework for multi-core schedulability analysis accounting for resource stress and sensitivity, Real-Time Systems, 58:4, (456-508), Online publication date: 1-Dec-2022.

Chen Y, Goebel R, Lin G, Liu L, Su B, Tong W, Xu Y and Zhang A (2022). A local search 4/3-approximation algorithm for the minimum 3-path partition problem, Journal of Combinatorial Optimization, 44:5, (3595-3610), Online publication date: 1-Dec-2022.

Quilliot A and Rebaine D (2022). Linear time algorithms on mirror trees, Journal of Combinatorial Optimization, 44:5, (3495-3519), Online publication date: 1-Dec-2022.

Dienstknecht M, Boysen N and Briskorn D (2022). The traveling salesman problem with drone resupply, OR Spectrum, 44:4, (1045-1086), Online publication date: 1-Dec-2022.

Ou Z, Xu T, Su Q, Li Y, Zhao P and Bian Y Learning neural set functions under the optimal subset oracle Proceedings of the 36th International Conference on Neural Information Processing Systems, (35021-35034)

Yuan B, He Y, Davis J, Zhang T, Dao T, Chen B, Liang P, Re C and Zhang C Decentralized training of foundation models in heterogeneous environments Proceedings of the 36th International Conference on Neural Information Processing Systems, (25464-25477)

Selvi A, Belbasi M, Haugh M and Wiesemann W Wasserstein logistic regression with mixed features Proceedings of the 36th International Conference on Neural Information Processing Systems, (16691-16704)

Zhang J and Bareinboim E Online reinforcement learning for mixed policy scopes Proceedings of the 36th International Conference on Neural Information Processing Systems, (3191-3202)

Gascon M, Dondi R and El-Mabrouk N (2022). MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms, Theoretical Computer Science, 937:C, (22-38), Online publication date: 18-Nov-2022.

Jiang G, Zhou Q, Jin T, Li B, Zhao Y, Li Y and Cheng J VSGM Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-15)

Wang Y, Ikematsu Y and Yasuda T Lattice-Based Public Key Cryptosystems Invoking Linear Mapping Mask Provable and Practical Security, (88-104)

Song G and Leus R (2022). Parallel Machine Scheduling Under Uncertainty, INFORMS Journal on Computing, 34:6, (3059-3079), Online publication date: 1-Nov-2022.

Soykan B and Rabadi G (2022). A simulation-based optimization approach for multi-objective runway operations scheduling, Simulation, 98:11, (991-1012), Online publication date: 1-Nov-2022.

Dokka T, Letchford A and Mansoor M (2022). Revisiting surrogate relaxation for the multidimensional knapsack problem, Operations Research Letters, 50:6, (674-678), Online publication date: 1-Nov-2022.

Boulmier A, Abdennadher N and Chopard B (2022). Optimal load balancing and assessment of existing load balancing criteria, Journal of Parallel and Distributed Computing, 169:C, (211-225), Online publication date: 1-Nov-2022.

Sahli A, Behiri W, Belmokhtar-Berraf S and Chu C (2022). An effective and robust genetic algorithm for urban freight transport scheduling using passenger rail network, Computers and Industrial Engineering, 173:C, Online publication date: 1-Nov-2022.

Garzón E, Martínez J, Moreno J and Puertas M (2022). HPC acceleration of large (min, +) matrix products to compute domination-type parameters in graphs, The Journal of Supercomputing, 78:16, (17826-17843), Online publication date: 1-Nov-2022.

Bärmann A, Gemander P, Martin A and Merkert M (2022). On Recognizing Staircase Compatibility, Journal of Optimization Theory and Applications, 195:2, (449-479), Online publication date: 1-Nov-2022.

Li J, Wang W, Lichen J, Liu S and Pan P (2022). Approximation algorithms for solving the line-capacitated minimum Steiner tree problem, Journal of Global Optimization, 84:3, (687-714), Online publication date: 1-Nov-2022.

Ardizzoni S, Consolini L, Laurini M and Locatelli M (2022). Shortest path with acceleration constraints: complexity and approximation algorithms, Computational Optimization and Applications, 83:2, (555-592), Online publication date: 1-Nov-2022.

Sagan N and Roychowdhury J DaS Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, (1-9)

Qu J and Cao N (2022). Edge metric dimension and mixed metric dimension of planar graph Q n , Discrete Applied Mathematics, 320:C, (462-475), Online publication date: 30-Oct-2022.

Abu-Affash A, Carmi P and Krasin A (2022). A linear-time algorithm for minimum k-hop dominating set of a cactus graph, Discrete Applied Mathematics, 320:C, (488-499), Online publication date: 30-Oct-2022.

Bergold H, Hochstättler W and Steiner R (2022). Colorings of oriented planar graphs avoiding a monochromatic subgraph, Discrete Applied Mathematics, 320:C, (81-94), Online publication date: 30-Oct-2022.

Frongillo R, Geneson J, Lladser M, Tillquist R and Yi E (2022). Truncated metric dimension for finite graphs, Discrete Applied Mathematics, 320:C, (150-169), Online publication date: 30-Oct-2022.

Barish R and Shibuya T Proper Colorability of Segment Intersection Graphs Computing and Combinatorics, (573-584)

Gorain B, Mondal K and Pandit S Distributed Dominating Sets in Interval Graphs Computing and Combinatorics, (508-520)

Liu X and Liu Z The Bound Coverage Problem by Aligned Disks in  Metric Computing and Combinatorics, (305-312)

Chen J, Chu Z, Guo Y and Yang W Space Limited Graph Algorithms on Big Data Computing and Combinatorics, (255-267)

Chaudhary J, Mishra S and Panda B On the Complexity of Minimum Maximal Acyclic Matchings Computing and Combinatorics, (106-117)

Das S and Gahlawat H (2022). Bumblebee visitation problem, Discrete Applied Mathematics, 319:C, (27-41), Online publication date: 15-Oct-2022.

Mao Y, Yu W, Liu Z and Xiong J (2022). Approximation algorithms for some Minimum Postmen Cover Problems, Discrete Applied Mathematics, 319:C, (382-393), Online publication date: 15-Oct-2022.

S.V. U, Dourado M and Thankachy M (2022). Computational and structural aspects of the geodetic and the hull numbers of shadow graphs, Discrete Applied Mathematics, 319:C, (499-510), Online publication date: 15-Oct-2022.

Anand B, Dourado M, Narasimha-Shenoi P and Ramla S (2022). On the Δ-interval and the Δ-convexity numbers of graphs and graph products, Discrete Applied Mathematics, 319:C, (487-498), Online publication date: 15-Oct-2022.

Jena S and Das G (2022). Vertex-edge domination in unit disk graphs, Discrete Applied Mathematics, 319:C, (351-361), Online publication date: 15-Oct-2022.

Bhore S, Chakraborty S, Jana S, Mitchell J, Pandit S and Roy S (2022). The balanced connected subgraph problem, Discrete Applied Mathematics, 319:C, (111-120), Online publication date: 15-Oct-2022.

Bao X, Xu L, Yu W and Song W (2022). Approximation algorithms for the min-max clustered k-traveling salesmen problems, Theoretical Computer Science, 933:C, (60-66), Online publication date: 14-Oct-2022.

He Z, Cui X, Huang H and Wan L Scheduling with periodic due date to minimize the maximum tardiness in lean production of medical equipment Proceedings of the 3rd International Symposium on Artificial Intelligence for Medicine Sciences, (360-364)

Chen X, Li M, Wang C, Wang C, Zhang M and Zhao Y (2022). Mechanisms for dual-role-facility location games, Theoretical Computer Science, 932:C, (69-83), Online publication date: 6-Oct-2022.

Mondal D, Rajasingh A, Parthiban N and Rajasingh I (2022). APX-hardness and approximation for the k-burning number problem, Theoretical Computer Science, 932:C, (21-30), Online publication date: 6-Oct-2022.

Hong W, Ran Y and Zhang Z (2022). Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph, Theoretical Computer Science, 932:C, (13-20), Online publication date: 6-Oct-2022.

Arvind V, Fuhlbrück F, Köbler J and Verbitsky O (2022). On the Weisfeiler-Leman dimension of fractional packing, Information and Computation, 288:C, Online publication date: 1-Oct-2022.

Bradbury M, Jhumka A and Watson T (2022). Information management for trust computation on resource-constrained IoT devices, Future Generation Computer Systems, 135:C, (348-363), Online publication date: 1-Oct-2022.

Moser M, Musliu N, Schaerf A and Winter F (2022). Exact and metaheuristic approaches for unrelated parallel machine scheduling, Journal of Scheduling, 25:5, (507-534), Online publication date: 1-Oct-2022.

Chen G, Chen Y, Chen Z, Lin G, Liu T and Zhang A (2022). Approximation algorithms for the maximally balanced connected graph tripartition problem, Journal of Combinatorial Optimization, 44:3, (1753-1773), Online publication date: 1-Oct-2022.

Lichen J, Li J, Lih K and Yu X (2022). Approximation algorithms for constructing required subgraphs using stock pieces of fixed length, Journal of Combinatorial Optimization, 44:3, (1774-1795), Online publication date: 1-Oct-2022.

Zhang S, Nip K and Wang Z (2022). Related machine scheduling with machine speeds satisfying linear constraints, Journal of Combinatorial Optimization, 44:3, (1724-1740), Online publication date: 1-Oct-2022.

Christman A, Chung C, Jaczko N, Westvold S and Yuen D (2022). Robustly assigning unstable items, Journal of Combinatorial Optimization, 44:3, (1556-1577), Online publication date: 1-Oct-2022.

Lu C, Deng Z, Fang S, Jin Q and Xing W (2022). Fast computation of global solutions to the single-period unit commitment problem, Journal of Combinatorial Optimization, 44:3, (1511-1536), Online publication date: 1-Oct-2022.

Aichholzer O, Borrazzo M, Bose P, Cardinal J, Frati F, Morin P and Vogtenhuber B (2022). Drawing Graphs as Spanners, Discrete & Computational Geometry, 68:3, (774-795), Online publication date: 1-Oct-2022.

Alon T and Halman N (2022). Strongly Polynomial FPTASes for Monotone Dynamic Programs, Algorithmica, 84:10, (2785-2819), Online publication date: 1-Oct-2022.

Zhou W (2022). Large Rainbow Matchings in Edge-Colored Graphs with Given Average Color Degree, Graphs and Combinatorics, 38:5, Online publication date: 1-Oct-2022.

Hernández Mira F, Parra Inza E, Sigarreta Almira J and Vakhania N (2022). A polynomial-time approximation to a minimum dominating set in a graph, Theoretical Computer Science, 930:C, (142-156), Online publication date: 21-Sep-2022.

Li P, Shang J and Shi Y (2022). A simple linear time algorithm to solve the MIST problem on interval graphs, Theoretical Computer Science, 930:C, (77-85), Online publication date: 21-Sep-2022.

Herup M, Thiesgaard G, van Twiller J and Jensen R A Linear Time Algorithm for Optimal Quay Crane Scheduling Computational Logistics, (60-73)

Glistrup M, Rudinac S and Jónsson B Urban Image Geo-Localization Using Open Data on Public Spaces Proceedings of the 19th International Conference on Content-based Multimedia Indexing, (50-56)

Trabelsi Y, Adiga A, Kraus S and Ravi S Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise Multi-Agent Systems, (403-420)

Jain P, Sornat K and Talmon N Preserving Consistency for Liquid Knapsack Voting Multi-Agent Systems, (221-238)

Gupta S, Jain P, Lokshtanov D, Roy S and Saurabh S Gehrlein Stable Committee with Multi-modal Preferences Algorithmic Game Theory, (508-525)

Subramani K, Wojciechowski P and Velasquez A New Results in Priority-Based Bin Packing Algorithmic Aspects of Cloud Computing, (58-72)

Willamowski F and Tillmann A (2022). Minimizing Airplane Boarding Time, Transportation Science, 56:5, (1196-1218), Online publication date: 1-Sep-2022.

Gudapati N, Malaguti E and Monaci M (2022). Network Design with Service Requirements, INFORMS Journal on Computing, 34:5, (2571-2582), Online publication date: 1-Sep-2022.

Wu W, Iori M, Martello S and Yagiura M (2022). An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion, INFORMS Journal on Computing, 34:5, (2523-2539), Online publication date: 1-Sep-2022.

Shim K (2022). A Survey on Post-Quantum Public-Key Signature Schemes for Secure Vehicular Communications, IEEE Transactions on Intelligent Transportation Systems, 23:9, (14025-14042), Online publication date: 1-Sep-2022.

Xu H and Menzies T (2022). Rust Library Fuzzing, IEEE Software, 39:5, (105-108), Online publication date: 1-Sep-2022.

Böhm M, Megow N and Schlöter J (2022). Throughput scheduling with equal additive laxity, Operations Research Letters, 50:5, (463-469), Online publication date: 1-Sep-2022.

Linz S and Semple C (2022). Non-essential arcs in phylogenetic networks, Journal of Computer and System Sciences, 128:C, (1-17), Online publication date: 1-Sep-2022.

Yang S, Dong Q, Cui L, Chen X, Lei S, Wu Y and Luo C (2022). EC-MASS, Computer Communications, 193:C, (355-364), Online publication date: 1-Sep-2022.

Berlińska J and Mor B (2022). Scheduling data gathering with background communications and a processing stage, Computers and Industrial Engineering, 171:C, Online publication date: 1-Sep-2022.

Chen X, Shen X, Kovalyov M, Sterna M and Blazewicz J (2022). Alternative algorithms for identical machines scheduling to maximize total early work with a common due date, Computers and Industrial Engineering, 171:C, Online publication date: 1-Sep-2022.

Sajid M, Mittal H, Pare S and Prasad M (2022). Routing and scheduling optimization for UAV assisted delivery system, Applied Soft Computing, 126:C, Online publication date: 1-Sep-2022.

Niranjani G and Umamaheswari K (2022). Minimization of Sustainable-Cost Using Tabu Search for Single Depot Heterogeneous Vehicle Routing Problem with Time Windows, Wireless Personal Communications: An International Journal, 126:2, (1481-1514), Online publication date: 1-Sep-2022.

Zhang T and Xia Y (2022). Covering a simplex by spheres: complexity and algorithms, Journal of Global Optimization, 84:1, (119-135), Online publication date: 1-Sep-2022.

Aneesh D, Mohanapriya A, Renjith P and Sadagopan N (2022). Steiner tree in k-star caterpillar convex bipartite graphs: a dichotomy, Journal of Combinatorial Optimization, 44:2, (1221-1247), Online publication date: 1-Sep-2022.

Dettlaff M, Gözüpek D and Raczek J (2022). Paired domination versus domination and packing number in graphs, Journal of Combinatorial Optimization, 44:2, (921-933), Online publication date: 1-Sep-2022.

Fernandes C, Lintzmayer C and San Felice M (2022). Leafy spanning k-forests, Journal of Combinatorial Optimization, 44:2, (934-946), Online publication date: 1-Sep-2022.

Coco A, Santos A and Noronha T (2022). Robust min-max regret covering problems, Computational Optimization and Applications, 83:1, (111-141), Online publication date: 1-Sep-2022.

Eremeev A, Kel’manov A, Kovalyov M and Pyatkin A (2022). Selecting a subset of diverse points based on the squared euclidean distance, Annals of Mathematics and Artificial Intelligence, 90:7-9, (965-977), Online publication date: 1-Sep-2022.

Ge Y, Orlowska M, Cao J, Wang H and Zhang Y (2022). MDDE: multitasking distributed differential evolution for privacy-preserving database fragmentation, The VLDB Journal — The International Journal on Very Large Data Bases, 31:5, (957-975), Online publication date: 1-Sep-2022.

Chandrasekaran K and Wang W (2022). -Norm Multiway Cut, Algorithmica, 84:9, (2667-2701), Online publication date: 1-Sep-2022.

Shrivastav V Stateful multi-pipelined programmable switches Proceedings of the ACM SIGCOMM 2022 Conference, (663-676)

Borhani M, Avgouleas I and Gurtov A Optimization of relay placement for scalable virtual private LAN services Proceedings of the ACM SIGCOMM Workshop on Future of Internet Routing & Addressing, (43-49)

Zhang Z and Guo J Colorful Graph Coloring Frontiers of Algorithmic Wisdom, (141-161)

Shi C, Tang Z, Zhou Y and Luo Q Greedy Squirrel Search Algorithm for Large-Scale Traveling Salesman Problems Intelligent Computing Methodologies, (830-845)

Fan W (2022). Big graphs, Proceedings of the VLDB Endowment, 15:12, (3782-3797), Online publication date: 1-Aug-2022.

Nabli A, Carvalho M and Hosteins P (2022). Complexity of the multilevel critical node problem, Journal of Computer and System Sciences, 127:C, (122-145), Online publication date: 1-Aug-2022.

Gu H, Zhang Y and Zinder Y (2022). An efficient optimisation procedure for the Workforce Scheduling and Routing Problem, Computers and Operations Research, 144:C, Online publication date: 1-Aug-2022.

Segal M and Tzfaty O (2022). Finding bounded diameter minimum spanning tree in general graphs, Computers and Operations Research, 144:C, Online publication date: 1-Aug-2022.

Rener E, Salassa F and T’kindt V (2022). Single machine rescheduling for new orders with maximum lateness minimization, Computers and Operations Research, 144:C, Online publication date: 1-Aug-2022.

Pikies T, Turowski K and Kubale M (2022). Scheduling with complete multipartite incompatibility graph on parallel machines, Artificial Intelligence, 309:C, Online publication date: 1-Aug-2022.

Wang T and Averbakh I (2022). Network construction/restoration problems: cycles and complexity, Journal of Combinatorial Optimization, 44:1, (51-73), Online publication date: 1-Aug-2022.

Mosca R (2022). New Results on Independent Sets in Extensions of -free Graphs, Graphs and Combinatorics, 38:4, Online publication date: 1-Aug-2022.

Sau I, Stamoulis G and Thilikos D (2022). k-apices of Minor-closed Graph Classes. II. Parameterized Algorithms, ACM Transactions on Algorithms, 18:3, (1-30), Online publication date: 31-Jul-2022.

Ito S, Kanahara K, Oda T and Katayama K An Extended NEH based Method for Permutation Flowshop Scheduling Problem Proceedings of the 10th International Conference on Computer and Communications Management, (252-256)

Kanahara K, Ito S and Katayama K The Performance of a Local Search based on Vertex Coloring for the Maximum Clique Problem Proceedings of the 10th International Conference on Computer and Communications Management, (79-83)

Aleksandrov M Dynamic Fleet Management and Household Feedback for Garbage Collection Proceedings of the 2022 AAAI/ACM Conference on AI, Ethics, and Society, (36-45)

Zhang X, Gong Y, Liang B, Huang J, You W, Shi W and Zhang J Hunting bugs with accelerated optimal graph vertex matching Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis, (64-76)

Golabi M, Idoumghar L and Arkat J A bi-objective single-server congested edge-based facility location problem under disruption 2022 IEEE Congress on Evolutionary Computation (CEC), (01-08)

Cors T, Vlćek T, Voß S and Jovanovic R Fixed Set Search Applied to the Territory Design Problem Metaheuristics, (322-334)

Rosati R, Bouamama S and Blum C Construct, Merge, Solve and Adapt Applied to the Maximum Disjoint Dominating Sets Problem Metaheuristics, (306-321)

Berny A Recent developments in HNCO Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1992-2000)

Yuan Q, Yuan Y, Wen Z, Wang H, Chen C and Wang G Exploring Heterogeneous Data Lake based on Unified Canonical Graphs Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval, (1834-1838)

Croella A, Dal Sasso V, Lamorgese L, Mannino C and Ventura P (2022). Disruption Management in Railway Systems by Safe Place Assignment, Transportation Science, 56:4, (938-952), Online publication date: 1-Jul-2022.

Dal Sasso V, Lamorgese L, Mannino C, Tancredi A and Ventura P (2022). Easy Cases of Deadlock Detection in Train Scheduling, Operations Research, 70:4, (2101-2118), Online publication date: 1-Jul-2022.

Mendes L, Usberti F and Cavellucci C (2022). The Capacitated and Economic Districting Problem, INFORMS Journal on Computing, 34:4, (2003-2016), Online publication date: 1-Jul-2022.

Graham N, Hu H, Im J, Li X and Wolkowicz H (2022). A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP, INFORMS Journal on Computing, 34:4, (2125-2143), Online publication date: 1-Jul-2022.

Yen C, Ghosal D, Zhang M and Chuah C (2022). Security Vulnerabilities and Protection Algorithms for Backpressure-Based Traffic Signal Control at an Isolated Intersection, IEEE Transactions on Intelligent Transportation Systems, 23:7, (6406-6417), Online publication date: 1-Jul-2022.

Ma J, Jiang H, Zhu D and Yang R (2021). Algorithms and Hardness for Scaffold Filling to Maximize Increased Duo-Preservations, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19:4, (2071-2079), Online publication date: 1-Jul-2022.

Luo L, Foerster K, Schmid S and Yu H (2022). Optimizing multicast flows in high-bandwidth reconfigurable datacenter networks, Journal of Network and Computer Applications, 203:C, Online publication date: 1-Jul-2022.

Levit V and Mandrescu E (2022). Critical sets, crowns and local maximum independent sets, Journal of Global Optimization, 83:3, (481-495), Online publication date: 1-Jul-2022.

Yu W, Liu Z and Bao X (2022). Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity, Journal of Combinatorial Optimization, 43:5, (1405-1422), Online publication date: 1-Jul-2022.

Boehmer N and Heeger K (2022). A Fine-grained View on Stable Many-to-one Matching Problems with Lower and Upper Quotas, ACM Transactions on Economics and Computation, 10:2, (1-53), Online publication date: 30-Jun-2022.

Gusmeroli N, Hrga T, Lužar B, Povh J, Siebenhofer M and Wiegele A (2022). BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, ACM Transactions on Mathematical Software, 48:2, (1-31), Online publication date: 30-Jun-2022.

Lin F and Hsieh H (2022). Traveling Transporter Problem: Arranging a New Circular Route in a Public Transportation System Based on Heterogeneous Non-Monotonic Urban Data, ACM Transactions on Intelligent Systems and Technology, 13:3, (1-25), Online publication date: 30-Jun-2022.

Göttlicher M and Wolf M A genetic algorithm for finding microgrid cable layouts Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (1-16)

Lin M (2022). Counting dominating sets in some subclasses of bipartite graphs, Theoretical Computer Science, 923:C, (337-347), Online publication date: 26-Jun-2022.

Nguyen K, Teh W, Hung N and Nguyen-Thu H (2022). A linear time algorithm for connected p-centdian problem on block graphs, Theoretical Computer Science, 923:C, (318-326), Online publication date: 26-Jun-2022.

Hosteins P, Scatamacchia R, Grosso A and Aringhieri R (2022). The Connected Critical Node Problem, Theoretical Computer Science, 923:C, (235-255), Online publication date: 26-Jun-2022.

Sheng Z and Xiao M (2022). An improved kernel for planar vertex-disjoint triangle packing, Theoretical Computer Science, 922:C, (122-130), Online publication date: 24-Jun-2022.

Bar-Noy A, Böhnlein T, Peleg D and Rawitz D (2022). On vertex-weighted realizations of acyclic and general graphs, Theoretical Computer Science, 922:C, (81-95), Online publication date: 24-Jun-2022.

Krithika R, Sharma R and Tale P The Complexity of Contracting Bipartite Graphs into Small Cycles Graph-Theoretic Concepts in Computer Science, (356-369)

Wojciechowski P, Subramani K and Velasquez A Analyzing the Reachability Problem in Choice Networks Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (408-423)

Ouellet Y and Quimper C A MinCumulative Resource Constraint Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (318-334)

Sedlar J and Škrekovski R (2022). Vertex and edge metric dimensions of unicyclic graphs, Discrete Applied Mathematics, 314:C, (81-92), Online publication date: 15-Jun-2022.

Bonomo-Braberman F and Gonzalez C (2022). A new approach on locally checkable problems, Discrete Applied Mathematics, 314:C, (53-80), Online publication date: 15-Jun-2022.

Lanzinger M The Complexity of Conjunctive Queries with Degree 2 Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (91-102)

Aganezov S, Avdeyev P, Alexeev N, Rong Y and Alekseyev M (2022). Orienting Ordered Scaffolds: Complexity and Algorithms, SN Computer Science, 3:4, Online publication date: 11-Jun-2022.

Wang H, Hu R, Zhang Y, Qin L, Wang W and Zhang W Neural Subgraph Counting with Wasserstein Estimator Proceedings of the 2022 International Conference on Management of Data, (160-175)

Fan W, Li Y, Liu M and Lu C A Hierarchical Contraction Scheme for Querying Big Graphs Proceedings of the 2022 International Conference on Management of Data, (1726-1740)

Englert M, Matsakis N and Veselý P Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, (317-330)

Ketabi S, Buckley M, Pazhooheshy P, Farahvash F and Ganjali Y (2022). Correlation-Aware Flow Consolidation for Load Balancing and Beyond, ACM SIGMETRICS Performance Evaluation Review, 49:4, (105-110), Online publication date: 2-Jun-2022.

Falk J, Geppert H, Dürr F, Bhowmik S and Rothermel K (2022). Dynamic QoS-Aware Traffic Planning for Time-Triggered Flows in the Real-Time Data Plane, IEEE Transactions on Network and Service Management, 19:2, (1807-1825), Online publication date: 1-Jun-2022.

Sadeh Y, Rottenstreich O and Kaplan H (2022). Optimal Weighted Load Balancing in TCAMs, IEEE/ACM Transactions on Networking, 30:3, (985-998), Online publication date: 1-Jun-2022.

Bampis E, Escoffier B and Teiller A (2022). Multistage knapsack, Journal of Computer and System Sciences, 126:C, (106-118), Online publication date: 1-Jun-2022.

Dai G, Zhang Z, Broersma H and Zhang X (2022). The Hamiltonian properties in K 1, -free split graphs, Discrete Mathematics, 345:6, Online publication date: 1-Jun-2022.

Abreu L, Prata B, Framinan J and Nagano M (2022). New efficient heuristics for scheduling open shops with makespan minimization, Computers and Operations Research, 142:C, Online publication date: 1-Jun-2022.

Abreu L and Nagano M (2022). A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times, Computers and Industrial Engineering, 168:C, Online publication date: 1-Jun-2022.

Ahadi A, Mollahajiaghaei M and Dehghan A (2022). On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard, Graphs and Combinatorics, 38:3, Online publication date: 1-Jun-2022.

Crespelle C and Golovach P (2022). Cyclability in graph classes, Discrete Applied Mathematics, 313:C, (147-178), Online publication date: 31-May-2022.

Gima T, Hanaka T, Kiyomi M, Kobayashi Y and Otachi Y (2022). Exploring the gap between treedepth and vertex cover through vertex integrity, Theoretical Computer Science, 918:C, (60-76), Online publication date: 29-May-2022.

Bloch-Hansen A, Solis-Oba R and Yu A High Multiplicity Strip Packing with Three Rectangle Types Combinatorial Optimization, (215-227)

D'Angelo G, Delfaraz E and Gilbert H Computation and Bribery of Voting Power in Delegative Simple Games Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, (336-344)

Boehmer N, Bredereck R, Heeger K, Knop D and Luo J Multivariate Algorithmics for Eliminating Envy by Donating Goods Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, (127-135)

Fan W, Jin R, Lu P, Tian C and Xu R (2022). Towards event prediction in temporal graphs, Proceedings of the VLDB Endowment, 15:9, (1861-1874), Online publication date: 1-May-2022.

Nikolov A, Singh M and Tantipongpipat U (2022). Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design, Mathematics of Operations Research, 47:2, (847-877), Online publication date: 1-May-2022.

Salemi H and Buchanan A (2022). Solving the Distance-Based Critical Node Problem, INFORMS Journal on Computing, 34:3, (1309-1326), Online publication date: 1-May-2022.

Gou C, Benoit A, Chen M, Marchal L and Wei T (2022). Mapping series-parallel streaming applications on hierarchical platforms with reliability and energy constraints, Journal of Parallel and Distributed Computing, 163:C, (45-61), Online publication date: 1-May-2022.

González J, Cire A, Lodi A and Rousseau L (2022). BDD-based optimization for the quadratic stable set problem, Discrete Optimization, 44:P2, Online publication date: 1-May-2022.

Morin P, Artigues C, Haït A, Kis T and Spieksma F (2022). A project scheduling problem with periodically aggregated resource-constraints, Computers and Operations Research, 141:C, Online publication date: 1-May-2022.

Ouzia H and Maculan N (2022). Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in , Journal of Global Optimization, 83:1, (119-136), Online publication date: 1-May-2022.

Liu M and Li P SATMargin: Practical Maximal Frequent Subgraph Mining via Margin Space Sampling Proceedings of the ACM Web Conference 2022, (1495-1505)

Schweimer C, Gfrerer C, Lugstein F, Pape D, Velimsky J, Elsässer R and Geiger B Generating Simple Directed Social Network Graphs for Information Spreading Proceedings of the ACM Web Conference 2022, (1475-1485)

Fabbri F, Wang Y, Bonchi F, Castillo C and Mathioudakis M Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways Proceedings of the ACM Web Conference 2022, (2719-2728)

Pikalov M and Mironovich V Parameter Tuning for the Genetic Algorithm Using Landscape Analysis and Machine Learning Applications of Evolutionary Computation, (704-720)

Li W A new approach to the traveling salesman problem Proceedings of the 2022 ACM Southeast Conference, (52-59)

Györgyi P and Kis T (2022). New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, Discrete Applied Mathematics, 311:C, (97-109), Online publication date: 15-Apr-2022.

Lai P, Fan R, Zhang X, Zhang W, Liu F and Zhou J (2021). Utility Optimal Thread Assignment and Resource Allocation in Multi-Server Systems, IEEE/ACM Transactions on Networking, 30:2, (735-748), Online publication date: 1-Apr-2022.

Martín-Pérez J, Malandrino F, Chiasserini C, Groshev M and Bernardos C (2021). KPI Guarantees in Network Slicing, IEEE/ACM Transactions on Networking, 30:2, (655-668), Online publication date: 1-Apr-2022.

Xu J, Li K and Chen Y (2022). Real-time task scheduling for FPGA-based multicore systems with communication delay, Microprocessors & Microsystems, 90:C, Online publication date: 1-Apr-2022.

Zhao Y, Liu Y, Liu X, Sun M, Qi F and Zheng Y (2022). Self-adapting spiking neural P systems with refractory period and propagation delay, Information Sciences: an International Journal, 589:C, (80-93), Online publication date: 1-Apr-2022.

Bredereck R, Kaczmarczyk A and Niedermeier R (2022). Envy-free allocations respecting social networks, Artificial Intelligence, 305:C, Online publication date: 1-Apr-2022.

Lindner N and Reisch J (2022). An analysis of the parameterized complexity of periodic timetabling, Journal of Scheduling, 25:2, (157-176), Online publication date: 1-Apr-2022.

Zhang X, Lin W and Wu C (2022). Rescheduling problems with allowing for the unexpected new jobs arrival, Journal of Combinatorial Optimization, 43:3, (630-645), Online publication date: 1-Apr-2022.

Chen Y, Cai Y, Liu L, Chen G, Goebel R, Lin G, Su B and Zhang A (2022). Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph, Journal of Combinatorial Optimization, 43:3, (571-588), Online publication date: 1-Apr-2022.

Schneckenburger S, Dorn B and Endriss U (2022). Minimising inequality in multiagent resource allocation, Annals of Mathematics and Artificial Intelligence, 90:4, (339-371), Online publication date: 1-Apr-2022.

Li W, Xu C, Yang Y, Chen J and Wang J (2022). A Refined Branching Algorithm for the Maximum Satisfiability Problem, Algorithmica, 84:4, (982-1006), Online publication date: 1-Apr-2022.

Agrawal A, Kolay S and Zehavi M (2022). Parameter Analysis for Guarding Terrains, Algorithmica, 84:4, (961-981), Online publication date: 1-Apr-2022.

Belmonte R, Hanaka T, Kanzaki M, Kiyomi M, Kobayashi Y, Kobayashi Y, Lampis M, Ono H and Otachi Y (2022). Parameterized Complexity of -Path Packing, Algorithmica, 84:4, (871-895), Online publication date: 1-Apr-2022.

Bouhenni S, Yahiaoui S, Nouali-Taboudjemat N and Kheddouci H (2021). A Survey on Distributed Graph Pattern Matching in Massive Graphs, ACM Computing Surveys, 54:2, (1-35), Online publication date: 31-Mar-2022.

Aziz H, Biró P, Fleiner T, Gaspers S, de Haan R, Mattei N and Rastegari B (2022). Stable matching with uncertain pairwise preferences, Theoretical Computer Science, 909:C, (1-11), Online publication date: 28-Mar-2022.

Espenant J and Mondal D StreamTable: An Area Proportional Visualization for Tables with Flowing Streams WALCOM: Algorithms and Computation, (97-108)

Cordasco G, Gargano L and Rescigno A Parameterized Complexity of Immunization in the Threshold Model WALCOM: Algorithms and Computation, (275-287)

Evans W and Lin R The Polygon Burning Problem WALCOM: Algorithms and Computation, (123-134)

Iwamoto C and Ibusuki T Vertex-to-Point Conflict-Free Chromatic Guarding is NP-Hard WALCOM: Algorithms and Computation, (111-122)

Haythorpe M and Newcombe A (2022). The secure domination number of Cartesian products of small graphs with paths and cycles, Discrete Applied Mathematics, 309:C, (32-45), Online publication date: 15-Mar-2022.

Dourado M, Penso L and Rautenbach D (2022). The hull number in the convexity of induced paths of order 3, Theoretical Computer Science, 906:C, (52-63), Online publication date: 5-Mar-2022.

Fan W, Fu W, Jin R, Lu P and Tian C (2022). Discovering association rules from big graphs, Proceedings of the VLDB Endowment, 15:7, (1479-1492), Online publication date: 1-Mar-2022.

Ajayi T, Thomas C and Schaefer A (2022). The Gap Function, Operations Research, 70:2, (1259-1270), Online publication date: 1-Mar-2022.

Ciocan D and Mišić V (2022). Interpretable Optimal Stopping, Management Science, 68:3, (1616-1638), Online publication date: 1-Mar-2022.

Hendel G, Anderson D, Le Bodic P and Pfetsch M (2022). Estimating the Size of Branch-and-Bound Trees, INFORMS Journal on Computing, 34:2, (934-952), Online publication date: 1-Mar-2022.

Ren Y, Sarkar A, Veltri P, Ay A, Dobra A and Kahveci T (2021). Pattern Discovery in Multilayer Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19:2, (741-752), Online publication date: 1-Mar-2022.

Van Giang T, Akutsu T and Hiraishi K (2020). An FVS-Based Approach to Attractor Detection in Asynchronous Random Boolean Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19:2, (806-818), Online publication date: 1-Mar-2022.

Agrawal A (2022). Fine-grained complexity of rainbow coloring and its variants, Journal of Computer and System Sciences, 124:C, (140-158), Online publication date: 1-Mar-2022.

Abu-Khzam F (2022). An improved exact algorithm for minimum dominating set in chordal graphs, Information Processing Letters, 174:C, Online publication date: 1-Mar-2022.

Jena S, Jallu R and Das G (2022). On d-distance m-tuple (ℓ,r)-domination in graphs, Information Processing Letters, 174:C, Online publication date: 1-Mar-2022.

Nakkala M, Singh A and Rossi A (2022). Swarm intelligence, exact and matheuristic approaches for minimum weight directed dominating set problem, Engineering Applications of Artificial Intelligence, 109:C, Online publication date: 1-Mar-2022.

Dwibedy D and Mohanty R (2021). Semi-online scheduling, Computers and Operations Research, 139:C, Online publication date: 1-Mar-2022.

Agnetis A, Benini M, Detti P, Hermans B and Pranzo M (2021). Replication and sequencing of unreliable jobs on parallel machines, Computers and Operations Research, 139:C, Online publication date: 1-Mar-2022.

Marzo R, Melo R, Ribeiro C and Santos M (2021). New formulations and branch-and-cut procedures for the longest induced path problem, Computers and Operations Research, 139:C, Online publication date: 1-Mar-2022.

Ravelo S (2022). Approximation algorithms for simple assembly line balancing problems, Journal of Combinatorial Optimization, 43:2, (432-443), Online publication date: 1-Mar-2022.

Aliev I, Averkov G, De Loera J and Oertel T (2022). Sparse representation of vectors in lattices and semigroups, Mathematical Programming: Series A and B, 192:1-2, (519-546), Online publication date: 1-Mar-2022.

Lin F and Hsieh H (2021). A Joint Passenger Flow Inference and Path Recommender System for Deploying New Routes and Stations of Mass Transit Transportation, ACM Transactions on Knowledge Discovery from Data, 16:1, (1-36), Online publication date: 28-Feb-2022.

Wang J and Chen J (2022). Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints, Theoretical Computer Science, 905:C, (54-68), Online publication date: 22-Feb-2022.

Khosravian Ghadikolaei M, Melissinos N, Monnot J and Pagourtzis A (2022). Extension and its price for the connected vertex cover problem, Theoretical Computer Science, 904:C, (66-80), Online publication date: 15-Feb-2022.

Casel K, Fernau H, Khosravian Ghadikolaei M, Monnot J and Sikora F (2022). On the complexity of solution extension of optimization problems, Theoretical Computer Science, 904:C, (48-65), Online publication date: 15-Feb-2022.

Kim E, Milanič M, Monnot J and Picouleau C (2022). Complexity and algorithms for constant diameter augmentation problems, Theoretical Computer Science, 904:C, (15-26), Online publication date: 15-Feb-2022.

Laforest C and Martinod T (2022). On the complexity of independent dominating set with obligations in graphs, Theoretical Computer Science, 904:C, (1-14), Online publication date: 15-Feb-2022.

Ohsaka N and Matsuoka T Reconfiguration Problems on Submodular Functions Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, (764-774)

Song B, Li K and Zeng X (2022). Monodirectional Evolutional Symport Tissue P Systems With Promoters and Cell Division, IEEE Transactions on Parallel and Distributed Systems, 33:2, (332-342), Online publication date: 1-Feb-2022.

Senapati D, Sarkar A and Karfa C (2022). PRESTO: A Penalty-Aware Real-Time Scheduler for Task Graphs on Heterogeneous Platforms, IEEE Transactions on Computers, 71:2, (421-435), Online publication date: 1-Feb-2022.

Goubault de Brugière T, Baboulin M, Valiron B, Martiel S and Allouche C (2022). Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures, Science of Computer Programming, 214:C, Online publication date: 1-Feb-2022.

Golovach P, Komusiewicz C, Kratsch D and Le V (2022). Refined notions of parameterized enumeration kernels with applications to matching cut enumeration, Journal of Computer and System Sciences, 123:C, (76-102), Online publication date: 1-Feb-2022.

Anadiotis A, Balalau O, Conceição C, Galhardas H, Haddad M, Manolescu I, Merabti T and You J (2022). Graph integration of structured, semistructured and unstructured data for data journalism, Information Systems, 104:C, Online publication date: 1-Feb-2022.

Müller M and Rojas C (2021). Risk-theoretic optimal design of output-feedback controllers via iterative convex relaxations, Automatica (Journal of IFAC), 136:C, Online publication date: 1-Feb-2022.

Karmakar K, Das R and Khatua S (2022). An ACO-based multi-objective optimization for cooperating VM placement in cloud data center, The Journal of Supercomputing, 78:3, (3093-3121), Online publication date: 1-Feb-2022.

Wang S, Hsiao H, Lin C and Chin H (2022). Multi-Objective Wireless Sensor Network Deployment Problem with Cooperative Distance-Based Sensing Coverage, Mobile Networks and Applications, 27:1, (3-14), Online publication date: 1-Feb-2022.

Briskorn D, Stephan K and Boysen N (2022). Minimizing the makespan on a single machine subject to modular setups, Journal of Scheduling, 25:1, (125-137), Online publication date: 1-Feb-2022.

Gliesch A and Ritt M (2022). A new heuristic for finding verifiable k-vertex-critical subgraphs, Journal of Heuristics, 28:1, (61-91), Online publication date: 1-Feb-2022.

Kleinberg J and Oren S (2022). Mechanisms for (Mis)allocating Scientific Credit, Algorithmica, 84:2, (344-378), Online publication date: 1-Feb-2022.

Alon N and Shikhelman C (2022). Additive Approximation of Generalized Turán Questions, Algorithmica, 84:2, (464-481), Online publication date: 1-Feb-2022.

Durand A, Kontinen J, De Rugy-Altherre N and Väänänen J (2021). Tractability Frontier of Data Complexity in Team Semantics, ACM Transactions on Computational Logic, 23:1, (1-21), Online publication date: 31-Jan-2022.

Chandran S.V. U, Dourado M and Thankachy M (2022). Computational and structural aspects of the geodetic and the hull numbers of shadow graphs, Discrete Applied Mathematics, 307:C, (50-61), Online publication date: 30-Jan-2022.

Arasteh B, Fatolahzadeh A and Kiani F (2021). Savalan, Journal of Software: Evolution and Process, 34:1, Online publication date: 18-Jan-2022.

Manuel P, Brešar B and Klavžar S (2022). The geodesic-transversal problem, Applied Mathematics and Computation, 413:C, Online publication date: 15-Jan-2022.

Subramani K and Wojciechowski P Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems Logical Foundations of Computer Science, (327-345)

Moscarini M (2021). Computing a metric basis of a bipartite distance-hereditary graph, Theoretical Computer Science, 900:C, (20-24), Online publication date: 8-Jan-2022.

Wolf P (2021). From decidability to undecidability by considering regular sets of instances, Theoretical Computer Science, 899:C, (25-38), Online publication date: 6-Jan-2022.

Nikolentzos G, Siglidis G and Vazirgiannis M (2021). Graph Kernels, Journal of Artificial Intelligence Research, 72, (943-1027), Online publication date: 4-Jan-2022.

Löffler M, Boysen N and Schneider M (2022). Picker Routing in AGV-Assisted Order Picking Systems, INFORMS Journal on Computing, 34:1, (440-462), Online publication date: 1-Jan-2022.

Lee J, Hwang J, Park H, Kim D and Luo C (2022). Ad Hoc Communication Topology Construction for Delay-Sensitive Internet of Vehicle Applications, Wireless Communications & Mobile Computing, 2022, Online publication date: 1-Jan-2022.

Fortnow L (2021). Fifty years of P vs. NP and the possibility of the impossible, Communications of the ACM, 65:1, (76-85), Online publication date: 1-Jan-2022.

Sun S and Luo Q (2022). Subgraph Matching With Effective Matching Order and Indexing, IEEE Transactions on Knowledge and Data Engineering, 34:1, (491-505), Online publication date: 1-Jan-2022.

Dvořák Z, Král' D and Thomas R (2022). Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm, Journal of Combinatorial Theory Series B, 152:C, (483-504), Online publication date: 1-Jan-2022.

Evans W, Fleszar K, Kindermann P, Saeedi N, Shin C and Wolff A (2022). Minimum rectilinear polygons for given angle sequences, Computational Geometry: Theory and Applications, 100:C, Online publication date: 1-Jan-2022.

Amendola G, Greco G and Veltri P (2022). Answers set programs for non-transferable utility games, Artificial Intelligence, 302:C, Online publication date: 1-Jan-2022.

Nip K, Shi T and Wang Z (2022). Some graph optimization problems with weights satisfying linear constraints, Journal of Combinatorial Optimization, 43:1, (200-225), Online publication date: 1-Jan-2022.

Jiang Z, Chen F and Zhang X (2022). Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect, Journal of Combinatorial Optimization, 43:1, (116-139), Online publication date: 1-Jan-2022.

Chen J, Skowron P and Sorge M (2021). Matchings under Preferences: Strength of Stability and Tradeoffs, ACM Transactions on Economics and Computation, 9:4, (1-55), Online publication date: 31-Dec-2022.

Hadfield S (2021). On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing, ACM Transactions on Quantum Computing, 2:4, (1-21), Online publication date: 31-Dec-2022.

Bonchi F, García-Soriano D, Miyauchi A and Tsourakakis C (2021). Finding densest k-connected subgraphs, Discrete Applied Mathematics, 305:C, (34-47), Online publication date: 31-Dec-2022.

Basappa M (2021). Line segment disk cover, Discrete Applied Mathematics, 305:C, (261-271), Online publication date: 31-Dec-2022.

Manthey B and Reijnders V (2021). Probabilistic properties of highly connected random geometric graphs, Discrete Applied Mathematics, 305:C, (366-376), Online publication date: 31-Dec-2022.

Chen J, Huang M and Guo Y Scheduling on Multiple Two-Stage Flowshops with a Deadline Algorithmic Aspects in Information and Management, (83-95)

Harutyunyan H and Li Z The Complexity of Finding a Broadcast Center Algorithmic Aspects in Information and Management, (57-70)

Fu Z, He M, Tang Z and Zhang Y Optimizing Data Locality by Executor Allocation in Reduce Stage for Spark Framework Parallel and Distributed Computing, Applications and Technologies, (349-357)

Tang Z, Tang Y and Diao Z On the Feedback Number of 3-Uniform Linear Extremal Hypergraphs Combinatorial Optimization and Applications, (687-700)

Lichen J, Cai L, Li J, Liu S, Pan P and Wang W Delay-Constrained Minimum Shortest Path Trees and Related Problems Combinatorial Optimization and Applications, (676-686)

Goyal P and Panda B Hardness Results of Connected Power Domination for Bipartite Graphs and Chordal Graphs Combinatorial Optimization and Applications, (653-667)

Yi E The Fractional k-truncated Metric Dimension of Graphs Combinatorial Optimization and Applications, (568-578)

Sun Y, Yu W and Liu Z Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems Combinatorial Optimization and Applications, (400-415)

Zhang A, Zhang L, Chen Y, Chen G and Wang X Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints Combinatorial Optimization and Applications, (111-124)

Ageev A, Gimadi E and Shtepa A How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs Analysis of Images, Social Networks and Texts, (303-314)

Khodkar A, Mojdeh D, Samadi B and Yero I (2021). Covering Italian domination in graphs, Discrete Applied Mathematics, 304:C, (324-331), Online publication date: 15-Dec-2021.

Chen R and Yuan J (2021). Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines, Discrete Applied Mathematics, 304:C, (45-54), Online publication date: 15-Dec-2021.

Li X, Yu G and Klavžar S (2021). On the average Steiner 3-eccentricity of trees, Discrete Applied Mathematics, 304:C, (181-195), Online publication date: 15-Dec-2021.

Asahiro Y, Eto H, Hanaka T, Lin G, Miyano E and Terabaru I (2021). Parameterized algorithms for the Happy Set problem, Discrete Applied Mathematics, 304:C, (32-44), Online publication date: 15-Dec-2021.

Caragiannis I and Ioannidis S Computing Envy-Freeable Allocations with Limited Subsidies Web and Internet Economics, (522-539)

Mustafa S, Seth S, Yuksel M and Rahman M Cellular Service with Settlement-Free Peering 2021 IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN), (153-162)

Nakamura S, Ikematsu Y, Wang Y, Ding J and Takagi T (2021). New complexity estimation on the Rainbow-Band-Separation attack, Theoretical Computer Science, 896:C, (1-18), Online publication date: 6-Dec-2021.

Hakert C, Khan A, Chen K, Hameed F, Castrillon J and Chen J BLOwing Trees to the Ground: Layout Optimization of Decision Trees on Racetrack Memory 2021 58th ACM/IEEE Design Automation Conference (DAC), (1111-1116)

Gui P, He F, Ling B and Zhang D (2021). United equilibrium optimizer for solving multimodal image registration, Knowledge-Based Systems, 233:C, Online publication date: 5-Dec-2021.

Bassin A, Buzdalov M and Shalyto A (2021). The “One-Fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ, λ)) Genetic Algorithm, Automatic Control and Computer Sciences, 55:7, (885-902), Online publication date: 1-Dec-2021.

Vasilchikov V (2021). Parallel Algorithm for Solving the Graph Isomorphism Problem, Automatic Control and Computer Sciences, 55:7, (617-622), Online publication date: 1-Dec-2021.

Chen N, Li A and Talluri K (2021). Reviews and Self-Selection Bias with Operational Implications, Management Science, 67:12, (7472-7492), Online publication date: 1-Dec-2021.

Pacut M, Dai W, Labbe A, Foerster K and Schmid S (2021). Improved scalability of demand-aware datacenter topologies with minimal route lengths and congestion, Performance Evaluation, 152:C, Online publication date: 1-Dec-2021.

Sau I and dos Santos Souza U (2022). Hitting forbidden induced subgraphs on bounded treewidth graphs, Information and Computation, 281:C, Online publication date: 1-Dec-2021.

Song B and Pan L (2022). Rule synchronization for tissue P systems, Information and Computation, 281:C, Online publication date: 1-Dec-2021.

Bianchessi N and Tresoldi E (2022). A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts, Computers and Operations Research, 136:C, Online publication date: 1-Dec-2021.

Krishna M, Panda N and Majhi S (2022). Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm, Expert Systems with Applications: An International Journal, 183:C, Online publication date: 30-Nov-2021.

Sun Y, Jiang W, Liu S, Li G and Ning B (2021). Accelerating subgraph matching by anchored relationship on labeled graph▪, Knowledge-Based Systems, 232:C, Online publication date: 28-Nov-2021.

Jiang J, Xu H and Zhou Y RULF Proceedings of the 36th IEEE/ACM International Conference on Automated Software Engineering, (581-592)

Chen L, Sunny A, Xu L, Xu S, Gao Z, Lu Y, Shi W and Shah N (2021). Computational complexity characterization of protecting elections from bribery, Theoretical Computer Science, 891:C, (189-209), Online publication date: 4-Nov-2021.

Kaczmarek J and Rothe J Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games Algorithmic Decision Theory, (194-208)

Häcker C, Bouros P, Chondrogiannis T and Althaus E Most Diverse Near-Shortest Paths Proceedings of the 29th International Conference on Advances in Geographic Information Systems, (229-239)

Yuan Y, Ma D, Wen Z, Zhang Z and Wang G (2022). Subgraph matching over graph federation, Proceedings of the VLDB Endowment, 15:3, (437-450), Online publication date: 1-Nov-2021.

Jia S, Li S, Lin X and Chen X (2021). Scheduling Tugboats in a Seaport, Transportation Science, 55:6, (1370-1391), Online publication date: 1-Nov-2021.

Su C, Pang J and Paul S (2019). Towards Optimal Decomposition of Boolean Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 18:6, (2167-2176), Online publication date: 1-Nov-2021.

Duan Y and Wu J (2021). Improving Learning-Based DAG Scheduling by Inserting Deliberate Idle Slots, IEEE Network: The Magazine of Global Internetworking, 35:6, (133-139), Online publication date: 1-Nov-2021.

Banerjee S, Chaudhuri A, Kim J, Murali G, Nelson M, Lim S and Chakrabarty K ParaMitE: Mitigating Parasitic CNFETs in the Presence of Unetched CNTs 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), (1-9)

Down D, Karakostas G, Kolliopoulos S and Rostami S (2021). Single-item lot-sizing with quantity discount and bounded inventory, Operations Research Letters, 49:6, (877-882), Online publication date: 1-Nov-2021.

Gaar E, Krenn D, Margulies S and Wiegele A (2022). Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares, Journal of Symbolic Computation, 107:C, (67-105), Online publication date: 1-Nov-2021.

Guschinsky N, Kovalyov M, Rozin B and Brauner N (2021). Fleet and charging infrastructure decisions for fast-charging city electric bus service, Computers and Operations Research, 135:C, Online publication date: 1-Nov-2021.

Padma Priya R and Rekha D (2021). Sustainability modelling and green energy optimisation in microgrid powered distributed FogMicroDataCenters in rural area, Wireless Networks, 27:8, (5519-5532), Online publication date: 1-Nov-2021.

Li J, Kirubarajan T, Tharmarasa R, Brown D and Pattipati K (2021). A dual approach to multi-dimensional assignment problems, Journal of Global Optimization, 81:3, (691-716), Online publication date: 1-Nov-2021.

Bah B, Kurtz J and Schaudt O (2021). Discrete optimization methods for group model selection in compressed sensing, Mathematical Programming: Series A and B, 190:1-2, (171-220), Online publication date: 1-Nov-2021.

Mosca R (2021). Independent Sets in (,Triangle)-Free Graphs, Graphs and Combinatorics, 37:6, (2173-2189), Online publication date: 1-Nov-2021.

Voudouris P, Stenström P and Pathan R (2021). Federated Scheduling of Sporadic DAGs on Unrelated Multiprocessors, ACM Transactions on Embedded Computing Systems, 20:5s, (1-25), Online publication date: 31-Oct-2021.

Goyal P and Panda B Hardness and Approximation Results of Roman {3}-Domination in Graphs Computing and Combinatorics, (101-111)

Acharyya A, Keikha V, Majumdar D and Pandit S Constrained Hitting Set Problem with Intervals Computing and Combinatorics, (604-616)

Gomes G, Masquio B, Pinto P, dos Santos V and Szwarcfiter J Disconnected Matchings Computing and Combinatorics, (579-590)

Ding W Finding Cheapest Deadline Paths Computing and Combinatorics, (476-486)

Hung R and Chiu M The Restrained Domination and Independent Restrained Domination in Extending Supergrid Graphs Computing and Combinatorics, (401-412)

Yanagisawa Y, Suzuki A, Tamura Y and Zhou X Decremental Optimization of Vertex-Coloring Under the Reconfiguration Framework Computing and Combinatorics, (355-366)

Wu G, Zhang Z, Liu H and Wang J Solving Time-Dependent Traveling Salesman Problem with Time Windows with Deep Reinforcement Learning 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), (558-563)

Ding J, Deaton J, Vishakha and Yang B The Nested Subset Differential Attack Advances in Cryptology – EUROCRYPT 2021, (329-347)

Van Giang T and Hiraishi K An Improved Method for Finding Attractors of Large-Scale Asynchronous Boolean Networks 2021 IEEE Conference on Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), (1-9)

Tellache N (2021). New complexity results for shop scheduling problems with agreement graphs, Theoretical Computer Science, 889:C, (85-95), Online publication date: 8-Oct-2021.

Araujo J, Cezar A, Lima C, dos Santos V and Silva A (2021). On the proper orientation number of chordal graphs, Theoretical Computer Science, 888:C, (117-132), Online publication date: 4-Oct-2021.

Zhou P, Jiang H, Zhu D and Zhu B (2021). Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs, Theoretical Computer Science, 888:C, (22-30), Online publication date: 4-Oct-2021.

Holohan N and Braghin S Secure Random Sampling in Differential Privacy Computer Security – ESORICS 2021, (523-542)

Chu H, Xiao M and Zhang Z (2021). An improved upper bound for SAT, Theoretical Computer Science, 887:C, (51-62), Online publication date: 2-Oct-2021.

Conejo A, Hall N, Long D and Zhang R (2021). Robust Capacity Planning for Project Management, INFORMS Journal on Computing, 33:4, (1533-1550), Online publication date: 1-Oct-2021.

Herzel A, Ruzika S and Thielen C (2021). Approximation Methods for Multiobjective Optimization Problems, INFORMS Journal on Computing, 33:4, (1284-1299), Online publication date: 1-Oct-2021.

Cen X and Xia Y (2021). A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, INFORMS Journal on Computing, 33:4, (1368-1383), Online publication date: 1-Oct-2021.

Afraimovich L and Emelin M (2021). Heuristic Strategies for Combining Solutions of the Three-Index Axial Assignment Problem, Automation and Remote Control, 82:10, (1635-1640), Online publication date: 1-Oct-2021.

Bekos M, Gronemann M, Montecchiani F, Pálvölgyi D, Symvonis A and Theocharous L (2021). Grid drawings of graphs with constant edge-vertex resolution, Computational Geometry: Theory and Applications, 98:C, Online publication date: 1-Oct-2021.

Jovanovic R and Voß S (2021). Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times, Applied Soft Computing, 110:C, Online publication date: 1-Oct-2021.

Xu C, Li W, Wang J and Yang Y (2021). An improved algorithm for the -MaxSAT problem: asking branchings to satisfy the clauses, Journal of Combinatorial Optimization, 42:3, (524-542), Online publication date: 1-Oct-2021.

Pandiri V and Singh A (2021). A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem, Journal of Heuristics, 27:5, (791-868), Online publication date: 1-Oct-2021.

Erdélyi G, Neveling M, Reger C, Rothe J, Yang Y and Zorn R (2021). Towards completing the puzzle: complexity of control by replacing, adding, and deleting candidates or voters, Autonomous Agents and Multi-Agent Systems, 35:2, Online publication date: 1-Oct-2021.

Roy S, Devaraj R, Sarkar A and Senapati D (2021). SLAQA, ACM Transactions on Embedded Computing Systems, 20:5, (1-31), Online publication date: 30-Sep-2021.

Fomin F, Golovach P, Lokshtanov D, Panolan F, Saurabh S and Zehavi M (2021). Multiplicative Parameterization Above a Guarantee, ACM Transactions on Computation Theory, 13:3, (1-16), Online publication date: 30-Sep-2021.

Bilò V and Mavronicolas M (2021). ∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games, ACM Transactions on Economics and Computation, 9:3, (1-25), Online publication date: 30-Sep-2021.

Yasudo R, Coutinho J, Varbanescu A, Luk W, Amano H, Becker T and Guo C (2021). Analytical Performance Estimation for Large-Scale Reconfigurable Dataflow Platforms, ACM Transactions on Reconfigurable Technology and Systems, 14:3, (1-21), Online publication date: 30-Sep-2021.

Bădică C and Popa A Polynomial Algorithms for Synthesizing Specific Classes of Optimal Block-Structured Processes Computational Collective Intelligence, (330-343)

Gao K and Yu J Capacitated Vehicle Routing with Target Geometric Constraints 2021 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), (7925-7930)

Cevallos A and Stewart A A verifiably secure and proportional committee election rule Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, (29-42)

Kokosiński Z Extraction of Nonredundant Information from Sensor Networks 2021 11th IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS), (403-407)

McKay M and Manlove D The Three-Dimensional Stable Roommates Problem with Additively Separable Preferences Algorithmic Game Theory, (266-280)

Perez H and Wijsen J Generalized Weighted Repairs Flexible Query Answering Systems, (67-81)

Martinod T, Pollet V, Darties B, Giroudeau R and König J (2022). Complexity and inapproximability results for balanced connected subgraph problem, Theoretical Computer Science, 886:C, (69-83), Online publication date: 13-Sep-2021.

Shi F, You J, Zhang Z, Liu J and Wang J (2022). Fixed-parameter tractability for the Tree Assembly problem, Theoretical Computer Science, 886:C, (3-12), Online publication date: 13-Sep-2021.

Hung R, Chiu M and Chen J The Domination and Independent Domination Problems in Supergrid Graphs Computational Science and Its Applications – ICCSA 2021, (631-646)

Neveling M, Rothe J and Weishaupt R The Possible Winner Problem with Uncertain Weights Revisited Fundamentals of Computation Theory, (399-412)

Bullinger M, Suksompong W and Voudouris A (2021). Welfare Guarantees in Schelling Segregation, Journal of Artificial Intelligence Research, 71, (143-174), Online publication date: 10-Sep-2021.

Yin C, Wang Y and Takagi T (Short Paper) Simple Matrix Signature Scheme Advances in Information and Computer Security, (227-237)

Acikalin U, Caskurlu B, Wojciechowski P and Subramani K New Results on Test-Cost Minimization in Database Migration Algorithmic Aspects of Cloud Computing, (38-55)

Kang M and Lee C (2021). An Exact Algorithm for Heterogeneous Drone-Truck Routing Problem, Transportation Science, 55:5, (1088-1112), Online publication date: 1-Sep-2021.

Magnanti T (2021). Optimization, Management Science, 67:9, (5349-5363), Online publication date: 1-Sep-2021.

Furugyan M (2021). Distribution of a Heterogeneous Set of Resources in Multiprocessor Scheduling, Journal of Computer and Systems Sciences International, 60:5, (785-792), Online publication date: 1-Sep-2021.

Leontiev V and Gordeev E (2021). On the Number of Solutions to a System of Boolean Equations, Automation and Remote Control, 82:9, (1581-1596), Online publication date: 1-Sep-2021.

Kurt A, Saputro N, Akkaya K and Uluagac A (2021). Distributed Connectivity Maintenance in Swarm of Drones During Post-Disaster Transportation Applications, IEEE Transactions on Intelligent Transportation Systems, 22:9, (6061-6073), Online publication date: 1-Sep-2021.

Lu Z, Hao J, Benlic U and Lesaint D (2021). Iterated multilevel simulated annealing for large-scale graph conductance minimization, Information Sciences: an International Journal, 572:C, (182-199), Online publication date: 1-Sep-2021.

Barba I, Jiménez-Ramírez A, Reichert M, Del Valle C and Weber B (2021). Flexible runtime support of business processes under rolling planning horizons, Expert Systems with Applications: An International Journal, 177:C, Online publication date: 1-Sep-2021.

Neveling M and Rothe J (2021). Control complexity in Borda elections, Artificial Intelligence, 298:C, Online publication date: 1-Sep-2021.

Chatterjee M and Setua S (2021). A Multi-Objective Deadline-Constrained Task Scheduling Algorithm with Guaranteed Performance in Load Balancing on Heterogeneous Networks, SN Computer Science, 2:5, Online publication date: 1-Sep-2021.

Rawitz D and Rosén A (2021). Online Budgeted Maximum Coverage, Algorithmica, 83:9, (2989-3014), Online publication date: 1-Sep-2021.

Beaumont O, Eyraud-Dubois L and Shilova A Pipelined Model Parallelism: Complexity Results and Memory Considerations Euro-Par 2021: Parallel Processing, (183-198)

Chen Y, Chen Z, Kennedy C, Lin G, Xu Y and Zhang A Approximation Algorithms for the Directed Path Partition Problems Frontiers of Algorithmics, (23-36)

Tao C, Petzoldt A and Ding J Efficient Key Recovery for All HFE Signature Variants Advances in Cryptology – CRYPTO 2021, (70-93)

Srivastava G, Singh A and Mallipeddi R (2021). NSGA-II with objective-specific variation operators for multiobjective vehicle routing problem with time windows, Expert Systems with Applications: An International Journal, 176:C, Online publication date: 15-Aug-2021.

Yin Y, Chen K, Shou L and Chen G Defending Privacy Against More Knowledgeable Membership Inference Attackers Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (2026-2036)

Gu J, Zheng W, Cai Y and Peng P Towards Computing a Near-Maximum Weighted Independent Set on Massive Graphs Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (467-477)

Zheng W, Yang Y and Piao C Accelerating Set Intersections over Graphs by Reducing-Merging Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (2349-2359)

Ren R and Tang X Generalized Skyline Interval Coloring and Dynamic Geometric Bin Packing Problems Proceedings of the 50th International Conference on Parallel Processing, (1-10)

Akitaya H, Biniaz A, Bose P, De Carufel J, Maheshwari A, da Silveira L and Smid M The Minimum Moving Spanning Tree Problem Algorithms and Data Structures, (15-28)

Xia X, Peng X and Liao W (2021). On the analysis of ant colony optimization for the maximum independent set problem, Frontiers of Computer Science: Selected Publications from Chinese Universities, 15:4, Online publication date: 1-Aug-2021.

Zhang Y and Yuan J (2021). A note on the complexity of two supply chain scheduling problems, Journal of Scheduling, 24:4, (447-454), Online publication date: 1-Aug-2021.

Zinder Y, Kononov A and Fung J (2021). A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements, Journal of Combinatorial Optimization, 42:2, (276-309), Online publication date: 1-Aug-2021.

Moscato P, Mathieson L and Haque M (2021). Augmented intuition: a bridge between theory and practice, Journal of Heuristics, 27:4, (497-547), Online publication date: 1-Aug-2021.

Singh K and Sundar S (2021). Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 25:16, (11289-11305), Online publication date: 1-Aug-2021.

Chandrasekaran K, Grigorescu E, Istrate G, Kulkarni S, Lin Y and Zhu M (2021). The Maximum Binary Tree Problem, Algorithmica, 83:8, (2427-2468), Online publication date: 1-Aug-2021.

Bonnet É and Purohit N (2021). Metric Dimension Parameterized By Treewidth, Algorithmica, 83:8, (2606-2633), Online publication date: 1-Aug-2021.

Papp P and Wattenhofer R Debt Swapping for Risk Mitigation in Financial Networks Proceedings of the 22nd ACM Conference on Economics and Computation, (765-784)

Zhou Y, Kong L, Yan L, Liu S and Hong J A Multiobjective Memetic Algorithm for Multiobjective Unconstrained Binary Quadratic Programming Problem Advances in Swarm Intelligence, (23-33)

Baouya A, Mohamed O, Ouchani S and Bennouar D (2021). Reliability-driven Automotive Software Deployment based on a Parametrizable Probabilistic Model Checking, Expert Systems with Applications: An International Journal, 174:C, Online publication date: 15-Jul-2021.

Aleksandrov M Fleet Fairness and Fleet Efficiency in Capacitated Pickup and Delivery Problems 2021 IEEE Intelligent Vehicles Symposium (IV), (1156-1161)

Parque V Generating combinations on the GPU and its application to the k-subset sum Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1308-1316)

Garmendia A, Ceberio J and Mendiburu A Exploratory analysis of the Monte Carlo tree search for solving the linear ordering problem Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1433-1441)

Weise T, Li X, Chen Y and Wu Z Solving job shop scheduling problems without using a bias for good solutions Proceedings of the Genetic and Evolutionary Computation Conference Companion, (1459-1466)

Bumpus B and Meeks K Edge Exploration of Temporal Graphs Combinatorial Algorithms, (107-121)

Lendl S, Woeginger G and Wulf L Non-preemptive Tree Packing Combinatorial Algorithms, (456-468)

Dumitrescu A and Tkadlec J Piercing All Translates of a Set of Axis-Parallel Rectangles Combinatorial Algorithms, (295-309)

Wassermann A Search for Combinatorial Objects Using Lattice Algorithms – Revisited Combinatorial Algorithms, (20-33)

Zinder Y, Berlińska J and Peter C Maximising the Total Weight of On-Time Jobs on Parallel Machines Subject to a Conflict Graph Mathematical Optimization Theory and Operations Research, (280-295)

Zhang W, Sauppe J and Jacobson S (2021). An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints, INFORMS Journal on Computing, 33:3, (1091-1102), Online publication date: 1-Jul-2021.

Koshelev P and Mishchenko A (2021). Optimizing Management of Jobs in a Logistic Project Under Conditions of Uncertainty, Journal of Computer and Systems Sciences International, 60:4, (595-609), Online publication date: 1-Jul-2021.

Grzelak D and Aßmann U (2021). A Canonical String Encoding for Pure Bigraphs, SN Computer Science, 2:4, Online publication date: 1-Jul-2021.

Viana L, Campêlo M, Sau I and Silva A (2021). A unifying model for locally constrained spanning tree problems, Journal of Combinatorial Optimization, 42:1, (125-150), Online publication date: 1-Jul-2021.

Fomin F and Golovach P (2021). Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs, Algorithmica, 83:7, (2170-2214), Online publication date: 1-Jul-2021.

Davot T, Chateau A, Giroudeau R, Weller M and Tabary D (2021). Producing Genomic Sequences after Genome Scaffolding with Ambiguous Paths: Complexity, Approximation and Lower Bounds, Algorithmica, 83:7, (2063-2095), Online publication date: 1-Jul-2021.

Torrente A and Romo J (2021). Initializing k-means Clustering by Bootstrap and Data Depth, Journal of Classification, 38:2, (232-256), Online publication date: 1-Jul-2021.

Pieterse A and Woeginger G (2021). The subset sum game revisited, Theory of Computing Systems, 65:5, (884-900), Online publication date: 1-Jul-2021.

Zeng Y, Tan J and Xia C (2021). Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension and Throughput Limit, Journal of the ACM, 68:3, (1-30), Online publication date: 30-Jun-2021.

Parque V Tackling the Subset Sum Problem with Fixed Size using an Integer Representation Scheme 2021 IEEE Congress on Evolutionary Computation (CEC), (1447-1453)

Bandyapadhyay S, Banik A and Bhore S On Fair Covering and Hitting Problems Graph-Theoretic Concepts in Computer Science, (39-51)

Fomin F, Golovach P and Thilikos D Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs Graph-Theoretic Concepts in Computer Science, (308-320)

Bentert M, Koana T and Niedermeier R The Complexity of Gerrymandering over Graphs: Paths and Trees Graph-Theoretic Concepts in Computer Science, (195-206)

Paiva T and Terada R Cryptanalysis of the Binary Permuted Kernel Problem Applied Cryptography and Network Security, (396-423)

Marx D Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (19-29)

Kim H, Choi Y, Park K, Lin X, Hong S and Han W Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching Proceedings of the 2021 International Conference on Management of Data, (925-937)

Zhang Y, Li Y, Bao Z, Zheng B and Jagadish H Minimizing the Regret of an Influence Provider Proceedings of the 2021 International Conference on Management of Data, (2115-2127)

Yang Z, Lai L, Lin X, Hao K and Zhang W HUGE: An Efficient and Scalable Subgraph Enumeration System Proceedings of the 2021 International Conference on Management of Data, (2049-2062)

Lu C, Yu J, Zhang Z and Cheng H Graph Iso/Auto-morphism Proceedings of the 2021 International Conference on Management of Data, (1195-1207)

Fan W, Li Y, Liu M and Lu C Making Graphs Compact by Lossless Contraction Proceedings of the 2021 International Conference on Management of Data, (472-484)

Thor A, Bornmann L, Haunschild R and Leydesdorff L (2021). Which are the influential publications in the Web of Science subject categories over a long period of time? CRExplorer software used for big-data analyses in bibliometrics , Journal of Information Science, 47:3, (419-428), Online publication date: 1-Jun-2021.

Lokshtanov D, Misra P, Mukherjee J, Panolan F, Philip G and Saurabh S (2021). 2-Approximating Feedback Vertex Set in Tournaments, ACM Transactions on Algorithms, 17:2, (1-14), Online publication date: 1-Jun-2021.

Chiu C and He T (2021). Stealthy DGoS Attack: DeGrading of Service Under the Watch of Network Tomography, IEEE/ACM Transactions on Networking, 29:3, (1294-1307), Online publication date: 1-Jun-2021.

Jin Y, Xu J, Wu S, Xu L, Yang D and Xia K (2021). Bus network assisted drone scheduling for sustainable charging of wireless rechargeable sensor network ▪, Journal of Systems Architecture: the EUROMICRO Journal, 116:C, Online publication date: 1-Jun-2021.

Spensieri D, Åblad E, Bohlin R, Carlson J and Söderberg R (2021). Modeling and optimization of implementation aspects in industrial robot coordination, Robotics and Computer-Integrated Manufacturing, 69:C, Online publication date: 1-Jun-2021.

Fan W, Fan J, Han Z, Li P, Zhang Y and Wang R (2021). Fault-tolerant hamiltonian cycles and paths embedding into locally exchanged twisted cubes, Frontiers of Computer Science: Selected Publications from Chinese Universities, 15:3, Online publication date: 1-Jun-2021.

Mogali J, Kinable J, Smith S and Rubinstein Z (2021). Scheduling for multi-robot routing with blocking and enabling constraints, Journal of Scheduling, 24:3, (291-318), Online publication date: 1-Jun-2021.

Chakraborty O, Faugère J and Perret L (2021). Cryptanalysis of the extension field cancellation cryptosystem, Designs, Codes and Cryptography, 89:6, (1335-1364), Online publication date: 1-Jun-2021.

Grigoriev A, Hartmann T, Lendl S and Woeginger G (2021). Dispersing Obnoxious Facilities on a Graph, Algorithmica, 83:6, (1734-1749), Online publication date: 1-Jun-2021.

Seifi C, Schulze M and Zimmermann J (2021). Solution procedures for block selection and sequencing in flat-bedded potash underground mines, OR Spectrum, 43:2, (409-440), Online publication date: 1-Jun-2021.

Steeples T, Gutierrez J and Wooldridge M Mean-Payoff Games with ω-Regular Specifications Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (1272-1280)

Schwind N, Demirović E, Inoue K and Lagniez J Partial Robustness in Team Formation: Bridging the Gap between Robustness and Resilience Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (1154-1162)

Imber A and Kimelfeld B Probabilistic Inference of Winners in Elections by Independent Random Voters Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (647-655)

Imber A and Kimelfeld B Computing the Extremal Possible Ranks with Incomplete Preferences Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (638-646)

Gupta S and Zehavi M Multivariate Analysis of Scheduling Fair Competitions Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (555-564)

Cohen S and Agmon N Spatial Consensus-Prevention in Robotic Swarms Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (359-367)

Aziz H, Chan H, Cseh Á, Li B, Ramezani F and Wang C Multi-Robot Task Allocation-Complexity and Approximation Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems, (133-141)

Van Lieshout R (2021). Integrated Periodic Timetabling and Vehicle Circulation Scheduling, Transportation Science, 55:3, (768-790), Online publication date: 1-May-2021.

Bärmann A, Martin A and Schneider O (2021). Efficient Formulations and Decomposition Approaches for Power Peak Reduction in Railway Traffic via Timetabling, Transportation Science, 55:3, (747-767), Online publication date: 1-May-2021.

Jiang S, Fang S and Jin Q (2020). Sparse Solutions by a Quadratically Constrained ℓ q (0 < q < 1) Minimization Model, INFORMS Journal on Computing, 33:2, (511-530), Online publication date: 1-May-2021.

Deng Y, Jia H, Ahmed S, Lee J and Shen S (2020). Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs, INFORMS Journal on Computing, 33:2, (757-773), Online publication date: 1-May-2021.

Briskorn D, Fliedner M and Tschöke M (2020). Vehicle Sequencing at Transshipment Terminals with Handover Relations, INFORMS Journal on Computing, 33:2, (477-494), Online publication date: 1-May-2021.

Dershowitz N (2021). Let's be honest, Communications of the ACM, 64:5, (37-41), Online publication date: 1-May-2021.

Bogdanov I, Nesterov V, Sudakov V, Sypalo K and Toporov N (2021). Calculation of the Optimal Loading of Air Vehicles Taking Into Account the Prioritization of Aircraft, Journal of Computer and Systems Sciences International, 60:3, (396-408), Online publication date: 1-May-2021.

Choi B and Park M (2021). Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty, Journal of Combinatorial Optimization, 41:4, (781-793), Online publication date: 1-May-2021.

Xia Y, Yang M and Wang S (2021). Chebyshev center of the intersection of balls: complexity, relaxation and approximation, Mathematical Programming: Series A and B, 187:1-2, (287-315), Online publication date: 1-May-2021.

Davarnia D and van Hoeve W (2021). Outer approximation for integer nonlinear programs via decision diagrams, Mathematical Programming: Series A and B, 187:1-2, (111-150), Online publication date: 1-May-2021.

Duarte G, Eto H, Hanaka T, Kobayashi Y, Kobayashi Y, Lokshtanov D, Pedrosa L, Schouery R and Souza U (2021). Computing the Largest Bond and the Maximum Connected Cut of a Graph, Algorithmica, 83:5, (1421-1458), Online publication date: 1-May-2021.

Yao K and Chang L (2021). Efficient size-bounded community search over large networks, Proceedings of the VLDB Endowment, 14:8, (1441-1453), Online publication date: 1-Apr-2021.

Fan W, Tian C, Wang Y and Yin Q (2021). Parallel discrepancy detection and incremental detection, Proceedings of the VLDB Endowment, 14:8, (1351-1364), Online publication date: 1-Apr-2021.

Song B, Li K, Orellana-Martín D, Pérez-Jiménez M and PéRez-Hurtado I (2021). A Survey of Nature-Inspired Computing, ACM Computing Surveys, 54:1, (1-31), Online publication date: 1-Apr-2021.

Minaeva A and Hanzálek Z (2021). Survey on Periodic Scheduling for Time-triggered Hard Real-time Systems, ACM Computing Surveys, 54:1, (1-32), Online publication date: 1-Apr-2021.

Huang Y, Shen X and You X (2021). A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem, Applied Soft Computing, 102:C, Online publication date: 1-Apr-2021.

Ravelo S (2021). Minimum constellation covers: hardness, approximability and polynomial cases, Journal of Combinatorial Optimization, 41:3, (603-624), Online publication date: 1-Apr-2021.

AlKasem H and Menai M (2021). Stochastic local search for Partial Max-SAT: an experimental evaluation, Artificial Intelligence Review, 54:4, (2525-2566), Online publication date: 1-Apr-2021.

Barrero L, Robledo F, Romero P and Viera R A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows Variable Neighborhood Search, (152-165)

Fanti M, Mangini A, Pedroncelli G and Ukovich W Discrete consensus for asynchronous distributed task assignment 2016 IEEE 55th Conference on Decision and Control (CDC), (251-255)

Dai W, Foerster K, Fuchssteiner D and Schmid S (2021). Load-Optimization in Reconfigurable Networks, ACM SIGMETRICS Performance Evaluation Review, 48:3, (39-44), Online publication date: 5-Mar-2021.

Tripathy L and Tripathy C (2021). Hierarchical Hexagon, Cybernetics and Information Technologies, 21:1, (32-49), Online publication date: 1-Mar-2021.

Makarovskikh T and Panyukov A (2021). Software for the Problem of Constructing Cutting Tool Paths in CAD/CAM Systems for Technological Preparation of Cutting Processes, Automation and Remote Control, 82:3, (468-480), Online publication date: 1-Mar-2021.

Pantsar M (2021). Descriptive Complexity, Computational Tractability, and the Logical and Cognitive Foundations of Mathematics, Minds and Machines, 31:1, (75-98), Online publication date: 1-Mar-2021.

Sai K, Uehara R and Viglietta G Cyclic Shift Problems on Graphs WALCOM: Algorithms and Computation, (308-320)

Mondal D, Parthiban N, Kavitha V and Rajasingh I APX-Hardness and Approximation for the k-Burning Number Problem WALCOM: Algorithms and Computation, (272-283)

Arseneva E, Cano P, Kleist L, Mchedlidze T, Mehrabi S, Parada I and Valtr P Upward Point Set Embeddings of Paths and Trees WALCOM: Algorithms and Computation, (234-246)

Subrt O, Bodlak M, Jary V, Kveton A, Novy J, Virius M and Zemko M Dynamic Programming and Greedy Heuristic in the Load Balancing Problem for the iFDAQ of the COMPASS Experiment at CERN 2021 International Symposium on Electrical, Electronics and Information Engineering, (283-294)

Gupta A, Lokhande S and Mondal K Burning Grids and Intervals Algorithms and Discrete Applied Mathematics, (66-79)

Panda B and Goyal P Hardness Results of Global Roman Domination in Graphs Algorithms and Discrete Applied Mathematics, (500-511)

Jana S, Pandit S and Roy S Balanced Connected Graph Partition Algorithms and Discrete Applied Mathematics, (487-499)

Wojciechowski P, Subramani K, Velasquez A and Caskurlu B Algorithmic Analysis of Priority-Based Bin Packing Algorithms and Discrete Applied Mathematics, (359-372)

Garg A and Ranade A Scheduling Trains with Small Stretch on a Unidirectional Line Algorithms and Discrete Applied Mathematics, (16-31)

Srinivasan A and Narayanaswamy N The Connected Domination Number of Grids Algorithms and Discrete Applied Mathematics, (247-258)

Ghosh S, Dey S and Dasgupta P (2020). Performance-Driven Post-Processing of Control Loop Execution Schedules, ACM Transactions on Design Automation of Electronic Systems, 26:2, (1-27), Online publication date: 1-Feb-2021.

Wu N, Deng L, Li G and Xie Y (2020). Core Placement Optimization for Multi-chip Many-core Neural Network Systems with Reinforcement Learning, ACM Transactions on Design Automation of Electronic Systems, 26:2, (1-27), Online publication date: 1-Feb-2021.

Yang S, Li F, Trajanovski S, Yahyapour R and Fu X (2020). Recent Advances of Resource Allocation in Network Function Virtualization, IEEE Transactions on Parallel and Distributed Systems, 32:2, (295-314), Online publication date: 1-Feb-2021.

Psychasand K and Ghaderi J (2021). High-Throughput Bin Packing: Scheduling Jobs With Random Resource Demands in Clusters, IEEE/ACM Transactions on Networking, 29:1, (220-233), Online publication date: 1-Feb-2021.

Naghsh Z and Valaee S (2021). Conflict-Free Scheduling in Cellular V2X Communications, IEEE/ACM Transactions on Networking, 29:1, (106-119), Online publication date: 1-Feb-2021.

Yang S, Li F, Trajanovski S, Chen X, Wang Y and Fu X (2021). Delay-Aware Virtual Network Function Placement and Routing in Edge Clouds, IEEE Transactions on Mobile Computing, 20:2, (445-459), Online publication date: 1-Feb-2021.

Poureidi A, Ghaznavi M and Fathali J (2021). Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination, Journal of Combinatorial Optimization, 41:2, (304-317), Online publication date: 1-Feb-2021.

Agrawal A, Panolan F, Saurabh S and Zehavi M (2021). Simultaneous Feedback Edge Set: A Parameterized Perspective, Algorithmica, 83:2, (753-774), Online publication date: 1-Feb-2021.

Bilò V and Mavronicolas M (2021). The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games, Algorithmica, 83:2, (447-530), Online publication date: 1-Feb-2021.

Casel K, Fernau H, Gaspers S, Gras B and Schmid M (2021). On the Complexity of the Smallest Grammar Problem over Fixed Alphabets, Theory of Computing Systems, 65:2, (344-409), Online publication date: 1-Feb-2021.

Gutin G, Wahlström M and Zehavi M (2021). r-Simple k-Path and Related Problems Parameterized by k/r, ACM Transactions on Algorithms, 17:1, (1-64), Online publication date: 28-Jan-2021.

Bjelde A, Hackfeld J, Disser Y, Hansknecht C, Lipmann M, Meißner J, SchlÖter M, Schewior K and Stougie L (2020). Tight Bounds for Online TSP on the Line, ACM Transactions on Algorithms, 17:1, (1-58), Online publication date: 28-Jan-2021.

Morell S, Seidel I and Weltge S Minimum-cost integer circulations in given homology classes Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2725-2738)

Bläser M, Ikenmeyer C, Lysikov V, Pandey A and Schreyer F On the orbit closure containment problem and slice rank of tensors Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2565-2584)

Hirahara S and Shimizu N Nearly optimal average-case complexity of counting bicliques under SETH Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2346-2365)

Koenig D and Tsvietkova A Unlinking, splitting, and some other NP-hard problems in knot theory Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (1496-1507)

Varma N and Yoshida Y Average sensitivity of graph algorithms Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (684-703)

Fernandes C and Lintzmayer C Leafy Spanning Arborescences in DAGs LATIN 2020: Theoretical Informatics, (50-62)

Gomes G, Guedes M and dos Santos V Structural Parameterizations for Equitable Coloring LATIN 2020: Theoretical Informatics, (129-140)

Mao M, Yi P, Zhang Z, Wang L, Pei J and Scioscia F (2021). Roadside Unit Deployment Mechanism Based on Node Popularity, Mobile Information Systems, 2021, Online publication date: 1-Jan-2021.

Wang H, Azeem M, Nadeem M, Ur-Rehman A, Aslam A and Javaid M (2021). On Fault-Tolerant Resolving Sets of Some Families of Ladder Networks, Complexity, 2021, Online publication date: 1-Jan-2021.

Shan X, Li H, Jia C, Li D, Song B and lin c (2021). Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs, Complexity, 2021, Online publication date: 1-Jan-2021.

Cappelle M, Gomes G and dos Santos V (2021). Parameterized algorithms for locating-dominating sets, Procedia Computer Science, 195:C, (68-76), Online publication date: 1-Jan-2021.

Yang Z, Wang W and Kim D (2020). On multi-path routing for reliable communications in failure interdependent complex networks, Journal of Combinatorial Optimization, 41:1, (170-196), Online publication date: 1-Jan-2021.

Dondi R, Hosseinzadeh M, Mauri G and Zoppis I (2020). Top-k overlapping densest subgraphs: approximation algorithms and computational complexity, Journal of Combinatorial Optimization, 41:1, (80-104), Online publication date: 1-Jan-2021.

Chen Y, Chen Z, Lin G, Wang L and Zhang A (2020). A randomized approximation algorithm for metric triangle packing, Journal of Combinatorial Optimization, 41:1, (12-27), Online publication date: 1-Jan-2021.

Letchford A and Vu A (2019). Facets from gadgets, Mathematical Programming: Series A and B, 185:1-2, (297-314), Online publication date: 1-Jan-2021.

Anderson S, Kuenzel K and Rall D (2021). On Well-Dominated Graphs, Graphs and Combinatorics, 37:1, (151-165), Online publication date: 1-Jan-2021.

Chan C, Gan B and Cai W Towards situation aware dispatching in a dynamic and complex manufacturing environment Proceedings of the Winter Simulation Conference, (528-539)

Yi E Fractional Maker-Breaker Resolving Game Combinatorial Optimization and Applications, (577-593)

Bello K and Honorio J Fairness constraints can help exact inference in structured prediction Proceedings of the 34th International Conference on Neural Information Processing Systems, (11322-11332)

Bishop N, Chan H, Mandal D and Tran-Thanh L Adversarial blocking bandits Proceedings of the 34th International Conference on Neural Information Processing Systems, (8139-8149)

Daras G, Odena A, Kitaev N and Dimakis A SMYRF Proceedings of the 34th International Conference on Neural Information Processing Systems, (6476-6489)

Pabbaraju C, Wang P and Kolter J Efficient semidefinite-programming-based inference for binary and multi-class MRFs Proceedings of the 34th International Conference on Neural Information Processing Systems, (4259-4270)

Bläsius T, Friedrich T, Katzmann M and Krohmer A (2020). Hyperbolic Embeddings for Near-Optimal Greedy Routing, ACM Journal of Experimental Algorithmics, 25, (1-18), Online publication date: 6-Dec-2020.

Medvedeva N and Smirnov A (2020). NP-Completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem, Automatic Control and Computer Sciences, 54:7, (685-696), Online publication date: 1-Dec-2020.

Ganian R, Haan R, Kanj I and Szeider S (2020). On Existential MSO and Its Relation to ETH, ACM Transactions on Computation Theory, 12:4, (1-32), Online publication date: 1-Dec-2020.

Shafransky Y and Shinkarevich V (2020). On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty, Journal of Scheduling, 23:6, (745-749), Online publication date: 1-Dec-2020.

Berlińska J (2020). Scheduling in data gathering networks with background communications, Journal of Scheduling, 23:6, (681-691), Online publication date: 1-Dec-2020.

Dias F, Tavares W and Costa J (2020). Reactive VNS algorithm for the maximum k-subset intersection problem, Journal of Heuristics, 26:6, (913-941), Online publication date: 1-Dec-2020.

Shao K, Fan W, Yang Z, Yang S and Pardalos P (2020). Patient scheduling with deteriorating treatment duration and maintenance activity, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:23, (17649-17668), Online publication date: 1-Dec-2020.

Bodlaender H, Hanaka T, Kobayashi Y, Kobayashi Y, Okamoto Y, Otachi Y and van der Zanden T (2020). Subgraph Isomorphism on Graph Classes that Exclude a Substructure, Algorithmica, 82:12, (3566-3587), Online publication date: 1-Dec-2020.

Walter R and Lawrinenko A (2020). A characterization of optimal multiprocessor schedules and new dominance rules, Journal of Combinatorial Optimization, 40:4, (876-900), Online publication date: 1-Nov-2020.

González-Rodríguez I, Puente J, Palacios J and Vela C (2020). Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:21, (16291-16302), Online publication date: 1-Nov-2020.

Jia F, Zhou K, Kamhoua C and Vorobeychik Y Blocking Adversarial Influence in Social Networks Decision and Game Theory for Security, (257-276)

Grohe M and Schweitzer P (2020). The graph isomorphism problem, Communications of the ACM, 63:11, (128-134), Online publication date: 22-Oct-2020.

Tredup R The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets Reachability Problems, (148-163)

Huang S and Xiao M (2020). Object reachability via swaps under strict and weak preferences, Autonomous Agents and Multi-Agent Systems, 34:2, Online publication date: 12-Oct-2020.

Benabbou N, Chakraborty M, Ho X, Sliwinski J and Zick Y (2020). The Price of Quota-based Diversity in Assignment Problems, ACM Transactions on Economics and Computation, 8:3, (1-32), Online publication date: 2-Oct-2020.

Xia J, Wang Y, Fan J, Fan W and Han Y Embedding Augmented Cubes into Grid Networks for Minimum Wirelength Algorithms and Architectures for Parallel Processing, (47-61)

Hu J, Du Z, Zhang S and Bader D QoS-Aware and Fault-Tolerant Replica Placement Algorithms and Architectures for Parallel Processing, (157-172)

Boccia M, Sforza A and Sterle C (2020). Simple Pattern Minimality Problems, INFORMS Journal on Computing, 32:4, (1049-1060), Online publication date: 1-Oct-2020.

Validi H and Buchanan A (2020). The Optimal Design of Low-Latency Virtual Backbones, INFORMS Journal on Computing, 32:4, (952-967), Online publication date: 1-Oct-2020.

Choi B and Park M (2020). Scheduling two projects with controllable processing times in a single-machine environment, Journal of Scheduling, 23:5, (619-628), Online publication date: 1-Oct-2020.

Dong J, Chang J, Su B, Hu J and Lin G (2020). Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments, Journal of Scheduling, 23:5, (595-608), Online publication date: 1-Oct-2020.

Geng Z and Liu J (2020). Single machine batch scheduling with two non-disjoint agents and splitable jobs, Journal of Combinatorial Optimization, 40:3, (774-795), Online publication date: 1-Oct-2020.

Chen Y, Lin G, Liu T, Luo T, Su B, Xu Y and Zhang P (2020). A -approximation algorithm for the 2-Max-Duo problem, Journal of Combinatorial Optimization, 40:3, (806-824), Online publication date: 1-Oct-2020.

Zhang A, Chen Y, Chen Z and Lin G (2020). Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs, Algorithmica, 82:10, (3041-3064), Online publication date: 1-Oct-2020.

Lin C, Ku K and Hsu C (2020). Paired-Domination Problem on Distance-Hereditary Graphs, Algorithmica, 82:10, (2809-2840), Online publication date: 1-Oct-2020.

Gemsa A, Niedermann B and Nöllenburg M (2020). A Unified Model and Algorithms for Temporal Map Labeling, Algorithmica, 82:10, (2709-2736), Online publication date: 1-Oct-2020.

Zhang C (2020). Minimal consistent DFA from sample strings, Acta Informatica, 57:3-5, (657-670), Online publication date: 1-Oct-2020.

Gimadi E, Shevyakov A and Shtepa A A Given Diameter MST on a Random Graph Optimization and Applications, (110-121)

Kudelić R and Rabuzin K Dealing with Intractability of Information System Subsystems Development Order via Control Flow Graph Reducibility Proceedings of the 2020 3rd International Conference on Electronics and Electrical Engineering Technology, (62-68)

Sun R, Zhu Q, Chen C, Wang X, Zhang Y and Wang X Discovering Cliques in Signed Networks Based on Balance Theory Database Systems for Advanced Applications, (666-674)

Hemery M, Fages F and Soliman S On the Complexity of Quadratization for Polynomial Differential Equations Computational Methods in Systems Biology, (120-140)

Aspinall T, Gepp A, Harris G and Vanstone B Variable Transformation to a Domain Space for Edge Matching Puzzles Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, (210-221)

Thiessen M, Quesada L and Brown K Improving a Branch-and-Bound Approach for the Degree-Constrained Minimum Spanning Tree Problem with LKH Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (447-456)

Escoffier B, Spanjaard O and Tydrichová M Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms Algorithmic Game Theory, (291-306)

Genc B and O’Sullivan B A Two-Phase Constraint Programming Model for Examination Timetabling at University College Cork Principles and Practice of Constraint Programming, (724-742)

Zeng Y, Tong Y, Song Y and Chen L (2020). The simpler the better, Proceedings of the VLDB Endowment, 13:13, (3517-3530), Online publication date: 1-Sep-2020.

Matakos A, Tu S and Gionis A (2020). Tell me something my friends do not know: diversity maximization in social networks, Knowledge and Information Systems, 62:9, (3697-3726), Online publication date: 1-Sep-2020.

An Z, Feng Q, Kanj I and Xia G (2020). The Complexity of Tree Partitioning, Algorithmica, 82:9, (2606-2643), Online publication date: 1-Sep-2020.

Hassin R, Ravi R, Salman F and Segev D (2020). The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures, Algorithmica, 82:9, (2474-2501), Online publication date: 1-Sep-2020.

Briskorn D, Kimms A and Olschok D (2020). Simultaneous planning for disaster road clearance and distribution of relief goods: a basic model and an exact solution method, OR Spectrum, 42:3, (591-619), Online publication date: 1-Sep-2020.

Asahiro Y, Eto H, Hanaka T, Lin G, Miyano E and Terabaru I Graph Classes and Approximability of the Happy Set Problem Computing and Combinatorics, (335-346)

Dippel M, Sundaram R and Varma A Realization Problems on Reachability Sequences Computing and Combinatorics, (274-286)

Bonomo-Braberman F, Nascimento J, Oliveira F, Souza U and Szwarcfiter J Linear-Time Algorithms for Eliminating Claws in Graphs Computing and Combinatorics, (14-26)

Welke P, Seiffarth F, Kamp M and Wrobel S HOPS: Probabilistic Subtree Mining for Small and Large Graphs Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1275-1284)

Terzakis G and Lourakis M A Consistently Fast and Globally Optimal Solution to the Perspective-n-Point Problem Computer Vision – ECCV 2020, (478-494)

Han L, Gao Y, Liu J, Robert Y and Vivien F Energy-aware strategies for reliability-oriented real-time task allocation on heterogeneous platforms Proceedings of the 49th International Conference on Parallel Processing, (1-11)

Ding J, Deaton J, Schmidt K, Vishakha and Zhang Z Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme Advances in Cryptology – CRYPTO 2020, (279-298)

Ding W and Qiu K Minimum Diameter Vertex-Weighted Steiner Tree Algorithmic Aspects in Information and Management, (62-72)

Wan L and Mei J Revisit of the Scheduling Problems with Integrated Production and Delivery on Parallel Batching Machines Algorithmic Aspects in Information and Management, (311-322)

Piao C, Zheng W, Rong Y and Cheng H (2020). Maximizing the reduction ability for near-maximum independent set computation, Proceedings of the VLDB Endowment, 13:12, (2466-2478), Online publication date: 1-Aug-2020.

Fan W, Jin R, Liu M, Lu P, Tian C and Zhou J (2020). Capturing associations in graphs, Proceedings of the VLDB Endowment, 13:12, (1863-1876), Online publication date: 1-Aug-2020.

Kong P (2020). Routing in Communication Networks With Interdependent Power Grid, IEEE/ACM Transactions on Networking, 28:4, (1899-1911), Online publication date: 1-Aug-2020.

Cao Y, Fan W and Yuan T (2020). Bounded Evaluation: Querying Big Data with Bounded Resources, International Journal of Automation and Computing, 17:4, (502-526), Online publication date: 1-Aug-2020.

Cui Y, Chang T, Hong M and Pang J (2020). A Study of Piecewise Linear-Quadratic Programs, Journal of Optimization Theory and Applications, 186:2, (523-553), Online publication date: 1-Aug-2020.

Rubert D, Araujo E, Stefanes M, Stoye J and Martinez F (2020). Searching and inferring colorful topological motifs in vertex-colored graphs, Journal of Combinatorial Optimization, 40:2, (379-411), Online publication date: 1-Aug-2020.

Woods B and Punnen A (2020). A class of exponential neighbourhoods for the quadratic travelling salesman problem, Journal of Combinatorial Optimization, 40:2, (303-332), Online publication date: 1-Aug-2020.

Kutucu H, Gursoy A, Kurt M and Nuriyev U (2020). The band collocation problem, Journal of Combinatorial Optimization, 40:2, (454-481), Online publication date: 1-Aug-2020.

Singgih I, Yu O, Kim B, Koo J and Lee S (2020). Production scheduling problem in a factory of automobile component primer painting, Journal of Intelligent Manufacturing, 31:6, (1483-1496), Online publication date: 1-Aug-2020.

Bonnet É, Bousquet N, Charbit P, Thomassé S and Watrigant R (2020). Parameterized Complexity of Independent Set in H-Free Graphs, Algorithmica, 82:8, (2360-2394), Online publication date: 1-Aug-2020.

Barbero F, Isenmann L and Thiebaut J (2020). On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs, Algorithmica, 82:8, (2243-2266), Online publication date: 1-Aug-2020.

Rottenstreich O, Kaplan H and Hassidim A (2020). Clustering in Hypergraphs to Minimize Average Edge Service Time, ACM Transactions on Algorithms, 16:3, (1-28), Online publication date: 31-Jul-2020.

Bar-Yehuda R, Censor-Hillel K, Maus Y, Pai S and Pemmaraju S Distributed Approximation on Power Graphs Proceedings of the 39th Symposium on Principles of Distributed Computing, (501-510)

Bartholdi L, Figelius M, Lohrey M and Weiß A Groups with ALOGTIME-hard word problems and PSPACE-complete circuit value problems Proceedings of the 35th Computational Complexity Conference, (1-29)

Ilango R, Loff B and Oliveira I NP-hardness of circuit minimization for multi-output functions Proceedings of the 35th Computational Complexity Conference, (1-36)

Gliesch A, Ritt M, Cruz A and Moreira M A hybrid heuristic for districting problems with routing criteria 2020 IEEE Congress on Evolutionary Computation (CEC), (1-9)

Fortez G, Robledo F, Romero P and Viera O A Fast Genetic Algorithm for the Max Cut-Clique Problem Machine Learning, Optimization, and Data Science, (528-539)

Lagos G and Romero P On the Reliability of Dynamical Stochastic Binary Systems Machine Learning, Optimization, and Data Science, (516-527)

Robledo F, Rodríguez-Bocca P and Romero P Optimal Broadcast Strategy in Homogeneous Point-to-Point Networks Machine Learning, Optimization, and Data Science, (448-457)

Ohsaka N and Matsuoka T On the (in)tractability of computing normalizing constants for the product of determinantal point processes Proceedings of the 37th International Conference on Machine Learning, (7414-7423)

Ahn S, Seo Y and Shin J Learning what to defer for maximum independent sets Proceedings of the 37th International Conference on Machine Learning, (134-144)

Chiu C and He T Stealthy DGoS Attack: DeGrading of Service under the Watch of Network Tomography IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, (367-376)

Cuevas A, Martínez J and Saucedo J (2020). A Two Stage Method for the Multiple Traveling Salesman Problem, International Journal of Applied Metaheuristic Computing, 11:3, (79-91), Online publication date: 1-Jul-2020.

Ryan K, Ahmed S, Dey S, Rajan D, Musselman A and Watson J (2020). Optimization-Driven Scenario Grouping, INFORMS Journal on Computing, 32:3, (805-821), Online publication date: 1-Jul-2020.

Miao Z and Balasundaram B (2020). An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph, INFORMS Journal on Computing, 32:3, (763-778), Online publication date: 1-Jul-2020.

Liu N, Ma Y and Topaloglu H (2020). Assortment Optimization Under the Multinomial Logit Model with Sequential Offerings, INFORMS Journal on Computing, 32:3, (835-853), Online publication date: 1-Jul-2020.

Riyana S, Nanthachumphu S and Riyana N (2020). Achieving Privacy Preservation Constraints in Missing-Value Datasets, SN Computer Science, 1:4, Online publication date: 1-Jul-2020.

Levin M (2020). Composite Technology Challenge System for Optimization in 5G Communications, SN Computer Science, 1:4, Online publication date: 1-Jul-2020.

Cropper A and Tourret S (2019). Logical reduction of metarules, Machine Language, 109:7, (1323-1369), Online publication date: 1-Jul-2020.

Sharifov F and Hulianytskyi L (2020). Cuts in Undirected Graphs. I, Cybernetics and Systems Analysis, 56:4, (559-565), Online publication date: 1-Jul-2020.

Fomin F, Golovach P, Strømme T and Thilikos D (2020). Subgraph Complementation, Algorithmica, 82:7, (1859-1880), Online publication date: 1-Jul-2020.

DasGupta B, Janardhanan M and Yahyanejad F (2020). Why Did the Shape of Your Network Change? (On Detecting Network Anomalies via Non-local Curvatures), Algorithmica, 82:7, (1741-1783), Online publication date: 1-Jul-2020.

Harutyunyan A, Ghadikolaei M, Melissinos N, Monnot J and Pagourtzis A On the Complexity of the Upper r-Tolerant Edge Cover Problem Topics in Theoretical Computer Science, (32-47)

Bulatov A and Živný S (2020). Approximate Counting CSP Seen from the Other Side, ACM Transactions on Computation Theory, 12:2, (1-19), Online publication date: 30-Jun-2020.

Aichholzer O, Borrazzo M, Bose P, Cardinal J, Frati F, Morin P and Vogtenhuber B Drawing Graphs as Spanners Graph-Theoretic Concepts in Computer Science, (310-324)

Guo W, Li Y, Sha M, He B, Xiao X and Tan K GPU-Accelerated Subgraph Enumeration on Partitioned Graphs Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, (1067-1082)

Fan G, Fan W, Li Y, Lu P, Tian C and Zhou J Extending Graph Patterns with Conditions Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, (715-729)

Blanché A, Mizuta H, Ouvrard P and Suzuki A Decremental Optimization of Dominating Sets Under the Reconfiguration Framework Combinatorial Algorithms, (69-82)

Belmonte R, Hanaka T, Kanzaki M, Kiyomi M, Kobayashi Y, Kobayashi Y, Lampis M, Ono H and Otachi Y Parameterized Complexity of -Path Packing Combinatorial Algorithms, (43-55)

Foucaud F, Gras B, Perez A and Sikora F On the Complexity of Broadcast Domination and Multipacking in Digraphs Combinatorial Algorithms, (264-276)

Bu G, Potop-Butucaru M and Rabie M Wireless Broadcast with Short Labels Networked Systems, (146-169)

Demianiuk V, Nikolenko S, Chuprikov P and Kogan K (2020). New Alternatives to Optimize Policy Classifiers, IEEE/ACM Transactions on Networking, 28:3, (1088-1101), Online publication date: 1-Jun-2020.

Dumitrescu A (2020). On the shortest separating cycle, Computational Geometry: Theory and Applications, 88:C, Online publication date: 1-Jun-2020.

Bose P, De Carufel J, Shaikhet A and Smid M (2020). Optimal Art Gallery Localization is NP-hard, Computational Geometry: Theory and Applications, 88:C, Online publication date: 1-Jun-2020.

Araújo J, Campos V, Maia A, Sau I and Silva A (2019). On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths, Algorithmica, 82:6, (1616-1639), Online publication date: 1-Jun-2020.

Eremeev A, Kovalyov M and Pyatkin A On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances Learning and Intelligent Optimization, (40-45)

Kamal N, Gupta A, Singla A, Tiwari S, Kohli P, Roy S and Bhattacharya B (2020). Architectural Design of Flow-Based Microfluidic Biochips for Multi-Target Dilution of Biochemical Fluids, ACM Transactions on Design Automation of Electronic Systems, 25:3, (1-34), Online publication date: 14-May-2020.

Song M, Xu X, E H and Hu Y Algorithm for Automatic Layout of Logo Pictures for Visualization of Ecological Map in Strategic Consulting Proceedings of the 2020 Asia Service Sciences and Software Engineering Conference, (120-126)

Bökler F, Chimani M, Wagner M and Wiedera T An Experimental Study of ILP Formulations for the Longest Induced Path Problem Combinatorial Optimization, (89-101)

Barbato M, Grappe R, Lacroix M and Lancini E On k-edge-connected Polyhedra: Box-TDIness in Series-Parallel Graphs Combinatorial Optimization, (27-41)

Madarasi P The Distance Matching Problem Combinatorial Optimization, (202-213)

Bendotti P, Chrétienne P, Fouilhoux P and Pass-Lanneau A Anchored Rescheduling Problems Under Generalized Precedence Constraints Combinatorial Optimization, (156-166)

Xiao M and Sheng Z (2020). Improved parameterized algorithms and kernels for mixed domination, Theoretical Computer Science, 815:C, (109-120), Online publication date: 2-May-2020.

Kim H, Min S, Park K, Lin X, Hong S and Han W (2020). IDAR, Proceedings of the VLDB Endowment, 13:9, (1456-1468), Online publication date: 1-May-2020.

Zhang H, Rusmevichientong P and Topaloglu H (2020). Assortment Optimization Under the Paired Combinatorial Logit Model, Operations Research, 68:3, (741-761), Online publication date: 1-May-2020.

Bakhteh S, Ghaffari-Hadigheh A and Chaparzadeh N (2020). Identification of Minimum Set of Master Regulatory Genes in Gene Regulatory Networks, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 17:3, (999-1009), Online publication date: 1-May-2020.

Dębski M, Junosza-Szaniawski K and Lonc Z (2020). Bundling all shortest paths, Discrete Applied Mathematics, 277:C, (82-91), Online publication date: 30-Apr-2020.

Bliznets I, Cygan M, Komosa P, Pilipczuk M and Mach L (2020). Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems, ACM Transactions on Algorithms, 16:2, (1-31), Online publication date: 27-Apr-2020.

Delgrange F, Katoen J, Quatmann T and Randour M Simple Strategies in Multi-Objective MDPs Tools and Algorithms for the Construction and Analysis of Systems, (346-364)

Galby E, Munaro A and Ries B (2020). Semitotal Domination, Theoretical Computer Science, 814:C, (28-48), Online publication date: 24-Apr-2020.

Fan W, Liu M, Tian C, Xu R and Zhou J (2020). Incrementalization of graph partitioning algorithms, Proceedings of the VLDB Endowment, 13:8, (1261-1274), Online publication date: 1-Apr-2020.

Chen X, Dathathri R, Gill G and Pingali K (2020). Pangolin, Proceedings of the VLDB Endowment, 13:8, (1190-1205), Online publication date: 1-Apr-2020.

Mittal A, Gokalp C and Hanasusanto G (2019). Robust Quadratic Programming with Mixed-Integer Uncertainty, INFORMS Journal on Computing, 32:2, (201-218), Online publication date: 1-Apr-2020.

Li C and Tang X (2020). On Fault-Tolerant Bin Packing for Online Resource Allocation, IEEE Transactions on Parallel and Distributed Systems, 31:4, (817-829), Online publication date: 1-Apr-2020.

Sadeh Y, Rottenstreich O, Barkan A, Kanizo Y and Kaplan H (2020). Optimal Representations of a Traffic Distribution in Switch Memories, IEEE/ACM Transactions on Networking, 28:2, (930-943), Online publication date: 1-Apr-2020.

Tang Q, Zhu L, Zhou L, Xiong J and Wei J (2020). Scheduling directed acyclic graphs with optimal duplication strategy on homogeneous multiprocessor systems, Journal of Parallel and Distributed Computing, 138:C, (115-127), Online publication date: 1-Apr-2020.

Geiser G and Schröder W (2020). Structured multi-block grid partitioning using balanced cut trees, Journal of Parallel and Distributed Computing, 138:C, (139-152), Online publication date: 1-Apr-2020.

Cao Y and Sandeep R (2020). Minimum fill-in, Information and Computation, 271:C, Online publication date: 1-Apr-2020.

Goetzmann K, Harks T and Klimm M (2020). Broadcasting a file in a communication network, Journal of Scheduling, 23:2, (211-232), Online publication date: 1-Apr-2020.

Kiermaier F, Frey M and Bard J (2020). The flexible break assignment problem for large tour scheduling problems with an application to airport ground handlers, Journal of Scheduling, 23:2, (177-209), Online publication date: 1-Apr-2020.

Della Croce F and Scatamacchia R (2018). The Longest Processing Time rule for identical parallel machines revisited, Journal of Scheduling, 23:2, (163-176), Online publication date: 1-Apr-2020.

Gupta S, Roy S, Saurabh S and Zehavi M (2019). Quadratic Vertex Kernel for Rainbow Matching, Algorithmica, 82:4, (881-897), Online publication date: 1-Apr-2020.

Drewes A, Joseph J, Gurumurthy B, Broneske D, Saake G and Pionteck T Optimising Operator Sets for Analytical Database Processing on FPGAs Applied Reconfigurable Computing. Architectures, Tools, and Applications, (30-44)

Asahiro Y, Eto H, Hanaka T, Lin G, Miyano E and Terabaru I Parameterized Algorithms for the Happy Set Problem WALCOM: Algorithms and Computation, (323-328)

Iwamoto C and Ibusuki T Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons WALCOM: Algorithms and Computation, (146-157)

Kanahara K, Katayama K, Funabiki N and Tomita E The Performance of a Metaheuristic Algorithm for Finding a Maximal Weight Clique in the Fill-in-Blank Problem Proceedings of the 2020 8th International Conference on Information and Education Technology, (257-261)

Aziz H and Monnot J (2020). Computing and testing Pareto optimal committees, Autonomous Agents and Multi-Agent Systems, 34:1, Online publication date: 25-Mar-2020.

Zhu B (2020). Computational Geometry Column 70, ACM SIGACT News, 51:1, (105-117), Online publication date: 12-Mar-2020.

Kunal K, Dhar T, Madhusudan M, Poojary J, Sharma A, Xu W, Burns S, Hu J, Harjani R and Sapatnekar S GANA Proceedings of the 23rd Conference on Design, Automation and Test in Europe, (55-60)

Erdélyi G, Reger C and Yang Y (2019). The complexity of bribery and control in group identification, Autonomous Agents and Multi-Agent Systems, 34:1, Online publication date: 9-Mar-2020.

Xiong C, Huang J and Lu X (2019). Framework for city‐scale building seismic resilience simulation and repair scheduling with labor constraints driven by time–history analysis, Computer-Aided Civil and Infrastructure Engineering, 35:4, (322-341), Online publication date: 4-Mar-2020.

Arvind V, Fuhlbrück F, Köbler J and Verbitsky O On the Weisfeiler-Leman Dimension of Fractional Packing Language and Automata Theory and Applications, (357-368)

Dondi R, Mauri G and Zoppis I Complexity Issues of String to Graph Approximate Matching Language and Automata Theory and Applications, (248-259)

Gupta H, Sharma M, Franklin A. A and Tamma B (2020). Apt-RAN: A Flexible Split-Based 5G RAN to Minimize Energy Consumption and Handovers, IEEE Transactions on Network and Service Management, 17:1, (473-487), Online publication date: 1-Mar-2020.

Juma N, Shahen J, Bijon K and Tripunitara M (2020). The Overhead from Combating Side-Channels in Cloud Systems Using VM-Scheduling, IEEE Transactions on Dependable and Secure Computing, 17:2, (422-435), Online publication date: 1-Mar-2020.

Nagata Y, Imamiya A and Ono N (2021). A genetic algorithm for the picture maze generation problem, Computers and Operations Research, 115:C, Online publication date: 1-Mar-2020.

Reveliotis S (2020). On the state liveness of some classes of guidepath-based transport systems and its computational complexity, Automatica (Journal of IFAC), 113:C, Online publication date: 1-Mar-2020.

Wang Y, Li C and Yin M (2020). A two phase removing algorithm for minimum independent dominating set problem, Applied Soft Computing, 88:C, Online publication date: 1-Mar-2020.

Zeng M and Fodor V (2020). Energy minimization for delay constrained mobile edge computing with orthogonal and non-orthogonal multiple access, Ad Hoc Networks, 98:C, Online publication date: 1-Mar-2020.

Caruccio L, Deufemia V and Polese G (2019). Mining relaxed functional dependencies from data, Data Mining and Knowledge Discovery, 34:2, (443-477), Online publication date: 1-Mar-2020.

Fernandes I, Goldbarg E, Maia S and Goldbarg M (2019). Empirical study of exact algorithms for the multi-objective spanning tree, Computational Optimization and Applications, 75:2, (561-605), Online publication date: 1-Mar-2020.

Agarwal P and Pan J (2019). Near-Linear Algorithms for Geometric Hitting Sets and Set Covers, Discrete & Computational Geometry, 63:2, (460-482), Online publication date: 1-Mar-2020.

de Jong J and Uetz M (2019). The quality of equilibria for set packing and throughput scheduling games, International Journal of Game Theory, 49:1, (321-344), Online publication date: 1-Mar-2020.

Yao Y, Guo S, Li P, Liu G and Zeng Y (2020). Forecasting assisted VNF scaling in NFV-enabled networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, 168:C, Online publication date: 26-Feb-2020.

Hemaspaandra E, Hemaspaandra L and Menton C (2020). Search versus Decision for Election Manipulation Problems, ACM Transactions on Computation Theory, 12:1, (1-42), Online publication date: 25-Feb-2020.

Fernau H, Manea F, Mercaş R and Schmid M (2020). Pattern Matching with Variables, ACM Transactions on Computation Theory, 12:1, (1-37), Online publication date: 25-Feb-2020.

Mills K, Chandrasekaran R and Mittal N (2020). Algorithms for optimal replica placement under correlated failure in hierarchical failure domains, Theoretical Computer Science, 809:C, (482-518), Online publication date: 24-Feb-2020.

Jena S and Das G Vertex-Edge Domination in Unit Disk Graphs Algorithms and Discrete Applied Mathematics, (67-78)

Hell P, Hernández-Cruz C and Sanyal A Partitioning Cographs into Two Forests and One Independent Set Algorithms and Discrete Applied Mathematics, (15-27)

Georgiadis L, Italiano G and Karanasiou A (2020). Approximating the smallest 2-vertex connected spanning subgraph of a directed graph, Theoretical Computer Science, 807:C, (185-200), Online publication date: 6-Feb-2020.

Hanaka T, Ito T, Mizuta H, Moore B, Nishimura N, Subramanya V, Suzuki A and Vaidyanathan K (2020). Reconfiguring spanning and induced subgraphs, Theoretical Computer Science, 806:C, (553-566), Online publication date: 2-Feb-2020.

Wu G, Chen J and Wang J (2020). Improved approximation algorithms for two-stage flowshops scheduling problem, Theoretical Computer Science, 806:C, (509-515), Online publication date: 2-Feb-2020.

Jäger G and Drewes F (2020). The metric dimension of Z n × Z n × Z n is ⌊3n/2⌋, Theoretical Computer Science, 806:C, (344-362), Online publication date: 2-Feb-2020.

Chen L, Hsieh S, Hung L and Klasing R (2020). Approximation algorithms for the p-hub center routing problem in parameterized metric graphs, Theoretical Computer Science, 806:C, (271-280), Online publication date: 2-Feb-2020.

You J, Shi F, Wang J and Feng Q (2020). Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition, Theoretical Computer Science, 806:C, (256-270), Online publication date: 2-Feb-2020.

Yi E (2020). On the broadcast domination number of permutation graphs, Theoretical Computer Science, 806:C, (171-183), Online publication date: 2-Feb-2020.

Gutin G, Ramanujan M, Reidl F and Wahlström M (2020). Alternative parameterizations of Metric Dimension , Theoretical Computer Science, 806:C, (133-143), Online publication date: 2-Feb-2020.

Bulteau L and Vialette S (2020). Recognizing binary shuffle squares is NP-hard, Theoretical Computer Science, 806:C, (116-132), Online publication date: 2-Feb-2020.

Eroh L, Kang C and Yi E (2020). The connected metric dimension at a vertex of a graph, Theoretical Computer Science, 806:C, (53-69), Online publication date: 2-Feb-2020.

Zhao L, Yang Y, Munir A, Liu A, Li Y and Qu W (2020). Optimizing Geo-Distributed Data Analytics with Coordinated Task Scheduling and Routing, IEEE Transactions on Parallel and Distributed Systems, 31:2, (279-293), Online publication date: 1-Feb-2020.

Yang Z and Yeung K (2020). SDN Candidate Selection in Hybrid IP/SDN Networks for Single Link Failure Protection, IEEE/ACM Transactions on Networking, 28:1, (312-321), Online publication date: 1-Feb-2020.

Kou C, Hu D, Yuan J and Ai W (2020). Bisection and Exact Algorithms Based on the Lagrangian Dual for a Single-Constrained Shortest Path Problem, IEEE/ACM Transactions on Networking, 28:1, (224-233), Online publication date: 1-Feb-2020.

Akrida E, Mertzios G, Spirakis P and Zamaraev V (2020). Temporal vertex cover with a sliding time window, Journal of Computer and System Sciences, 107:C, (108-123), Online publication date: 1-Feb-2020.

Zschoche P, Fluschnik T, Molter H and Niedermeier R (2020). The complexity of finding small separators in temporal graphs, Journal of Computer and System Sciences, 107:C, (72-92), Online publication date: 1-Feb-2020.

Wang Y, Pan S, Li C and Yin M (2020). A local search algorithm with reinforcement learning based repair procedure for minimum weight independent dominating set, Information Sciences: an International Journal, 512:C, (533-548), Online publication date: 1-Feb-2020.

Sangha P, Wong P and Zito M (2020). Dynamic programming optimization in line of sight networks, Information and Computation, 270:C, Online publication date: 1-Feb-2020.

Benhamiche A, Mahjoub A, Perrot N and Uchoa E (2020). Capacitated Multi-Layer Network Design with Unsplittable Demands, Discrete Optimization, 35:C, Online publication date: 1-Feb-2020.

Miotk M, Topp J and Żyliński P (2020). Disjoint dominating and 2-dominating sets in graphs, Discrete Optimization, 35:C, Online publication date: 1-Feb-2020.

Laroche P, Marchetti F, Martin S, Nagih A and Róka Z (2020). Multiple Bipartite Complete Matching Vertex Blocker Problem, Discrete Optimization, 35:C, Online publication date: 1-Feb-2020.

Liu H, Erdogan A, Lin R and Tsao H (2022). Mathematical models of political districting for more representative governments, Computers and Industrial Engineering, 140:C, Online publication date: 1-Feb-2020.

Santucci V and Ceberio J (2020). Using pairwise precedences for solving the linear ordering problem, Applied Soft Computing, 87:C, Online publication date: 1-Feb-2020.

Sharma P and Chaudhari N (2019). A Tree Based Novel Approach for Graph Coloring Problem Using Maximal Independent Set, Wireless Personal Communications: An International Journal, 110:3, (1143-1155), Online publication date: 1-Feb-2020.

Andersen P and Ras C (2019). Degree bounded bottleneck spanning trees in three dimensions, Journal of Combinatorial Optimization, 39:2, (457-491), Online publication date: 1-Feb-2020.

Ashok P, Basu Roy A and Govindarajan S (2019). Local search strikes again: PTAS for variants of geometric covering and packing, Journal of Combinatorial Optimization, 39:2, (618-635), Online publication date: 1-Feb-2020.

Singh K and Sundar S (2019). A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 24:3, (2169-2186), Online publication date: 1-Feb-2020.

Chan S and Cheney J Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming Practical Aspects of Declarative Languages, (20-36)

Hosseinzadeh M Dense Subgraphs in Biological Networks SOFSEM 2020: Theory and Practice of Computer Science, (711-719)

Berry V, Scornavacca C and Weller M Scanning Phylogenetic Networks Is NP-hard SOFSEM 2020: Theory and Practice of Computer Science, (519-530)

Knop D (2020). Partitioning graphs into induced subgraphs, Discrete Applied Mathematics, 272:C, (31-42), Online publication date: 15-Jan-2020.

Yu W, Liu Z and Bao X (2020). New LP relaxations for Minimum Cycle/Path/Tree Cover Problems, Theoretical Computer Science, 803:C, (71-81), Online publication date: 10-Jan-2020.

Liu L, Chen Y, Dong J, Goebel R, Lin G, Luo Y, Ni G, Su B, Xu Y and Zhang A (2020). Approximation algorithms for the three-machine proportionate mixed shop scheduling, Theoretical Computer Science, 803:C, (57-70), Online publication date: 10-Jan-2020.

Nguyen M, Debroy S, Calyam P, Lyu Z and Joshi T Security-aware Resource Brokering for Bioinformatics Workflows across Federated Multi-cloud Infrastructures Proceedings of the 21st International Conference on Distributed Computing and Networking, (1-10)

Qahtan A, Tang N, Ouzzani M, Cao Y and Stonebraker M (2020). Pattern functional dependencies for data cleaning, Proceedings of the VLDB Endowment, 13:5, (684-697), Online publication date: 1-Jan-2020.

Sun Y, Li G, Guan M, Ning B and Chen W (2020). Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph, Complexity, 2020, Online publication date: 1-Jan-2020.

Adasme P, Dehghan Firoozabadi A and Wang Q (2020). Degree-Constrained k-Minimum Spanning Tree Problem, Complexity, 2020, Online publication date: 1-Jan-2020.

Ning B, Sun Y, Zhao D, Xing W, Li G and Chen W (2020). Dominance-Partitioned Subgraph Matching on Large RDF Graph, Complexity, 2020, Online publication date: 1-Jan-2020.

Cao L, Hao J, Jiang D and Yang Z (2020). Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan, Complexity, 2020, Online publication date: 1-Jan-2020.

Kim S, Venet A and Thakur A (2019). Deterministic parallel fixpoint computation, Proceedings of the ACM on Programming Languages, 4:POPL, (1-33), Online publication date: 1-Jan-2020.

García-Fernández Á, Rahmathullah A and Svensson L (2020). A Metric on the Space of Finite Sets of Trajectories for Evaluation of Multi-Target Tracking Algorithms, IEEE Transactions on Signal Processing, 68, (3917-3928), Online publication date: 1-Jan-2020.

Chae J and Hong S (2020). Greedy Algorithms for Sparse and Positive Signal Recovery Based on Bit-Wise MAP Detection, IEEE Transactions on Signal Processing, 68, (4017-4029), Online publication date: 1-Jan-2020.

Abreu L, Cunha J, Prata B and Framinan J (2022). A genetic algorithm for scheduling open shops with sequence-dependent setup times, Computers and Operations Research, 113:C, Online publication date: 1-Jan-2020.

Araujo J, Santos H, Gendron B, Jena S, Brito S and Souza D (2022). Strong bounds for resource constrained project scheduling, Computers and Operations Research, 113:C, Online publication date: 1-Jan-2020.

Greco G, Lupia F and Scarcello F (2020). Coalitional games induced by matching problems, Artificial Intelligence, 278:C, Online publication date: 1-Jan-2020.

Zhao F, He X, Zhang Y, Lei W, Ma W, Zhang C and Song H (2019). A jigsaw puzzle inspired algorithm for solving large-scale no-wait flow shop scheduling problems, Applied Intelligence, 50:1, (87-100), Online publication date: 1-Jan-2020.

Cornuéjols G, Lee D and Li Y (2018). On the Rational Polytopes with Chvátal Rank 1, Mathematical Programming: Series A and B, 179:1-2, (21-46), Online publication date: 1-Jan-2020.

Tong Y, Zhou Z, Zeng Y, Chen L and Shahabi C (2019). Spatial crowdsourcing: a survey, The VLDB Journal — The International Journal on Very Large Data Bases, 29:1, (217-250), Online publication date: 1-Jan-2020.

Fang Y, Huang X, Qin L, Zhang Y, Zhang W, Cheng R and Lin X (2019). A survey of community search over big graphs, The VLDB Journal — The International Journal on Very Large Data Bases, 29:1, (353-392), Online publication date: 1-Jan-2020.

Phan H, Ellis K, Barca J and Dorin A (2019). A survey of dynamic parameter setting methods for nature-inspired swarm intelligence algorithms, Neural Computing and Applications, 32:2, (567-588), Online publication date: 1-Jan-2020.

Rahbani H, Rad N and Sadeghi M (2019). A note on the complexity of locating-total domination in graphs, Theoretical Computer Science, 799:C, (32-39), Online publication date: 24-Dec-2019.

Hespe D, Schulz C and Strash D (2019). Scalable Kernelization for Maximum Independent Sets, ACM Journal of Experimental Algorithmics, 24, (1-22), Online publication date: 17-Dec-2019.

Radermacher M, Reichard K, Rutter I and Wagner D (2019). Geometric Heuristics for Rectilinear Crossing Minimization, ACM Journal of Experimental Algorithmics, 24, (1-21), Online publication date: 17-Dec-2019.

Chimani M, Hedtke I and Wiedera T (2019). Exact Algorithms for the Maximum Planar Subgraph Problem, ACM Journal of Experimental Algorithmics, 24, (1-21), Online publication date: 17-Dec-2019.

Beullens W, Faugère J, Koussa E, Macario-Rat G, Patarin J and Perret L PKP-Based Signature Scheme Progress in Cryptology – INDOCRYPT 2019, (3-22)

Amarilli A, Ba M, Deutch D and Senellart P (2019). Computing possible and certain answers over order-incomplete data, Theoretical Computer Science, 797:C, (42-76), Online publication date: 10-Dec-2019.

Priyadarsini M, Mukherjee J, Bera P, Kumar S, Jakaria A and Rahman M (2019). An adaptive load balancing scheme for software-defined network controllers, Computer Networks: The International Journal of Computer and Telecommunications Networking, 164:C, Online publication date: 9-Dec-2019.

Celli A, Marchesi A, Bianchi T and Gatti N Learning to correlate in multi-player general-sum sequential games Proceedings of the 33rd International Conference on Neural Information Processing Systems, (13076-13086)

Adiga A, Barrett C, Eubank S, Kuhlman C, Marathe M, Mortveit H, Ravi S, Rosenkrantz D, Stearns R, Swarup S and Vullikanti A Validating agent-based models of large networked systems Proceedings of the Winter Simulation Conference, (2807-2818)

Jafari Rad N (2022). On the complexity of multiple bondage in graphs, Theoretical Computer Science, 796:C, (180-186), Online publication date: 3-Dec-2019.

Tellache N, Boudhar M and Yalaoui F (2022). Two-machine open shop problem with agreement graph, Theoretical Computer Science, 796:C, (154-168), Online publication date: 3-Dec-2019.

Döcker J, Linz S and Semple C (2022). Displaying trees across two phylogenetic networks, Theoretical Computer Science, 796:C, (129-146), Online publication date: 3-Dec-2019.

Siddiqui H, Hayat S, Khan A, Imran M, Razzaq A and Liu J (2022). Resolvability and fault-tolerant resolvability structures of convex polytopes, Theoretical Computer Science, 796:C, (114-128), Online publication date: 3-Dec-2019.

Lazarev D and Kuzyurin N (2019). On Online Algorithms for Bin, Strip, and Box Packing, and Their Worst-Case and Average-Case Analysis, Programming and Computing Software, 45:8, (448-457), Online publication date: 1-Dec-2019.

Wang K, Gu Y, Zhou T and Chen H (2019). Multi-Pair Active Shielding for Security IC Protection, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 38:12, (2321-2329), Online publication date: 1-Dec-2019.

Sandi G, Vascon S and Pelillo M (2019). Hypergraph isomorphism using association hypergraphs, Pattern Recognition Letters, 128:C, (393-399), Online publication date: 1-Dec-2019.

Chaurasia S and Kim J (2019). An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Information Sciences: an International Journal, 505:C, (1-31), Online publication date: 1-Dec-2019.

Castiglioni M, Marchesi A, Gatti N and Coniglio S (2019). Leadership in singleton congestion games, Artificial Intelligence, 277:C, Online publication date: 1-Dec-2019.

Horn M, Raidl G and Blum C (2019). Job sequencing with one common and multiple secondary resources, Artificial Intelligence, 277:C, Online publication date: 1-Dec-2019.

Segal-Halevi E and Suksompong W (2019). Democratic fair allocation of indivisible goods, Artificial Intelligence, 277:C, Online publication date: 1-Dec-2019.

Dehmer M, Chen Z, Shi Y, Zhang Y, Tripathi S, Ghorbani M, Mowshowitz A and Emmert-Streib F (2019). On efficient network similarity measures, Applied Mathematics and Computation, 362:C, Online publication date: 1-Dec-2019.

Luo W, Xu Y, Tong W and Lin G (2019). Single-machine scheduling with job-dependent machine deterioration, Journal of Scheduling, 22:6, (691-707), Online publication date: 1-Dec-2019.

Ye Z, Yu M and Liu Y (2019). NP-completeness of optimal planning problem for modular robots, Autonomous Robots, 43:8, (2261-2270), Online publication date: 1-Dec-2019.

Crampton J, Gutin G, Koutecký M and Watrigant R (2019). Parameterized resiliency problems, Theoretical Computer Science, 795:C, (478-491), Online publication date: 26-Nov-2019.

Cai L and Ye J (2019). Two edge-disjoint paths with length constraints, Theoretical Computer Science, 795:C, (275-284), Online publication date: 26-Nov-2019.

Nishikawa H, Shimada K, Taniguchi I and Tomiyama H (2019). Energy-aware scheduling of malleable fork-join tasks under a deadline constraint on heterogeneous multicores, ACM SIGBED Review, 16:3, (57-62), Online publication date: 25-Nov-2019.

Liu J, Yue X and Chen Z A Note on Polynomial-time Solvability for Edge Packing on Graphs Proceedings of the 2019 9th International Conference on Communication and Network Security, (118-122)

Kononov A, Kovalyov M and Lin B (2019). Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P||C max , Theoretical Computer Science, 793:C, (70-78), Online publication date: 12-Nov-2019.

Yu W, Liu Z and Bao X (2019). New approximation algorithms for the minimum cycle cover problem, Theoretical Computer Science, 793:C, (44-58), Online publication date: 12-Nov-2019.

Huang Z, Li S, Cheng G, Kharlamov E and Qu Y MiCRon Proceedings of the 28th ACM International Conference on Information and Knowledge Management, (2901-2904)

Baum M, Dibbelt J, Gemsa A, Wagner D and Zündorf T (2019). Shortest Feasible Paths with Charging Stops for Battery Electric Vehicles, Transportation Science, 53:6, (1627-1655), Online publication date: 1-Nov-2019.

Fokkink R, Lidbetter T and Végh L (2019). On Submodular Search and Machine Scheduling, Mathematics of Operations Research, 44:4, (1431-1449), Online publication date: 1-Nov-2019.

Chen Z, Zhou H and Gu J (2019). R-Accelerator: An RRAM-Based CGRA Accelerator With Logic Contraction, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 27:11, (2655-2667), Online publication date: 1-Nov-2019.

Pascual F and Rzadca K (2019). Optimizing Egalitarian Performance when Colocating Tasks with Types for Cloud Data Center Resource Management, IEEE Transactions on Parallel and Distributed Systems, 30:11, (2523-2535), Online publication date: 1-Nov-2019.

Cosmi M, Oriolo G, Piccialli V and Ventura P (2022). Single courier single restaurant meal delivery (without routing), Operations Research Letters, 47:6, (537-541), Online publication date: 1-Nov-2019.

Bachmeier G, Brandt F, Geist C, Harrenstein P, Kardel K, Peters D and Seedig H (2019). k-Majority digraphs and the hardness of voting with a constant number of voters, Journal of Computer and System Sciences, 105:C, (130-157), Online publication date: 1-Nov-2019.

Chen R, Yuan J and Lu L (2019). Single-machine scheduling with positional due indices and positional deadlines, Discrete Optimization, 34:C, Online publication date: 1-Nov-2019.

Matsuoka T and Szigeti Z (2019). Polymatroid-based capacitated packing of branchings, Discrete Applied Mathematics, 270:C, (190-203), Online publication date: 1-Nov-2019.

Kutiel G and Rawitz D (2019). Service chain placement in SDNs, Discrete Applied Mathematics, 270:C, (168-180), Online publication date: 1-Nov-2019.

Almeida M and Brás R (2019). The maximum l-triangle k-club problem, Computers and Operations Research, 111:C, (258-270), Online publication date: 1-Nov-2019.

Foutlane O, El Hallaoui I and Hansen P (2019). Integral simplex using double decomposition for set partitioning problems, Computers and Operations Research, 111:C, (243-257), Online publication date: 1-Nov-2019.

Özer A (2019). A double auction based mathematical market model and heuristics for internet-based secondhand durable good markets, Computers and Operations Research, 111:C, (116-129), Online publication date: 1-Nov-2019.

Nip K and Wang Z (2019). On the approximability of the two-phase knapsack problem, Journal of Combinatorial Optimization, 38:4, (1155-1179), Online publication date: 1-Nov-2019.

Li J, Tharmarasa R, Brown D, Kirubarajan T and Pattipati K (2019). A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, Computational Optimization and Applications, 74:2, (481-516), Online publication date: 1-Nov-2019.

Schmidt M, Sirvent M and Wollner W (2019). A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Mathematical Programming: Series A and B, 178:1-2, (449-483), Online publication date: 1-Nov-2019.

Chen L, Lu H, Li H, Wang G and Chen L (2019). Dimension-by-dimension enhanced cuckoo search algorithm for global optimization, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:21, (11297-11312), Online publication date: 1-Nov-2019.

Nasiri M, Salesi S, Rahbari A, Salmanzadeh Meydani N and Abdollai M (2019). A data mining approach for population-based methods to solve the JSSP, Soft Computing - A Fusion of Foundations, Methodologies and Applications, 23:21, (11107-11122), Online publication date: 1-Nov-2019.

Chen Z, Lin G, Wang L, Chen Y and Wang D (2019). Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem, Algorithmica, 81:11-12, (4167-4199), Online publication date: 1-Nov-2019.

Hanaka T, Kiya H, Maei Y and Ono H Computational Complexity of Hedonic Games on Sparse Graphs PRIMA 2019: Principles and Practice of Multi-Agent Systems, (576-584)

Bonakdarpour B and Finkbeiner B Program Repair for Hyperproperties Automated Technology for Verification and Analysis, (423-441)

Lange P and Rothe J Optimizing Social Welfare in Social Networks Algorithmic Decision Theory, (81-96)

Gu Q, Liang J and Zhang G (2019). Efficient algorithms for ridesharing of personal vehicles, Theoretical Computer Science, 788:C, (79-94), Online publication date: 8-Oct-2019.

Erlebach T, Liu F, Liu H, Shalom M, Wong P and Zaks S (2019). Complexity and online algorithms for minimum skyline coloring of intervals, Theoretical Computer Science, 788:C, (66-78), Online publication date: 8-Oct-2019.

Goldreich O, Micali S and Wigderson A Proofs that yield nothing but their validity and a methodology of cryptographic protocol design Providing Sound Foundations for Cryptography, (285-306)

Stöcker B, Schäfer T, Mutzel P, Köster J, Kriege N and Rahmann S Protein Complex Similarity Based on Weisfeiler-Lehman Labeling Similarity Search and Applications, (308-322)

Kel’manov A and Ruzankin P (2019). An Accelerated Exact Algorithm for the One-Dimensional M-Variance Problem, Pattern Recognition and Image Analysis, 29:4, (573-576), Online publication date: 1-Oct-2019.

He Q, Dan G and Fodor V (2019). Joint Assignment and Scheduling for Minimizing Age of Correlated Information, IEEE/ACM Transactions on Networking, 27:5, (1887-1900), Online publication date: 1-Oct-2019.

Zheng J, Xu H, Zhu X, Chen G and Geng Y (2019). Sentinel, IEEE/ACM Transactions on Networking, 27:5, (1859-1872), Online publication date: 1-Oct-2019.

Ekanayake S, Cadena J, Wickramasinghe U and Vullikanti A (2019). MIDAS, Journal of Parallel and Distributed Computing, 132:C, (363-382), Online publication date: 1-Oct-2019.

Cabarle F, de la Cruz R, Cailipan D, Zhang D, Liu X and Zeng X (2019). On solutions and representations of spiking neural P systems with rules on synapses, Information Sciences: an International Journal, 501:C, (30-49), Online publication date: 1-Oct-2019.

Yardimci A and Karpuz C (2022). Shortest path optimization of haul road design in underground mines using an evolutionary algorithm, Applied Soft Computing, 83:C, Online publication date: 1-Oct-2019.

Chen R and Yuan J (2019). Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines, Journal of Scheduling, 22:5, (595-601), Online publication date: 1-Oct-2019.

Kovalyov M and Šešok D (2019). Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity, Journal of Scheduling, 22:5, (603-606), Online publication date: 1-Oct-2019.

Kasperski A and Zieliński P (2019). Risk-averse single machine scheduling: complexity and approximation, Journal of Scheduling, 22:5, (567-580), Online publication date: 1-Oct-2019.

Chen R, Yuan J and Gao Y (2019). The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs, Journal of Scheduling, 22:5, (581-593), Online publication date: 1-Oct-2019.

Darkooti M, Alhevaz A, Rahimi S and Rahbani H (2019). On perfect Roman domination number in trees: complexity and bounds, Journal of Combinatorial Optimization, 38:3, (712-720), Online publication date: 1-Oct-2019.

Gao Y and Yuan J (2019). Unbounded parallel-batch scheduling under agreeable release and processing to minimize total weighted number of tardy jobs, Journal of Combinatorial Optimization, 38:3, (698-711), Online publication date: 1-Oct-2019.

Ouldrabah L, Blidia M and Bouchou A (2019). On the k-domination number of digraphs, Journal of Combinatorial Optimization, 38:3, (680-688), Online publication date: 1-Oct-2019.

Ouldrabah L, Blidia M and Bouchou A (2019). Extremal digraphs for an upper bound on the Roman domination number, Journal of Combinatorial Optimization, 38:3, (667-679), Online publication date: 1-Oct-2019.

Máximo V and Nascimento M (2019). Intensification, learning and diversification in a hybrid metaheuristic: an efficient unification, Journal of Heuristics, 25:4-5, (539-564), Online publication date: 1-Oct-2019.

Sun W, Hao J and Caminada A (2019). Iterated backtrack removal search for finding k-vertex-critical subgraphs, Journal of Heuristics, 25:4-5, (565-590), Online publication date: 1-Oct-2019.

Biskup J and Preuß M (2019). Checking inference-proofness of attribute-disjoint and duplicate-preserving fragmentations, Annals of Mathematics and Artificial Intelligence, 87:1-2, (43-82), Online publication date: 1-Oct-2019.

Dasler P and Mount D (2019). Modular Circulation and Applications to Traffic Management, Algorithmica, 81:10, (4098-4117), Online publication date: 1-Oct-2019.

Freydenberger D (2019). A Logic for Document Spanners, Theory of Computing Systems, 63:7, (1679-1754), Online publication date: 1-Oct-2019.

Anjos M and Neto J (2019). Spectral bounds for graph partitioning with prescribed partition sizes, Discrete Applied Mathematics, 269:C, (200-210), Online publication date: 30-Sep-2019.

Cabrera Martínez A, Kuziak D and Yero I (2019). Outer-independent total Roman domination in graphs, Discrete Applied Mathematics, 269:C, (107-119), Online publication date: 30-Sep-2019.

Bilò V, Gourvès L and Monnot J On a Simple Hedonic Game with Graph-Restricted Communication Algorithmic Game Theory, (252-265)

Kaznatcheev A, Cohen D and Jeavons P Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search Principles and Practice of Constraint Programming, (300-316)

Wu G, Chen J and Wang J (2019). On scheduling inclined jobs on multiple two-stage flowshops, Theoretical Computer Science, 786:C, (67-77), Online publication date: 27-Sep-2019.

Angelini P, Bekos M, Kaufmann M and Schneck T Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity Graph Drawing and Network Visualization, (253-267)

Firman O, Kindermann P, Ravsky A, Wolff A and Zink J Computing Height-Optimal Tangles Faster Graph Drawing and Network Visualization, (203-215)

Chaplick S, Kindermann P, Löffler A, Thiele F, Wolff A, Zaft A and Zink J Stick Graphs with Length Constraints Graph Drawing and Network Visualization, (3-17)

Carmi P, Maheshwari A, Mehrabi S and Xavier da Silveira L (2019). Approximability of covering cells with line segments, Theoretical Computer Science, 784:C, (133-141), Online publication date: 13-Sep-2019.

Subramani K, Caskurlu B and Acikalin U Security-Aware Database Migration Planning Algorithmic Aspects of Cloud Computing, (103-121)

Rosenstock N, Piccini J, Rela G, Robledo F and Romero P GRASP Heuristics for the Stochastic Weighted Graph Fragmentation Problem Machine Learning, Optimization, and Data Science, (422-433)

Almulhim A, Dave V and Hasan M Network Alignment Using Graphlet Signature and High Order Proximity Machine Learning, Optimization, and Data Science, (130-142)

Manea F and Schmid M Matching Patterns with Variables Combinatorics on Words, (1-27)

Alattar M and Sali A Keys in Relational Databases with Nulls and Bounded Domains Advances in Databases and Information Systems, (33-50)

Ren Y, Sarkar A, Ay A, Dobra A and Kahveci T Finding Conserved Patterns in Multilayer Networks Proceedings of the 10th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics, (97-102)

Hochbaum D and Rao X (2019). The Replenishment Schedule to Minimize Peak Storage Problem, Operations Research, 67:5, (1345-1361), Online publication date: 1-Sep-2019.

Nayebi M and Ruhe G (2019). Asymmetric Release Planning: Compromising Satisfaction against Dissatisfaction, IEEE Transactions on Software Engineering, 45:9, (839-857), Online publication date: 1-Sep-2019.

Tran T and Pompili D (2019). Adaptive Bitrate Video Caching and Processing in Mobile-Edge Computing Networks, IEEE Transactions on Mobile Computing, 18:9, (1965-1978), Online publication date: 1-Sep-2019.

Fu C, Liu Q, Wu P, Li M, Xue C, Zhao Y, Hu J and Han S (2019). Real-Time Data Retrieval in Cyber-Physical Systems with Temporal Validity and Data Availability Constraints, IEEE Transactions on Knowledge and Data Engineering, 31:9, (1779-1793), Online publication date: 1-Sep-2019.

Riva A, Rufi A, Banfi J and Amigoni F (2019). Algorithms for limited-buffer shortest path problems in communication-restricted environments, Robotics and Autonomous Systems, 119:C, (221-230), Online publication date: 1-Sep-2019.

Wang J, Song H, Li J, Lin Q and Cheng L (2022). Modular exponential multivariate sequence and its application to lightweight security design, Future Generation Computer Systems, 98:C, (435-443), Online publication date: 1-Sep-2019.

Li S, Chen W, Chen Y, Chen C and Zheng Z (2019). Makespan-minimized computation offloading for smart toys in edge-cloud computing, Electronic Commerce Research and Applications, 37:C, Online publication date: 1-Sep-2019.

El-Ashmawi W and Elminaam D (2019). A modified squirrel search algorithm based on improved best fit heuristic and operator strategy for bin packing problem, Applied Soft Computing, 82:C, Online publication date: 1-Sep-2019.

Corus D, Oliveto P and Yazdani D (2019). Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem, Artificial Intelligence, 274:C, (180-196), Online publication date: 1-Sep-2019.

Malinovsky Y (2019). Sterrett Procedure for the Generalized Group Testing Problem, Methodology and Computing in Applied Probability, 21:3, (829-840), Online publication date: 1-Sep-2019.

Beynier A, Chevaleyre Y, Gourvès L, Harutyunyan A, Lesca J, Maudet N and Wilczynski A (2019). Local envy-freeness in house allocation problems, Autonomous Agents and Multi-Agent Systems, 33:5, (591-627), Online publication date: 1-Sep-2019.

Gupta S, Panolan F, Saurabh S and Zehavi M (2019). Stability in barter exchange markets, Autonomous Agents and Multi-Agent Systems, 33:5, (518-539), Online publication date: 1-Sep-2019.

Liu H, Fu X, Ye C, Chai S and Liu L (2019). Atlas refinement with bounded packing efficiency, ACM Transactions on Graphics, 38:4, (1-13), Online publication date: 31-Aug-2019.

Raczek J and Cyman J (2019). Weakly connected Roman domination in graphs, Discrete Applied Mathematics, 267:C, (151-159), Online publication date: 31-Aug-2019.