Found: 34
Select item for more details and to access through your institution.
Efficient enumeration of monocyclic chemical graphs with given path frequencies.
- Published in:
- Journal of Cheminformatics, 2014, v. 6, n. 1, p. 1, doi. 10.1186/1758-2946-6-31
- By:
- Publication type:
- Article
Efficient enumeration of monocyclic chemical graphs with given path frequencies.
- Published in:
- Journal of Cheminformatics, 2014, v. 6, n. 1, p. 1, doi. 10.1186/1758-2946-6-31
- By:
- Publication type:
- Article
ALGORITHMIC ASPECTS OF THE CORE OF COMBINATORIAL OPTIMIZATION GAMES.
- Published in:
- Mathematics of Operations Research, 1999, v. 24, n. 3, p. 751, doi. 10.1287/moor.24.3.751
- By:
- Publication type:
- Article
COMPLEXITY OF THE MINIMUM BASE GAME ON MATROIDS.
- Published in:
- Mathematics of Operations Research, 1997, v. 22, n. 1, p. 146, doi. 10.1287/moor.22.1.146
- By:
- Publication type:
- Article
A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming.
- Published in:
- Algorithms for Molecular Biology, 2021, v. 16, n. 1, p. 1, doi. 10.1186/s13015-021-00197-2
- By:
- Publication type:
- Article
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 2, p. 241, doi. 10.1007/s00224-015-9612-x
- By:
- Publication type:
- Article
Network Design with Edge-Connectivity and Degree Constraints.
- Published in:
- Theory of Computing Systems, 2009, v. 45, n. 3, p. 512, doi. 10.1007/s00224-008-9149-3
- By:
- Publication type:
- Article
Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank.
- Published in:
- Entropy, 2020, v. 22, n. 11, p. 1295, doi. 10.3390/e22111295
- By:
- Publication type:
- Article
An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops.
- Published in:
- Entropy, 2020, v. 22, n. 9, p. 923, doi. 10.3390/e22090923
- By:
- Publication type:
- Article
PACKING SOFT RECTANGLES.
- Published in:
- International Journal of Foundations of Computer Science, 2006, v. 17, n. 5, p. 1165, doi. 10.1142/S0129054106004327
- By:
- Publication type:
- Article
AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 6, p. 661, doi. 10.1142/S0218195911003858
- By:
- Publication type:
- Article
DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 253, doi. 10.1142/S0218195911003652
- By:
- Publication type:
- Article
MINKOWSKI SUM SELECTION AND FINDING.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 283, doi. 10.1142/S0218195911003664
- By:
- Publication type:
- Article
COVERING A POINT SET BY TWO DISJOINT RECTANGLES.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 313, doi. 10.1142/S0218195911003676
- By:
- Publication type:
- Article
GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 331, doi. 10.1142/S0218195911003688
- By:
- Publication type:
- Article
GUEST EDITORS' FOREWORD.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 251, doi. 10.1142/S0218195911003640
- By:
- Publication type:
- Article
APPROXIMATE NEAREST NEIGHBOR SEARCH UNDER TRANSLATION INVARIANT HAUSDORFF DISTANCE.
- Published in:
- International Journal of Computational Geometry & Applications, 2011, v. 21, n. 3, p. 369, doi. 10.1142/S0218195911003706
- By:
- Publication type:
- Article
Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks.
- Published in:
- Networks, 2002, v. 39, n. 4, p. 203, doi. 10.1002/net.10028
- By:
- Publication type:
- Article
Multigraph augmentation under biconnectivity and general edge-connectivity requirements.
- Published in:
- Networks, 2001, v. 37, n. 3, p. 144, doi. 10.1002/net.4
- By:
- Publication type:
- Article
On sparse subgraphs preserving connectivity properties.
- Published in:
- Journal of Graph Theory, 1993, v. 17, n. 3, p. 275, doi. 10.1002/jgt.3190170302
- By:
- Publication type:
- Article
On the one-dimensional stock cutting problem in the paper tube industry.
- Published in:
- Journal of Scheduling, 2011, v. 14, n. 3, p. 281, doi. 10.1007/s10951-010-0164-2
- By:
- Publication type:
- Article
Vehicle scheduling on a tree with release and handling times.
- Published in:
- Annals of Operations Research, 1997, v. 69, n. 1-4, p. 193, doi. 10.1023/A:1018928911513
- By:
- Publication type:
- Article
Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies.
- Published in:
- BMC Bioinformatics, 2011, v. 12, n. Suppl 14, p. 1, doi. 10.1186/1471-2105-12-S14-S3
- By:
- Publication type:
- Article
An exact lower bound on the number of cut-sets in multigraphs.
- Published in:
- Networks, 1994, v. 24, n. 8, p. 429, doi. 10.1002/net.3230240804
- By:
- Publication type:
- Article
Maximum flows in probabilistic networks.
- Published in:
- Networks, 1991, v. 21, n. 6, p. 645, doi. 10.1002/net.3230210604
- By:
- Publication type:
- Article
Relaxation methods for the strictly convex multicommodity flow problem with capacity constraints on individual commodities.
- Published in:
- Networks, 1990, v. 20, n. 4, p. 409, doi. 10.1002/net.3230200405
- By:
- Publication type:
- Article
Efficient branch-and-bound algorithms for weighted MAX-2-SAT.
- Published in:
- Mathematical Programming, 2011, v. 127, n. 2, p. 297, doi. 10.1007/s10107-009-0285-6
- By:
- Publication type:
- Article
Greedy splitting algorithms for approximating multiway partition problems.
- Published in:
- Mathematical Programming, 2005, v. 102, n. 1, p. 167, doi. 10.1007/s10107-004-0510-2
- By:
- Publication type:
- Article
A fast algorithm for computing minimum 3-way and 4-way cuts.
- Published in:
- Mathematical Programming, 2000, v. 88, n. 3, p. 507, doi. 10.1007/PL00011383
- By:
- Publication type:
- Article
Totally balanced combinatorial optimization games.
- Published in:
- Mathematical Programming, 2000, v. 87, n. 3, p. 441, doi. 10.1007/s101070050005
- By:
- Publication type:
- Article
BREADTH-FIRST SEARCH APPROACH TO ENUMERATION OF TREE-LIKE CHEMICAL COMPOUNDS.
- Published in:
- Journal of Bioinformatics & Computational Biology, 2013, v. 11, n. 6, p. 1, doi. 10.1142/S0219720013430075
- By:
- Publication type:
- Article
A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming.
- Published in:
- Algorithms, 2020, v. 13, n. 5, p. 124, doi. 10.3390/a13050124
- By:
- Publication type:
- Article
An Inverse QSAR Method Based on a Two-Layered Model and Integer Programming.
- Published in:
- International Journal of Molecular Sciences, 2021, v. 22, n. 6, p. 2847, doi. 10.3390/ijms22062847
- By:
- Publication type:
- Article
Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming.
- Published in:
- Journal of Mathematical Chemistry, 2011, v. 49, n. 4, p. 910, doi. 10.1007/s10910-010-9789-9
- By:
- Publication type:
- Article