human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a linear time algorithm for maximum cardinality matching on cocomparability graphs"
  Abstract: Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For general m-edge and n-vertex graphs, it is well-known to be solvable in $O(m \sqrt{n})$ time. We develop a linear-time algorithm to find maximum-cardinality matchings on cocomparability graphs, a prominent subclass of perfect graphs that contains interval graphs as well as permutation graphs. Our algorithm is based on the recently discovered Lexicographic Depth First Search (LDFS).

Connected through hyperedge HE-1 (induced by source paper "on adaptive algorithms for maximum matching"):
  with members:
    - "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs"
    - "efficient and adaptive parameterized algorithms on modular decompositions"
    - "parameterized aspects of triangle enumeration"
    - "robust and adaptive search"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "simplified algorithmic metatheorems beyond mso treewidth and neighborhood diversity"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "navigating central path with electrical flows from flows to matchings and back"

Connected through hyperedge HE-2 (induced by source paper "a quasi linear time b matching algorithm on distance hereditary graphs and bounded split width graphs"):
  with members:
    - "parameterized aspects of triangle enumeration"
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "the weighted matching approach to maximum cardinality matching"
    - "on the power of tree depth for fully polynomial fpt algorithms"
    - "when can graph hyperbolicity be computed in linear time"
    - "data structures for weighted matching and extensions to b matching and f factors"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "linear time split decomposition revisited"

Connected through hyperedge HE-3 (induced by source paper "the use of a pruned modular decomposition for maximum matching algorithms on some graph classes"):
  with members:
    - "fully polynomial fpt algorithms for some classes of bounded clique width graphs"
    - "the weighted matching approach to maximum cardinality matching"
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"
    - "algorithms parameterized by vertex cover and modular width through potential maximal cliques"
    - "parameterized algorithms for modular width"

Connected through hyperedge HE-4 (induced by source paper "listing conflicting triples in optimal time"):
  with members:
    - "fully polynomial time parameterized computations for graphs and matrices of low treewidth"

Connected through hyperedge HE-5 (induced by source paper "parameterized algorithms for power efficient connected symmetric wireless sensor networks"):
  with members:
    - "a parameterized approximation algorithm for the mixed and windy capacitated arc routing problem theory and experiments"
    - "parameterized aspects of triangle enumeration"
    - "minimum power range assignment for symmetric connectivity in sensor networks with two power levels"
    - "raising the bar for vertex cover fixed parameter tractability above a higher guarantee"
    - "on multiway cut parameterized above lower bounds"

Connected through hyperedge HE-6 (induced by source paper "maximum induced matching algorithms via vertex ordering characterizations"):
  with members:
    - "towards a unified view of linear structure on graph classes"
    - "linear time lexdfs on cocomparability graphs"
    - "ordering without forbidden patterns"
    - "a simple polynomial algorithm for the longest path problem on cocomparability graphs"
    - "minimizing flow time in the wireless gathering problem"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.DS(Data Structures and Algorithms)