Nearly-Linear Time Seeded Extractors With Short Seeds

Authors: Doron, D., Ribeiro, J.

Source: IEEE Transactions on Information Theory IEEE Trans. Inform. Theory Information Theory, IEEE Transactions on. 71(11):9028-9054 Nov, 2025

Solving NP-hard problems on GATEX graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets

Authors: Hellmuth, Marc, 1980, Scholz, Guillaume E.

Source: Theoretical Computer Science. 1037

Subject Terms: Cograph, Galled-tree, Linear-time algorithms, Modular decomposition, NP-hard problems

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-241848
https://doi.org/10.1016/j.tcs.2025.115157

New Structures and Algorithms for Length-Constrained Expander Decompositions

Authors: Haeupler, Bernhard, Hershkowitz, D Ellis, Tan, Zihan

Source: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS) FOCS Foundations of Computer Science (FOCS), 2024 IEEE 65th Annual Symposium on. :1634-1645 Oct, 2024

Relation: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Authors: Chien-Chung Huang, François Sellier

Contributors: Huang, Chien-Chung

Source: Algorithmica. 86:3598-3628

Subject Terms: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

File Description: application/pdf

Access URL: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

On complementarily transitivity of graphs

Authors: Santra, Kamal ^⁎

Source: In Theoretical Computer Science 22 December 2025 1058

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Authors: Gottesbüren, Lars, Maas, Nikolai, Rosch, Dominik, Sanders, Peter, Seemaier, Daniel

Contributors: Lars Gottesbüren and Nikolai Maas and Dominik Rosch and Peter Sanders and Daniel Seemaier

Subject Terms: FOS: Computer and information sciences, Linear Time Algorithms, Graph Partitioning, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph Algorithms, ddc:004, Graph Sparsification

File Description: application/pdf

Access URL: http://arxiv.org/abs/2504.17615
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.32

Realization of Temporally Connected Graphs Based on Degree Sequences

Authors: Casteigts, Arnaud, Döring, Michelle, Morawietz, Nils

Contributors: Arnaud Casteigts and Michelle Döring and Nils Morawietz

Subject Terms: temporal paths, gossiping, (multi)graphical degree sequences, edge-disjoint spanning trees, linear time algorithms

File Description: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.17

Availability: https://doi.org/10.4230/LIPIcs.ISAAC.2025.17
https://nbn-resolving.org/urn:nbn:de:0030-drops-249256
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.17

Testing Depth First Search Numbering

Authors: Czumaj, Artur, Sohler, Christian, Walzer, Stefan

Subject Terms: Randomized Algorithms, Graph Algorithms, Property Testing, Theory of computation → Streaming, sublinear and near linear time algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

File Description: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; https://publikationen.bibliothek.kit.edu/1000185667; https://publikationen.bibliothek.kit.edu/1000185667/167997099; https://doi.org/10.5445/IR/1000185667

Availability: https://publikationen.bibliothek.kit.edu/1000185667
https://publikationen.bibliothek.kit.edu/1000185667/167997099
https://doi.org/10.5445/IR/1000185667

Linear-Time Graph Programs for Unbounded-Degree Graphs

Authors: Ismaili Alaoui, Ziad^Aff26, Plump, Detlef^Aff26

Contributors: Hartmanis, Juris, Founding Editor^Aff1, van Leeuwen, Jan, Series Editor^Aff2, Hutchison, David, Editorial Board Member^Aff3, Kanade, Takeo, Editorial Board Member^Aff4, Kittler, Josef, Editorial Board Member^Aff5, Kleinberg, Jon M., Editorial Board Member^Aff6, Kobsa, Alfred, Series Editor^Aff7, Mattern, Friedemann, Editorial Board Member^Aff8, Mitchell, John C., Editorial Board Member^Aff9, Naor, Moni, Editorial Board Member^Aff10, Nierstrasz, Oscar, Series Editor^Aff11, Pandu Rangan, C., Editorial Board Member^Aff12, Sudan, Madhu, Series Editor^Aff13, Terzopoulos, Demetri, Editorial Board Member^Aff14, Tygar, Doug, Editorial Board Member^Aff15, Weikum, Gerhard, Series Editor^Aff16, Vardi, Moshe Y, Series Editor^Aff17, Goos, Gerhard, Founding Editor^Aff18, Bertino, Elisa, Editorial Board Member^Aff19, Gao, Wen, Editorial Board Member^Aff20, Steffen, Bernhard, Editorial Board Member^Aff21, Yung, Moti, Editorial Board Member^Aff22, Woeginger, Gerhard, Editorial Board Member^Aff23, Harmer, Russ, editor^Aff24, Kosiol, Jens, editor^Aff25

Source: Graph Transformation : 17th International Conference, ICGT 2024, Held as Part of STAF 2024, Enschede, The Netherlands, July 10–11, 2024, Proceedings. 14774:3-20

Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs

Authors: Hellmuth, Marc^Aff9, Scholz, Guillaume E.^Aff10

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Wu, Weili, editor^Aff7, Tong, Guangmo, editor^Aff8

Source: Computing and Combinatorics : 29th International Conference, COCOON 2023, Hawaii, HI, USA, December 15–17, 2023, Proceedings, Part I. 14422:115-126

Force-Directed Graph Layouts by Edge Sampling

Authors: Gove, Robert

Source: 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV) Large Data Analysis and Visualization (LDAV),2019 IEEE 9th Symposium on. :1-5 Oct, 2019

Relation: 2019 IEEE 9th Symposium on Large Data Analysis and Visualization (LDAV)

On Time-Sensitive Control Closure for Secure Information Flow

Authors: Masud, Abu Naser, Lisper, Björn

Source: Lecture Notes in Computer Science. :120-137

Subject Terms: Benchmarking, Data flow graphs, Data integrity, Data transfer, Graph algorithms, Information management, Program compilers, Sensitive data, Dependency analysis, Information flow control, Linear-time algorithms, Program execution, Secret data, Secret information, Secure information flow, Sensitive informations, Static program, Timing channels, Information leakage

File Description: print

Access URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-70995

Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time

Authors: Didimo W., Kaufmann M., Liotta G., Ortali G.

Source: Algorithmica. 85:2605-2666

Subject Terms: Linear-time algorithms, Plane graphs, Computational Geometry (cs.CG), FOS: Computer and information sciences, Bend minimization, Series–parallel graphs, Computer Science - Data Structures and Algorithms, Orthogonal drawings, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Access URL: http://arxiv.org/abs/2205.07500
https://hdl.handle.net/11391/1553147
https://doi.org/10.1007/s00453-023-01110-6

Streaming Euclidean MST to a Constant Factor

Authors: Chen, Xi, Cohen-Addad, Vincent, Jayaram, Rajesh, Levi, Amit, Waingarten, Erik

Source: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. :156-169

Availability: http://dl.acm.org/doi/10.1145/3564246.3585168

Buffered Streaming Edge Partitioning

Authors: Chhabra, Adil, Fonseca Faraj, Marcelo, Schulz, Christian, Seemaier, Daniel

Contributors: Adil Chhabra and Marcelo Fonseca Faraj and Christian Schulz and Daniel Seemaier

Subject Terms: ddc:004, graph partitioning, DATA processing & computer science, sublinear and near linear time algorithms, Theory of computation → Streaming, edge partitioning, buffered partitioning, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, streaming, online

File Description: application/pdf

Access URL: http://arxiv.org/abs/2402.11980
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.5
https://publikationen.bibliothek.kit.edu/1000173355
https://doi.org/10.5445/IR/1000173355
https://publikationen.bibliothek.kit.edu/1000173355/154079176

New Advances in Rightmost Lempel-Ziv

Authors: Ellert, Jonas^Aff10, Fischer, Johannes^Aff10, Pedersen, Max Rishøj^Aff11

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Yung, Moti, Editorial Board Member^Aff6, Nardini, Franco Maria, editor^Aff7, Pisanti, Nadia, editor^Aff8, Venturini, Rossano, editor^Aff9

Source: String Processing and Information Retrieval : 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings. 14240:188-202

Structured Watermarks for Structured Software

Authors: Bento, Lucila M. S.^{Aff1, IDs4297902402934x_cor1}, Boccardo, Davidson R., Machado, Raphael C. S., Pereira de Sá, Vinícius G., Szwarcfiter, Jayme L.^{Aff1, Aff2}

Source: SN Computer Science. 5(5)

On cherry-picking and network containment

Authors: Remie Janssen, Yukihiro Murakami

Source: Theoretical Computer Science. 856:121-150

Subject Terms: Linear-time algorithms, 0301 basic medicine, Phylogenetic networks, 0303 health sciences, 03 medical and health sciences, Cherry-picking networks, Network containment, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Tree containment, Cherry-picking sequences

Access URL: http://arxiv.org/abs/1812.08065
https://www.sciencedirect.com/science/article/pii/S0304397520307593
https://www.sciencedirect.com/science/article/abs/pii/S0304397520307593
https://www.narcis.nl/publication/RecordID/oai:tudelft.nl:uuid:6fdc6897-0883-4fc1-b3c3-f62477324d49
https://dblp.uni-trier.de/db/journals/tcs/tcs856.html#JanssenM21
http://resolver.tudelft.nl/uuid:6fdc6897-0883-4fc1-b3c3-f62477324d49

Homomorphisms to Digraphs with Large Girth and Oriented Colorings of Minimal Series-Parallel Digraphs

Authors: Gurski, Frank^Aff11, Komander, Dominique^Aff11, Lindemann, Marvin^Aff11

Contributors: Goos, Gerhard, Founding Editor^Aff1, Hartmanis, Juris, Founding Editor^Aff2, Bertino, Elisa, Editorial Board Member^Aff3, Gao, Wen, Editorial Board Member^Aff4, Steffen, Bernhard, Editorial Board Member^Aff5, Woeginger, Gerhard, Editorial Board Member^Aff6, Yung, Moti, Editorial Board Member^Aff7, Uehara, Ryuhei, editor^Aff8, Hong, Seok-Hee, editor^Aff9, Nandy, Subhas C., editor^Aff10

Source: WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings. 12635:182-194

The Power of Linear-Time Data Reduction for Maximum Matching

Authors: George B. Mertzios, André Nichterlein, Rolf Niedermeier

Contributors: George B. Mertzios and André Nichterlein and Rolf Niedermeier, Larsen, Kim G., Bodlaender, Hans L., Raskin, Jean-Francois

Source: Algorithmica, 2020, Vol.82(12), pp.3521-3565 [Peer Reviewed Journal]
Larsen, Kim G. & Bodlaender, Hans L. & Raskin, Jean-Francois (Eds.). (2017). 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) : August 21-25, 2017, Aalborg (Denmark) ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 46, LIPIcs–Leibniz International Proceedings in Informatics(83)

Subject Terms: FOS: Computer and information sciences, F.2.2, G.2.2, bipartite graphs, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, parameterized complexity analysis, 13. Climate action, FPT in P, Maximum-cardinality matching, kernelization, Computer Science - Data Structures and Algorithms, linear-time algorithms, Data Structures and Algorithms (cs.DS), ddc:004

File Description: application/pdf

Access URL: https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf
http://arxiv.org/abs/1609.08879
https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf
https://depositonce.tu-berlin.de/handle/11303/12830
https://dro.dur.ac.uk/31150/
https://link.springer.com/article/10.1007/s00453-020-00736-0
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#MertziosNN20
https://depositonce.tu-berlin.de/bitstream/11303/12830/1/Mertzios_etal_Power_2020.pdf
https://dro.dur.ac.uk/22113/
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#MertziosNN17
https://drops.dagstuhl.de/opus/volltexte/2017/8116/pdf/LIPIcs-MFCS-2017-46.pdf/
http://dro.dur.ac.uk/22113/
https://doi.org/10.4230/LIPIcs.MFCS.2017.46
https://drops.dagstuhl.de/opus/volltexte/2017/8116/
https://www.arxiv.org/abs/1609.08879
https://ui.adsabs.harvard.edu/abs/2016arXiv160908879M/abstract
https://arxiv.org/pdf/1609.08879v3
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.46
http://dro.dur.ac.uk/22113/1/22113.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2017.46
http://dro.dur.ac.uk/22113/
https://depositonce.tu-berlin.de/handle/11303/12830