Search Results - "ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS"

Refine Results
  1. 1

    Linearized Polynomial Chinese remainder codes ; Codes restes chinois sur les polynômes linéarisés

    Authors: Gaborit, Philippe Garnier, Camille Ruatta, Olivier et al.

    Contributors: Gaborit, Philippe Garnier, Camille Ruatta, Olivier et al.

    Source: https://hal.science/hal-05062636 ; 2025.

    Subject Terms: 94B05,94B35,94B70 ,11T71,11T55, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [MATH]Mathematics [math], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT], [MATH.MATH-RA]Mathematics [math]/Rings and Algebras [math.RA]

    Availability: https://hal.science/hal-05062636
    https://hal.science/hal-05062636v1/document
    https://hal.science/hal-05062636v1/file/PapierCurrent.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  2. 2

    Nonlocal Perimeters and Curvature Flows on Graphs with Applications in Image Processing and High-Dimensional Data Classification

    Authors: El Bouchairi, Imad Elmoataz, Abderrahim Fadili, Jalal M. et al.

    Contributors: El Bouchairi, Imad Elmoataz, Abderrahim Fadili, Jalal M. et al.

    Source: SIAM Journal on Imaging Sciences. 16:368-392

    Subject Terms: [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 7. Clean energy, mean curvature flow, AMS subject classifications. 68Q25, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], 14. Life underwater, Perimeter, [MATH.MATH-AP] Mathematics [math]/Analysis of PDEs [math.AP], ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, 4. Education, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], 15. Life on land, image processing, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], total variation, data clustering, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], PdE on graph, 13. Climate action, [INFO.INFO-IT] Computer Science [cs]/Information Theory [cs.IT], graph cuts, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]

    File Description: application/pdf

    Access URL: https://hal.science/hal-03631338v3/document
    https://hal.science/hal-03631338v3
    https://doi.org/10.1137/22m148598x

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Save to List
  3. 3

    Improved local search for graph edit distance

    Authors: Nicolas Boria David B. Blumenthal Sébastien Bougleux et al.

    Contributors: Nicolas Boria David B. Blumenthal Sébastien Bougleux et al.

    Source: Pattern Recognition Letters. 129:19-25

    Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, Local search, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Graph edit distance, Stochastic warm start, 02 engineering and technology, Machine Learning (cs.LG), [INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, 05C60, 68W25, 65D15, 68T20, Data Structures and Algorithms (cs.DS), ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS

    File Description: application/pdf

    Access URL: https://www.sciencedirect.com/science/article/am/pii/S016786551930306X
    http://arxiv.org/abs/1907.02929
    https://hal.science/hal-02388317v1
    https://hal.science/hal-02388317v1/document
    https://doi.org/10.1016/j.patrec.2019.10.028
    https://arxiv.org/abs/1907.02929
    https://dblp.uni-trier.de/db/journals/corr/corr1907.html#abs-1907-02929
    https://arxiv.org/pdf/1907.02929.pdf
    http://ui.adsabs.harvard.edu/abs/2019arXiv190702929B/abstract
    https://hal.archives-ouvertes.fr/hal-02388317
    https://hal.archives-ouvertes.fr/hal-02388317/document

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  4. 4

    Towards understanding the robustness against evasion attack on categorical inputs

    Authors: Bao, Hongyan Han, Yufei Zhou, Yujun et al.

    Contributors: Bao, Hongyan Han, Yufei Zhou, Yujun et al.

    Source: ICLR 2022 - 10th International Conference on Learning Representations ; https://inria.hal.science/hal-03893480 ; ICLR 2022 - 10th International Conference on Learning Representations, Apr 2022, Virtual Event, France

    Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM]

    Subject Geographic: Virtual Event, France

    Availability: https://inria.hal.science/hal-03893480
    https://inria.hal.science/hal-03893480v1/document
    https://inria.hal.science/hal-03893480v1/file/3912_towards_understanding_the_robu.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  5. 5

    The aperiodic Domino problem in higher dimension ; Le problème du Domino apériodique en dimension supérieure

    Authors: de Menibus, Benjamin Hellouin Callard, Antonin Graphes, Algorithmes et Combinatoire - LISN (GALaC) et al.

    Contributors: de Menibus, Benjamin Hellouin Callard, Antonin Graphes, Algorithmes et Combinatoire - LISN (GALaC) et al.

    Source: 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022). Leibniz International Proceedings in Informatics.
    39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
    https://hal.science/hal-03573476
    39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022), Mar 2022, Marseille, France. pp.1-15, ⟨10.4230/LIPIcs.STACS.2022.18⟩
    https://stacs2022.sciencesconf.org/

    Subject Terms: computability, tilings, effective subshift, sofic subshift, subshift of finite type, domino problem, aperiodicity, periodicity, subshift, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

    Subject Geographic: Marseille, France

    Availability: https://hal.science/hal-03573476
    https://hal.science/hal-03573476v1/document
    https://hal.science/hal-03573476v1/file/HAL.pdf
    https://doi.org/10.4230/LIPIcs.STACS.2022.18

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  6. 6

    Relationship between superstring and compression measures: New insights on the greedy conjecture

    Authors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Contributors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Source: Discrete Applied Mathematics. 245:59-64

    Subject Terms: 2. Zero hunger, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, Greedy conjecture, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: F.: Theory of Computation, Approximation algorithm, 01 natural sciences, 7. Clean energy, 12. Responsible consumption, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Common Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

    File Description: application/pdf

    Access URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340
    https://www.sciencedirect.com/science/article/pii/S0166218X1730183X
    https://hal-lirmm.ccsd.cnrs.fr/lirmm-01800340/document
    https://www.sciencedirect.com/science/article/abs/pii/S0166218X1730183X

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  7. 7

    Functional Characterization of Deformation Fields

    Authors: Corman, Etienne Ovsjanikov, Maks Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) et al.

    Contributors: Corman, Etienne Ovsjanikov, Maks Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX) et al.

    Source: ACM Transactions on Graphics

    Subject Terms: FOS: Computer and information sciences, Computer Science - Graphics, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], 02 engineering and technology, Shape exploration, functional maps, Graphics (cs.GR)

    Access URL: http://arxiv.org/pdf/1709.09701
    http://arxiv.org/abs/1709.09701
    https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002268241194543
    https://dl.acm.org/citation.cfm?id=3292480
    https://arxiv.org/abs/1709.09701
    https://hal.archives-ouvertes.fr/hal-02953326
    https://doi.org/10.1145/3292480
    https://dl.acm.org/doi/10.1145/3292480

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  8. 8

    Effect of quantified irreducibility on the computability of subshift entropy

    Authors: Gangloff, Silvère Hellouin de Menibus, Benjamin I2m, Aigle et al.

    Contributors: Gangloff, Silvère Hellouin de Menibus, Benjamin I2m, Aigle et al.

    Source: Discrete & Continuous Dynamical Systems - A. 39:1975-2000

    Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computability, Entropy, 37B50, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], 37B40, Subshift, Symbolic dynamics, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Computational Complexity, Tilings, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, F.4.3, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Mathematics - Dynamical Systems, 0101 mathematics, 37B50, 37B40, 37B10, 68Q17, Computer Science - Discrete Mathematics

    Access URL: https://www.aimsciences.org/article/exportPdf?id=0e190e9e-d545-4c7f-96de-7d6da539aa80
    http://arxiv.org/abs/1602.06166
    http://ui.adsabs.harvard.edu/abs/2016arXiv160206166G/abstract
    https://www.aimsciences.org/article/doi/10.3934/dcds.2019083
    https://hal.archives-ouvertes.fr/hal-01320671
    https://hal-univ-tlse3.archives-ouvertes.fr/INSMI/hal-01320671
    https://hal.science/hal-01320671v1
    https://doi.org/10.3934/dcds.2019083

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Save to List
  9. 9

    Nonlocal perimeters and curvature flows on graphs with applications in image processing and high-dimensional data classification

    Authors: El Bouchairi, Imad Elmoataz, Abderrahim Fadili, Jalal M. et al.

    Contributors: El Bouchairi, Imad Elmoataz, Abderrahim Fadili, Jalal M. et al.

    Source: EISSN: 1936-4954 ; SIAM Journal on Imaging Sciences ; https://hal.archives-ouvertes.fr/hal-03631338 ; SIAM Journal on Imaging Sciences, Society for Industrial and Applied Mathematics, In press

    Subject Terms: Perimeter, total variation, graph cuts, mean curvature flow, image processing, data clustering, PdE on graph, AMS subject classifications. 68Q25, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.8: Partial Differential Equations, ACM: I.: Computing Methodologies/I.4: IMAGE PROCESSING AND COMPUTER VISION, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT], [MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

    Relation: hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338; https://hal.archives-ouvertes.fr/hal-03631338v2/document; https://hal.archives-ouvertes.fr/hal-03631338v2/file/nonlocal_perimeter.pdf

    Availability: https://hal.archives-ouvertes.fr/hal-03631338
    https://hal.archives-ouvertes.fr/hal-03631338v2/document
    https://hal.archives-ouvertes.fr/hal-03631338v2/file/nonlocal_perimeter.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  10. 10

    Lexicographic optimal homologous chains and applications to point cloud triangulations

    Authors: Cohen-Steiner, David Lieutier, André Vuillamy, Julien et al.

    Contributors: Cohen-Steiner, David Lieutier, André Vuillamy, Julien et al.

    Source: SoCG 2020 - 36th International Symposium on Computational Geometry ; https://hal.science/hal-02391240 ; SoCG 2020 - 36th International Symposium on Computational Geometry, Jun 2020, Zurich, Switzerland

    Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]

    Subject Geographic: Zurich, Switzerland

    Availability: https://hal.science/hal-02391240
    https://hal.science/hal-02391240v1/document
    https://hal.science/hal-02391240v1/file/LexicographicAlgosResearchReport.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  11. 11

    Thirty-six Full Matrix Forms of the Pascal Triangle: Derivation and Symmetry Relations

    Authors: Doh, Prosper K. Adjallah, Kondo Hloindo Birregah, B. et al.

    Contributors: Doh, Prosper K. Adjallah, Kondo Hloindo Birregah, B. et al.

    Source: ISSN: 2468-2276 ; Scientific African ; https://hal.univ-lorraine.fr/hal-03321158 ; Scientific African, 2021, 13, pp.e00932. ⟨10.1016/j.sciaf.2021.e00932⟩.

    Subject Terms: Symmetry transformation, Transformation matrix, Circulant matrix, Bipartition, Pascal matrix, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.5: Computational Geometry and Object Modeling, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.7: Three-Dimensional Graphics and Realism, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation

    Availability: https://hal.univ-lorraine.fr/hal-03321158
    https://hal.univ-lorraine.fr/hal-03321158v1/document
    https://hal.univ-lorraine.fr/hal-03321158v1/file/S2468227621002362.pdf
    https://doi.org/10.1016/j.sciaf.2021.e00932

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  12. 12

    Visualization of a family of sequences of points in a toric sub-lattice of the ring of Gaussian integers ; Visualisation d'une famille de suites dans un sous-réseau torique de l'anneau des entiers de Gauss

    Authors: Bigot, Jean-François Ecole Navale (EN)

    Contributors: Bigot, Jean-François Ecole Navale (EN)

    Source: https://hal.archives-ouvertes.fr/hal-03832796 ; 2022.

    Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: I.: Computing Methodologies/I.3: COMPUTER GRAPHICS/I.3.3: Picture/Image Generation/I.3.3.5: Viewing algorithms, [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

    Relation: hal-03832796; https://hal.archives-ouvertes.fr/hal-03832796; https://hal.archives-ouvertes.fr/hal-03832796v2/document; https://hal.archives-ouvertes.fr/hal-03832796v2/file/20221027%20Bigot%20-%20visualisation%20suite%20tore%20Zi%20-%20Heuliad.pdf

    Availability: https://hal.archives-ouvertes.fr/hal-03832796
    https://hal.archives-ouvertes.fr/hal-03832796v2/document
    https://hal.archives-ouvertes.fr/hal-03832796v2/file/20221027%20Bigot%20-%20visualisation%20suite%20tore%20Zi%20-%20Heuliad.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  13. 13

    Generalized Median Graph via Iterative Alternate Minimizations ; Graph médian généralisé via des minimisations alternées.

    Authors: Boria, Nicolas Bougleux, Sébastien Gaüzère, Benoit et al.

    Contributors: Boria, Nicolas Bougleux, Sébastien Gaüzère, Benoit et al.

    Source: IAPR International workshop on Graph-Based Representation in Pattern Recognition ; https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838 ; IAPR International workshop on Graph-Based Representation in Pattern Recognition, Donatello Conte, Jean-Yves Ramel,, Jun 2019, Tours, France. pp.99-109 ; https://gbr2019.sciencesconf.org/

    Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]

    Subject Geographic: Tours, France

    Relation: info:eu-repo/semantics/altIdentifier/arxiv/1906.11009; hal-02162838; https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838; https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838/document; https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838/file/gbr19median.pdf; ARXIV: 1906.11009

    Availability: https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838
    https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838/document
    https://hal-normandie-univ.archives-ouvertes.fr/hal-02162838/file/gbr19median.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  14. 14

    Towards Dynamic-Point Systems on Metric Graphs with Longest Stabilization Time

    Authors: Dworzanski, Leonid Vysšaja škola èkonomiki = National Research University Higher School of Economics Moscow (HSE)

    Contributors: Dworzanski, Leonid Vysšaja škola èkonomiki = National Research University Higher School of Economics Moscow (HSE)

    Source: ISSN: 1462-7264.

    Subject Terms: quantum graphs, stabilization time, system of dynamic points, discrete event dynamic systems, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

    Relation: hal-02964390; https://hal.archives-ouvertes.fr/hal-02964390; https://hal.archives-ouvertes.fr/hal-02964390/document; https://hal.archives-ouvertes.fr/hal-02964390/file/OnMetricGraphs.pdf

    Availability: https://hal.archives-ouvertes.fr/hal-02964390
    https://hal.archives-ouvertes.fr/hal-02964390/document
    https://hal.archives-ouvertes.fr/hal-02964390/file/OnMetricGraphs.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  15. 15

    An Asymptotic Stability Theorem for Divide-and-Conquer Sequences

    Authors: GUEDJ, Michael Chambre de commerce et d’industrie - Paris-Île de France (CCIP IDF)

    Contributors: GUEDJ, Michael Chambre de commerce et d’industrie - Paris-Île de France (CCIP IDF)

    Source: https://hal.archives-ouvertes.fr/hal-02902407 ; 2021.

    Subject Terms: algorithm analysis, asymptotic approximations, divide- and-conquer sequences, recurrence relations, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

    Relation: hal-02902407; https://hal.archives-ouvertes.fr/hal-02902407; https://hal.archives-ouvertes.fr/hal-02902407v2/document; https://hal.archives-ouvertes.fr/hal-02902407v2/file/MICHAEL_GUEDJ__DAC__E1.pdf

    Availability: https://hal.archives-ouvertes.fr/hal-02902407
    https://hal.archives-ouvertes.fr/hal-02902407v2/document
    https://hal.archives-ouvertes.fr/hal-02902407v2/file/MICHAEL_GUEDJ__DAC__E1.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  16. 16

    On a problem of team hiring

    Authors: Liu, Jin-Yi School of Computer & Communication Engineering (CCE) Liaoning Shihua University (LNPU)

    Contributors: Liu, Jin-Yi School of Computer & Communication Engineering (CCE) Liaoning Shihua University (LNPU)

    Source: https://hal.archives-ouvertes.fr/hal-02485153 ; 2021.

    Subject Terms: ACM: G.: Mathematics of Computing, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics, [INFO]Computer Science [cs], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

    Relation: hal-02485153; https://hal.archives-ouvertes.fr/hal-02485153; https://hal.archives-ouvertes.fr/hal-02485153v2/document; https://hal.archives-ouvertes.fr/hal-02485153v2/file/2021team.pdf

    Availability: https://hal.archives-ouvertes.fr/hal-02485153
    https://hal.archives-ouvertes.fr/hal-02485153v2/document
    https://hal.archives-ouvertes.fr/hal-02485153v2/file/2021team.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Save to List
  17. 17

    The power of greedy algorithms for approximating Max-ATSP, Cyclic Cover, and superstrings

    Authors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Contributors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Source: Discrete Applied Mathematics. 212:48-60

    Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Assembly, Greedy conjecture, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Approximation algorithm, 01 natural sciences, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Shortest Superstring Problem, Data compression, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Stringology, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

    Access URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01286943v1
    https://doi.org/10.1016/j.dam.2015.06.003

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  18. 18

    A convex optimization approach for solving the single-vehicle cyclic inventory routing problem

    Authors: Wouter Lefever El-Houssaine Aghezzaf Khaled Hadj-Hamou et al.

    Contributors: Wouter Lefever El-Houssaine Aghezzaf Khaled Hadj-Hamou et al.

    Source: Computers & Operations Research. 72:97-106

    Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, Inventory, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Single-vehicle cyclic inventory routing problem, 02 engineering and technology, Convex optimization, Routing

    Access URL: https://hal.archives-ouvertes.fr/hal-01355830
    https://dblp.uni-trier.de/db/journals/cor/cor72.html#LefeverAH16
    http://www.sciencedirect.com/science/article/pii/S030505481630034X
    https://www.sciencedirect.com/science/article/pii/S030505481630034X
    https://biblio.ugent.be/publication/7142577
    https://doi.org/10.1016/j.cor.2016.02.010

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  19. 19

    A linear time algorithm for Shortest Cyclic Cover of Strings

    Authors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Contributors: Cazaux, Bastien Rivals, Eric Méthodes et Algorithmes pour la Bioinformatique (MAB) et al.

    Source: Journal of Discrete Algorithms. 37:56-67

    Subject Terms: Overlap, Minimum assignment, ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Superstring, 16. Peace & justice, 01 natural sciences, Graph, Theoretical Computer Science, 3. Good health, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computational Theory and Mathematics, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM], Shortest cyclic cover of strings, Greedy, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM]

    File Description: application/pdf

    Access URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995
    https://dblp.uni-trier.de/db/journals/jda/jda37.html#CazauxR16
    https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995/document
    https://www.sciencedirect.com/science/article/pii/S1570866716300065
    https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1/document
    https://doi.org/10.1016/j.jda.2016.05.001
    https://hal-lirmm.ccsd.cnrs.fr/lirmm-01525995v1

    View record at OpenAIRE Full Text Finder Nájsť tento článok vo Web of Science
    Save to List
  20. 20

    Cyclable sets of vertices in 3-connected graphs

    Authors: Li, Hao Zhu, Yan Laboratoire de Recherche en Informatique (LRI) et al.

    Contributors: Li, Hao Zhu, Yan Laboratoire de Recherche en Informatique (LRI) et al.

    Source: Journal of Combinatorics. 7:495-508

    Subject Terms: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0102 computer and information sciences, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 0101 mathematics, 01 natural sciences

    Access URL: https://www.intlpress.com/site/pub/files/_fulltext/journals/joc/2016/0007/0002/JOC-2016-0007-0002-a014.pdf
    https://intlpress.com/site/pub/pages/journals/items/joc/content/vols/0007/0002/a014/index.html

    View record at OpenAIRE Nájsť tento článok vo Web of Science
    Save to List

Search Tools: