{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":4,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":67,"n_cols":5,"rows_kept":67,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[11,2,11,3],[11,4,11,5],[12,2,12,3],[12,4,12,5],[13,2,13,3],[13,4,13,5],[14,2,14,3],[15,2,15,3],[16,2,16,3],[17,2,17,3],[18,2,18,3],[19,2,19,3],[25,2,25,3],[25,4,25,5],[26,2,26,3],[26,4,26,5],[27,2,27,3],[27,4,27,5],[28,2,28,3],[29,2,29,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[34,2,34,3],[35,2,35,3],[36,2,36,3],[39,2,39,3],[48,2,48,3],[48,4,48,5],[49,2,49,3],[49,4,49,5],[50,2,50,3],[50,4,50,5],[51,2,51,3],[53,2,53,3],[54,2,54,3],[55,2,55,3],[56,2,56,3],[57,2,57,3],[58,2,58,3],[60,2,60,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA990001467700403321"]
[null,null,"Autore",null,"Moore, Rufus H."]
[null,null,"Titolo",null,"Laboratory guide for elementary Plant Physiology / by Rufus H. Moore"]
[null,null,"Pubbl/distr/stampa",null,"Minneapolis : Burgess Publishing Company, 1960"]
[null,null,"Edizione",null,"[2 edz]"]
[null,null,"Descrizione fisica",null,"viii, 146 p. ; 30 cm"]
[null,null,"Locazione",null,"DBV"]
[null,null,"Collocazione",null,"5 VI 13"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,"2.","Record Nr.",null,"UNISA996497169003316"]
[null,null,"Autore",null,"Vergilio, Polidoro <1470?-1555.>"]
[null,null,"Titolo",null,"The works of the famous antiquary, Polidore Virgil : containing the original of all arts, sciences, mysteries, orders, rites, and ceremonies, both ecclesiastical and civil : a work useful for all divines, historians, lawyers, and all artificers / compendiously English't by John [i.e. Thomas] Langley"]
[null,null,"Pubbl/distr/stampa",null,"London, : Printed for Simon Miller, 1663"]
[null,null,"Descrizione fisica",null,"Testo elettronico (PDF)  (311, [25] p.)"]
[null,null,"Disciplina",null,"942"]
[null,null,"Soggetti",null,"Civiltà - Storia"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Risorsa elettronica"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Riproduzione dell'originale in: British Library."]
[{"$nulls":4},"Traduzione di: De rerum inventoribus - NUC pre-1956 impronte."]
[{"$nulls":4},"Riproduzione dell'originale nella Bodleian Library"]
[{"$nulls":4},"Altri autori di contributi: Langley, Thomas, d. 1581."]
[null,"3.","Record Nr.",null,"UNINA9910150214303321"]
[null,null,"Autore",null,"Kasap Safa"]
[null,null,"Titolo",null,"Optoelectronics and photonics : principles and practices / / Safa O. Kasap, Ravindra Kumar Sinha"]
[null,null,"Pubbl/distr/stampa",null,"Boston : , : Pearson, , 2013"]
[null,null,"ISBN",null,"0-273-77418-2"]
[null,null,"Edizione",null,"[Second edition, international edition.]"]
[null,null,"Descrizione fisica",null,"1 online resource (551 pages) : illustrations, tables"]
[null,null,"Collana",null,"Always Learning"]
[null,null,"Disciplina",null,"621.381045"]
[null,null,"Soggetti",null,"Optoelectronic devices"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Includes index."]
[null,null,"Nota di contenuto",null,"Cover -- Contents -- Chapter 1 Wave Nature of Light -- 1.1 Light Waves in a Homogeneous Medium -- A. Plane Electromagnetic Wave -- B. Maxwell's Wave Equation and Diverging Waves -- Example 1.1.1 A diverging laser beam -- 1.2 Refractive Index and Dispersion -- Example 1.2.1 Sellmeier equation and diamond -- Example 1.2.2 Cauchy equation and diamond -- 1.3 Group Velocity and Group Index -- Example 1.3.1 Group velocity -- Example 1.3.2 Group velocity and index -- Example 1.3.3 Group and phase velocities -- 1.4 Magnetic Field, Irradiance, and Poynting Vector -- Example 1.4.1 Electric and magnetic fields in light -- Example 1.4.2 Power and irradiance of a Gaussian beam -- 1.5 Snell's Law and Total Internal Reflection (TIR) -- Example 1.5.1 Beam displacement -- 1.6 Fresnel's Equations -- A. Amplitude Reflection and Transmission Coefficients (r and t ) -- B. Intensity, Reflectance, and Transmittance -- C. Goos-Hänchen Shift and Optical Tunneling -- Example 1.6.1 Reflection of light from a less dense medium (internal reflection) -- Example 1.6.2 Reflection at normal incidence, and internal and external reflection -- Example 1.6.3 Reflection and transmission at the Brewster angle -- 1.7 Antireflection Coatings and Dielectric Mirrors -- A. Antireflection Coatings on Photodetectors and Solar Cells -- Example 1.7.1 Antireflection coating on a photodetector -- B. Dielectric Mirrors and Bragg Reflectors -- Example 1.7.2 Dielectric mirror -- 1.8 Absorption of Light and Complex Refractive Index -- Example 1.8.1 Complex refractive index of InP -- Example 1.8.2 Reflectance of CdTe around resonance absorption -- 1.9 Temporal and Spatial Coherence -- Example 1.9.1 Coherence length of LED light -- 1.10 Superposition and Interference of Waves -- 1.11 Multiple Interference and Optical Resonators."]
[{"$nulls":4},"Example 1.11.1 Resonator modes and spectral width of a semiconductor Fabry-Perot cavity -- 1.12 Diffraction Principles -- A. Fraunhofer Diffraction -- Example 1.12.1 Resolving power of imaging systems -- B. Diffraction Grating -- Example 1.12.2 A reflection grating -- Additional topics -- 1.13 Interferometers -- 1.14 Thin Film Optics: Multiple Reflections in Thin Films -- Example 1.14.1 Thin film optics -- 1.15 Multiple Reflections in Plates and Incoherent Waves -- 1.16 Scattering of Light -- 1.17 Photonic Crystals -- Questions and Problems -- Chapter 2 Dielectric Waveguides and Optical Fibers -- 2.1 Symmetric Planar Dielectric Slab Waveguide -- A. Waveguide Condition -- B. Single and Multimode Waveguides -- C. TE and TM Modes -- Example 2.1.1 Waveguide modes -- Example 2.1.2 V-number and the number of modes -- Example 2.1.3 Mode field width, 2w[Sub(0)] -- 2.2 Modal and Waveguide Dispersion in Planar Waveguides -- A. Waveguide Dispersion Diagram and Group Velocity -- B. Intermodal Dispersion -- C. Intramodal Dispersion -- 2.3 Step-Index Optical Fiber -- A. Principles and Allowed Modes -- Example 2.3.1 A multimode fiber -- Example 2.3.2 A single-mode fiber -- B. Mode Field Diameter -- Example 2.3.3 Mode field diameter -- C. Propagation Constant and Group Velocity -- Example 2.3.4 Group velocity and delay -- D. Modal Dispersion in Multimode Step-Index Fibers -- Example 2.3.5 A multimode fiber and dispersion -- 2.4 Numerical Aperture -- Example 2.4.1 A multimode fiber and total acceptance angle -- Example 2.4.2 A single-mode fiber -- 2.5 Dispersion In Single-Mode Fibers -- A. Material Dispersion -- B. Waveguide Dispersion -- C. Chromatic Dispersion -- D. Profile and Polarization Dispersion Effects -- Example 2.5.1 Material dispersion -- Example 2.5.2 Material, waveguide, and chromatic dispersion."]
[{"$nulls":4},"Example 2.5.3 Chromatic dispersion at different wavelengths -- Example 2.5.4 Waveguide dispersion -- 2.6 Dispersion Modified Fibers and Compensation -- A. Dispersion Modified Fibers -- B. Dispersion Compensation -- Example 2.6.1 Dispersion compensation -- 2.7 Bit Rate, Dispersion, and Electrical and Optical Bandwidth -- A. Bit Rate and Dispersion -- B. Optical and Electrical Bandwidth -- Example 2.7.1 Bit rate and dispersion for a single-mode fiber -- 2.8 The Graded Index (GRIN) Optical Fiber -- A. Basic Properties of GRIN Fibers -- B. Telecommunications -- Example 2.8.1 Dispersion in a graded index fiber and bit rate -- Example 2.8.2 Dispersion in a graded index fiber and bit rate -- 2.9 Attenuation in Optical Fibers -- A. Attenuation Coefficient and Optical Power Levels -- Example 2.9.1 Attenuation along an optical fiber -- B. Intrinsic Attenuation in Optical Fibers -- C. Intrinsic Attenuation Equations -- Example 2.9.2 Rayleigh scattering equations -- D. Bending losses -- Example 2.9.3 Bending loss for SMF -- 2.10 Fiber Manufacture -- A. Fiber Drawing -- B. Outside Vapor Deposition -- Example 2.10.1 Fiber drawing -- Additional topics -- 2.11 Wavelength Division Multiplexing: WDM -- 2.12 Nonlinear Effects in Optical Fibers and DWDM -- 2.13 Bragg Fibers -- 2.14 Photonic Crystal Fibers-Holey Fibers -- 2.15 Fiber Bragg Gratings and Sensors -- Example 2.15.1 Fiber Bragg grating at 1550 nm -- Questions and Problems -- Chapter 3 Semiconductor Science and Light-Emitting Diodes -- 3.1 Review of Semiconductor Concepts and Energy Bands -- A. Energy Band Diagrams, Density of States, Fermi-Dirac Function and Metals -- B. Energy Band Diagrams of Semiconductors -- 3.2 Semiconductor Statistics -- 3.3 Extrinsic Semiconductors -- A. n-Type and p-Type Semiconductors -- B. Compensation Doping -- C. Nondegenerate and Degenerate Semiconductors."]
[{"$nulls":4},"D. Energy Band Diagrams in an Applied Field -- Example 3.3.1 Fermi levels in semiconductors -- Example 3.3.2 Conductivity of n-Si -- 3.4 "]
[{"$nulls":4},"Direct and Indirect Bandgap Semiconductors: E-k Diagrams -- 3.5 pn Junction Principles -- A. Open Circuit -- B. Forward Bias and the Shockley Diode Equation -- C. Minority Carrier Charge Stored in Forward Bias -- D. Recombination Current and the Total Current -- 3.6 pn Junction Reverse Current -- 3.7 pn Junction Dynamic Resistance and Capacitances -- A. Depletion Layer Capacitance -- B. Dynamic Resistance and Diffusion Capacitance for Small Signals -- 3.8 Recombination Lifetime -- A. Direct Recombination -- B. Indirect Recombination -- Example 3.8.1 A direct bandgap pn junction -- 3.9 pn Junction Band Diagram -- A. Open Circuit -- B. Forward and Reverse Bias -- Example 3.9.1 The built-in voltage from the band diagram -- 3.10 Heterojunctions -- 3.11 Light-Emitting Diodes: Principles -- A. Homojunction LEDs -- B. Heterostructure High Intensity LEDs -- C. Output Spectrum -- Example 3.11.1 LED spectral linewidth -- Example 3.11.2 LED spectral width -- Example 3.11.3 Dependence of the emission peak and linewidth on temperature -- 3.12 Quantum Well High Intensity LEDs -- Example 3.12.1 Energy levels in the quantum well -- 3.13 LED Materials and Structures -- A. LED Materials -- B. LED Structures -- Example 3.13.1 Light extraction from a bare LED chip -- 3.14 LED Efficiencies and Luminous Flux -- Example 3.14.1 LED efficiencies -- Example 3.14.2 LED brightness -- 3.15 Basic LED Characteristics -- 3.16 LEDs for Optical Fiber Communications -- 3.17 Phosphors and White LEDs -- Additional topics -- 3.18 LED Electronics -- Questions and Problems -- Chapter 4 Stimulated Emission Devices: Optical Amplifiers and Lasers -- 4.1 Stimulated Emission, Photon Amplification, and Lasers -- A. Stimulated Emission and Population Inversion."]
[{"$nulls":4},"B. Photon Amplification and Laser Principles -- C. Four-Level Laser System -- 4.2 Stimulated Emission Rate and Emission Cross-Section -- A. Stimulated Emission and Einstein Coefficients -- Example 4.2.1 Minimum pumping power for three-level laser systems -- B. Emission and Absorption Cross-Sections -- Example 4.2.2 Gain coefficient in a Nd[Sup(3+)] -doped glass fiber -- 4.3 Erbium-Doped Fiber Amplifiers -- A. Principle of Operation and Amplifier Configurations -- B. EDFA Characteristics, Efficiency, and Gain Saturation -- Example 4.3.1 An erbium-doped fiber amplifier -- C. Gain-Flattened EDFAs and Noise Figure -- 4.4 Gas Lasers: The He-Ne Laser -- Example 4.4.1 Efficiency of the He-Ne laser -- 4.5 The Output Spectrum of a Gas Laser -- Example 4.5.1 Doppler broadened linewidth -- 4.6 Laser Oscillations: Threshold Gain Coefficient and Gain Bandwidth -- A. Optical Gain Coefficient g -- B. Threshold Gain Coefficient g[Sub(th)] and Output Power -- Example 4.6.1 Threshold population inversion for the He-Ne laser -- C. Output Power and Photon Lifetime in the Cavity -- Example 4.6.2 Output power and photon cavity lifetime T[Sub(ph)] -- D. Optical Cavity, Phase Condition, Laser Modes -- 4.7 Broadening of the Optical Gain Curve and Linewidth -- 4.8 Pulsed Lasers: Q-Switching and Mode Locking -- A. Q-Switching -- B. Mode Locking -- 4.9 Principle of the Laser Diode -- 4.10 Heterostructure Laser Diodes -- Example 4.10.1 Modes in a semiconductor laser and the optical cavity length -- 4.11 Quantum Well Devices -- Example 4.11.1 A GaAs quantum well -- 4.12 Elementary Laser Diode Characteristics -- Example 4.12.1 Laser output wavelength variation with temperature -- Example 4.12.2 Laser diode efficiencies for a sky-blue LD -- Example 4.12.3 Laser diode efficiencies -- 4.13 Steady State Semiconductor Rate Equations: The Laser Diode Equation -- A. Laser Diode Equation."]
[{"$nulls":4},"B. Optical Gain Curve, Threshold, and Transparency Conditions."]
[null,null,null,"Sommario/riassunto","For one-semester, undergraduate-level courses in Optoelectronics and Photonics, in the departments of electrical engineering, engineering "]
[{"$nulls":4},"physics, and materials science and engineering.  This text takes a fresh look at the enormous developments in electo-optic devices and associated materials-such as Pockels (Lithium Niobate) modulators."]
[null,"4.","Record Nr.",null,"UNISA996601562903316"]
[null,null,"Autore",null,"Basu Amitabh"]
[null,null,"Titolo",null,"Combinatorial Optimization : 8th International Symposium, ISCO 2024, la Laguna, Tenerife, Spain, May 22-24, 2024, Revised Selected Papers"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer, , 2024"]
[{"$nulls":4},"©2024"]
[null,null,"ISBN",null,"3-031-60924-7"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (425 pages)"]
[null,null,"Collana",null,"Lecture Notes in Computer Science Series ; ; v.14594"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Intro -- Preface -- Organization -- Contents -- Integer Programming -- On Disjunction Convex Hulls by Lifting -- 1 Introduction -- 2 Definitions -- 2.1 Model and Notation -- 2.2 Convex Hull -- 2.3 Full Optimal Big-M Lifting -- 3 Results -- 4 Some Proofs, Proof Sketches, and Remarks -- References -- On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location -- 1 Introduction -- 2 Covering Edges with a Subset of a Finite Set of Balls -- 3 What Kind of Constraint Matrices Can We Get? -- 4 Efficiently Solvable Cases -- 4.1 When G Is a Unit-Grid Graph in Rd, d2, NV(G), and 1r(x)&lt -- [d]5/4, for All xN -- 4.2 When G Is a Path Intersecting Each Ball on a Subpath -- 4.3 A Fork-Free Set of Subtrees -- 5 Strong Fixing -- 6 Computational Experiments -- 7 Outlook -- References -- Quadratically Constrained Reformulation, Strong Semidefinite Programming Bounds, and Algorithms for the Chordless Cycle Problem -- 1 Introduction -- 2 QC Reformulation and SDP Relaxation -- 3 SDP Lagrangian Relaxation Bounds -- 3.1 Subgradient Optimization -- 4 Lagrangian Relaxation as a Warm Starter to BC -- 4.1 An Improved BC Algorithm -- 5 Preliminary Computational Experiments -- 6 Conclusions -- References -- A Family of Spanning-Tree Formulations for the Maximum Cut Problem -- 1 Introduction -- 2 Preliminaries and Related Work -- 3 A Family of Spanning-Tree Formulations for MaxCut -- 3.1 Basic Spanning-Tree Formulations -- 3.2 Improved Spanning-Tree Formulations -- 3.3 Separation of Odd-Cycle Inequalities for a Given Cycle -- 4 Computational Experiments -- 5 Conclusion -- References -- Optimal Cycle Selections: An Experimental Assessment of Integer Programming Formulations -- 1 Introduction -- 2 Formulations "]
[{"$nulls":4},"and Implementations -- 3 Experimental Results -- 3.1 Random Instances -- 3.2 Instances Associated with Steiner Triples."]
[{"$nulls":4},"4 MWCS with budget constraint -- 5 MWCS with maximum cycle length constraint -- 5.1 Formulation of 3-Cycle Selections -- 5.2 Polyhedral Study -- 5.3 Numerical Experiments -- 6 Conclusions -- References -- 1-Persistency of the Clique Relaxation of the Stable Set Polytope -- 1 Introduction -- 2 Definitions and Preliminary Results -- 3 1-Persistency on Relaxations of the Stable Set Polytope -- 3.1 Basic Results on the Family of Q-Persistent Graphs -- 3.2 Forbidden Structures for the Family of Q-Persistent Graphs -- 4 Final Remarks -- References -- Alternating Direction Method and Deep Learning for Discrete Control with Storage -- 1 Introduction -- 2 MINLP for Discrete Control with Storage -- 3 A Concrete Model: Pump Scheduling -- 4 ADM for Local Optimization by Decomposition -- 5 The Deep Learning Model -- 6 Experimental Evaluation -- 6.1 Benchmark, Dataset Generation, and Scaling -- 6.2 Hyperparameters of the Deep Learning Models -- 6.3 Parameters of the Optimization Algorithms -- 6.4 Performance of Deep Learning -- 6.5 Performance of the Hybrid Algorithm -- 7 Conclusions -- References -- Branch and Cut for Partitioning a Graph into a Cycle of Clusters -- 1 Introduction -- 2 Formulations -- 3 Valid Inequalities -- 3.1 Triangle Inequalities -- 3.2 Partition Inequalities -- 3.3 Subtour and Path Inequalitities -- 4 Primal Heuristics -- 5 Computational Experiments -- References -- Graph Theory -- Computing the Edge Expansion of a Graph Using Semidefinite Programming -- 1 Introduction -- 2 QP Formulation and a Semidefinite Relaxation -- 3 Fixing the Size k: Bisection Problem -- 3.1 SDP Lower Bounds for the Bisection Problem -- 3.2 A Heuristic for the Bisection Problem -- 3.3 A Branch-and-bound Algorithm for the Bisection Problem -- 3.4 Transformation to a Max-Cut Problem -- 4 Split and Bound -- 4.1 Pre-elimination -- 4.2 Computational Aspects."]
[{"$nulls":4},"5 Numerical Results -- 5.1 Benchmark Instances -- 5.2 Discussion of the Experiments -- 6 Summary and Future Research -- References -- Minimizing External Vertices in Hypergraph Orientations -- 1 Introduction -- 2 Notations, Definitions and Preliminaries -- 3 Computational Complexity of HOP -- 4 Polynomial Instances of HOP -- 5 An ILP Model for HOP -- 6 Computational Experiments -- 7 Conclusion -- References -- Open-Separating Dominating Codes in Graphs -- 1 Introduction -- 2 Existence, Bounds and Hardness -- 3 OSD-numbers of Some Graph Families -- 4 Polyhedra Associated with OSD-codes -- 5 Concluding Remarks -- References -- On the Complexity of the Minimum Chromatic Violation Problem -- 1 Introduction -- 1.1 Basic Definitions -- 2 Complexity of MCVP -- 3 A Polynomial Algorithm for MCVP on a Subclass of Unit Interval Graphs -- 4 Concluding Remarks -- References -- Crystal Trees -- 1 Introduction -- 2 Preliminary Concepts -- 3 Crystal Trees Are Distinct from Well Known Classes of Trees in Graphs -- 4 Algebraic Definition of Crystal Trees -- 4.1 A System of Crystal Trees -- 5 Conclusion -- References -- Parameterized Algorithms -- Reducing Treewidth for SAT-Related Problems Using Simple Liftings -- 1 Introduction -- 1.1 Related Work -- 2 Definitions and Formalization of the Question -- 2.1 Graphs and Tree Decompositions -- 2.2 Formulas and Satisfiability Problems -- 2.3 Graphs Associated with Formula -- 2.4 Simple Lifting and Problem Statement -- 3 A Solution Using the Incidence Graph -- 4 Near-Optimality of the Approach -- 5 Computation of a Lifting -- 6 Experiments -- 7 Conclusion -- References -- Total Matching and Subdeterminants -- 1 Introduction -- 2 General Graphs -- 2.1 Maximum Subdeterminants and Graph Structure -- 2.2 Algorithmic Results -- 3 Forests -- 4 Conclusions and Future Work -- References."]
[{"$nulls":4},"A New Structural Parameter on Single Machine Scheduling with Release Dates and Deadlines -- 1 Introduction -- 2 Preliminaries -- 3 The (wED) Rule -- 3.1 Definition and Dominance -- 3.2 A Summit-Based Decomposition -- 4 The Algorithm -- 4.1 Core Concept -- 4.2 State Bounding -- 4.3 Complexity -- 4.4 Minimizing Lmax -- 5 Conclusion -- References -- Fixed-Parameter Algorithms for Cardinality-Constrained Graph Partitioning Problems on Sparse Graphs -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Contribution -- 2 Preliminaries -- 2.1 Fixed-Parameter Tractability -- 2.2 (n, p, q)-Lopsided Universal Set -- 2.3 Vertex-Weighted Max (Min) Connected k-Subgraph -- 3 Fixed-Parameter Algorithms for Max (Min) -FCGP Parameterized by k+d -- 4 FPT Algorithms for Max (Min) Connected -FCGP -- 4.1 FPT Algorithms Parameterized by k+ -- 4.2 FPT Algorithms Parameterized by k+d -- 4.3 Subexponential-Time FPT Algorithm on Apex-Minor-Free Graphs -- 4.4 FPT-AS for Connected -FCGP -- References -- Approximation Algorithms -- Sequencing Stochastic Jobs with a Single Sample -- 1 Introduction, Motivation, and Model -- 2 Preliminaries: Single Machine Scheduling by Samples -- 3 Relative Optimality Gap and Better Than Random Schedules -- 4 On Uniform Randomization as Adversary -- 5 Well Behaved Input Distributions -- 5.1 Symmetric Processing Time Distributions -- 5.2 Identical Processing Time Distributions up to Scaling -- 5.3 Translations of Identical Processing Time Distributions -- 5.4 Exponential Distributions and -Separated Priorities -- 6 Conclusions -- References -- The Thief Orienteering Problem on Series-Parallel Graphs -- 1 Introduction -- 2 Thief Orienteering on Series-Parallel Graphs -- 2.1 Removing Vertices with Degree 1 -- 2.2 Cut Vertices -- 2.3 Transforming Gx into a DAG -- 2.4 Algorithm Analysis -- References."]
[{"$nulls":4},"Approximation Algorithm for Job Scheduling with Reconfigurable Resources -- 1 Introduction -- 2 Problem Description and Notations -- 3 Identical-Machines Scheduling -- 4 Presentation of the Algorithm -- 5 Approximation Analysis -- 6 Generation of Packings with Small Volume -- 6.1 Dynamic Programming for the Single-Period Problems -- 6.2 Optimum Packing with Unlimited Scale -- 6.3 Consequences for Multi_Bot -- 7 Perspectives -- References -- Network Design on Undirected Series-Parallel Graphs -- 1 Introduction -- 1.1 Related Work -- 1.2 Our Results -- 2 Preliminaries -- 3 Pseudopolynomial Algorithm -- 4 Fully Polynomial Time Approximation Scheme -- 5 Further Extensions -- 5.1 Capacities from a Lattice -- 5.2 Edge Upgrades -- References -- Online Graph Coloring with Predictions -- 1 Introduction -- 1.1 Preliminaries -- 1.2 Our Contribution -- 2 A Structural Theorem About FirstFit -- 3 Algorithmic Results -- 3.1 FirstFitPredictions (FFP) -- 3.2 RobustFirstFitPredictions(RFFP) -- 3.3 Results for Specific Classes of Graphs -- 4 Discussion -- References -- Integer Programming for Machine Learning -- Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear Programming -- 1 Introduction -- 2 Robustness Verification Problem in BNNs -- 2.1 Description of BNNs -- 2.2 Robustness Verification Problem -- 2.3 Related Work -- 3 Disjunctive Programming Based View to Neuron Pairs in BNNs -- 3.1 Single Neuron Convexification -- 3.2 Disjunctive Programming Based Approach for Neuron Pairs -- 3.3 Separation Procedure w.r.t. conv(S2) -- 3.4 Facet Defining Inequalities -- 4 Computational Experiments -- 4.1 Evaluated Methods and Setup -- 4.2 Computational Results -- 5 Conclusion -- References -- Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming -- 1 Introduction."]
[{"$nulls":4},"2 Problem Definition."]