Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleSeptember 2024
Orientations without forbidden patterns on three vertices
Applied Mathematics and Computation (APMC), Volume 480, Issue Chttps://doi.org/10.1016/j.amc.2024.128912AbstractGiven a set F of oriented graphs, a graph G is a F o r b e ( F )-graph if it admits an F-free orientation. Skrien showed that proper-circular arc graphs, nested interval graphs and comparability graphs, correspond to F o r b e ( F )-graph classes ...
- research-articleAugust 2024
- research-articleMay 2024
- research-articleApril 2024
Segmentation in Measure Spaces
Applied Mathematics and Optimization (APMO), Volume 89, Issue 3https://doi.org/10.1007/s00245-024-10134-5AbstractWe consider an abstract concept of perimeter measure space as a very general framework in which one can properly consider two of the most well-studied variational models in image processing: the Rudin–Osher–Fatemi model for image denoising (ROF) ...
-
- research-articleMarch 2024
Embedding into interconnection networks
- research-articleMarch 2024
On Blocky Ranks Of Matrices
AbstractA matrix is blocky if it is a "blowup" of a permutation matrix. The blocky rank of a matrix M is the minimum number of blocky matrices that linearly span M. Hambardzumyan, Hatami and Hatami defined blocky rank and showed that it is connected to ...
- research-articleMarch 2024
- research-articleFebruary 2024
Dynamic opportunistic routing protocol for ad-hoc Internet of Vehicles (IoV)
AbstractInternet of Vehicles (IoV) aka V2X is a growing area of research that aims at information exchange between vehicles and all other related objects to develop intelligent transportation systems. IoVs are characterized by high mobility, high-speed ...
- research-articleFebruary 2024
Algorithms for enumerating multiple leaf-distance granular regular α-subtree of unicyclic and edge-disjoint bicyclic graphs
Applied Mathematics and Computation (APMC), Volume 462, Issue Chttps://doi.org/10.1016/j.amc.2023.128334AbstractA multiple leaf-distance granular regular α-tree (abbreviated as LDR α-tree for short) is a tree (with at least α + 1 vertices) where any two leaves are at some distance divisible by α. A connected graph's subtree which is additionally an LDR α-...
- research-articleJanuary 2024
On the analysis of collaboration networks between industry and academia: the Mexican case of the innovation incentive program
Scientometrics (SPSCI), Volume 129, Issue 3Pages 1523–1544https://doi.org/10.1007/s11192-023-04903-2AbstractThe responsible for proposing public policies have to decide how to allocate economic resources to boost Research & Development in target industrial areas. Typically, the government supports R &D projects from universities, companies, or ...
- research-articleNovember 2023
New lower bounds on crossing numbers of from semidefinite programming
- research-articleNovember 2023
Spiraling and Folding: The Topological View
Discrete & Computational Geometry (DCOG), Volume 72, Issue 1Pages 246–268https://doi.org/10.1007/s00454-023-00603-zAbstractFor every n, we construct two arcs in the plane that intersect at least n times and do not form spirals. The construction is in three stages: we first exhibit two closed curves on the torus that do not form double spirals, then two arcs on the ...
- research-articleNovember 2023
Missing link prediction using path and community information
AbstractDue to the evolving nature of complex networks, link prediction plays a crucial role in exploring likelihood of potential relationships among nodes. There exist a great number of strategies to apply the similarity-based metrics for estimating ...
- research-articleNovember 2023
A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing
Discrete & Computational Geometry (DCOG), Volume 70, Issue 4Pages 1292–1355https://doi.org/10.1007/s00454-023-00593-yAbstractOrthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the ...
- research-articleOctober 2023
Exact and sampling methods for mining higher-order motifs in large hypergraphs
AbstractNetwork motifs are recurrent, small-scale patterns of interactions observed frequently in a system. They shed light on the interplay between the topology and the dynamics of complex networks across various domains. In this work, we focus on the ...
- research-articleOctober 2023
A study of progressive hedging for stochastic integer programming
Computational Optimization and Applications (COOP), Volume 86, Issue 3Pages 989–1034https://doi.org/10.1007/s10589-023-00532-wAbstractMotivated by recent literature demonstrating the surprising effectiveness of the heuristic application of progressive hedging (PH) to stochastic mixed-integer programming (SMIP) problems, we provide theoretical support for the inclusion of integer ...