The Experts below are selected from a list of 45 Experts worldwide ranked by ideXlab platform

Ernst Kenndler - One of the best experts on this subject based on the ideXlab platform.

  • electrophoresis in fused silica capillaries the influence of organic solvents on the electroosmotic velocity and the zeta potential
    Analytical Chemistry, 1991
    Co-Authors: Christine Schwer, Ernst Kenndler
    Abstract:

    3390. (44) De Le RkM J. H. Ar-h s ~ b s ~ ~ Nftrm Academic Press Inc.: New York, 1959. (45) mine, H. J. RMCW m n / s m in orgenic ”/sby, A r m & ReanangementS: Monograph 6, Eaborn, C., Chapman, N. E., Eds.: Elsevier Publishing Company: New York. 1967. (46) Mer&, J. ~b~~~ orgenic cmiSw, RMcbbn Mechanism Structure, 3rd. ed.: John Wlley 8 Sons: New York, 1985; p 501. p. D. RECEIVED for review February 11, 1991. Accepted June 7, 1991. The support of the U.S. Environmental Protection Agency (EPA CK-815749-01-0) is acknowledged. The Support provided by the Emil Aaltonen Foundation and Suomen Kulttuurirahasto is greatly appreciated (T.K.).

Christine Schwer - One of the best experts on this subject based on the ideXlab platform.

  • electrophoresis in fused silica capillaries the influence of organic solvents on the electroosmotic velocity and the zeta potential
    Analytical Chemistry, 1991
    Co-Authors: Christine Schwer, Ernst Kenndler
    Abstract:

    3390. (44) De Le RkM J. H. Ar-h s ~ b s ~ ~ Nftrm Academic Press Inc.: New York, 1959. (45) mine, H. J. RMCW m n / s m in orgenic ”/sby, A r m & ReanangementS: Monograph 6, Eaborn, C., Chapman, N. E., Eds.: Elsevier Publishing Company: New York. 1967. (46) Mer&, J. ~b~~~ orgenic cmiSw, RMcbbn Mechanism Structure, 3rd. ed.: John Wlley 8 Sons: New York, 1985; p 501. p. D. RECEIVED for review February 11, 1991. Accepted June 7, 1991. The support of the U.S. Environmental Protection Agency (EPA CK-815749-01-0) is acknowledged. The Support provided by the Emil Aaltonen Foundation and Suomen Kulttuurirahasto is greatly appreciated (T.K.).

Michael C Sturman - One of the best experts on this subject based on the ideXlab platform.

  • a salute to the knowledge gained with Elsevier Publishing
    Cornell Hotel and Restaurant Administration Quarterly, 2003
    Co-Authors: Michael C Sturman
    Abstract:

    [Excerpt] This "double issue" of Cornell Quarterly is special in a number of ways. Most obviously, it is quite lengthy. Given the amount of material for this issue, we decided to make this a combined issue, and thus this represents the October-December 2003 issue (numbers 5 and 6 of volume 44). But besides its length, the timing of this issue is also noteworthy. This is the final issue of Cornell Quarterly to be published by Elsevier. The reasons and benefits of this change will be discussed in our next issue; however, I did want to mention this important point. Furthermore, as this marks the end of an impressive run, I wanted to end this relationship by looking back over Elsevier's Publishing tenure, and provide a salute to the content that CQ has printed over this time.

Cathy Kennedy - One of the best experts on this subject based on the ideXlab platform.

  • Publishing the ICES Journal of Marine Science: facing fresh challenges in a competitive environment
    ICES Journal of Marine Science, 2007
    Co-Authors: Andrew I. L. Payne, Cathy Kennedy
    Abstract:

    This issue marks the start of a new era for the Journal. It first appeared in 1903 under the title Publications de Circonstance, and was published from 1926 to 1991 as the Journal du Conseil. In 1991, the title was changed to ICES Journal of Marine Science (with the subtitle Journal du Conseil), when ICES entered a formal agreement with Academic Press. That title was maintained when Academic Press became part of Elsevier, and the agreement and contract was honoured through several extensions until the end of 2006 when, following a comprehensive and competitive tendering process, the contract was taken over by Oxford University Press (OUP). Before looking to the future and the challenges ahead, it would be remiss of us not to say a few words about how the Journal has changed during its successful 16 years in total with Elsevier and Academic Press. From being somewhat of a drain on ICES’ financial resources and run by an editor and an assistant editor, the Journal immediately started growing and increasing its penetration internationally, with the production and marketing process soon rationalized and run in a very businesslike way by committed professional publishers whose staff knew how to make the most of what the ICES scientific community and its collaborators had to offer. It is informative to learn that during the whole 16 years, just three Academic/Elsevier Publishing Editors and two in-house ICES Technical Editors held the reins: Andy Richford, Els Bosma, and Christiane Barranguet for the Publisher, and Judith Rosenmeier and Bill Anthony for ICES. Of course, editors and later editors-in-chief came and went, perhaps because of burn-out, perhaps to face new challenges, but still just 13 have been associated with the Journal since 1991. Alphabetically, they are Ray Beverton, John Blaxter, Mike Chadwick, Niels Daan, Chris Frid, Audrey Geffen, John Hislop, Bernard Megrey, Andrew Payne, Pierre Pepin, John Ramster, Stephen Smith, and Verena Trenkel; six are still associated with the Journal, including John Ramster who has served it faithfully for 23 years! We also welcome a seventh editor to the current team, Panayiota Apostolaki, with this issue, but that still only makes 14 editors since 1991—a huge burden on each, given the rising submission rate. To the Publishers and the senior ICES office-bearers who saw the potential and made the decision to go down the professional Publishing road and to all those named above plus Soren Lund at ICES, who has been acting as postbox and focal point for the Journal for many years, the ICES community owes a debt of thanks for placing the Journal where it is in 2007. It is thriving, its impact factor impressive and rising, its size (number of pages) increasing (including the two, soon to be three, annual ICES symposia), quality (especially colour reproduction) improving, and the flow of manuscripts from scientists worldwide seeming to burgeon year on year. OUP therefore takes over from Elsevier a well-oiled machine, but many will ask what this actually means for the Journal. First, we believe that a partnership with a not-for-profit organization that is a department of a university brings with it aims and values that are closely aligned with those of ICES. “Not-for-profit” does not mean financial deficit: on the contrary, OUP has agreed excellent terms that should see a secure financial future for the Journal. It is more a question of priorities: fair pricing, a continuing emphasis on quality in all aspects of publication, maximizing dissemination to those who need the Journal, and a long-term strategy. How then will these priorities be manifest? First, the new regime is very much one of partnership. ICES and OUP editorial staff have already engaged in frequent, stimulating, indeed animated, discussions, both informally and at meetings organized by OUP that have given us the opportunity to discuss topical issues with representatives of other journals as well as each other: the status quo is very much one of shared, informed decision-making. We have discussed impact factors (rising higher, we hope) and rejection rates (also rising, to maintain and enhance standards), online submission, open access, self-archiving policies, pricing, etc., all within the context of an open, convivial atmosphere. Next the practicalities; here are some of the more significant changes already agreed (some, of course, were already part of the agreement with Elsevier, but we aim to develop them further). Production times: We will continue to publish electronically the corrected proofs of papers as soon as they are ready, well in advance of publication in print/hard copy. Typically, this will be within 4–6 weeks of the manuscript’s submission to the publisher. Publication in print, we hope, will take place much sooner than currently, as little as 4 weeks later (though not initially, as Elsevier and now OUP are currently handling a backlog of papers that needs to be eliminated before this target can be achieved). Similarly, we will seek to avoid backlogs that would extend the publication time beyond our target. Online hosting: With the move to Oxford Journals, our publication online relocates from Elsevier’s ScienceDirect to HighWire Press, a not-for-profit, high quality online service provider that hosts nearly half of the 200 most frequently cited journals Publishing in science. Our new online version will incorporate many features, from superb search functionality through the facility to download figures directly into Powerpoint, to access the entire

De Figueiredo C.m.h. - One of the best experts on this subject based on the ideXlab platform.

  • The Splitting Number And Skewness Of Cn × Cm
    2015
    Co-Authors: De Mendonca Neto C.f.x., Schaffer K, Stolfi J, Faria L, Xavier E.f., De Figueiredo C.m.h.
    Abstract:

    The skewness of a graph G is the minimum number of edges that need to be deleted from G to produce a planar graph. The splitting number of a graph G is the minimum number of splitting steps needed to turn G into a planar graph; where each step replaces some of the edges {u, v} incident to a selected vertex u by edges {u′,v}, where u′ is a new vertex. We show that the splitting number of the toroidal grid graph Cn × Cm is min{n, m} - 2δn,3,δm,3 - δ n,4δm,3 - δn,3δ m,4 and its skewness is min{n, m} - δ n,3,δm,3 - δn,4δ m,3 - δn,3δm,4. Here, δ is the Kronecker symbol, i.e., δi,j is 1 if i = j, and 0 if i ≠ j.63193205Anderson, M.S., Richter, R.B., Rodney, P., The crossing number of C6 × C6 (1996) Congr. Numer., 118, pp. 97-107Anderson, M.S., Richter, R.B., Rodney, P., The crossing number of C7 × C7 (1997) Proc. 28th Southeastern Conference on Combinatorics, Graph Theory and ComputingBeineke, L.W., Ringeisen, R.D., On the crossing numbers of products of cycles and graphs of order four (1980) J. Graph Theory, 4, pp. 145-155Bondy, J.A., Murty, U.S.R., (1976) Graph Theory with Applications, , American Elsevier Publishing Co., IncCimikowski, R.J., Graph planarization and skewness (1992) Congr. Numer., 88, pp. 21-32De Figueiredo, C.M.H., Faria, L., Mendonça, C.F.X., Optimal node-degree bounds for the complexity of nonplanarity parameters (1999) Proc. Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '99, pp. 887-888Dean, A.M., Richter, R.B., The crossing number of C4 × C4 (1995) J. Graph Theory, 19, pp. 125-129Eades, P., De Mendonça, C.F.X., Heuristics for planarization by vertex splitting (1993) Proc. ALCOM Int. Workshop on Graph Drawing, GD'93, pp. 83-85Eades, P., De Mendonça, C.F.X., Vertex splitting and tension-free layout (1996) Lecture Notes in Computer Science, 1027, pp. 202-211Faria, L., (1998) Alguns Invariantes em Não Planaridade: Uma Abordagem Estrutural e de Complexidade, , PhD thesis, COPPE/Sistemas e Computação - Universidade Federal do Rio de Janeiro, Brazil, August. In PortugueseFaria, L., De Figueiredo, C.M.H., Mendonça, C.F.X., Splitting number is NP-complete (2001) Discrete Appl. Math., 108, pp. 65-83Faria, L., De Figueiredo, C.M.H., Mendonça, C.F.X., The splitting number of the 4-cube (1998) Proc. 3th Lotin American Symposium on Theoretical Informatics - Latin'98, pp. 141-150. , ftp://chicago.cos.ufrj.br/pub/tech_reps/es50099.ps.gz, number 1380 in Lecture Notes in Computer Science. Springer-Verlag, April. Technical Report ES-500/99,COPPE/UFRJ, BrazilGarey, M.R., Johnson, D.S., Crossing number is NP-complete (1983) SIAM J. Algebraic and Discrete Methods, 1, pp. 312-316Geldmacher, R.C., Liu, P.C., On the deletion of nonplanar edges of a graph (1979) Congr. Numer., 24, pp. 727-738Harary, F., Hayes, J.P., Wu, H.-J., A survey of the theory of hypercube graphs (1988) Comput. Math. Appl., 15, pp. 277-289Harary, F., Kainen, P.C., Schwenk, A.J., Toroidal graphs with arbitrarily high crossing number (1973) Nanta Math., 6, pp. 58-67Hartsfield, N., Jackson, B., Ringel, G., The splitting number of the complete graph (1985) Graphs Combin., 1, pp. 311-329Heath, M.I., Hipercube multicomputers (1987) Proc. of the 2nd Conference on Hipercube Multicomputers, SIAMJackson, B., Ringel, G., The splitting number of complete bipartite graphs (1984) Arch. Math., 42, pp. 178-184Kiešč, M., Richter, R.B., Stobert, I., The crossing number of C5 × Cn (1996) J. Graph Theory, 22, pp. 239-243Kuratowski, K., Sur le problème des courbes gauches en topologie (1930) Fund. Math., 15, pp. 271-283Leighton, F.T., New lower bound techniques for VLSI (1981) Proc. of the 22nd Annual Symposium on Foundations of Computer Science, 42, pp. 1-12. , IEEE Computer SocietyMendonça, C.F.X., (1994) A Layout System for Information System Diagrams, , PhD thesis, University of Newcastle, Australia, MarchRichter, R.B., Thomassen, C., Intersections of curve systems and the crossing number of C5 × C5 (1995) Disc. Comp. Geom., 13, pp. 149-159Ringeisen, R.D., Beineke, L.W., The crossing number of C3 × Cn (1978) J. of Combinatorial Theory, 24, pp. 134-136Robertson, N., Seymour, P.D., Graph minors. XIII. The disjoint paths problems (1995) J. Combin. Theory Ser. B, 63, pp. 65-110Salazar, G., On the crossing number of Cn × Cm (1998) J. Graph Theory, 28, pp. 163-170Schaffer, K., (1981) The Splitting Number and Other Topological Parameters of Graphs, , PhD thesis, University of California at Santa Cruz, Marc

  • The Non Planar Vertex Deletion Of Cn × Cm
    2015
    Co-Authors: De Mendonca C.f.x., Stolfi J, Faria L, Xavier E.f., De Figueiredo C.m.h.
    Abstract:

    The non planar vertex deletion or vertex deletion vd(G) of a graph G = (V, E) is the smallest non negative integer k, such that the removal of k vertices from G produces a planar graph. Hence, the maximum planar induced subgraph of G has precisely |V| -vd(G) vertices. The problem of computing vertex deletion is in general very hard, it is NP-complete. In this paper we compute the non planar vertex deletion for the family of toroidal graphs Cn × C m.76328Anderson, M.S., Richter, R.B., Rodney, P., The crossing number of C6 × C6 (1996) Congr. Numer., 118, pp. 97-107Anderson, M.S., Richter, R.B., Rodney, P., The crossing number of C7 × C7 (1997) Congr. Numer., 125, pp. 97-117Beineke, L.W., Ringeisen, R.D., On the crossing numbers of products of cycles and graphs of order four (1980) J. Graph Theory, 4, pp. 145-155Bondy, J.A., Murty, U.S.R., (1976) Graph Theory with Applications, , American Elsevier Publishing Co., IncCãlinescu, G., Fernandes, C.G., Finkler, U., Karloff, H., A better approximation algorithm for finding planar subgraphs (1998) J. of Algorithms, 27 (2), pp. 269-302Dean, A.M., Richter, R.B., The crossing number of C4 × C4 (1995) J. Graph Theory, 19, pp. 125-129Faria, L., (1998) Some Results about Nonplanarity Invariants in Graphs: An Analysis of Structure and Complexity., , PhD thesis, COPPE/Sistemas e Computação - Universidade Federal do Rio de Janeiro, Brazil, August In PortugueseFaria, L., De Figueiredo, C.M.H., Mendonça, C.F.X., Splitting number is NP-complete (2001) Discrete Appl. Math., 108, pp. 65-83Faria, L., De Figueiredo, C.M.H., Mendonça, C.F.X., On the complexity of the approximation of nonplanarity parameters for cubic graphs Proceedings of the 2001 Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO'2001), Electronic Notes in Discrete Mathematics, , http://www.cos.ufrj.br/Tuerbio/gz/damfiill4.ps, Full paper accepted for publication in the special issue of Discrete Applied MathematicsFaria, L., De Figueiredo, C.M.H., Mendonça, C.F.X., The splitting number of the 4-cube (1998) Proceedings 3th Latin American Symposium on Theoretical Informatics - Latin'98, Lecture Notes in Computer Science, 1380, pp. 141-150. , Springer-VerlagFaria, L., De Figueiredo, C.M.H., De Mendonça, C.F.X., Stolfi, J., Xavier, E.F., Non planar vertex deletion: Maximum degree thresholds for NP/Max SNP-hardness (2002) Technical Report ES-588/02 COPPE/UFRJ, , http://www.cos.ufrj.br/publicacoes/reltec/es58802.pdf, BrazilGarey, M.R., Johnson, D.S., Crossing number is NP-complete (1983) SIAM J. Algebraic and Discrete Methods, 1, pp. 312-316Geldmacher, R.C., Liu, P.C., On the deletion of nonplanar edges of a graph (1979) Congr. Numer., 24, pp. 727-738Harary, F., Hayes, J.P., Wu, H.-J., A survey of the theory of hypercube graphs (1988) Comput. Math. Appl., 15, pp. 277-289Harary, F., Kainen, P.C., Schwenk, A.J., Toroidal graphs with arbitrarily high crossing number (1973) Nanta Math., 6, pp. 58-67Hypercube multicomputers (1987) Proceedings of the 2nd Conference on Hypercube Multicomputers, SIAM, , M. I. Heath (Editor)Kiešě, M., Richter, R.B., Stobert, I., The crossing number of C5 × Cn (1996) J. Graph Theory, 22, pp. 239-243Kuratowski, K., Sur le problème des courbes gauches en topologie (1930) Fund. Math., 15, pp. 271-283Leighton, F.T., New lower bound techniques for VLSI (1981) Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society, 42, pp. 1-12Lund, C., Yannakakis, M., The approximation of maximum subgraph problems (1993) Proceedings 20th Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 700, pp. 40-51. , Springer-VerlagDe Mendonça, C.F.X., Schaffer, K., Stolfi, J., Xavier, E.F., Faria, L., De Figueiredo, C.M.H., The splitting number and skewness of Cn × Cm (2002) Ars Combinatoria, 63, pp. 193-205Richter, R.B., Salazar, G., The crossing number of C6 × Cn (2001) Australas. J. Combin., 23, pp. 135-143Richter, R.B., Thomassen, C., Intersections of curve systems and the crossing number of C5 × C5 (1995) Disc. Comp. Geom., 13, pp. 149-159Ringeisen, R.D., Beineke, L.W., The crossing number of C3 × Cn (1978) J. of Combinatorial Theory, 24, pp. 134-136Shahrokhi, F., Skora, O., Szkely, L.A., Vrt'o, I., Intersection of curves and crossing number of Cm × Cn on surfaces (1998) Discrete Comput. Geom., 19, pp. 237-247Thomassen, C., The graph genus problem is NP-complete (1989) J. Algorithms, 10, pp. 568-576Yannakakis, M., Node and Edge-Deletion NP-Complete Problems (1978) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 253-26