Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Andrea Marino
Efficient Enumeration of Graph Orientations With Sources
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
Efficient Algorithms for Listing K Disjoint St-Paths in Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Efficient Maximal Clique Enumeration Over Graph Data
Data Science and Engineering
Computational Mechanics
Computer Science Applications
Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Edge Dominating Set: Efficient Enumeration-Based Exact Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On Efficient Parallelizing of the Algorithms for Discrete Enumeration Problems
Machine Learning and Data Analysis
An Efficient Graph Indexing Method
Interpolation Theorem for a Continuous Function on Orientations of a Simple Graph
Czechoslovak Mathematical Journal
Mathematics
Memory Efficient Anonymous Graph Exploration
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Efficient Learning of Non-Autoregressive Graph Variational Autoencoders for Molecular Graph Generation
Journal of Cheminformatics
Computer Graphics
Information Sciences
Library
Theoretical Chemistry
Computer Science Applications
Computer-Aided Design
Physical
